details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.82392 seconds
cpu usage	30.6315
user time	29.1671
system time	1.4644
max virtual memory	6.2570752E7
max residence set size	4037048.0

stage attributes

key	value
starexec-result	YES

output

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