details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.97995 seconds
cpu usage	4.87369
user time	4.65351
system time	0.220185
max virtual memory	1.9142372E7
max residence set size	459036.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 33 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> a(b(a(x1))) b(b(x1)) -> a(a(x1)) a(b(b(a(x1)))) -> x1 Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> a(b(a(x1))) a(b(b(x1))) -> a(a(a(x1))) b(b(b(x1))) -> b(a(a(x1))) a(a(b(b(a(x1))))) -> a(x1) b(a(b(b(a(x1))))) -> b(x1) Q is empty. ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{a_1}(a_{a_1}(x1)) -> a_{b_1}(b_{a_1}(a_{a_1}(x1))) a_{a_1}(a_{b_1}(x1)) -> a_{b_1}(b_{a_1}(a_{b_1}(x1))) a_{b_1}(b_{b_1}(b_{a_1}(x1))) -> a_{a_1}(a_{a_1}(a_{a_1}(x1))) a_{b_1}(b_{b_1}(b_{b_1}(x1))) -> a_{a_1}(a_{a_1}(a_{b_1}(x1))) b_{b_1}(b_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{a_1}(x1))) b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(x1))) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1))))) -> a_{a_1}(x1) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1))))) -> a_{b_1}(x1) b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1))))) -> b_{a_1}(x1) b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1))))) -> b_{b_1}(x1) Q is empty. ---------------------------------------- (5) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = 1 + x_1 POL(a_{b_1}(x_1)) = 1 + x_1 POL(b_{a_1}(x_1)) = x_1 POL(b_{b_1}(x_1)) = 3 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a_{b_1}(b_{b_1}(b_{a_1}(x1))) -> a_{a_1}(a_{a_1}(a_{a_1}(x1))) a_{b_1}(b_{b_1}(b_{b_1}(x1))) -> a_{a_1}(a_{a_1}(a_{b_1}(x1))) b_{b_1}(b_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{a_1}(x1))) b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(x1))) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1))))) -> a_{a_1}(x1) a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1))))) -> a_{b_1}(x1) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Standard