/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 61 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) RisEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

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

   not(x) -> xor(x, true)
   implies(x, y) -> xor(and(x, y), xor(x, true))
   or(x, y) -> xor(and(x, y), xor(x, y))
   =(x, y) -> xor(x, xor(y, true))

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(=(x_1, x_2)) = 2 + 2*x_1 + 2*x_2
   POL(and(x_1, x_2)) = 1 + x_1 + x_2
   POL(implies(x_1, x_2)) = 2 + 2*x_1 + x_2
   POL(not(x_1)) = 1 + x_1
   POL(or(x_1, x_2)) = 1 + 2*x_1 + 2*x_2
   POL(true) = 1
   POL(xor(x_1, x_2)) = x_1 + x_2
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   =(x, y) -> xor(x, xor(y, true))




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

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

   not(x) -> xor(x, true)
   implies(x, y) -> xor(and(x, y), xor(x, true))
   or(x, y) -> xor(and(x, y), xor(x, y))

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(and(x_1, x_2)) = x_1 + x_2
   POL(implies(x_1, x_2)) = 2 + 2*x_1 + x_2
   POL(not(x_1)) = 1 + 2*x_1
   POL(or(x_1, x_2)) = 2*x_1 + 2*x_2
   POL(true) = 0
   POL(xor(x_1, x_2)) = x_1 + x_2
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   not(x) -> xor(x, true)
   implies(x, y) -> xor(and(x, y), xor(x, true))




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

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

   or(x, y) -> xor(and(x, y), xor(x, y))

Q is empty.

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

(5) QTRSRRRProof (EQUIVALENT)
Used ordering:
Quasi precedence:
or_2 > [xor_2, and_2]


Status:
or_2: [1,2]
xor_2: [2,1]
and_2: [1,2]

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   or(x, y) -> xor(and(x, y), xor(x, y))




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

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

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

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

(8)
YES