/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 58 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x, empty) -> x f(empty, cons(a, k)) -> f(cons(a, k), k) f(cons(a, k), y) -> f(y, k) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(cons(x_1, x_2)) = x_1 + 2*x_2 POL(empty) = 2 POL(f(x_1, x_2)) = x_1 + 2*x_2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(x, empty) -> x f(empty, cons(a, k)) -> f(cons(a, k), k) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(cons(a, k), y) -> f(y, k) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:cons_2 > f_2 and weight map: cons_2=0 f_2=0 The variable weight is 1With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(cons(a, k), y) -> f(y, k) ---------------------------------------- (4) Obligation: Q restricted rewrite system: R is empty. Q is empty. ---------------------------------------- (5) RisEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (6) YES