Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715420
details
property
value
status
complete
benchmark
Ex5_DLMMU04_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n108.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
4.75135302544 seconds
cpu usage
4.714031383
max memory
5.1740672E7
stage attributes
key
value
output-size
96159
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 active : [o] --> o cons : [o * o] --> o incr : [o] --> o mark : [o] --> o nil : [] --> o oddNs : [] --> o pair : [o * o] --> o pairNs : [] --> o repItems : [o] --> o s : [o] --> o tail : [o] --> o take : [o * o] --> o zip : [o * o] --> o active(pairNs) => mark(cons(0, incr(oddNs))) active(oddNs) => mark(incr(pairNs)) active(incr(cons(X, Y))) => mark(cons(s(X), incr(Y))) active(take(0, X)) => mark(nil) active(take(s(X), cons(Y, Z))) => mark(cons(Y, take(X, Z))) active(zip(nil, X)) => mark(nil) active(zip(X, nil)) => mark(nil) active(zip(cons(X, Y), cons(Z, U))) => mark(cons(pair(X, Z), zip(Y, U))) active(tail(cons(X, Y))) => mark(Y) active(repItems(nil)) => mark(nil) active(repItems(cons(X, Y))) => mark(cons(X, cons(X, repItems(Y)))) mark(pairNs) => active(pairNs) mark(cons(X, Y)) => active(cons(mark(X), Y)) mark(0) => active(0) mark(incr(X)) => active(incr(mark(X))) mark(oddNs) => active(oddNs) mark(s(X)) => active(s(mark(X))) mark(take(X, Y)) => active(take(mark(X), mark(Y))) mark(nil) => active(nil) mark(zip(X, Y)) => active(zip(mark(X), mark(Y))) mark(pair(X, Y)) => active(pair(mark(X), mark(Y))) mark(tail(X)) => active(tail(mark(X))) mark(repItems(X)) => active(repItems(mark(X))) cons(mark(X), Y) => cons(X, Y) cons(X, mark(Y)) => cons(X, Y) cons(active(X), Y) => cons(X, Y) cons(X, active(Y)) => cons(X, Y) incr(mark(X)) => incr(X) incr(active(X)) => incr(X) s(mark(X)) => s(X) s(active(X)) => s(X) take(mark(X), Y) => take(X, Y) take(X, mark(Y)) => take(X, Y) take(active(X), Y) => take(X, Y) take(X, active(Y)) => take(X, Y) zip(mark(X), Y) => zip(X, Y) zip(X, mark(Y)) => zip(X, Y) zip(active(X), Y) => zip(X, Y) zip(X, active(Y)) => zip(X, Y) pair(mark(X), Y) => pair(X, Y) pair(X, mark(Y)) => pair(X, Y) pair(active(X), Y) => pair(X, Y) pair(X, active(Y)) => pair(X, Y) tail(mark(X)) => tail(X) tail(active(X)) => tail(X) repItems(mark(X)) => repItems(X) repItems(active(X)) => repItems(X) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): active(pairNs) >? mark(cons(0, incr(oddNs))) active(oddNs) >? mark(incr(pairNs)) active(incr(cons(X, Y))) >? mark(cons(s(X), incr(Y))) active(take(0, X)) >? mark(nil) active(take(s(X), cons(Y, Z))) >? mark(cons(Y, take(X, Z))) active(zip(nil, X)) >? mark(nil) active(zip(X, nil)) >? mark(nil) active(zip(cons(X, Y), cons(Z, U))) >? mark(cons(pair(X, Z), zip(Y, U))) active(tail(cons(X, Y))) >? mark(Y) active(repItems(nil)) >? mark(nil) active(repItems(cons(X, Y))) >? mark(cons(X, cons(X, repItems(Y)))) mark(pairNs) >? active(pairNs) mark(cons(X, Y)) >? active(cons(mark(X), Y)) mark(0) >? active(0) mark(incr(X)) >? active(incr(mark(X))) mark(oddNs) >? active(oddNs) mark(s(X)) >? active(s(mark(X))) mark(take(X, Y)) >? active(take(mark(X), mark(Y))) mark(nil) >? active(nil) mark(zip(X, Y)) >? active(zip(mark(X), mark(Y))) mark(pair(X, Y)) >? active(pair(mark(X), mark(Y))) mark(tail(X)) >? active(tail(mark(X)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472