details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	33.8523128033 seconds
cpu usage	91.628131013
max memory	5.953093632E9

stage attributes

key	value
output-size	33087
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 1 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) QDP (5) TransformationProof [EQUIVALENT, 0 ms] (6) QDP (7) TransformationProof [EQUIVALENT, 0 ms] (8) QDP (9) TransformationProof [EQUIVALENT, 0 ms] (10) QDP (11) NonTerminationLoopProof [COMPLETE, 9840 ms] (12) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> x1 o(x1) -> x1 l(x1) -> x1 S(x1) -> x1 +(x1, x2) -> x2 +(x1, x2) -> x1 P(x1, x2, x3) -> x3 P(x1, x2, x3) -> x2 P(x1, x2, x3) -> x1 M(x1, x2, x3) -> x3 M(x1, x2, x3) -> x2 M(x1, x2, x3) -> x1 J1(x1, x2) -> x2 J1(x1, x2) -> x1 J2(x1, x2, x3) -> x3 J2(x1, x2, x3) -> x2 J2(x1, x2, x3) -> x1 Q11(x1, x2) -> x2 Q11(x1, x2) -> x1 Q21(x1, x2, x3) -> x3 Q21(x1, x2, x3) -> x2 Q21(x1, x2, x3) -> x1 Q22(x1, x2, x3) -> x3 Q22(x1, x2, x3) -> x2 Q22(x1, x2, x3) -> x1 R1(x1, x2, x3) -> x3 R1(x1, x2, x3) -> x2 R1(x1, x2, x3) -> x1 R2(x1, x2, x3, x4) -> x4 R2(x1, x2, x3, x4) -> x3 R2(x1, x2, x3, x4) -> x2 R2(x1, x2, x3, x4) -> x1 P(0, 0, 0) -> S(0) +(x, S(y)) -> S(+(x, y)) a(l(x)) -> l(a(a(x))) l(o(x)) -> o(l(l(x))) o(x) -> l(x) l(x) -> a(x) a(S(x)) -> S(l(x)) a(+(x, y)) -> +(l(x), y) a(+(x, y)) -> +(x, l(y)) a(P(x1, x2, x3)) -> P(x1, x2, l(x3)) a(P(x1, x2, x3)) -> P(x1, l(x2), x3) a(P(x1, x2, x3)) -> P(l(x1), x2, x3) +(x, o(y)) -> o(+(x, y)) P(x1, x2, o(x3)) -> o(P(x1, x2, x3)) P(x1, o(x2), x3) -> o(P(x1, x2, x3)) P(o(x1), x2, x3) -> o(P(x1, x2, x3)) M(x1, x2, l(y)) -> +(M(x1, x2, y), P(x1, x2, y)) J2(x1, l(x2), y) -> P(x1, J2(x1, x2, y), 0) J1(l(x1), y) -> P(J1(x1, y), 0, 0) a(S(x)) -> o(x) P(0, 0, S(y)) -> o(M(0, 0, y)) P(0, 0, P(x1, x2, y)) -> o(M(x1, x2, y)) P(x1, S(x2), y) -> o(J2(x1, x2, y)) P(S(x1), 0, y) -> o(J1(x1, y)) P(x1, S(x2), S(y)) -> o(J2(x1, x2, P(x1, S(x2), y))) P(S(x1), 0, S(y)) -> o(J1(x1, P(S(x1), 0, y))) a(P(x1, x2, 0)) -> Q22(x1, a(x2), x2) a(P(x1, x2, 0)) -> Q21(x1, a(x2), x1) a(P(x1, 0, 0)) -> Q11(a(x1), x1) Q22(x1, o(x2), y) -> o(P(x1, x2, y)) Q21(x1, o(x2), y) -> o(P(x1, x2, y)) Q11(o(x1), y) -> o(P(x1, 0, y)) a(P(x1, x2, S(y))) -> R2(x1, a(x2), x2, y) popout

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

job log

popout

actions

all output return to TRS Stand 20472