details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.08074 seconds
cpu usage	8.49912
user time	8.09149
system time	0.407638
max virtual memory	2.0142628E7
max residence set size	1226036.0

stage attributes

key	value
starexec-result	YES

output

8.22/2.97 YES 8.22/2.99 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 8.22/2.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.22/2.99 8.22/2.99 8.22/2.99 Termination w.r.t. Q of the given QTRS could be proven: 8.22/2.99 8.22/2.99 (0) QTRS 8.22/2.99 (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] 8.22/2.99 (2) QTRS 8.22/2.99 (3) DependencyPairsProof [EQUIVALENT, 8 ms] 8.22/2.99 (4) QDP 8.22/2.99 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 8.22/2.99 (6) AND 8.22/2.99 (7) QDP 8.22/2.99 (8) UsableRulesProof [EQUIVALENT, 0 ms] 8.22/2.99 (9) QDP 8.22/2.99 (10) QReductionProof [EQUIVALENT, 0 ms] 8.22/2.99 (11) QDP 8.22/2.99 (12) QDPOrderProof [EQUIVALENT, 6 ms] 8.22/2.99 (13) QDP 8.22/2.99 (14) PisEmptyProof [EQUIVALENT, 0 ms] 8.22/2.99 (15) YES 8.22/2.99 (16) QDP 8.22/2.99 (17) UsableRulesProof [EQUIVALENT, 0 ms] 8.22/2.99 (18) QDP 8.22/2.99 (19) QReductionProof [EQUIVALENT, 0 ms] 8.22/2.99 (20) QDP 8.22/2.99 (21) QDPOrderProof [EQUIVALENT, 0 ms] 8.22/2.99 (22) QDP 8.22/2.99 (23) PisEmptyProof [EQUIVALENT, 0 ms] 8.22/2.99 (24) YES 8.22/2.99 8.22/2.99 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (0) 8.22/2.99 Obligation: 8.22/2.99 Q restricted rewrite system: 8.22/2.99 The TRS R consists of the following rules: 8.22/2.99 8.22/2.99 a(b(x1)) -> b(b(a(x1))) 8.22/2.99 c(b(x1)) -> b(c(c(x1))) 8.22/2.99 8.22/2.99 Q is empty. 8.22/2.99 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (1) Overlay + Local Confluence (EQUIVALENT) 8.22/2.99 The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (2) 8.22/2.99 Obligation: 8.22/2.99 Q restricted rewrite system: 8.22/2.99 The TRS R consists of the following rules: 8.22/2.99 8.22/2.99 a(b(x1)) -> b(b(a(x1))) 8.22/2.99 c(b(x1)) -> b(c(c(x1))) 8.22/2.99 8.22/2.99 The set Q consists of the following terms: 8.22/2.99 8.22/2.99 a(b(x0)) 8.22/2.99 c(b(x0)) 8.22/2.99 8.22/2.99 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (3) DependencyPairsProof (EQUIVALENT) 8.22/2.99 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (4) 8.22/2.99 Obligation: 8.22/2.99 Q DP problem: 8.22/2.99 The TRS P consists of the following rules: 8.22/2.99 8.22/2.99 A(b(x1)) -> A(x1) 8.22/2.99 C(b(x1)) -> C(c(x1)) 8.22/2.99 C(b(x1)) -> C(x1) 8.22/2.99 8.22/2.99 The TRS R consists of the following rules: 8.22/2.99 8.22/2.99 a(b(x1)) -> b(b(a(x1))) 8.22/2.99 c(b(x1)) -> b(c(c(x1))) 8.22/2.99 8.22/2.99 The set Q consists of the following terms: 8.22/2.99 8.22/2.99 a(b(x0)) 8.22/2.99 c(b(x0)) 8.22/2.99 8.22/2.99 We have to consider all minimal (P,Q,R)-chains. 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (5) DependencyGraphProof (EQUIVALENT) 8.22/2.99 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs. 8.22/2.99 ---------------------------------------- 8.22/2.99 8.22/2.99 (6) 8.22/2.99 Complex Obligation (AND) popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29