details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.58614 seconds
cpu usage	18.2493
user time	17.3185
system time	0.930825
max virtual memory	8.1826232E7
max residence set size	2735712.0

stage attributes

key	value
starexec-result	YES

output

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