details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.643111944199 seconds
cpu usage	0.639954231
max memory	1.0407936E7

stage attributes

key	value
output-size	40872
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. !6220!6220 : [o * o] --> o a : [] --> o a!6220!6220!6220!6220 : [o * o] --> o a!6220!6220and : [o * o] --> o a!6220!6220isList : [o] --> o a!6220!6220isNeList : [o] --> o a!6220!6220isNePal : [o] --> o a!6220!6220isPal : [o] --> o a!6220!6220isQid : [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 tt : [] --> o u : [] --> o a!6220!6220!6220!6220(!6220!6220(X, Y), Z) => a!6220!6220!6220!6220(mark(X), a!6220!6220!6220!6220(mark(Y), mark(Z))) a!6220!6220!6220!6220(X, nil) => mark(X) a!6220!6220!6220!6220(nil, X) => mark(X) a!6220!6220and(tt, X) => mark(X) a!6220!6220isList(X) => a!6220!6220isNeList(X) a!6220!6220isList(nil) => tt a!6220!6220isList(!6220!6220(X, Y)) => a!6220!6220and(a!6220!6220isList(X), isList(Y)) a!6220!6220isNeList(X) => a!6220!6220isQid(X) a!6220!6220isNeList(!6220!6220(X, Y)) => a!6220!6220and(a!6220!6220isList(X), isNeList(Y)) a!6220!6220isNeList(!6220!6220(X, Y)) => a!6220!6220and(a!6220!6220isNeList(X), isList(Y)) a!6220!6220isNePal(X) => a!6220!6220isQid(X) a!6220!6220isNePal(!6220!6220(X, !6220!6220(Y, X))) => a!6220!6220and(a!6220!6220isQid(X), isPal(Y)) a!6220!6220isPal(X) => a!6220!6220isNePal(X) a!6220!6220isPal(nil) => tt a!6220!6220isQid(a) => tt a!6220!6220isQid(e) => tt a!6220!6220isQid(i) => tt a!6220!6220isQid(o) => tt a!6220!6220isQid(u) => tt mark(!6220!6220(X, Y)) => a!6220!6220!6220!6220(mark(X), mark(Y)) mark(and(X, Y)) => a!6220!6220and(mark(X), Y) mark(isList(X)) => a!6220!6220isList(X) mark(isNeList(X)) => a!6220!6220isNeList(X) mark(isQid(X)) => a!6220!6220isQid(X) mark(isNePal(X)) => a!6220!6220isNePal(X) mark(isPal(X)) => a!6220!6220isPal(X) mark(nil) => nil mark(tt) => tt mark(a) => a mark(e) => e mark(i) => i mark(o) => o mark(u) => u a!6220!6220!6220!6220(X, Y) => !6220!6220(X, Y) a!6220!6220and(X, Y) => and(X, Y) a!6220!6220isList(X) => isList(X) a!6220!6220isNeList(X) => isNeList(X) a!6220!6220isQid(X) => isQid(X) a!6220!6220isNePal(X) => isNePal(X) a!6220!6220isPal(X) => isPal(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]): a!6220!6220!6220!6220(!6220!6220(X, Y), Z) >? a!6220!6220!6220!6220(mark(X), a!6220!6220!6220!6220(mark(Y), mark(Z))) a!6220!6220!6220!6220(X, nil) >? mark(X) a!6220!6220!6220!6220(nil, X) >? mark(X) a!6220!6220and(tt, X) >? mark(X) a!6220!6220isList(X) >? a!6220!6220isNeList(X) a!6220!6220isList(nil) >? tt a!6220!6220isList(!6220!6220(X, Y)) >? a!6220!6220and(a!6220!6220isList(X), isList(Y)) a!6220!6220isNeList(X) >? a!6220!6220isQid(X) a!6220!6220isNeList(!6220!6220(X, Y)) >? a!6220!6220and(a!6220!6220isList(X), isNeList(Y)) a!6220!6220isNeList(!6220!6220(X, Y)) >? a!6220!6220and(a!6220!6220isNeList(X), isList(Y)) a!6220!6220isNePal(X) >? a!6220!6220isQid(X) a!6220!6220isNePal(!6220!6220(X, !6220!6220(Y, X))) >? a!6220!6220and(a!6220!6220isQid(X), isPal(Y)) a!6220!6220isPal(X) >? a!6220!6220isNePal(X) a!6220!6220isPal(nil) >? tt a!6220!6220isQid(a) >? tt a!6220!6220isQid(e) >? tt a!6220!6220isQid(i) >? tt a!6220!6220isQid(o) >? tt a!6220!6220isQid(u) >? tt mark(!6220!6220(X, Y)) >? a!6220!6220!6220!6220(mark(X), mark(Y)) mark(and(X, Y)) >? a!6220!6220and(mark(X), Y) popout

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

job log

popout

actions

all output return to TRS Stand 20472