details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.14426 seconds
cpu usage	4.64629
user time	4.42177
system time	0.224524
max virtual memory	1.84775E7
max residence set size	321216.0

stage attributes

key	value
starexec-result	NO

output

4.58/2.10 NO 4.58/2.11 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 4.58/2.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.58/2.11 4.58/2.11 4.58/2.11 Termination w.r.t. Q of the given QTRS could be disproven: 4.58/2.11 4.58/2.11 (0) QTRS 4.58/2.11 (1) DependencyPairsProof [EQUIVALENT, 0 ms] 4.58/2.11 (2) QDP 4.58/2.11 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 4.58/2.11 (4) QDP 4.58/2.11 (5) UsableRulesProof [EQUIVALENT, 0 ms] 4.58/2.11 (6) QDP 4.58/2.11 (7) TransformationProof [EQUIVALENT, 0 ms] 4.58/2.11 (8) QDP 4.58/2.11 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 4.58/2.11 (10) QDP 4.58/2.11 (11) UsableRulesProof [EQUIVALENT, 0 ms] 4.58/2.11 (12) QDP 4.58/2.11 (13) QReductionProof [EQUIVALENT, 0 ms] 4.58/2.11 (14) QDP 4.58/2.11 (15) NonTerminationLoopProof [COMPLETE, 0 ms] 4.58/2.11 (16) NO 4.58/2.11 4.58/2.11 4.58/2.11 ---------------------------------------- 4.58/2.11 4.58/2.11 (0) 4.58/2.11 Obligation: 4.58/2.11 Q restricted rewrite system: 4.58/2.11 The TRS R consists of the following rules: 4.58/2.11 4.58/2.11 *(X, +(Y, 1)) -> +(*(X, +(Y, *(1, 0))), X) 4.58/2.11 *(X, 1) -> X 4.58/2.11 *(X, 0) -> X 4.58/2.11 *(X, 0) -> 0 4.58/2.11 4.58/2.11 The set Q consists of the following terms: 4.58/2.11 4.58/2.11 *(x0, +(x1, 1)) 4.58/2.11 *(x0, 1) 4.58/2.11 *(x0, 0) 4.58/2.11 4.58/2.11 4.58/2.11 ---------------------------------------- 4.58/2.11 4.58/2.11 (1) DependencyPairsProof (EQUIVALENT) 4.58/2.11 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 4.58/2.11 ---------------------------------------- 4.58/2.11 4.58/2.11 (2) 4.58/2.11 Obligation: 4.58/2.11 Q DP problem: 4.58/2.11 The TRS P consists of the following rules: 4.58/2.11 4.58/2.11 *^1(X, +(Y, 1)) -> *^1(X, +(Y, *(1, 0))) 4.58/2.11 *^1(X, +(Y, 1)) -> *^1(1, 0) 4.58/2.11 4.58/2.11 The TRS R consists of the following rules: 4.58/2.11 4.58/2.11 *(X, +(Y, 1)) -> +(*(X, +(Y, *(1, 0))), X) 4.58/2.11 *(X, 1) -> X 4.58/2.11 *(X, 0) -> X 4.58/2.11 *(X, 0) -> 0 4.58/2.11 4.58/2.11 The set Q consists of the following terms: 4.58/2.11 4.58/2.11 *(x0, +(x1, 1)) 4.58/2.11 *(x0, 1) 4.58/2.11 *(x0, 0) 4.58/2.11 4.58/2.11 We have to consider all minimal (P,Q,R)-chains. 4.58/2.11 ---------------------------------------- 4.58/2.11 4.58/2.11 (3) DependencyGraphProof (EQUIVALENT) 4.58/2.11 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node. 4.58/2.11 ---------------------------------------- 4.58/2.11 4.58/2.11 (4) 4.58/2.11 Obligation: 4.58/2.11 Q DP problem: 4.58/2.11 The TRS P consists of the following rules: 4.58/2.11 4.58/2.11 *^1(X, +(Y, 1)) -> *^1(X, +(Y, *(1, 0))) 4.58/2.11 4.58/2.11 The TRS R consists of the following rules: 4.58/2.11 4.58/2.11 *(X, +(Y, 1)) -> +(*(X, +(Y, *(1, 0))), X) 4.58/2.11 *(X, 1) -> X 4.58/2.11 *(X, 0) -> X 4.58/2.11 *(X, 0) -> 0 4.58/2.11 4.58/2.11 The set Q consists of the following terms: 4.58/2.11 4.58/2.11 *(x0, +(x1, 1)) 4.58/2.11 *(x0, 1) 4.58/2.11 *(x0, 0) 4.58/2.11 4.58/2.11 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_Innermost 2019-03-28 22.12