details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	5.30327796936 seconds
cpu usage	5.300420459
max memory	1.15941376E8

stage attributes

key	value
output-size	80108
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 U21 : [o * o * o] --> o U31 : [o] --> o U41 : [o * o * o] --> o active : [o] --> o and : [o * o] --> o isNat : [o] --> o mark : [o] --> o ok : [o] --> o plus : [o * o] --> o proper : [o] --> o s : [o] --> o top : [o] --> o tt : [] --> o x : [o * o] --> o active(U11(tt, X)) => mark(X) active(U21(tt, X, Y)) => mark(s(plus(Y, X))) active(U31(tt)) => mark(0) active(U41(tt, X, Y)) => mark(plus(x(Y, X), Y)) active(and(tt, X)) => mark(X) active(isNat(0)) => mark(tt) active(isNat(plus(X, Y))) => mark(and(isNat(X), isNat(Y))) active(isNat(s(X))) => mark(isNat(X)) active(isNat(x(X, Y))) => mark(and(isNat(X), isNat(Y))) active(plus(X, 0)) => mark(U11(isNat(X), X)) active(plus(X, s(Y))) => mark(U21(and(isNat(Y), isNat(X)), Y, X)) active(x(X, 0)) => mark(U31(isNat(X))) active(x(X, s(Y))) => mark(U41(and(isNat(Y), isNat(X)), Y, X)) active(U11(X, Y)) => U11(active(X), Y) active(U21(X, Y, Z)) => U21(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(U31(X)) => U31(active(X)) active(U41(X, Y, Z)) => U41(active(X), Y, Z) active(x(X, Y)) => x(active(X), Y) active(x(X, Y)) => x(X, active(Y)) active(and(X, Y)) => and(active(X), Y) U11(mark(X), Y) => mark(U11(X, Y)) U21(mark(X), Y, Z) => mark(U21(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)) U31(mark(X)) => mark(U31(X)) U41(mark(X), Y, Z) => mark(U41(X, Y, Z)) x(mark(X), Y) => mark(x(X, Y)) x(X, mark(Y)) => mark(x(X, Y)) and(mark(X), Y) => mark(and(X, Y)) proper(U11(X, Y)) => U11(proper(X), proper(Y)) proper(tt) => ok(tt) proper(U21(X, Y, Z)) => U21(proper(X), proper(Y), proper(Z)) proper(s(X)) => s(proper(X)) proper(plus(X, Y)) => plus(proper(X), proper(Y)) proper(U31(X)) => U31(proper(X)) proper(0) => ok(0) proper(U41(X, Y, Z)) => U41(proper(X), proper(Y), proper(Z)) proper(x(X, Y)) => x(proper(X), proper(Y)) proper(and(X, Y)) => and(proper(X), proper(Y)) proper(isNat(X)) => isNat(proper(X)) U11(ok(X), ok(Y)) => ok(U11(X, Y)) U21(ok(X), ok(Y), ok(Z)) => ok(U21(X, Y, Z)) s(ok(X)) => ok(s(X)) plus(ok(X), ok(Y)) => ok(plus(X, Y)) U31(ok(X)) => ok(U31(X)) U41(ok(X), ok(Y), ok(Z)) => ok(U41(X, Y, Z)) x(ok(X), ok(Y)) => ok(x(X, Y)) and(ok(X), ok(Y)) => ok(and(X, Y)) isNat(ok(X)) => ok(isNat(X)) top(mark(X)) => top(proper(X)) top(ok(X)) => top(active(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]): active(U11(tt, X)) >? mark(X) active(U21(tt, X, Y)) >? mark(s(plus(Y, X))) active(U31(tt)) >? mark(0) active(U41(tt, X, Y)) >? mark(plus(x(Y, X), Y)) active(and(tt, X)) >? mark(X) active(isNat(0)) >? mark(tt) active(isNat(plus(X, Y))) >? mark(and(isNat(X), isNat(Y))) active(isNat(s(X))) >? mark(isNat(X)) active(isNat(x(X, Y))) >? mark(and(isNat(X), isNat(Y))) active(plus(X, 0)) >? mark(U11(isNat(X), X)) active(plus(X, s(Y))) >? mark(U21(and(isNat(Y), isNat(X)), Y, X)) active(x(X, 0)) >? mark(U31(isNat(X))) popout

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

job log

popout

actions

all output return to TRS Stand 20472