details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.3207 seconds
cpu usage	40.3483
user time	38.7497
system time	1.59868
max virtual memory	1.24220632E8
max residence set size	3968228.0

stage attributes

key	value
starexec-result	YES

output

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