/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, 0 ms]
(2) QTRS
(3) RisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   \(x, x) -> e
   /(x, x) -> e
   .(e, x) -> x
   .(x, e) -> x
   \(e, x) -> x
   /(x, e) -> x
   .(x, \(x, y)) -> y
   .(/(y, x), x) -> y
   \(x, .(x, y)) -> y
   /(.(y, x), x) -> y
   /(x, \(y, x)) -> y
   \(/(x, y), x) -> y

Q is empty.

----------------------------------------

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:._2 > /_2 > \_2 > e

and weight map:

   e=2
   \_2=0
   /_2=0
   ._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:

   \(x, x) -> e
   /(x, x) -> e
   .(e, x) -> x
   .(x, e) -> x
   \(e, x) -> x
   /(x, e) -> x
   .(x, \(x, y)) -> y
   .(/(y, x), x) -> y
   \(x, .(x, y)) -> y
   /(.(y, x), x) -> y
   /(x, \(y, x)) -> y
   \(/(x, y), x) -> y




----------------------------------------

(2)
Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.

----------------------------------------

(3) RisEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------

(4)
YES