details

property	value
status	complete
benchmark	jambox5.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	Secret_05_SRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.5813 seconds
cpu usage	65.0451
user time	62.6868
system time	2.35829
max virtual memory	8.0759384E7
max residence set size	4820784.0

stage attributes

key	value
starexec-result	YES

output

64.58/17.37 YES 64.93/17.44 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 64.93/17.44 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 64.93/17.44 64.93/17.44 64.93/17.44 Termination w.r.t. Q of the given QTRS could be proven: 64.93/17.44 64.93/17.44 (0) QTRS 64.93/17.44 (1) QTRS Reverse [EQUIVALENT, 0 ms] 64.93/17.44 (2) QTRS 64.93/17.44 (3) DependencyPairsProof [EQUIVALENT, 31 ms] 64.93/17.44 (4) QDP 64.93/17.44 (5) DependencyGraphProof [EQUIVALENT, 2 ms] 64.93/17.44 (6) AND 64.93/17.44 (7) QDP 64.93/17.44 (8) UsableRulesProof [EQUIVALENT, 3 ms] 64.93/17.44 (9) QDP 64.93/17.44 (10) MRRProof [EQUIVALENT, 34 ms] 64.93/17.44 (11) QDP 64.93/17.44 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 64.93/17.44 (13) TRUE 64.93/17.44 (14) QDP 64.93/17.44 (15) QDPOrderProof [EQUIVALENT, 236 ms] 64.93/17.44 (16) QDP 64.93/17.44 (17) QDPOrderProof [EQUIVALENT, 790 ms] 64.93/17.44 (18) QDP 64.93/17.44 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 64.93/17.44 (20) QDP 64.93/17.44 (21) UsableRulesProof [EQUIVALENT, 0 ms] 64.93/17.44 (22) QDP 64.93/17.44 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 64.93/17.44 (24) YES 64.93/17.44 64.93/17.44 64.93/17.44 ---------------------------------------- 64.93/17.44 64.93/17.44 (0) 64.93/17.44 Obligation: 64.93/17.44 Q restricted rewrite system: 64.93/17.44 The TRS R consists of the following rules: 64.93/17.44 64.93/17.44 b(a(x1)) -> a(a(d(x1))) 64.93/17.44 a(c(x1)) -> b(b(x1)) 64.93/17.44 d(a(b(x1))) -> b(d(d(c(x1)))) 64.93/17.44 d(x1) -> a(x1) 64.93/17.44 b(a(c(a(x1)))) -> x1 64.93/17.44 64.93/17.44 Q is empty. 64.93/17.44 64.93/17.44 ---------------------------------------- 64.93/17.44 64.93/17.44 (1) QTRS Reverse (EQUIVALENT) 64.93/17.44 We applied the QTRS Reverse Processor [REVERSE]. 64.93/17.44 ---------------------------------------- 64.93/17.44 64.93/17.44 (2) 64.93/17.44 Obligation: 64.93/17.44 Q restricted rewrite system: 64.93/17.44 The TRS R consists of the following rules: 64.93/17.44 64.93/17.44 a(b(x1)) -> d(a(a(x1))) 64.93/17.44 c(a(x1)) -> b(b(x1)) 64.93/17.44 b(a(d(x1))) -> c(d(d(b(x1)))) 64.93/17.44 d(x1) -> a(x1) 64.93/17.44 a(c(a(b(x1)))) -> x1 64.93/17.44 64.93/17.44 Q is empty. 64.93/17.44 64.93/17.44 ---------------------------------------- 64.93/17.44 64.93/17.44 (3) DependencyPairsProof (EQUIVALENT) 64.93/17.44 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 64.93/17.44 ---------------------------------------- 64.93/17.44 64.93/17.44 (4) 64.93/17.44 Obligation: 64.93/17.44 Q DP problem: 64.93/17.44 The TRS P consists of the following rules: 64.93/17.44 64.93/17.44 A(b(x1)) -> D(a(a(x1))) 64.93/17.44 A(b(x1)) -> A(a(x1)) 64.93/17.44 A(b(x1)) -> A(x1) 64.93/17.44 C(a(x1)) -> B(b(x1)) 64.93/17.44 C(a(x1)) -> B(x1) 64.93/17.44 B(a(d(x1))) -> C(d(d(b(x1)))) 64.93/17.44 B(a(d(x1))) -> D(d(b(x1))) 64.93/17.44 B(a(d(x1))) -> D(b(x1)) 64.93/17.44 B(a(d(x1))) -> B(x1) 64.93/17.44 D(x1) -> A(x1) 64.93/17.44 64.93/17.44 The TRS R consists of the following rules: 64.93/17.44 64.93/17.44 a(b(x1)) -> d(a(a(x1))) 64.93/17.44 c(a(x1)) -> b(b(x1)) 64.93/17.44 b(a(d(x1))) -> c(d(d(b(x1)))) 64.93/17.44 d(x1) -> a(x1) 64.93/17.44 a(c(a(b(x1)))) -> x1 64.93/17.44 64.93/17.44 Q is empty. 64.93/17.44 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 SRS_Standard 2019-03-29 03.29