Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716375
details
property
value
status
complete
benchmark
PALINDROME_nokinds-noand_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
0.332103967667 seconds
cpu usage
0.328574853
max memory
6672384.0
stage attributes
key
value
output-size
23357
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 U11 : [o] --> o U21 : [o * o] --> o U22 : [o] --> o U31 : [o] --> o U41 : [o * o] --> o U42 : [o] --> o U51 : [o * o] --> o U52 : [o] --> o U61 : [o] --> o U71 : [o * o] --> o U72 : [o] --> o U81 : [o] --> o a : [] --> o activate : [o] --> o e : [] --> o i : [] --> o isList : [o] --> o isNeList : [o] --> o isNePal : [o] --> o isPal : [o] --> o isQid : [o] --> o n!6220!6220!6220!6220 : [o * o] --> o n!6220!6220a : [] --> o n!6220!6220e : [] --> o n!6220!6220i : [] --> o n!6220!6220nil : [] --> o n!6220!6220o : [] --> o n!6220!6220u : [] --> o nil : [] --> o o : [] --> o tt : [] --> o u : [] --> o !6220!6220(!6220!6220(X, Y), Z) => !6220!6220(X, !6220!6220(Y, Z)) !6220!6220(X, nil) => X !6220!6220(nil, X) => X U11(tt) => tt U21(tt, X) => U22(isList(activate(X))) U22(tt) => tt U31(tt) => tt U41(tt, X) => U42(isNeList(activate(X))) U42(tt) => tt U51(tt, X) => U52(isList(activate(X))) U52(tt) => tt U61(tt) => tt U71(tt, X) => U72(isPal(activate(X))) U72(tt) => tt U81(tt) => tt isList(X) => U11(isNeList(activate(X))) isList(n!6220!6220nil) => tt isList(n!6220!6220!6220!6220(X, Y)) => U21(isList(activate(X)), activate(Y)) isNeList(X) => U31(isQid(activate(X))) isNeList(n!6220!6220!6220!6220(X, Y)) => U41(isList(activate(X)), activate(Y)) isNeList(n!6220!6220!6220!6220(X, Y)) => U51(isNeList(activate(X)), activate(Y)) isNePal(X) => U61(isQid(activate(X))) isNePal(n!6220!6220!6220!6220(X, !6220!6220(Y, X))) => U71(isQid(activate(X)), activate(Y)) isPal(X) => U81(isNePal(activate(X))) isPal(n!6220!6220nil) => tt isQid(n!6220!6220a) => tt isQid(n!6220!6220e) => tt isQid(n!6220!6220i) => tt isQid(n!6220!6220o) => tt isQid(n!6220!6220u) => tt nil => n!6220!6220nil !6220!6220(X, Y) => n!6220!6220!6220!6220(X, Y) a => n!6220!6220a e => n!6220!6220e i => n!6220!6220i o => n!6220!6220o u => n!6220!6220u activate(n!6220!6220nil) => nil activate(n!6220!6220!6220!6220(X, Y)) => !6220!6220(X, Y) activate(n!6220!6220a) => a activate(n!6220!6220e) => e activate(n!6220!6220i) => i activate(n!6220!6220o) => o activate(n!6220!6220u) => u 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]): !6220!6220(!6220!6220(X, Y), Z) >? !6220!6220(X, !6220!6220(Y, Z)) !6220!6220(X, nil) >? X !6220!6220(nil, X) >? X U11(tt) >? tt U21(tt, X) >? U22(isList(activate(X)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472