details

property	value
status	complete
benchmark	PEANO_complete_FR.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n095.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.998126983643 seconds
cpu usage	0.650966196
max memory	1.8382848E7

stage attributes

key	value
output-size	31519
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. 0 : [] --> o U11 : [o * o * o] --> o U12 : [o * o] --> o U13 : [o] --> o U21 : [o * o] --> o U22 : [o] --> o U31 : [o * o] --> o U41 : [o * o * o] --> o activate : [o] --> o and : [o * o] --> o isNat : [o] --> o isNatKind : [o] --> o n!6220!62200 : [] --> o n!6220!6220and : [o * o] --> o n!6220!6220isNat : [o] --> o n!6220!6220isNatKind : [o] --> o n!6220!6220plus : [o * o] --> o n!6220!6220s : [o] --> o plus : [o * o] --> o s : [o] --> o tt : [] --> o U11(tt, X, Y) => U12(isNat(activate(X)), activate(Y)) U12(tt, X) => U13(isNat(activate(X))) U13(tt) => tt U21(tt, X) => U22(isNat(activate(X))) U22(tt) => tt U31(tt, X) => activate(X) U41(tt, X, Y) => s(plus(activate(Y), activate(X))) and(tt, X) => activate(X) isNat(n!6220!62200) => tt isNat(n!6220!6220plus(X, Y)) => U11(and(isNatKind(activate(X)), n!6220!6220isNatKind(activate(Y))), activate(X), activate(Y)) isNat(n!6220!6220s(X)) => U21(isNatKind(activate(X)), activate(X)) isNatKind(n!6220!62200) => tt isNatKind(n!6220!6220plus(X, Y)) => and(isNatKind(activate(X)), n!6220!6220isNatKind(activate(Y))) isNatKind(n!6220!6220s(X)) => isNatKind(activate(X)) plus(X, 0) => U31(and(isNat(X), n!6220!6220isNatKind(X)), X) plus(X, s(Y)) => U41(and(and(isNat(Y), n!6220!6220isNatKind(Y)), n!6220!6220and(n!6220!6220isNat(X), n!6220!6220isNatKind(X))), Y, X) 0 => n!6220!62200 plus(X, Y) => n!6220!6220plus(X, Y) isNatKind(X) => n!6220!6220isNatKind(X) s(X) => n!6220!6220s(X) and(X, Y) => n!6220!6220and(X, Y) isNat(X) => n!6220!6220isNat(X) activate(n!6220!62200) => 0 activate(n!6220!6220plus(X, Y)) => plus(activate(X), activate(Y)) activate(n!6220!6220isNatKind(X)) => isNatKind(X) activate(n!6220!6220s(X)) => s(activate(X)) activate(n!6220!6220and(X, Y)) => and(activate(X), Y) activate(n!6220!6220isNat(X)) => isNat(X) activate(X) => X We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): U11(tt, X, Y) >? U12(isNat(activate(X)), activate(Y)) U12(tt, X) >? U13(isNat(activate(X))) U13(tt) >? tt U21(tt, X) >? U22(isNat(activate(X))) U22(tt) >? tt U31(tt, X) >? activate(X) U41(tt, X, Y) >? s(plus(activate(Y), activate(X))) and(tt, X) >? activate(X) isNat(n!6220!62200) >? tt isNat(n!6220!6220plus(X, Y)) >? U11(and(isNatKind(activate(X)), n!6220!6220isNatKind(activate(Y))), activate(X), activate(Y)) isNat(n!6220!6220s(X)) >? U21(isNatKind(activate(X)), activate(X)) isNatKind(n!6220!62200) >? tt isNatKind(n!6220!6220plus(X, Y)) >? and(isNatKind(activate(X)), n!6220!6220isNatKind(activate(Y))) isNatKind(n!6220!6220s(X)) >? isNatKind(activate(X)) plus(X, 0) >? U31(and(isNat(X), n!6220!6220isNatKind(X)), X) plus(X, s(Y)) >? U41(and(and(isNat(Y), n!6220!6220isNatKind(Y)), n!6220!6220and(n!6220!6220isNat(X), n!6220!6220isNatKind(X))), Y, X) 0 >? n!6220!62200 plus(X, Y) >? n!6220!6220plus(X, Y) isNatKind(X) >? n!6220!6220isNatKind(X) s(X) >? n!6220!6220s(X) and(X, Y) >? n!6220!6220and(X, Y) isNat(X) >? n!6220!6220isNat(X) activate(n!6220!62200) >? 0 activate(n!6220!6220plus(X, Y)) >? plus(activate(X), activate(Y)) activate(n!6220!6220isNatKind(X)) >? isNatKind(X) activate(n!6220!6220s(X)) >? s(activate(X)) activate(n!6220!6220and(X, Y)) >? and(activate(X), Y) activate(n!6220!6220isNat(X)) >? isNat(X) activate(X) >? X about to try horpo We use a recursive path ordering as defined in [Kop12, Chapter 5]. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Stand 20472