details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.54593 seconds
cpu usage	26.0384
user time	24.8502
system time	1.18823
max virtual memory	4.1914484E7
max residence set size	3450168.0

stage attributes

key	value
starexec-result	YES

output

25.46/7.37 YES 25.74/7.44 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 25.74/7.44 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 25.74/7.44 25.74/7.44 25.74/7.44 Termination w.r.t. Q of the given QTRS could be proven: 25.74/7.44 25.74/7.44 (0) QTRS 25.74/7.44 (1) DependencyPairsProof [EQUIVALENT, 11 ms] 25.74/7.44 (2) QDP 25.74/7.44 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 25.74/7.44 (4) AND 25.74/7.44 (5) QDP 25.74/7.44 (6) UsableRulesProof [EQUIVALENT, 11 ms] 25.74/7.44 (7) QDP 25.74/7.44 (8) MRRProof [EQUIVALENT, 51 ms] 25.74/7.44 (9) QDP 25.74/7.44 (10) DependencyGraphProof [EQUIVALENT, 0 ms] 25.74/7.44 (11) QDP 25.74/7.44 (12) QDPOrderProof [EQUIVALENT, 1 ms] 25.74/7.44 (13) QDP 25.74/7.44 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 25.74/7.44 (15) TRUE 25.74/7.44 (16) QDP 25.74/7.44 (17) UsableRulesProof [EQUIVALENT, 1 ms] 25.74/7.44 (18) QDP 25.74/7.44 (19) QDPOrderProof [EQUIVALENT, 64 ms] 25.74/7.44 (20) QDP 25.74/7.44 (21) PisEmptyProof [EQUIVALENT, 0 ms] 25.74/7.44 (22) YES 25.74/7.44 25.74/7.44 25.74/7.44 ---------------------------------------- 25.74/7.44 25.74/7.44 (0) 25.74/7.44 Obligation: 25.74/7.44 Q restricted rewrite system: 25.74/7.44 The TRS R consists of the following rules: 25.74/7.44 25.74/7.44 b(a(a(x1))) -> a(b(c(x1))) 25.74/7.44 c(a(x1)) -> a(c(x1)) 25.74/7.44 b(c(a(x1))) -> a(b(c(x1))) 25.74/7.44 c(b(x1)) -> d(x1) 25.74/7.44 a(d(x1)) -> d(a(x1)) 25.74/7.44 d(x1) -> b(a(x1)) 25.74/7.44 L(a(a(x1))) -> L(a(b(c(x1)))) 25.74/7.44 c(R(x1)) -> c(b(R(x1))) 25.74/7.44 25.74/7.44 Q is empty. 25.74/7.44 25.74/7.44 ---------------------------------------- 25.74/7.44 25.74/7.44 (1) DependencyPairsProof (EQUIVALENT) 25.74/7.44 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 25.74/7.44 ---------------------------------------- 25.74/7.44 25.74/7.44 (2) 25.74/7.44 Obligation: 25.74/7.44 Q DP problem: 25.74/7.44 The TRS P consists of the following rules: 25.74/7.44 25.74/7.44 B(a(a(x1))) -> A(b(c(x1))) 25.74/7.44 B(a(a(x1))) -> B(c(x1)) 25.74/7.44 B(a(a(x1))) -> C(x1) 25.74/7.44 C(a(x1)) -> A(c(x1)) 25.74/7.44 C(a(x1)) -> C(x1) 25.74/7.44 B(c(a(x1))) -> A(b(c(x1))) 25.74/7.44 B(c(a(x1))) -> B(c(x1)) 25.74/7.44 B(c(a(x1))) -> C(x1) 25.74/7.44 C(b(x1)) -> D(x1) 25.74/7.44 A(d(x1)) -> D(a(x1)) 25.74/7.44 A(d(x1)) -> A(x1) 25.74/7.44 D(x1) -> B(a(x1)) 25.74/7.44 D(x1) -> A(x1) 25.74/7.44 L^1(a(a(x1))) -> L^1(a(b(c(x1)))) 25.74/7.44 L^1(a(a(x1))) -> A(b(c(x1))) 25.74/7.44 L^1(a(a(x1))) -> B(c(x1)) 25.74/7.44 L^1(a(a(x1))) -> C(x1) 25.74/7.44 C(R(x1)) -> C(b(R(x1))) 25.74/7.44 C(R(x1)) -> B(R(x1)) 25.74/7.44 25.74/7.44 The TRS R consists of the following rules: 25.74/7.44 25.74/7.44 b(a(a(x1))) -> a(b(c(x1))) 25.74/7.45 c(a(x1)) -> a(c(x1)) 25.74/7.45 b(c(a(x1))) -> a(b(c(x1))) 25.74/7.45 c(b(x1)) -> d(x1) 25.74/7.45 a(d(x1)) -> d(a(x1)) 25.74/7.45 d(x1) -> b(a(x1)) 25.74/7.45 L(a(a(x1))) -> L(a(b(c(x1)))) 25.74/7.45 c(R(x1)) -> c(b(R(x1))) 25.74/7.45 25.74/7.45 Q is empty. 25.74/7.45 We have to consider all minimal (P,Q,R)-chains. 25.74/7.45 ---------------------------------------- 25.74/7.45 25.74/7.45 (3) DependencyGraphProof (EQUIVALENT) 25.74/7.45 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 4 less nodes. 25.74/7.45 ---------------------------------------- 25.74/7.45 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