/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


WORST_CASE(Omega(n^1), O(n^1))
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).

(0) CpxTRS
(1) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(2) CpxTRS
    (3) CpxTrsMatchBoundsTAProof [FINISHED, 27 ms]
    (4) BOUNDS(1, n^1)
(5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(6) TRS for Loop Detection
    (7) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
    (8) BEST
        (9) proven lower bound
            (10) LowerBoundPropagationProof [FINISHED, 0 ms]
            (11) BOUNDS(n^1, INF)
        (12) TRS for Loop Detection


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

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


The TRS R consists of the following rules:

   implies(not(x), y) -> or(x, y)
   implies(not(x), or(y, z)) -> implies(y, or(x, z))
   implies(x, or(y, z)) -> or(y, implies(x, z))

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

(1) RelTrsToTrsProof (UPPER BOUND(ID))
transformed relative TRS to TRS
----------------------------------------

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


The TRS R consists of the following rules:

   implies(not(x), y) -> or(x, y)
   implies(not(x), or(y, z)) -> implies(y, or(x, z))
   implies(x, or(y, z)) -> or(y, implies(x, z))

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

(3) CpxTrsMatchBoundsTAProof (FINISHED)
A linear upper bound on the runtime complexity of the TRS R could be shown with a Match-Bound[TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] (for contructor-based start-terms) of 2. 

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: 
final states : [1]
transitions: 
not0(0) -> 0
or0(0, 0) -> 0
implies0(0, 0) -> 1
or1(0, 0) -> 1
or1(0, 0) -> 2
implies1(0, 2) -> 1
implies1(0, 0) -> 3
or1(0, 3) -> 1
or1(0, 2) -> 1
or1(0, 0) -> 3
implies1(0, 2) -> 3
or1(0, 3) -> 3
implies2(0, 0) -> 4
or2(0, 4) -> 1
or1(0, 2) -> 3
or2(0, 4) -> 3
or1(0, 0) -> 4
implies1(0, 2) -> 4
or1(0, 3) -> 4
or1(0, 2) -> 4
or2(0, 4) -> 4

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

(4)
BOUNDS(1, n^1)

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

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

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

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).


The TRS R consists of the following rules:

   implies(not(x), y) -> or(x, y)
   implies(not(x), or(y, z)) -> implies(y, or(x, z))
   implies(x, or(y, z)) -> or(y, implies(x, z))

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

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

The rewrite sequence

implies(x, or(y, z)) ->^+ or(y, implies(x, z))

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

The pumping substitution is [z / or(y, z)].

The result substitution is [ ].




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

(8)
Complex Obligation (BEST)

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

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

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).


The TRS R consists of the following rules:

   implies(not(x), y) -> or(x, y)
   implies(not(x), or(y, z)) -> implies(y, or(x, z))
   implies(x, or(y, z)) -> or(y, implies(x, z))

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

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

(11)
BOUNDS(n^1, INF)

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

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

The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1).


The TRS R consists of the following rules:

   implies(not(x), y) -> or(x, y)
   implies(not(x), or(y, z)) -> implies(y, or(x, z))
   implies(x, or(y, z)) -> or(y, implies(x, z))

S is empty.
Rewrite Strategy: FULL