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


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


WORST_CASE(Omega(n^1), O(n^1))
proof of /export/starexec/sandbox/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, 36 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:

   +(0, y) -> y
   +(s(x), 0) -> s(x)
   +(s(x), s(y)) -> s(+(s(x), +(y, 0)))

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:

   +(0, y) -> y
   +(s(x), 0) -> s(x)
   +(s(x), s(y)) -> s(+(s(x), +(y, 0)))

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 3. 

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: 
final states : [1]
transitions: 
00() -> 0
s0(0) -> 0
+0(0, 0) -> 1
s1(0) -> 1
s1(0) -> 3
01() -> 5
+1(0, 5) -> 4
+1(3, 4) -> 2
s1(2) -> 1
s1(0) -> 4
s2(0) -> 2
s2(0) -> 7
02() -> 9
+2(0, 9) -> 8
+2(7, 8) -> 6
s2(6) -> 2
s1(0) -> 8
s3(0) -> 6
s2(6) -> 6
0 -> 1
5 -> 4
9 -> 8

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

(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:

   +(0, y) -> y
   +(s(x), 0) -> s(x)
   +(s(x), s(y)) -> s(+(s(x), +(y, 0)))

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

+(s(x), s(s(x1_0))) ->^+ s(+(s(x), s(x1_0)))

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

The pumping substitution is [x1_0 / s(x1_0)].

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:

   +(0, y) -> y
   +(s(x), 0) -> s(x)
   +(s(x), s(y)) -> s(+(s(x), +(y, 0)))

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:

   +(0, y) -> y
   +(s(x), 0) -> s(x)
   +(s(x), s(y)) -> s(+(s(x), +(y, 0)))

S is empty.
Rewrite Strategy: FULL