details

property	value
status	complete
benchmark	random-254.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n153.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	25.8975 seconds
cpu usage	97.5873
user time	95.3204
system time	2.26689
max virtual memory	4.1980612E7
max residence set size	5146384.0

stage attributes

key	value
starexec-result	YES

output

96.66/25.60 YES 97.18/25.69 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 97.18/25.69 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 97.18/25.69 97.18/25.69 97.18/25.69 Termination w.r.t. Q of the given QTRS could be proven: 97.18/25.69 97.18/25.69 (0) QTRS 97.18/25.69 (1) FlatCCProof [EQUIVALENT, 0 ms] 97.18/25.69 (2) QTRS 97.18/25.69 (3) RootLabelingProof [EQUIVALENT, 0 ms] 97.18/25.69 (4) QTRS 97.18/25.69 (5) DependencyPairsProof [EQUIVALENT, 83 ms] 97.18/25.69 (6) QDP 97.18/25.69 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 97.18/25.69 (8) QDP 97.18/25.69 (9) QDPOrderProof [EQUIVALENT, 107 ms] 97.18/25.69 (10) QDP 97.18/25.69 (11) DependencyGraphProof [EQUIVALENT, 0 ms] 97.18/25.69 (12) QDP 97.18/25.69 (13) QDPOrderProof [EQUIVALENT, 1604 ms] 97.18/25.69 (14) QDP 97.18/25.69 (15) QDPOrderProof [EQUIVALENT, 2615 ms] 97.18/25.69 (16) QDP 97.18/25.69 (17) PisEmptyProof [EQUIVALENT, 0 ms] 97.18/25.69 (18) YES 97.18/25.69 97.18/25.69 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (0) 97.18/25.69 Obligation: 97.18/25.69 Q restricted rewrite system: 97.18/25.69 The TRS R consists of the following rules: 97.18/25.69 97.18/25.69 a(a(b(b(x1)))) -> a(a(a(b(x1)))) 97.18/25.69 b(b(a(b(x1)))) -> a(a(b(a(x1)))) 97.18/25.69 b(a(a(a(x1)))) -> b(a(b(b(x1)))) 97.18/25.69 97.18/25.69 Q is empty. 97.18/25.69 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (1) FlatCCProof (EQUIVALENT) 97.18/25.69 We used flat context closure [ROOTLAB] 97.18/25.69 As Q is empty the flat context closure was sound AND complete. 97.18/25.69 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (2) 97.18/25.69 Obligation: 97.18/25.69 Q restricted rewrite system: 97.18/25.69 The TRS R consists of the following rules: 97.18/25.69 97.18/25.69 a(a(b(b(x1)))) -> a(a(a(b(x1)))) 97.18/25.69 b(a(a(a(x1)))) -> b(a(b(b(x1)))) 97.18/25.69 a(b(b(a(b(x1))))) -> a(a(a(b(a(x1))))) 97.18/25.69 b(b(b(a(b(x1))))) -> b(a(a(b(a(x1))))) 97.18/25.69 97.18/25.69 Q is empty. 97.18/25.69 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (3) RootLabelingProof (EQUIVALENT) 97.18/25.69 We used plain root labeling [ROOTLAB] with the following heuristic: 97.18/25.69 LabelAll: All function symbols get labeled 97.18/25.69 97.18/25.69 As Q is empty the root labeling was sound AND complete. 97.18/25.69 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (4) 97.18/25.69 Obligation: 97.18/25.69 Q restricted rewrite system: 97.18/25.69 The TRS R consists of the following rules: 97.18/25.69 97.18/25.69 a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) 97.18/25.69 a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) 97.18/25.69 b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) 97.18/25.69 b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) 97.18/25.69 a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) 97.18/25.69 a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> a_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) 97.18/25.69 b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))) 97.18/25.69 b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))) 97.18/25.69 97.18/25.69 Q is empty. 97.18/25.69 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (5) DependencyPairsProof (EQUIVALENT) 97.18/25.69 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 97.18/25.69 ---------------------------------------- 97.18/25.69 97.18/25.69 (6) 97.18/25.69 Obligation: 97.18/25.69 Q DP problem: 97.18/25.69 The TRS P consists of the following rules: 97.18/25.69 97.18/25.69 A_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) 97.18/25.69 A_{A_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> A_{A_1}(a_{b_1}(b_{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