details

property	value
status	complete
benchmark	uni-1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n044.star.cs.uiowa.edu
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.90671 seconds
cpu usage	8.32931
user time	7.90376
system time	0.425549
max virtual memory	3.7640608E7
max residence set size	1220180.0

stage attributes

key	value
starexec-result	YES

output

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