/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


The Runtime Complexity (innermost) 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, 0 ms]
    (4) BOUNDS(1, n^1)
(5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(6) CpxTRS
    (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (8) typed CpxTrs
    (9) OrderProof [LOWER BOUND(ID), 0 ms]
    (10) typed CpxTrs
    (11) RewriteLemmaProof [LOWER BOUND(ID), 1817 ms]
    (12) proven lower bound
    (13) LowerBoundPropagationProof [FINISHED, 0 ms]
    (14) BOUNDS(n^1, INF)


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

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


The TRS R consists of the following rules:

   f(S(x), x2) -> f(x2, x)
   f(0, x2) -> 0

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

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

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


The TRS R consists of the following rules:

   f(S(x), x2) -> f(x2, x)
   f(0, x2) -> 0

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

(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 1. 

The compatible tree automaton used to show the Match-Boundedness (for constructor-based start-terms) is represented by: 
final states : [1]
transitions: 
S0(0) -> 0
00() -> 0
f0(0, 0) -> 1
f1(0, 0) -> 1
01() -> 1

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

(4)
BOUNDS(1, n^1)

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

(5) RenamingProof (BOTH BOUNDS(ID, ID))
Renamed function symbols to avoid clashes with predefined symbol.
----------------------------------------

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


The TRS R consists of the following rules:

   f(S(x), x2) -> f(x2, x)
   f(0', x2) -> 0'

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

(7) TypeInferenceProof (BOTH BOUNDS(ID, ID))
Infered types.
----------------------------------------

(8)
Obligation:
Innermost TRS:
Rules:
f(S(x), x2) -> f(x2, x)
f(0', x2) -> 0'

Types:
f :: S:0' -> S:0' -> S:0'
S :: S:0' -> S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat -> S:0'

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

(9) OrderProof (LOWER BOUND(ID))
Heuristically decided to analyse the following defined symbols:
f
----------------------------------------

(10)
Obligation:
Innermost TRS:
Rules:
f(S(x), x2) -> f(x2, x)
f(0', x2) -> 0'

Types:
f :: S:0' -> S:0' -> S:0'
S :: S:0' -> S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat -> S:0'


Generator Equations:
gen_S:0'2_0(0) <=> 0'
gen_S:0'2_0(+(x, 1)) <=> S(gen_S:0'2_0(x))


The following defined symbols remain to be analysed:
f
----------------------------------------

(11) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
f(gen_S:0'2_0(n4_0), gen_S:0'2_0(n4_0)) -> gen_S:0'2_0(0), rt in Omega(1 + n4_0)

Induction Base:
f(gen_S:0'2_0(0), gen_S:0'2_0(0)) ->_R^Omega(1)
0'

Induction Step:
f(gen_S:0'2_0(+(n4_0, 1)), gen_S:0'2_0(+(n4_0, 1))) ->_R^Omega(1)
f(gen_S:0'2_0(+(n4_0, 1)), gen_S:0'2_0(n4_0)) ->_R^Omega(1)
f(gen_S:0'2_0(n4_0), gen_S:0'2_0(n4_0)) ->_IH
gen_S:0'2_0(0)

We have rt in Omega(n^1) and sz in O(n). Thus, we have irc_R in Omega(n).
----------------------------------------

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

Innermost TRS:
Rules:
f(S(x), x2) -> f(x2, x)
f(0', x2) -> 0'

Types:
f :: S:0' -> S:0' -> S:0'
S :: S:0' -> S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat -> S:0'


Generator Equations:
gen_S:0'2_0(0) <=> 0'
gen_S:0'2_0(+(x, 1)) <=> S(gen_S:0'2_0(x))


The following defined symbols remain to be analysed:
f
----------------------------------------

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

(14)
BOUNDS(n^1, INF)