Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715465
details
property
value
status
complete
benchmark
MYNAT_nosorts_noand_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
0.527328968048 seconds
cpu usage
0.523942465
max memory
1.439744E7
stage attributes
key
value
output-size
25498
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. 0 : [] --> o U11 : [o * o * o] --> o U12 : [o * o * o] --> o U21 : [o * o * o] --> o U22 : [o * o * o] --> o a!6220!6220U11 : [o * o * o] --> o a!6220!6220U12 : [o * o * o] --> o a!6220!6220U21 : [o * o * o] --> o a!6220!6220U22 : [o * o * o] --> o a!6220!6220plus : [o * o] --> o a!6220!6220x : [o * o] --> o mark : [o] --> o plus : [o * o] --> o s : [o] --> o tt : [] --> o x : [o * o] --> o a!6220!6220U11(tt, X, Y) => a!6220!6220U12(tt, X, Y) a!6220!6220U12(tt, X, Y) => s(a!6220!6220plus(mark(Y), mark(X))) a!6220!6220U21(tt, X, Y) => a!6220!6220U22(tt, X, Y) a!6220!6220U22(tt, X, Y) => a!6220!6220plus(a!6220!6220x(mark(Y), mark(X)), mark(Y)) a!6220!6220plus(X, 0) => mark(X) a!6220!6220plus(X, s(Y)) => a!6220!6220U11(tt, Y, X) a!6220!6220x(X, 0) => 0 a!6220!6220x(X, s(Y)) => a!6220!6220U21(tt, Y, X) mark(U11(X, Y, Z)) => a!6220!6220U11(mark(X), Y, Z) mark(U12(X, Y, Z)) => a!6220!6220U12(mark(X), Y, Z) mark(plus(X, Y)) => a!6220!6220plus(mark(X), mark(Y)) mark(U21(X, Y, Z)) => a!6220!6220U21(mark(X), Y, Z) mark(U22(X, Y, Z)) => a!6220!6220U22(mark(X), Y, Z) mark(x(X, Y)) => a!6220!6220x(mark(X), mark(Y)) mark(tt) => tt mark(s(X)) => s(mark(X)) mark(0) => 0 a!6220!6220U11(X, Y, Z) => U11(X, Y, Z) a!6220!6220U12(X, Y, Z) => U12(X, Y, Z) a!6220!6220plus(X, Y) => plus(X, Y) a!6220!6220U21(X, Y, Z) => U21(X, Y, Z) a!6220!6220U22(X, Y, Z) => U22(X, Y, Z) a!6220!6220x(X, Y) => x(X, Y) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): a!6220!6220U11(tt, X, Y) >? a!6220!6220U12(tt, X, Y) a!6220!6220U12(tt, X, Y) >? s(a!6220!6220plus(mark(Y), mark(X))) a!6220!6220U21(tt, X, Y) >? a!6220!6220U22(tt, X, Y) a!6220!6220U22(tt, X, Y) >? a!6220!6220plus(a!6220!6220x(mark(Y), mark(X)), mark(Y)) a!6220!6220plus(X, 0) >? mark(X) a!6220!6220plus(X, s(Y)) >? a!6220!6220U11(tt, Y, X) a!6220!6220x(X, 0) >? 0 a!6220!6220x(X, s(Y)) >? a!6220!6220U21(tt, Y, X) mark(U11(X, Y, Z)) >? a!6220!6220U11(mark(X), Y, Z) mark(U12(X, Y, Z)) >? a!6220!6220U12(mark(X), Y, Z) mark(plus(X, Y)) >? a!6220!6220plus(mark(X), mark(Y)) mark(U21(X, Y, Z)) >? a!6220!6220U21(mark(X), Y, Z) mark(U22(X, Y, Z)) >? a!6220!6220U22(mark(X), Y, Z) mark(x(X, Y)) >? a!6220!6220x(mark(X), mark(Y)) mark(tt) >? tt mark(s(X)) >? s(mark(X)) mark(0) >? 0 a!6220!6220U11(X, Y, Z) >? U11(X, Y, Z) a!6220!6220U12(X, Y, Z) >? U12(X, Y, Z) a!6220!6220plus(X, Y) >? plus(X, Y) a!6220!6220U21(X, Y, Z) >? U21(X, Y, Z) a!6220!6220U22(X, Y, Z) >? U22(X, Y, Z) a!6220!6220x(X, Y) >? x(X, Y) about to try horpo We use a recursive path ordering as defined in [Kop12, Chapter 5]. Argument functions: [[0]] = _|_ [[mark(x_1)]] = x_1 [[tt]] = _|_ We choose Lex = {} and Mul = {U11, U12, U21, U22, a!6220!6220U11, a!6220!6220U12, a!6220!6220U21, a!6220!6220U22, a!6220!6220plus, a!6220!6220x, plus, s, x}, and the following precedence: U21 = U22 = a!6220!6220U21 = a!6220!6220U22 = a!6220!6220x = x > U11 = U12 = a!6220!6220U11 = a!6220!6220U12 = a!6220!6220plus = plus > s Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: a!6220!6220U11(_|_, X, Y) >= a!6220!6220U12(_|_, X, Y) a!6220!6220U12(_|_, X, Y) >= s(a!6220!6220plus(Y, X)) a!6220!6220U21(_|_, X, Y) >= a!6220!6220U22(_|_, X, Y) a!6220!6220U22(_|_, X, Y) >= a!6220!6220plus(a!6220!6220x(Y, X), Y) a!6220!6220plus(X, _|_) >= X a!6220!6220plus(X, s(Y)) > a!6220!6220U11(_|_, Y, X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472