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

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

or(x, x) → x
and(x, x) → x
not(not(x)) → x
not(and(x, y)) → or(not(x), not(y))
not(or(x, y)) → and(not(x), not(y))

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

or(z0, z0) → z0
and(z0, z0) → z0
not(not(z0)) → z0
not(and(z0, z1)) → or(not(z0), not(z1))
not(or(z0, z1)) → and(not(z0), not(z1))

Tuples:

NOT(and(z0, z1)) → c3(OR(not(z0), not(z1)), NOT(z0), NOT(z1))
NOT(or(z0, z1)) → c4(AND(not(z0), not(z1)), NOT(z0), NOT(z1))

S tuples:

NOT(and(z0, z1)) → c3(OR(not(z0), not(z1)), NOT(z0), NOT(z1))
NOT(or(z0, z1)) → c4(AND(not(z0), not(z1)), NOT(z0), NOT(z1))

K tuples:none
Defined Rule Symbols:

or, and, not

Defined Pair Symbols:

NOT

Compound Symbols:

c3, c4

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

NOT(and(z0, z1)) → c3(OR(not(z0), not(z1)), NOT(z0), NOT(z1))
NOT(or(z0, z1)) → c4(AND(not(z0), not(z1)), NOT(z0), NOT(z1))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

or(z0, z0) → z0
and(z0, z0) → z0
not(not(z0)) → z0
not(and(z0, z1)) → or(not(z0), not(z1))
not(or(z0, z1)) → and(not(z0), not(z1))

Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:

or, and, not

Defined Pair Symbols:none

Compound Symbols:none

(5) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(6) BOUNDS(O(1), O(1))