details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	23.3733 seconds
cpu usage	88.6474
user time	85.7036
system time	2.94385
max virtual memory	6.246568E7
max residence set size	5262984.0

stage attributes

key	value
starexec-result	YES

output

87.94/23.16 YES 88.34/23.22 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 88.34/23.22 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 88.34/23.22 88.34/23.22 88.34/23.22 Termination w.r.t. Q of the given QTRS could be proven: 88.34/23.22 88.34/23.22 (0) QTRS 88.34/23.22 (1) QTRS Reverse [EQUIVALENT, 0 ms] 88.34/23.22 (2) QTRS 88.34/23.22 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 88.34/23.22 (4) QDP 88.34/23.22 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 88.34/23.22 (6) QDP 88.34/23.22 (7) QDPOrderProof [EQUIVALENT, 2020 ms] 88.34/23.22 (8) QDP 88.34/23.22 (9) QDPOrderProof [EQUIVALENT, 873 ms] 88.34/23.22 (10) QDP 88.34/23.22 (11) UsableRulesProof [EQUIVALENT, 0 ms] 88.34/23.22 (12) QDP 88.34/23.22 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 88.34/23.22 (14) YES 88.34/23.22 88.34/23.22 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (0) 88.34/23.22 Obligation: 88.34/23.22 Q restricted rewrite system: 88.34/23.22 The TRS R consists of the following rules: 88.34/23.22 88.34/23.22 a(a(c(x1))) -> b(c(b(a(x1)))) 88.34/23.22 b(x1) -> d(a(x1)) 88.34/23.22 b(a(c(d(x1)))) -> a(a(a(x1))) 88.34/23.22 c(x1) -> x1 88.34/23.22 b(x1) -> c(d(x1)) 88.34/23.22 88.34/23.22 Q is empty. 88.34/23.22 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (1) QTRS Reverse (EQUIVALENT) 88.34/23.22 We applied the QTRS Reverse Processor [REVERSE]. 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (2) 88.34/23.22 Obligation: 88.34/23.22 Q restricted rewrite system: 88.34/23.22 The TRS R consists of the following rules: 88.34/23.22 88.34/23.22 c(a(a(x1))) -> a(b(c(b(x1)))) 88.34/23.22 b(x1) -> a(d(x1)) 88.34/23.22 d(c(a(b(x1)))) -> a(a(a(x1))) 88.34/23.22 c(x1) -> x1 88.34/23.22 b(x1) -> d(c(x1)) 88.34/23.22 88.34/23.22 Q is empty. 88.34/23.22 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (3) DependencyPairsProof (EQUIVALENT) 88.34/23.22 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (4) 88.34/23.22 Obligation: 88.34/23.22 Q DP problem: 88.34/23.22 The TRS P consists of the following rules: 88.34/23.22 88.34/23.22 C(a(a(x1))) -> B(c(b(x1))) 88.34/23.22 C(a(a(x1))) -> C(b(x1)) 88.34/23.22 C(a(a(x1))) -> B(x1) 88.34/23.22 B(x1) -> D(x1) 88.34/23.22 B(x1) -> D(c(x1)) 88.34/23.22 B(x1) -> C(x1) 88.34/23.22 88.34/23.22 The TRS R consists of the following rules: 88.34/23.22 88.34/23.22 c(a(a(x1))) -> a(b(c(b(x1)))) 88.34/23.22 b(x1) -> a(d(x1)) 88.34/23.22 d(c(a(b(x1)))) -> a(a(a(x1))) 88.34/23.22 c(x1) -> x1 88.34/23.22 b(x1) -> d(c(x1)) 88.34/23.22 88.34/23.22 Q is empty. 88.34/23.22 We have to consider all minimal (P,Q,R)-chains. 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (5) DependencyGraphProof (EQUIVALENT) 88.34/23.22 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. 88.34/23.22 ---------------------------------------- 88.34/23.22 88.34/23.22 (6) 88.34/23.22 Obligation: 88.34/23.22 Q DP problem: 88.34/23.22 The TRS P consists of the following rules: 88.34/23.22 88.34/23.22 B(x1) -> C(x1) 88.34/23.22 C(a(a(x1))) -> B(c(b(x1))) 88.34/23.22 C(a(a(x1))) -> C(b(x1)) 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