details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.9275970459 seconds
cpu usage	4.622886976
max memory	2.23121408E8

stage attributes

key	value
output-size	4938
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 110 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 1 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(2nd(cons1(X, cons(Y, Z)))) -> mark(Y) active(2nd(cons(X, X1))) -> mark(2nd(cons1(X, X1))) active(from(X)) -> mark(cons(X, from(s(X)))) active(2nd(X)) -> 2nd(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(from(X)) -> from(active(X)) active(s(X)) -> s(active(X)) active(cons1(X1, X2)) -> cons1(active(X1), X2) active(cons1(X1, X2)) -> cons1(X1, active(X2)) 2nd(mark(X)) -> mark(2nd(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) from(mark(X)) -> mark(from(X)) s(mark(X)) -> mark(s(X)) cons1(mark(X1), X2) -> mark(cons1(X1, X2)) cons1(X1, mark(X2)) -> mark(cons1(X1, X2)) proper(2nd(X)) -> 2nd(proper(X)) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(from(X)) -> from(proper(X)) proper(s(X)) -> s(proper(X)) proper(cons1(X1, X2)) -> cons1(proper(X1), proper(X2)) 2nd(ok(X)) -> ok(2nd(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) from(ok(X)) -> ok(from(X)) s(ok(X)) -> ok(s(X)) cons1(ok(X1), ok(X2)) -> ok(cons1(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(2nd(x_1)) = 1 + 2*x_1 POL(active(x_1)) = 1 + 2*x_1 POL(cons(x_1, x_2)) = 1 + x_1 + x_2 POL(cons1(x_1, x_2)) = 1 + 2*x_1 + 2*x_2 POL(from(x_1)) = 2 + 2*x_1 POL(mark(x_1)) = 1 + x_1 POL(ok(x_1)) = 2 + 2*x_1 POL(proper(x_1)) = x_1 POL(s(x_1)) = x_1 POL(top(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: active(2nd(cons1(X, cons(Y, Z)))) -> mark(Y) active(2nd(cons(X, X1))) -> mark(2nd(cons1(X, X1))) active(from(X)) -> mark(cons(X, from(s(X)))) active(cons(X1, X2)) -> cons(active(X1), X2) active(from(X)) -> from(active(X)) 2nd(mark(X)) -> mark(2nd(X)) from(mark(X)) -> mark(from(X)) cons1(mark(X1), X2) -> mark(cons1(X1, X2)) cons1(X1, mark(X2)) -> mark(cons1(X1, X2)) 2nd(ok(X)) -> ok(2nd(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) cons1(ok(X1), ok(X2)) -> ok(cons1(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: popout

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

job log

popout

actions

all output return to TRS Stand 20472