details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.05245304108 seconds
cpu usage	11.332516942
max memory	2.367352832E9

stage attributes

key	value
output-size	5481
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, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) NonTerminationLoopProof [COMPLETE, 3502 ms] (12) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: +(X, 0) -> X +(X, s(Y)) -> s(+(X, Y)) double(X) -> +(X, X) f(0, s(0), X) -> f(X, double(X), X) g(X, Y) -> X g(X, Y) -> Y 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: +^1(X, s(Y)) -> +^1(X, Y) DOUBLE(X) -> +^1(X, X) F(0, s(0), X) -> F(X, double(X), X) F(0, s(0), X) -> DOUBLE(X) The TRS R consists of the following rules: +(X, 0) -> X +(X, s(Y)) -> s(+(X, Y)) double(X) -> +(X, X) f(0, s(0), X) -> f(X, double(X), X) g(X, Y) -> X g(X, Y) -> Y 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 2 SCCs with 2 less nodes. ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Q DP problem: The TRS P consists of the following rules: +^1(X, s(Y)) -> +^1(X, Y) The TRS R consists of the following rules: +(X, 0) -> X +(X, s(Y)) -> s(+(X, Y)) double(X) -> +(X, X) f(0, s(0), X) -> f(X, double(X), X) g(X, Y) -> X g(X, Y) -> Y Q is empty. We have to consider all minimal (P,Q,R)-chains. popout

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

job log

popout

actions

all output return to TRS Stand 20472