details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	3.24319815636 seconds
cpu usage	3.238245517
max memory	6.160384E7

stage attributes

key	value
output-size	60306
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 active : [o] --> o and : [o * o] --> o isNat : [o] --> o isNatKind : [o] --> o mark : [o] --> o ok : [o] --> o plus : [o * o] --> o proper : [o] --> o s : [o] --> o top : [o] --> o tt : [] --> o active(U11(tt, X, Y)) => mark(U12(isNat(X), Y)) active(U12(tt, X)) => mark(U13(isNat(X))) active(U13(tt)) => mark(tt) active(U21(tt, X)) => mark(U22(isNat(X))) active(U22(tt)) => mark(tt) active(U31(tt, X)) => mark(X) active(U41(tt, X, Y)) => mark(s(plus(Y, X))) active(and(tt, X)) => mark(X) active(isNat(0)) => mark(tt) active(isNat(plus(X, Y))) => mark(U11(and(isNatKind(X), isNatKind(Y)), X, Y)) active(isNat(s(X))) => mark(U21(isNatKind(X), X)) active(isNatKind(0)) => mark(tt) active(isNatKind(plus(X, Y))) => mark(and(isNatKind(X), isNatKind(Y))) active(isNatKind(s(X))) => mark(isNatKind(X)) active(plus(X, 0)) => mark(U31(and(isNat(X), isNatKind(X)), X)) active(plus(X, s(Y))) => mark(U41(and(and(isNat(Y), isNatKind(Y)), and(isNat(X), isNatKind(X))), Y, X)) active(U11(X, Y, Z)) => U11(active(X), Y, Z) active(U12(X, Y)) => U12(active(X), Y) active(U13(X)) => U13(active(X)) active(U21(X, Y)) => U21(active(X), Y) active(U22(X)) => U22(active(X)) active(U31(X, Y)) => U31(active(X), Y) active(U41(X, Y, Z)) => U41(active(X), Y, Z) active(s(X)) => s(active(X)) active(plus(X, Y)) => plus(active(X), Y) active(plus(X, Y)) => plus(X, active(Y)) active(and(X, Y)) => and(active(X), Y) U11(mark(X), Y, Z) => mark(U11(X, Y, Z)) U12(mark(X), Y) => mark(U12(X, Y)) U13(mark(X)) => mark(U13(X)) U21(mark(X), Y) => mark(U21(X, Y)) U22(mark(X)) => mark(U22(X)) U31(mark(X), Y) => mark(U31(X, Y)) U41(mark(X), Y, Z) => mark(U41(X, Y, Z)) s(mark(X)) => mark(s(X)) plus(mark(X), Y) => mark(plus(X, Y)) plus(X, mark(Y)) => mark(plus(X, Y)) and(mark(X), Y) => mark(and(X, Y)) proper(U11(X, Y, Z)) => U11(proper(X), proper(Y), proper(Z)) proper(tt) => ok(tt) proper(U12(X, Y)) => U12(proper(X), proper(Y)) proper(isNat(X)) => isNat(proper(X)) proper(U13(X)) => U13(proper(X)) proper(U21(X, Y)) => U21(proper(X), proper(Y)) proper(U22(X)) => U22(proper(X)) proper(U31(X, Y)) => U31(proper(X), proper(Y)) proper(U41(X, Y, Z)) => U41(proper(X), proper(Y), proper(Z)) proper(s(X)) => s(proper(X)) proper(plus(X, Y)) => plus(proper(X), proper(Y)) proper(and(X, Y)) => and(proper(X), proper(Y)) proper(0) => ok(0) proper(isNatKind(X)) => isNatKind(proper(X)) U11(ok(X), ok(Y), ok(Z)) => ok(U11(X, Y, Z)) U12(ok(X), ok(Y)) => ok(U12(X, Y)) isNat(ok(X)) => ok(isNat(X)) U13(ok(X)) => ok(U13(X)) U21(ok(X), ok(Y)) => ok(U21(X, Y)) U22(ok(X)) => ok(U22(X)) U31(ok(X), ok(Y)) => ok(U31(X, Y)) U41(ok(X), ok(Y), ok(Z)) => ok(U41(X, Y, Z)) s(ok(X)) => ok(s(X)) plus(ok(X), ok(Y)) => ok(plus(X, Y)) and(ok(X), ok(Y)) => ok(and(X, Y)) isNatKind(ok(X)) => ok(isNatKind(X)) top(mark(X)) => top(proper(X)) top(ok(X)) => top(active(X)) We use rule removal, following [Kop12, Theorem 2.23]. popout

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

job log

popout

actions

all output return to TRS Stand 20472