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


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


WORST_CASE(NON_POLY, ?)
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(EXP, INF).

(0) CpxTRS
(1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxTRS
(3) SlicingProof [LOWER BOUND(ID), 0 ms]
(4) CpxTRS
(5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
(6) typed CpxTrs
(7) OrderProof [LOWER BOUND(ID), 0 ms]
(8) typed CpxTrs
(9) RewriteLemmaProof [FINISHED, 596 ms]
(10) BOUNDS(EXP, INF)


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

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


The TRS R consists of the following rules:

   f(g(X)) -> g(f(f(X)))
   f(h(X)) -> h(g(X))

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

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

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


The TRS R consists of the following rules:

   f(g(X)) -> g(f(f(X)))
   f(h(X)) -> h(g(X))

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

(3) SlicingProof (LOWER BOUND(ID))
Sliced the following arguments:
h/0

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

(4)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF).


The TRS R consists of the following rules:

   f(g(X)) -> g(f(f(X)))
   f(h) -> h

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

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

(6)
Obligation:
TRS:
Rules:
f(g(X)) -> g(f(f(X)))
f(h) -> h

Types:
f :: g:h -> g:h
g :: g:h -> g:h
h :: g:h
hole_g:h1_0 :: g:h
gen_g:h2_0 :: Nat -> g:h

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

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

(8)
Obligation:
TRS:
Rules:
f(g(X)) -> g(f(f(X)))
f(h) -> h

Types:
f :: g:h -> g:h
g :: g:h -> g:h
h :: g:h
hole_g:h1_0 :: g:h
gen_g:h2_0 :: Nat -> g:h


Generator Equations:
gen_g:h2_0(0) <=> h
gen_g:h2_0(+(x, 1)) <=> g(gen_g:h2_0(x))


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

(9) RewriteLemmaProof (FINISHED)
Proved the following rewrite lemma:
f(gen_g:h2_0(n4_0)) -> gen_g:h2_0(n4_0), rt in Omega(EXP)

Induction Base:
f(gen_g:h2_0(0)) ->_R^Omega(1)
h

Induction Step:
f(gen_g:h2_0(+(n4_0, 1))) ->_R^Omega(1)
g(f(f(gen_g:h2_0(n4_0)))) ->_IH
g(f(gen_g:h2_0(c5_0))) ->_IH
g(gen_g:h2_0(c5_0))

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

(10)
BOUNDS(EXP, INF)