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	n070.star.cs.uiowa.edu
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.9060959816 seconds
cpu usage	11.411143736
max memory	1.221312512E9

stage attributes

key	value
output-size	4204
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 1 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 18 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 9 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(a(x1))) -> a(c(a(a(x1)))) c(c(c(x1))) -> a(x1) 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(a(x1))) -> a(c(a(a(x1)))) a(c(c(c(x1)))) -> a(a(x1)) c(c(c(c(x1)))) -> c(a(x1)) a(a(x1)) -> a(x1) c(a(x1)) -> c(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}(a_{a_1}(x1))) -> a_{c_1}(c_{a_1}(a_{a_1}(a_{a_1}(x1)))) a_{a_1}(a_{a_1}(a_{c_1}(x1))) -> a_{c_1}(c_{a_1}(a_{a_1}(a_{c_1}(x1)))) a_{c_1}(c_{c_1}(c_{c_1}(c_{a_1}(x1)))) -> a_{a_1}(a_{a_1}(x1)) a_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1)))) -> a_{a_1}(a_{c_1}(x1)) c_{c_1}(c_{c_1}(c_{c_1}(c_{a_1}(x1)))) -> c_{a_1}(a_{a_1}(x1)) c_{c_1}(c_{c_1}(c_{c_1}(c_{c_1}(x1)))) -> c_{a_1}(a_{c_1}(x1)) a_{a_1}(a_{a_1}(x1)) -> a_{a_1}(x1) a_{a_1}(a_{c_1}(x1)) -> a_{c_1}(x1) c_{a_1}(a_{a_1}(x1)) -> c_{a_1}(x1) c_{a_1}(a_{c_1}(x1)) -> c_{c_1}(x1) Q is empty. ---------------------------------------- (5) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a_{a_1}(x_1)) = 3 + x_1 POL(a_{c_1}(x_1)) = x_1 POL(c_{a_1}(x_1)) = 3 + x_1 POL(c_{c_1}(x_1)) = 2 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: popout

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

job log

popout

actions

all output return to SRS Standard