WORST_CASE(?,O(1))
proof of input_Xgq2WZpJS3.trs
# AProVE Commit ID: aff8ecad908e01718a4c36e68d2e55d5e0f16e15 fuhs 20220216 unpublished


The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1).

(0) CpxTRS
(1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


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

(0)
Obligation:
The Runtime Complexity (parallel-innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1).


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))

S is empty.
Rewrite Strategy: PARALLEL_INNERMOST
----------------------------------------

(1) NarrowingOnBasicTermsTerminatesProof (FINISHED)
Constant runtime complexity proven by termination of constructor-based narrowing.

The maximal most general narrowing sequences give rise to the following rewrite sequences:

=(x0, x1) ->^* xor(x0, xor(x1, true))

or(x0, x1) ->^* xor(and(x0, x1), xor(x0, x1))

implies(x0, x1) ->^* xor(and(x0, x1), xor(x0, true))

not(x0) ->^* xor(x0, true)




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

(2)
BOUNDS(1, 1)