Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709898
details
property
value
status
complete
benchmark
tree.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
0.789338111877 seconds
cpu usage
0.78725574
max memory
1.4106624E7
stage attributes
key
value
output-size
29470
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. !940 : [] --> o !minus : [o * o] --> o !plus : [o * o] --> o 0 : [o] --> o 1 : [o] --> o and : [o * o] --> o bs : [o] --> o false : [] --> o ge : [o * o] --> o if : [o * o * o] --> o l : [o] --> o max : [o] --> o min : [o] --> o n : [o * o * o] --> o not : [o] --> o size : [o] --> o true : [] --> o val : [o] --> o wb : [o] --> o 0(!940) => !940 !plus(X, !940) => X !plus(!940, X) => X !plus(0(X), 0(Y)) => 0(!plus(X, Y)) !plus(0(X), 1(Y)) => 1(!plus(X, Y)) !plus(1(X), 0(Y)) => 1(!plus(X, Y)) !plus(1(X), 1(Y)) => 0(!plus(!plus(X, Y), 1(!940))) !plus(X, !plus(Y, Z)) => !plus(!plus(X, Y), Z) !minus(X, !940) => X !minus(!940, X) => !940 !minus(0(X), 0(Y)) => 0(!minus(X, Y)) !minus(0(X), 1(Y)) => 1(!minus(!minus(X, Y), 1(!940))) !minus(1(X), 0(Y)) => 1(!minus(X, Y)) !minus(1(X), 1(Y)) => 0(!minus(X, Y)) not(false) => true not(true) => false and(X, true) => X and(X, false) => false if(true, X, Y) => X if(false, X, Y) => Y ge(0(X), 0(Y)) => ge(X, Y) ge(0(X), 1(Y)) => not(ge(Y, X)) ge(1(X), 0(Y)) => ge(X, Y) ge(1(X), 1(Y)) => ge(X, Y) ge(X, !940) => true ge(!940, 1(X)) => false ge(!940, 0(X)) => ge(!940, X) val(l(X)) => X val(n(X, Y, Z)) => X min(l(X)) => X min(n(X, Y, Z)) => min(Y) max(l(X)) => X max(n(X, Y, Z)) => max(Z) bs(l(X)) => true bs(n(X, Y, Z)) => and(and(ge(X, max(Y)), ge(min(Z), X)), and(bs(Y), bs(Z))) size(l(X)) => 1(!940) size(n(X, Y, Z)) => !plus(!plus(size(X), size(Y)), 1(!940)) wb(l(X)) => true wb(n(X, Y, Z)) => and(if(ge(size(Y), size(Z)), ge(1(!940), !minus(size(Y), size(Z))), ge(1(!940), !minus(size(Z), size(Y)))), and(wb(Y), wb(Z))) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): 0(!940) >? !940 !plus(X, !940) >? X !plus(!940, X) >? X !plus(0(X), 0(Y)) >? 0(!plus(X, Y)) !plus(0(X), 1(Y)) >? 1(!plus(X, Y)) !plus(1(X), 0(Y)) >? 1(!plus(X, Y)) !plus(1(X), 1(Y)) >? 0(!plus(!plus(X, Y), 1(!940))) !plus(X, !plus(Y, Z)) >? !plus(!plus(X, Y), Z) !minus(X, !940) >? X !minus(!940, X) >? !940 !minus(0(X), 0(Y)) >? 0(!minus(X, Y)) !minus(0(X), 1(Y)) >? 1(!minus(!minus(X, Y), 1(!940))) !minus(1(X), 0(Y)) >? 1(!minus(X, Y)) !minus(1(X), 1(Y)) >? 0(!minus(X, Y)) not(false) >? true not(true) >? false and(X, true) >? X and(X, false) >? false if(true, X, Y) >? X if(false, X, Y) >? Y ge(0(X), 0(Y)) >? ge(X, Y) ge(0(X), 1(Y)) >? not(ge(Y, X)) ge(1(X), 0(Y)) >? ge(X, Y) ge(1(X), 1(Y)) >? ge(X, Y) ge(X, !940) >? true
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472