details

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

run statistics

property	value
solver	Wanda
configuration	FirstOrder
runtime (wallclock)	0.72743678093 seconds
cpu usage	0.714189026
max memory	2.064384E7

stage attributes

key	value
output-size	30732
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 active : [o] --> o add : [o * o] --> o cons : [o * o] --> o from : [o] --> o fst : [o * o] --> o len : [o] --> o mark : [o] --> o nil : [] --> o ok : [o] --> o proper : [o] --> o s : [o] --> o top : [o] --> o active(fst(0, X)) => mark(nil) active(fst(s(X), cons(Y, Z))) => mark(cons(Y, fst(X, Z))) active(from(X)) => mark(cons(X, from(s(X)))) active(add(0, X)) => mark(X) active(add(s(X), Y)) => mark(s(add(X, Y))) active(len(nil)) => mark(0) active(len(cons(X, Y))) => mark(s(len(Y))) active(cons(X, Y)) => cons(active(X), Y) active(fst(X, Y)) => fst(active(X), Y) active(fst(X, Y)) => fst(X, active(Y)) active(from(X)) => from(active(X)) active(add(X, Y)) => add(active(X), Y) active(add(X, Y)) => add(X, active(Y)) active(len(X)) => len(active(X)) cons(mark(X), Y) => mark(cons(X, Y)) fst(mark(X), Y) => mark(fst(X, Y)) fst(X, mark(Y)) => mark(fst(X, Y)) from(mark(X)) => mark(from(X)) add(mark(X), Y) => mark(add(X, Y)) add(X, mark(Y)) => mark(add(X, Y)) len(mark(X)) => mark(len(X)) proper(0) => ok(0) proper(s(X)) => s(proper(X)) proper(nil) => ok(nil) proper(cons(X, Y)) => cons(proper(X), proper(Y)) proper(fst(X, Y)) => fst(proper(X), proper(Y)) proper(from(X)) => from(proper(X)) proper(add(X, Y)) => add(proper(X), proper(Y)) proper(len(X)) => len(proper(X)) s(ok(X)) => ok(s(X)) cons(ok(X), ok(Y)) => ok(cons(X, Y)) fst(ok(X), ok(Y)) => ok(fst(X, Y)) from(ok(X)) => ok(from(X)) add(ok(X), ok(Y)) => ok(add(X, Y)) len(ok(X)) => ok(len(X)) top(mark(X)) => top(proper(X)) top(ok(X)) => top(active(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] active#(fst(s(X), cons(Y, Z))) =#> cons#(Y, fst(X, Z)) 1] active#(fst(s(X), cons(Y, Z))) =#> fst#(X, Z) 2] active#(from(X)) =#> cons#(X, from(s(X))) 3] active#(from(X)) =#> from#(s(X)) 4] active#(from(X)) =#> s#(X) 5] active#(add(s(X), Y)) =#> s#(add(X, Y)) 6] active#(add(s(X), Y)) =#> add#(X, Y) 7] active#(len(cons(X, Y))) =#> s#(len(Y)) 8] active#(len(cons(X, Y))) =#> len#(Y) 9] active#(cons(X, Y)) =#> cons#(active(X), Y) 10] active#(cons(X, Y)) =#> active#(X) 11] active#(fst(X, Y)) =#> fst#(active(X), Y) 12] active#(fst(X, Y)) =#> active#(X) 13] active#(fst(X, Y)) =#> fst#(X, active(Y)) 14] active#(fst(X, Y)) =#> active#(Y) 15] active#(from(X)) =#> from#(active(X)) 16] active#(from(X)) =#> active#(X) 17] active#(add(X, Y)) =#> add#(active(X), Y) 18] active#(add(X, Y)) =#> active#(X) 19] active#(add(X, Y)) =#> add#(X, active(Y)) 20] active#(add(X, Y)) =#> active#(Y) 21] active#(len(X)) =#> len#(active(X)) 22] active#(len(X)) =#> active#(X) 23] cons#(mark(X), Y) =#> cons#(X, Y) 24] fst#(mark(X), Y) =#> fst#(X, Y) 25] fst#(X, mark(Y)) =#> fst#(X, Y) 26] from#(mark(X)) =#> from#(X) 27] add#(mark(X), Y) =#> add#(X, Y) 28] add#(X, mark(Y)) =#> add#(X, Y) 29] len#(mark(X)) =#> len#(X) 30] proper#(s(X)) =#> s#(proper(X)) popout

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

job log

popout

actions

all output return to TRS Stand 20472