details

property	value
status	complete
benchmark	size-12-alpha-3-num-45.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n107.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.62324 seconds
cpu usage	33.9487
user time	32.4499
system time	1.49879
max virtual memory	1.25532292E8
max residence set size	4216612.0

stage attributes

key	value
starexec-result	YES

output

33.80/9.57 YES 33.80/9.58 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 33.80/9.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 33.80/9.58 33.80/9.58 33.80/9.58 Termination w.r.t. Q of the given QTRS could be proven: 33.80/9.58 33.80/9.58 (0) QTRS 33.80/9.58 (1) QTRS Reverse [EQUIVALENT, 0 ms] 33.80/9.58 (2) QTRS 33.80/9.58 (3) FlatCCProof [EQUIVALENT, 0 ms] 33.80/9.58 (4) QTRS 33.80/9.58 (5) RootLabelingProof [EQUIVALENT, 1 ms] 33.80/9.58 (6) QTRS 33.80/9.58 (7) QTRSRRRProof [EQUIVALENT, 60 ms] 33.80/9.58 (8) QTRS 33.80/9.58 (9) DependencyPairsProof [EQUIVALENT, 0 ms] 33.80/9.58 (10) QDP 33.80/9.58 (11) DependencyGraphProof [EQUIVALENT, 0 ms] 33.80/9.58 (12) QDP 33.80/9.58 (13) QDPOrderProof [EQUIVALENT, 223 ms] 33.80/9.58 (14) QDP 33.80/9.58 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 33.80/9.58 (16) AND 33.80/9.58 (17) QDP 33.80/9.58 (18) UsableRulesProof [EQUIVALENT, 0 ms] 33.80/9.58 (19) QDP 33.80/9.58 (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.80/9.58 (21) YES 33.80/9.58 (22) QDP 33.80/9.58 (23) UsableRulesProof [EQUIVALENT, 0 ms] 33.80/9.58 (24) QDP 33.80/9.58 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 33.80/9.58 (26) YES 33.80/9.58 33.80/9.58 33.80/9.58 ---------------------------------------- 33.80/9.58 33.80/9.58 (0) 33.80/9.58 Obligation: 33.80/9.58 Q restricted rewrite system: 33.80/9.58 The TRS R consists of the following rules: 33.80/9.58 33.80/9.58 a(x1) -> x1 33.80/9.58 a(x1) -> b(c(x1)) 33.80/9.58 b(b(x1)) -> a(a(x1)) 33.80/9.58 c(c(c(x1))) -> b(x1) 33.80/9.58 33.80/9.58 Q is empty. 33.80/9.58 33.80/9.58 ---------------------------------------- 33.80/9.58 33.80/9.58 (1) QTRS Reverse (EQUIVALENT) 33.80/9.58 We applied the QTRS Reverse Processor [REVERSE]. 33.80/9.58 ---------------------------------------- 33.80/9.58 33.80/9.58 (2) 33.80/9.58 Obligation: 33.80/9.58 Q restricted rewrite system: 33.80/9.58 The TRS R consists of the following rules: 33.80/9.58 33.80/9.58 a(x1) -> x1 33.80/9.58 a(x1) -> c(b(x1)) 33.80/9.58 b(b(x1)) -> a(a(x1)) 33.80/9.58 c(c(c(x1))) -> b(x1) 33.80/9.58 33.80/9.58 Q is empty. 33.80/9.58 33.80/9.58 ---------------------------------------- 33.80/9.58 33.80/9.58 (3) FlatCCProof (EQUIVALENT) 33.80/9.58 We used flat context closure [ROOTLAB] 33.80/9.58 As Q is empty the flat context closure was sound AND complete. 33.80/9.58 33.80/9.58 ---------------------------------------- 33.80/9.58 33.80/9.58 (4) 33.80/9.58 Obligation: 33.80/9.58 Q restricted rewrite system: 33.80/9.58 The TRS R consists of the following rules: 33.80/9.58 33.80/9.58 a(a(x1)) -> a(x1) 33.80/9.58 c(a(x1)) -> c(x1) 33.80/9.58 b(a(x1)) -> b(x1) 33.80/9.58 a(a(x1)) -> a(c(b(x1))) 33.80/9.58 c(a(x1)) -> c(c(b(x1))) 33.80/9.58 b(a(x1)) -> b(c(b(x1))) 33.80/9.58 a(b(b(x1))) -> a(a(a(x1))) 33.80/9.58 c(b(b(x1))) -> c(a(a(x1))) 33.80/9.58 b(b(b(x1))) -> b(a(a(x1))) 33.80/9.58 a(c(c(c(x1)))) -> a(b(x1)) 33.80/9.58 c(c(c(c(x1)))) -> c(b(x1)) 33.80/9.58 b(c(c(c(x1)))) -> b(b(x1)) 33.80/9.58 33.80/9.58 Q is empty. 33.80/9.58 33.80/9.58 ---------------------------------------- 33.80/9.58 33.80/9.58 (5) RootLabelingProof (EQUIVALENT) 33.80/9.58 We used plain root labeling [ROOTLAB] with the following heuristic: 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