details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	1.35136699677 seconds
cpu usage	0.95189449
max memory	4.286464E7

stage attributes

key	value
output-size	12349
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. 0 : [] --> o U11 : [o * o * o] --> o U12 : [o * o * o] --> o U21 : [o * o] --> o U22 : [o * o] --> o U31 : [o * o] --> o U32 : [o * o] --> o U41 : [o * o * o] --> o U42 : [o * o * o] --> o U51 : [o * o] --> o U52 : [o * o] --> o U61 : [o * o * o * o] --> o U62 : [o * o * o * o] --> o U63 : [o * o * o * o] --> o U64 : [o * o] --> o U71 : [o * o] --> o U72 : [o * o] --> o U81 : [o * o * o] --> o U82 : [o * o * o] --> o activate : [o] --> o afterNth : [o * o] --> o cons : [o * o] --> o fst : [o] --> o head : [o] --> o n!6220!6220natsFrom : [o] --> o natsFrom : [o] --> o nil : [] --> o pair : [o * o] --> o s : [o] --> o sel : [o * o] --> o snd : [o] --> o splitAt : [o * o] --> o tail : [o] --> o take : [o * o] --> o tt : [] --> o U11(tt, X, Y) => U12(tt, activate(X), activate(Y)) U12(tt, X, Y) => snd(splitAt(activate(X), activate(Y))) U21(tt, X) => U22(tt, activate(X)) U22(tt, X) => activate(X) U31(tt, X) => U32(tt, activate(X)) U32(tt, X) => activate(X) U41(tt, X, Y) => U42(tt, activate(X), activate(Y)) U42(tt, X, Y) => head(afterNth(activate(X), activate(Y))) U51(tt, X) => U52(tt, activate(X)) U52(tt, X) => activate(X) U61(tt, X, Y, Z) => U62(tt, activate(X), activate(Y), activate(Z)) U62(tt, X, Y, Z) => U63(tt, activate(X), activate(Y), activate(Z)) U63(tt, X, Y, Z) => U64(splitAt(activate(X), activate(Z)), activate(Y)) U64(pair(X, Y), Z) => pair(cons(activate(Z), X), Y) U71(tt, X) => U72(tt, activate(X)) U72(tt, X) => activate(X) U81(tt, X, Y) => U82(tt, activate(X), activate(Y)) U82(tt, X, Y) => fst(splitAt(activate(X), activate(Y))) afterNth(X, Y) => U11(tt, X, Y) fst(pair(X, Y)) => U21(tt, X) head(cons(X, Y)) => U31(tt, X) natsFrom(X) => cons(X, n!6220!6220natsFrom(s(X))) sel(X, Y) => U41(tt, X, Y) snd(pair(X, Y)) => U51(tt, Y) splitAt(0, X) => pair(nil, X) splitAt(s(X), cons(Y, Z)) => U61(tt, X, Y, activate(Z)) tail(cons(X, Y)) => U71(tt, activate(Y)) take(X, Y) => U81(tt, X, Y) natsFrom(X) => n!6220!6220natsFrom(X) activate(n!6220!6220natsFrom(X)) => natsFrom(X) activate(X) => X We use the dependency pair framework as described in [Kop12, Ch. 6/7], with static dependency pairs (see [KusIsoSakBla09] and the adaptation for AFSMs in [Kop12, Ch. 7.8]). We thus obtain the following dependency pair problem (P_0, R_0, minimal, formative): Dependency Pairs P_0: 0] U11#(tt, X, Y) =#> U12#(tt, activate(X), activate(Y)) 1] U11#(tt, X, Y) =#> activate#(X) 2] U11#(tt, X, Y) =#> activate#(Y) 3] U12#(tt, X, Y) =#> snd#(splitAt(activate(X), activate(Y))) 4] U12#(tt, X, Y) =#> splitAt#(activate(X), activate(Y)) 5] U12#(tt, X, Y) =#> activate#(X) 6] U12#(tt, X, Y) =#> activate#(Y) 7] U21#(tt, X) =#> U22#(tt, activate(X)) 8] U21#(tt, X) =#> activate#(X) 9] U22#(tt, X) =#> activate#(X) 10] U31#(tt, X) =#> U32#(tt, activate(X)) 11] U31#(tt, X) =#> activate#(X) 12] U32#(tt, X) =#> activate#(X) 13] U41#(tt, X, Y) =#> U42#(tt, activate(X), activate(Y)) 14] U41#(tt, X, Y) =#> activate#(X) popout

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

job log

popout

actions

all output return to TRS Stand 20472