details

property	value
status	complete
benchmark	Ex14_AEGL02_Z.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)	3.43497610092 seconds
cpu usage	8.998745997
max memory	5.30825216E8

stage attributes

key	value
output-size	11406
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 10 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) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) TransformationProof [EQUIVALENT, 0 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) NonTerminationLoopProof [COMPLETE, 2 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: from(X) -> cons(X, n__from(s(X))) length(n__nil) -> 0 length(n__cons(X, Y)) -> s(length1(activate(Y))) length1(X) -> length(activate(X)) from(X) -> n__from(X) nil -> n__nil cons(X1, X2) -> n__cons(X1, X2) activate(n__from(X)) -> from(X) activate(n__nil) -> nil activate(n__cons(X1, X2)) -> cons(X1, X2) activate(X) -> X Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: FROM(X) -> CONS(X, n__from(s(X))) LENGTH(n__cons(X, Y)) -> LENGTH1(activate(Y)) LENGTH(n__cons(X, Y)) -> ACTIVATE(Y) LENGTH1(X) -> LENGTH(activate(X)) LENGTH1(X) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(X) ACTIVATE(n__nil) -> NIL ACTIVATE(n__cons(X1, X2)) -> CONS(X1, X2) The TRS R consists of the following rules: from(X) -> cons(X, n__from(s(X))) length(n__nil) -> 0 length(n__cons(X, Y)) -> s(length1(activate(Y))) length1(X) -> length(activate(X)) from(X) -> n__from(X) nil -> n__nil cons(X1, X2) -> n__cons(X1, X2) activate(n__from(X)) -> from(X) activate(n__nil) -> nil activate(n__cons(X1, X2)) -> cons(X1, X2) activate(X) -> X Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 6 less nodes. ---------------------------------------- (4) Obligation: Q DP problem: popout

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

job log

popout

actions

all output return to TRS Stand 20472