details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.97176 seconds
cpu usage	19.3328
user time	18.5682
system time	0.764643
max virtual memory	2.090776E7
max residence set size	2025744.0

stage attributes

key	value
starexec-result	YES

output

19.04/5.88 YES 19.04/5.89 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 19.04/5.89 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 19.04/5.89 19.04/5.89 19.04/5.89 Termination w.r.t. Q of the given QTRS could be proven: 19.04/5.89 19.04/5.89 (0) QTRS 19.04/5.89 (1) QTRS Reverse [EQUIVALENT, 0 ms] 19.04/5.89 (2) QTRS 19.04/5.89 (3) FlatCCProof [EQUIVALENT, 0 ms] 19.04/5.89 (4) QTRS 19.04/5.89 (5) RootLabelingProof [EQUIVALENT, 0 ms] 19.04/5.89 (6) QTRS 19.04/5.89 (7) QTRSRRRProof [EQUIVALENT, 55 ms] 19.04/5.89 (8) QTRS 19.04/5.89 (9) DependencyPairsProof [EQUIVALENT, 38 ms] 19.04/5.89 (10) QDP 19.04/5.89 (11) QDPOrderProof [EQUIVALENT, 118 ms] 19.04/5.89 (12) QDP 19.04/5.89 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 19.04/5.89 (14) TRUE 19.04/5.89 19.04/5.89 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (0) 19.04/5.89 Obligation: 19.04/5.89 Q restricted rewrite system: 19.04/5.89 The TRS R consists of the following rules: 19.04/5.89 19.04/5.89 a(x1) -> x1 19.04/5.89 a(a(x1)) -> b(b(c(x1))) 19.04/5.89 c(x1) -> x1 19.04/5.89 c(b(x1)) -> b(c(a(x1))) 19.04/5.89 19.04/5.89 Q is empty. 19.04/5.89 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (1) QTRS Reverse (EQUIVALENT) 19.04/5.89 We applied the QTRS Reverse Processor [REVERSE]. 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (2) 19.04/5.89 Obligation: 19.04/5.89 Q restricted rewrite system: 19.04/5.89 The TRS R consists of the following rules: 19.04/5.89 19.04/5.89 a(x1) -> x1 19.04/5.89 a(a(x1)) -> c(b(b(x1))) 19.04/5.89 c(x1) -> x1 19.04/5.89 b(c(x1)) -> a(c(b(x1))) 19.04/5.89 19.04/5.89 Q is empty. 19.04/5.89 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (3) FlatCCProof (EQUIVALENT) 19.04/5.89 We used flat context closure [ROOTLAB] 19.04/5.89 As Q is empty the flat context closure was sound AND complete. 19.04/5.89 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (4) 19.04/5.89 Obligation: 19.04/5.89 Q restricted rewrite system: 19.04/5.89 The TRS R consists of the following rules: 19.04/5.89 19.04/5.89 a(a(x1)) -> a(x1) 19.04/5.89 c(a(x1)) -> c(x1) 19.04/5.89 b(a(x1)) -> b(x1) 19.04/5.89 a(a(a(x1))) -> a(c(b(b(x1)))) 19.04/5.89 c(a(a(x1))) -> c(c(b(b(x1)))) 19.04/5.89 b(a(a(x1))) -> b(c(b(b(x1)))) 19.04/5.89 a(c(x1)) -> a(x1) 19.04/5.89 c(c(x1)) -> c(x1) 19.04/5.89 b(c(x1)) -> b(x1) 19.04/5.89 a(b(c(x1))) -> a(a(c(b(x1)))) 19.04/5.89 c(b(c(x1))) -> c(a(c(b(x1)))) 19.04/5.89 b(b(c(x1))) -> b(a(c(b(x1)))) 19.04/5.89 19.04/5.89 Q is empty. 19.04/5.89 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (5) RootLabelingProof (EQUIVALENT) 19.04/5.89 We used plain root labeling [ROOTLAB] with the following heuristic: 19.04/5.89 LabelAll: All function symbols get labeled 19.04/5.89 19.04/5.89 As Q is empty the root labeling was sound AND complete. 19.04/5.89 19.04/5.89 ---------------------------------------- 19.04/5.89 19.04/5.89 (6) 19.04/5.89 Obligation: 19.04/5.89 Q restricted rewrite system: 19.04/5.89 The TRS R consists of the following rules: 19.04/5.89 19.04/5.89 a_{a_1}(a_{a_1}(x1)) -> a_{a_1}(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