details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	1.20743489265 seconds
cpu usage	1.203851698
max memory	3.4512896E7

stage attributes

key	value
output-size	38967
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 U13 : [o * o * o] --> o U14 : [o * o * o] --> o U15 : [o * o] --> o U16 : [o] --> o U21 : [o * o] --> o U22 : [o * o] --> o U23 : [o] --> o U31 : [o * o] --> o U32 : [o] --> o U41 : [o] --> o U51 : [o * o] --> o U52 : [o * o] --> o U61 : [o * o * o] --> o U62 : [o * o * o] --> o U63 : [o * o * o] --> o U64 : [o * o * o] --> o activate : [o] --> o isNat : [o] --> o isNatKind : [o] --> o n!6220!62200 : [] --> o n!6220!6220plus : [o * o] --> o n!6220!6220s : [o] --> o plus : [o * o] --> o s : [o] --> o tt : [] --> o U11(tt, X, Y) => U12(isNatKind(activate(X)), activate(X), activate(Y)) U12(tt, X, Y) => U13(isNatKind(activate(Y)), activate(X), activate(Y)) U13(tt, X, Y) => U14(isNatKind(activate(Y)), activate(X), activate(Y)) U14(tt, X, Y) => U15(isNat(activate(X)), activate(Y)) U15(tt, X) => U16(isNat(activate(X))) U16(tt) => tt U21(tt, X) => U22(isNatKind(activate(X)), activate(X)) U22(tt, X) => U23(isNat(activate(X))) U23(tt) => tt U31(tt, X) => U32(isNatKind(activate(X))) U32(tt) => tt U41(tt) => tt U51(tt, X) => U52(isNatKind(activate(X)), activate(X)) U52(tt, X) => activate(X) U61(tt, X, Y) => U62(isNatKind(activate(X)), activate(X), activate(Y)) U62(tt, X, Y) => U63(isNat(activate(Y)), activate(X), activate(Y)) U63(tt, X, Y) => U64(isNatKind(activate(Y)), activate(X), activate(Y)) U64(tt, X, Y) => s(plus(activate(Y), activate(X))) isNat(n!6220!62200) => tt isNat(n!6220!6220plus(X, Y)) => U11(isNatKind(activate(X)), activate(X), activate(Y)) isNat(n!6220!6220s(X)) => U21(isNatKind(activate(X)), activate(X)) isNatKind(n!6220!62200) => tt isNatKind(n!6220!6220plus(X, Y)) => U31(isNatKind(activate(X)), activate(Y)) isNatKind(n!6220!6220s(X)) => U41(isNatKind(activate(X))) plus(X, 0) => U51(isNat(X), X) plus(X, s(Y)) => U61(isNat(Y), Y, X) 0 => n!6220!62200 plus(X, Y) => n!6220!6220plus(X, Y) s(X) => n!6220!6220s(X) activate(n!6220!62200) => 0 activate(n!6220!6220plus(X, Y)) => plus(activate(X), activate(Y)) activate(n!6220!6220s(X)) => s(activate(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#(isNatKind(activate(X)), activate(X), activate(Y)) 1] U11#(tt, X, Y) =#> isNatKind#(activate(X)) 2] U11#(tt, X, Y) =#> activate#(X) 3] U11#(tt, X, Y) =#> activate#(X) 4] U11#(tt, X, Y) =#> activate#(Y) 5] U12#(tt, X, Y) =#> U13#(isNatKind(activate(Y)), activate(X), activate(Y)) 6] U12#(tt, X, Y) =#> isNatKind#(activate(Y)) 7] U12#(tt, X, Y) =#> activate#(Y) 8] U12#(tt, X, Y) =#> activate#(X) 9] U12#(tt, X, Y) =#> activate#(Y) 10] U13#(tt, X, Y) =#> U14#(isNatKind(activate(Y)), activate(X), activate(Y)) 11] U13#(tt, X, Y) =#> isNatKind#(activate(Y)) 12] U13#(tt, X, Y) =#> activate#(Y) 13] U13#(tt, X, Y) =#> activate#(X) 14] U13#(tt, X, Y) =#> activate#(Y) 15] U14#(tt, X, Y) =#> U15#(isNat(activate(X)), activate(Y)) 16] U14#(tt, X, Y) =#> isNat#(activate(X)) 17] U14#(tt, X, Y) =#> activate#(X) 18] U14#(tt, X, Y) =#> activate#(Y) 19] U15#(tt, X) =#> U16#(isNat(activate(X))) popout

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

job log

popout

actions

all output return to TRS Stand 20472