WORST_CASE(Omega(n^1),?)
proof of /export/starexec/sandbox/benchmark/theBenchmark.trs
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).

(0) CpxRelTRS
(1) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 714 ms]
(2) CpxRelTRS
(3) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(4) TRS for Loop Detection
(5) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
(6) BEST
    (7) proven lower bound
        (8) LowerBoundPropagationProof [FINISHED, 0 ms]
        (9) BOUNDS(n^1, INF)
    (10) TRS for Loop Detection


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

(0)
Obligation:
The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).


The TRS R consists of the following rules:

   COND(true, z0, z1, z2) -> c(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z0, z2))
   COND(true, z0, z1, z2) -> c1(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z1, z2))
   COND(true, z0, z1, z2) -> c2(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z0))
   COND(true, z0, z1, z2) -> c3(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z1))
   AND(true, true) -> c4
   AND(z0, false) -> c5
   AND(false, z0) -> c6
   GR(0, 0) -> c7
   GR(0, z0) -> c8
   GR(s(z0), 0) -> c9
   GR(s(z0), s(z1)) -> c10(GR(z0, z1))
   P(0) -> c11
   P(s(z0)) -> c12

The (relative) TRS S consists of the following rules:

   cond(true, z0, z1, z2) -> cond(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2)
   and(true, true) -> true
   and(z0, false) -> false
   and(false, z0) -> false
   gr(0, 0) -> false
   gr(0, z0) -> false
   gr(s(z0), 0) -> true
   gr(s(z0), s(z1)) -> gr(z0, z1)
   p(0) -> 0
   p(s(z0)) -> z0

Rewrite Strategy: INNERMOST
----------------------------------------

(1) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID))
proved innermost termination of relative rules
----------------------------------------

(2)
Obligation:
The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).


The TRS R consists of the following rules:

   COND(true, z0, z1, z2) -> c(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z0, z2))
   COND(true, z0, z1, z2) -> c1(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z1, z2))
   COND(true, z0, z1, z2) -> c2(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z0))
   COND(true, z0, z1, z2) -> c3(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z1))
   AND(true, true) -> c4
   AND(z0, false) -> c5
   AND(false, z0) -> c6
   GR(0, 0) -> c7
   GR(0, z0) -> c8
   GR(s(z0), 0) -> c9
   GR(s(z0), s(z1)) -> c10(GR(z0, z1))
   P(0) -> c11
   P(s(z0)) -> c12

The (relative) TRS S consists of the following rules:

   cond(true, z0, z1, z2) -> cond(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2)
   and(true, true) -> true
   and(z0, false) -> false
   and(false, z0) -> false
   gr(0, 0) -> false
   gr(0, z0) -> false
   gr(s(z0), 0) -> true
   gr(s(z0), s(z1)) -> gr(z0, z1)
   p(0) -> 0
   p(s(z0)) -> z0

Rewrite Strategy: INNERMOST
----------------------------------------

(3) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
Transformed a relative TRS into a decreasing-loop problem.
----------------------------------------

(4)
Obligation:
Analyzing the following TRS for decreasing loops:

The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).


The TRS R consists of the following rules:

   COND(true, z0, z1, z2) -> c(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z0, z2))
   COND(true, z0, z1, z2) -> c1(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z1, z2))
   COND(true, z0, z1, z2) -> c2(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z0))
   COND(true, z0, z1, z2) -> c3(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z1))
   AND(true, true) -> c4
   AND(z0, false) -> c5
   AND(false, z0) -> c6
   GR(0, 0) -> c7
   GR(0, z0) -> c8
   GR(s(z0), 0) -> c9
   GR(s(z0), s(z1)) -> c10(GR(z0, z1))
   P(0) -> c11
   P(s(z0)) -> c12

The (relative) TRS S consists of the following rules:

   cond(true, z0, z1, z2) -> cond(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2)
   and(true, true) -> true
   and(z0, false) -> false
   and(false, z0) -> false
   gr(0, 0) -> false
   gr(0, z0) -> false
   gr(s(z0), 0) -> true
   gr(s(z0), s(z1)) -> gr(z0, z1)
   p(0) -> 0
   p(s(z0)) -> z0

Rewrite Strategy: INNERMOST
----------------------------------------

(5) DecreasingLoopProof (LOWER BOUND(ID))
The following loop(s) give(s) rise to the lower bound Omega(n^1):

The rewrite sequence

GR(s(z0), s(z1)) ->^+ c10(GR(z0, z1))

gives rise to a decreasing loop by considering the right hand sides subterm at position [0].

The pumping substitution is [z0 / s(z0), z1 / s(z1)].

The result substitution is [ ].




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

(6)
Complex Obligation (BEST)

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

(7)
Obligation:
Proved the lower bound n^1 for the following obligation:

The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).


The TRS R consists of the following rules:

   COND(true, z0, z1, z2) -> c(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z0, z2))
   COND(true, z0, z1, z2) -> c1(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z1, z2))
   COND(true, z0, z1, z2) -> c2(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z0))
   COND(true, z0, z1, z2) -> c3(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z1))
   AND(true, true) -> c4
   AND(z0, false) -> c5
   AND(false, z0) -> c6
   GR(0, 0) -> c7
   GR(0, z0) -> c8
   GR(s(z0), 0) -> c9
   GR(s(z0), s(z1)) -> c10(GR(z0, z1))
   P(0) -> c11
   P(s(z0)) -> c12

The (relative) TRS S consists of the following rules:

   cond(true, z0, z1, z2) -> cond(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2)
   and(true, true) -> true
   and(z0, false) -> false
   and(false, z0) -> false
   gr(0, 0) -> false
   gr(0, z0) -> false
   gr(s(z0), 0) -> true
   gr(s(z0), s(z1)) -> gr(z0, z1)
   p(0) -> 0
   p(s(z0)) -> z0

Rewrite Strategy: INNERMOST
----------------------------------------

(8) LowerBoundPropagationProof (FINISHED)
Propagated lower bound.
----------------------------------------

(9)
BOUNDS(n^1, INF)

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

(10)
Obligation:
Analyzing the following TRS for decreasing loops:

The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).


The TRS R consists of the following rules:

   COND(true, z0, z1, z2) -> c(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z0, z2))
   COND(true, z0, z1, z2) -> c1(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), AND(gr(z0, z2), gr(z1, z2)), GR(z1, z2))
   COND(true, z0, z1, z2) -> c2(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z0))
   COND(true, z0, z1, z2) -> c3(COND(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2), P(z1))
   AND(true, true) -> c4
   AND(z0, false) -> c5
   AND(false, z0) -> c6
   GR(0, 0) -> c7
   GR(0, z0) -> c8
   GR(s(z0), 0) -> c9
   GR(s(z0), s(z1)) -> c10(GR(z0, z1))
   P(0) -> c11
   P(s(z0)) -> c12

The (relative) TRS S consists of the following rules:

   cond(true, z0, z1, z2) -> cond(and(gr(z0, z2), gr(z1, z2)), p(z0), p(z1), z2)
   and(true, true) -> true
   and(z0, false) -> false
   and(false, z0) -> false
   gr(0, 0) -> false
   gr(0, z0) -> false
   gr(s(z0), 0) -> true
   gr(s(z0), s(z1)) -> gr(z0, z1)
   p(0) -> 0
   p(s(z0)) -> z0

Rewrite Strategy: INNERMOST