Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715355
details
property
value
status
complete
benchmark
MYNAT_nokinds-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n099.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
7.9815299511 seconds
cpu usage
7.968544003
max memory
1.49487616E8
stage attributes
key
value
output-size
116457
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 U12 : [o] --> o U21 : [o] --> o U31 : [o * o] --> o U32 : [o] --> o U41 : [o * o] --> o U51 : [o * o * o] --> o U52 : [o * o * o] --> o U61 : [o] --> o U71 : [o * o * o] --> o U72 : [o * o * o] --> o activate : [o] --> o isNat : [o] --> o n!6220!62200 : [] --> o n!6220!6220plus : [o * o] --> o n!6220!6220s : [o] --> o n!6220!6220x : [o * o] --> o plus : [o * o] --> o s : [o] --> o tt : [] --> o x : [o * o] --> o U11(tt, X) => U12(isNat(activate(X))) U12(tt) => tt U21(tt) => tt U31(tt, X) => U32(isNat(activate(X))) U32(tt) => tt U41(tt, X) => activate(X) U51(tt, X, Y) => U52(isNat(activate(Y)), activate(X), activate(Y)) U52(tt, X, Y) => s(plus(activate(Y), activate(X))) U61(tt) => 0 U71(tt, X, Y) => U72(isNat(activate(Y)), activate(X), activate(Y)) U72(tt, X, Y) => plus(x(activate(Y), activate(X)), activate(Y)) isNat(n!6220!62200) => tt isNat(n!6220!6220plus(X, Y)) => U11(isNat(activate(X)), activate(Y)) isNat(n!6220!6220s(X)) => U21(isNat(activate(X))) isNat(n!6220!6220x(X, Y)) => U31(isNat(activate(X)), activate(Y)) plus(X, 0) => U41(isNat(X), X) plus(X, s(Y)) => U51(isNat(Y), Y, X) x(X, 0) => U61(isNat(X)) x(X, s(Y)) => U71(isNat(Y), Y, X) 0 => n!6220!62200 plus(X, Y) => n!6220!6220plus(X, Y) s(X) => n!6220!6220s(X) x(X, Y) => n!6220!6220x(X, Y) 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(n!6220!6220x(X, Y)) => x(activate(X), activate(Y)) 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) =#> U12#(isNat(activate(X))) 1] U11#(tt, X) =#> isNat#(activate(X)) 2] U11#(tt, X) =#> activate#(X) 3] U31#(tt, X) =#> U32#(isNat(activate(X))) 4] U31#(tt, X) =#> isNat#(activate(X)) 5] U31#(tt, X) =#> activate#(X) 6] U41#(tt, X) =#> activate#(X) 7] U51#(tt, X, Y) =#> U52#(isNat(activate(Y)), activate(X), activate(Y)) 8] U51#(tt, X, Y) =#> isNat#(activate(Y)) 9] U51#(tt, X, Y) =#> activate#(Y) 10] U51#(tt, X, Y) =#> activate#(X) 11] U51#(tt, X, Y) =#> activate#(Y) 12] U52#(tt, X, Y) =#> s#(plus(activate(Y), activate(X))) 13] U52#(tt, X, Y) =#> plus#(activate(Y), activate(X)) 14] U52#(tt, X, Y) =#> activate#(Y) 15] U52#(tt, X, Y) =#> activate#(X) 16] U61#(tt) =#> 0# 17] U71#(tt, X, Y) =#> U72#(isNat(activate(Y)), activate(X), activate(Y)) 18] U71#(tt, X, Y) =#> isNat#(activate(Y)) 19] U71#(tt, X, Y) =#> activate#(Y) 20] U71#(tt, X, Y) =#> activate#(X) 21] U71#(tt, X, Y) =#> activate#(Y) 22] U72#(tt, X, Y) =#> plus#(x(activate(Y), activate(X)), activate(Y)) 23] U72#(tt, X, Y) =#> x#(activate(Y), activate(X)) 24] U72#(tt, X, Y) =#> activate#(Y) 25] U72#(tt, X, Y) =#> activate#(X) 26] U72#(tt, X, Y) =#> activate#(Y) 27] isNat#(n!6220!6220plus(X, Y)) =#> U11#(isNat(activate(X)), activate(Y)) 28] isNat#(n!6220!6220plus(X, Y)) =#> isNat#(activate(X)) 29] isNat#(n!6220!6220plus(X, Y)) =#> activate#(X) 30] isNat#(n!6220!6220plus(X, Y)) =#> activate#(Y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472