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


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

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

   a__f(f(a)) -> c(f(g(f(a))))
   mark(f(X)) -> a__f(mark(X))
   mark(a) -> a
   mark(c(X)) -> c(X)
   mark(g(X)) -> g(mark(X))
   a__f(X) -> f(X)

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:

   a__f(f(a)) -> c(f(g(f(a))))
   mark(f(X)) -> a__f(mark(X))
   mark(a) -> a
   mark(c(X)) -> c(X)
   mark(g(X)) -> g(mark(X))
   a__f(X) -> f(X)

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

(3) CpxTrsMatchBoundsProof (FINISHED)
A linear upper bound on the runtime complexity of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. 
The certificate found is represented by the following graph.

"[1, 2, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16]
{(1,2,[a__f_1|0, mark_1|0, f_1|1, a|1, c_1|1]), (1,5,[c_1|1]), (1,9,[a__f_1|1, f_1|2]), (1,10,[g_1|1]), (1,13,[c_1|2]), (2,2,[f_1|0, a|0, c_1|0, g_1|0]), (5,6,[f_1|1]), (6,7,[g_1|1]), (7,8,[f_1|1]), (8,2,[a|1]), (9,2,[mark_1|1, a|1, c_1|1]), (9,9,[a__f_1|1, f_1|2]), (9,10,[g_1|1]), (9,13,[c_1|2]), (10,2,[mark_1|1, a|1, c_1|1]), (10,9,[a__f_1|1, f_1|2]), (10,10,[g_1|1]), (10,13,[c_1|2]), (13,14,[f_1|2]), (14,15,[g_1|2]), (15,16,[f_1|2]), (16,2,[a|2])}"
----------------------------------------

(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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).


The TRS R consists of the following rules:

   a__f(f(a)) -> c(f(g(f(a))))
   mark(f(X)) -> a__f(mark(X))
   mark(a) -> a
   mark(c(X)) -> c(X)
   mark(g(X)) -> g(mark(X))
   a__f(X) -> f(X)

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

(7) SlicingProof (LOWER BOUND(ID))
Sliced the following arguments:
c/0

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

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


The TRS R consists of the following rules:

   a__f(f(a)) -> c
   mark(f(X)) -> a__f(mark(X))
   mark(a) -> a
   mark(c) -> c
   mark(g(X)) -> g(mark(X))
   a__f(X) -> f(X)

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

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

(10)
Obligation:
TRS:
Rules:
a__f(f(a)) -> c
mark(f(X)) -> a__f(mark(X))
mark(a) -> a
mark(c) -> c
mark(g(X)) -> g(mark(X))
a__f(X) -> f(X)

Types:
a__f :: a:f:c:g -> a:f:c:g
f :: a:f:c:g -> a:f:c:g
a :: a:f:c:g
c :: a:f:c:g
mark :: a:f:c:g -> a:f:c:g
g :: a:f:c:g -> a:f:c:g
hole_a:f:c:g1_0 :: a:f:c:g
gen_a:f:c:g2_0 :: Nat -> a:f:c:g

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

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

(12)
Obligation:
TRS:
Rules:
a__f(f(a)) -> c
mark(f(X)) -> a__f(mark(X))
mark(a) -> a
mark(c) -> c
mark(g(X)) -> g(mark(X))
a__f(X) -> f(X)

Types:
a__f :: a:f:c:g -> a:f:c:g
f :: a:f:c:g -> a:f:c:g
a :: a:f:c:g
c :: a:f:c:g
mark :: a:f:c:g -> a:f:c:g
g :: a:f:c:g -> a:f:c:g
hole_a:f:c:g1_0 :: a:f:c:g
gen_a:f:c:g2_0 :: Nat -> a:f:c:g


Generator Equations:
gen_a:f:c:g2_0(0) <=> a
gen_a:f:c:g2_0(+(x, 1)) <=> f(gen_a:f:c:g2_0(x))


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

(13) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
mark(gen_a:f:c:g2_0(+(1, n4_0))) -> *3_0, rt in Omega(n4_0)

Induction Base:
mark(gen_a:f:c:g2_0(+(1, 0)))

Induction Step:
mark(gen_a:f:c:g2_0(+(1, +(n4_0, 1)))) ->_R^Omega(1)
a__f(mark(gen_a:f:c:g2_0(+(1, n4_0)))) ->_IH
a__f(*3_0)

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

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

TRS:
Rules:
a__f(f(a)) -> c
mark(f(X)) -> a__f(mark(X))
mark(a) -> a
mark(c) -> c
mark(g(X)) -> g(mark(X))
a__f(X) -> f(X)

Types:
a__f :: a:f:c:g -> a:f:c:g
f :: a:f:c:g -> a:f:c:g
a :: a:f:c:g
c :: a:f:c:g
mark :: a:f:c:g -> a:f:c:g
g :: a:f:c:g -> a:f:c:g
hole_a:f:c:g1_0 :: a:f:c:g
gen_a:f:c:g2_0 :: Nat -> a:f:c:g


Generator Equations:
gen_a:f:c:g2_0(0) <=> a
gen_a:f:c:g2_0(+(x, 1)) <=> f(gen_a:f:c:g2_0(x))


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

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

(16)
BOUNDS(n^1, INF)