details

property	value
status	complete
benchmark	dup05.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n068.star.cs.uiowa.edu
space	Trafo_06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.0688 seconds
cpu usage	39.2487
user time	37.4628
system time	1.78587
max virtual memory	4.1911948E7
max residence set size	4347120.0

stage attributes

key	value
starexec-result	YES

output

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