details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	1.59996199608 seconds
cpu usage	1.596625016
max memory	2.0922368E7

stage attributes

key	value
output-size	53119
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. !6220!6220 : [o * o] --> o a : [] --> o active : [o] --> o and : [o * o] --> o e : [] --> o i : [] --> o isList : [o] --> o isNeList : [o] --> o isNePal : [o] --> o isPal : [o] --> o isQid : [o] --> o mark : [o] --> o nil : [] --> o o : [] --> o ok : [o] --> o proper : [o] --> o top : [o] --> o tt : [] --> o u : [] --> o active(!6220!6220(!6220!6220(X, Y), Z)) => mark(!6220!6220(X, !6220!6220(Y, Z))) active(!6220!6220(X, nil)) => mark(X) active(!6220!6220(nil, X)) => mark(X) active(and(tt, X)) => mark(X) active(isList(X)) => mark(isNeList(X)) active(isList(nil)) => mark(tt) active(isList(!6220!6220(X, Y))) => mark(and(isList(X), isList(Y))) active(isNeList(X)) => mark(isQid(X)) active(isNeList(!6220!6220(X, Y))) => mark(and(isList(X), isNeList(Y))) active(isNeList(!6220!6220(X, Y))) => mark(and(isNeList(X), isList(Y))) active(isNePal(X)) => mark(isQid(X)) active(isNePal(!6220!6220(X, !6220!6220(Y, X)))) => mark(and(isQid(X), isPal(Y))) active(isPal(X)) => mark(isNePal(X)) active(isPal(nil)) => mark(tt) active(isQid(a)) => mark(tt) active(isQid(e)) => mark(tt) active(isQid(i)) => mark(tt) active(isQid(o)) => mark(tt) active(isQid(u)) => mark(tt) active(!6220!6220(X, Y)) => !6220!6220(active(X), Y) active(!6220!6220(X, Y)) => !6220!6220(X, active(Y)) active(and(X, Y)) => and(active(X), Y) !6220!6220(mark(X), Y) => mark(!6220!6220(X, Y)) !6220!6220(X, mark(Y)) => mark(!6220!6220(X, Y)) and(mark(X), Y) => mark(and(X, Y)) proper(!6220!6220(X, Y)) => !6220!6220(proper(X), proper(Y)) proper(nil) => ok(nil) proper(and(X, Y)) => and(proper(X), proper(Y)) proper(tt) => ok(tt) proper(isList(X)) => isList(proper(X)) proper(isNeList(X)) => isNeList(proper(X)) proper(isQid(X)) => isQid(proper(X)) proper(isNePal(X)) => isNePal(proper(X)) proper(isPal(X)) => isPal(proper(X)) proper(a) => ok(a) proper(e) => ok(e) proper(i) => ok(i) proper(o) => ok(o) proper(u) => ok(u) !6220!6220(ok(X), ok(Y)) => ok(!6220!6220(X, Y)) and(ok(X), ok(Y)) => ok(and(X, Y)) isList(ok(X)) => ok(isList(X)) isNeList(ok(X)) => ok(isNeList(X)) isQid(ok(X)) => ok(isQid(X)) isNePal(ok(X)) => ok(isNePal(X)) isPal(ok(X)) => ok(isPal(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(!6220!6220(!6220!6220(X, Y), Z)) >? mark(!6220!6220(X, !6220!6220(Y, Z))) active(!6220!6220(X, nil)) >? mark(X) active(!6220!6220(nil, X)) >? mark(X) active(and(tt, X)) >? mark(X) active(isList(X)) >? mark(isNeList(X)) active(isList(nil)) >? mark(tt) active(isList(!6220!6220(X, Y))) >? mark(and(isList(X), isList(Y))) active(isNeList(X)) >? mark(isQid(X)) active(isNeList(!6220!6220(X, Y))) >? mark(and(isList(X), isNeList(Y))) active(isNeList(!6220!6220(X, Y))) >? mark(and(isNeList(X), isList(Y))) active(isNePal(X)) >? mark(isQid(X)) active(isNePal(!6220!6220(X, !6220!6220(Y, X)))) >? mark(and(isQid(X), isPal(Y))) active(isPal(X)) >? mark(isNePal(X)) active(isPal(nil)) >? mark(tt) active(isQid(a)) >? mark(tt) active(isQid(e)) >? mark(tt) popout

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

job log

popout

actions

all output return to TRS Stand 20472