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


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


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


The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF).

(0) DCpxTrs
(1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxRelTRS
(3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 39 ms]
(4) CpxRelTRS
(5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms]
(6) CpxRelTRS
(7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 9 ms]
(8) typed CpxTrs
(9) OrderProof [LOWER BOUND(ID), 0 ms]
(10) typed CpxTrs
(11) RewriteLemmaProof [LOWER BOUND(ID), 444 ms]
(12) BEST
    (13) proven lower bound
        (14) LowerBoundPropagationProof [FINISHED, 0 ms]
        (15) BOUNDS(n^1, INF)
    (16) typed CpxTrs
        (17) RewriteLemmaProof [LOWER BOUND(ID), 112 ms]
        (18) BOUNDS(1, INF)


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

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


The TRS R consists of the following rules:

   b(d(b(x1))) -> c(d(b(x1)))
   b(a(c(x1))) -> b(c(x1))
   a(d(x1)) -> d(c(x1))
   b(b(b(x1))) -> a(b(c(x1)))
   d(c(x1)) -> b(d(x1))
   d(c(x1)) -> d(b(d(x1)))
   d(a(c(x1))) -> b(b(x1))

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

(1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID))
The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem:

   encArg(c(x_1)) -> c(encArg(x_1))
   encArg(cons_b(x_1)) -> b(encArg(x_1))
   encArg(cons_a(x_1)) -> a(encArg(x_1))
   encArg(cons_d(x_1)) -> d(encArg(x_1))
   encode_b(x_1) -> b(encArg(x_1))
   encode_d(x_1) -> d(encArg(x_1))
   encode_c(x_1) -> c(encArg(x_1))
   encode_a(x_1) -> a(encArg(x_1))


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

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


The TRS R consists of the following rules:

   b(d(b(x1))) -> c(d(b(x1)))
   b(a(c(x1))) -> b(c(x1))
   a(d(x1)) -> d(c(x1))
   b(b(b(x1))) -> a(b(c(x1)))
   d(c(x1)) -> b(d(x1))
   d(c(x1)) -> d(b(d(x1)))
   d(a(c(x1))) -> b(b(x1))

The (relative) TRS S consists of the following rules:

   encArg(c(x_1)) -> c(encArg(x_1))
   encArg(cons_b(x_1)) -> b(encArg(x_1))
   encArg(cons_a(x_1)) -> a(encArg(x_1))
   encArg(cons_d(x_1)) -> d(encArg(x_1))
   encode_b(x_1) -> b(encArg(x_1))
   encode_d(x_1) -> d(encArg(x_1))
   encode_c(x_1) -> c(encArg(x_1))
   encode_a(x_1) -> a(encArg(x_1))

Rewrite Strategy: INNERMOST
----------------------------------------

(3) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID))
proved innermost termination of relative rules
----------------------------------------

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


The TRS R consists of the following rules:

   b(d(b(x1))) -> c(d(b(x1)))
   b(a(c(x1))) -> b(c(x1))
   a(d(x1)) -> d(c(x1))
   b(b(b(x1))) -> a(b(c(x1)))
   d(c(x1)) -> b(d(x1))
   d(c(x1)) -> d(b(d(x1)))
   d(a(c(x1))) -> b(b(x1))

The (relative) TRS S consists of the following rules:

   encArg(c(x_1)) -> c(encArg(x_1))
   encArg(cons_b(x_1)) -> b(encArg(x_1))
   encArg(cons_a(x_1)) -> a(encArg(x_1))
   encArg(cons_d(x_1)) -> d(encArg(x_1))
   encode_b(x_1) -> b(encArg(x_1))
   encode_d(x_1) -> d(encArg(x_1))
   encode_c(x_1) -> c(encArg(x_1))
   encode_a(x_1) -> a(encArg(x_1))

Rewrite Strategy: INNERMOST
----------------------------------------

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

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


The TRS R consists of the following rules:

   b(d(b(x1))) -> c(d(b(x1)))
   b(a(c(x1))) -> b(c(x1))
   a(d(x1)) -> d(c(x1))
   b(b(b(x1))) -> a(b(c(x1)))
   d(c(x1)) -> b(d(x1))
   d(c(x1)) -> d(b(d(x1)))
   d(a(c(x1))) -> b(b(x1))

The (relative) TRS S consists of the following rules:

   encArg(c(x_1)) -> c(encArg(x_1))
   encArg(cons_b(x_1)) -> b(encArg(x_1))
   encArg(cons_a(x_1)) -> a(encArg(x_1))
   encArg(cons_d(x_1)) -> d(encArg(x_1))
   encode_b(x_1) -> b(encArg(x_1))
   encode_d(x_1) -> d(encArg(x_1))
   encode_c(x_1) -> c(encArg(x_1))
   encode_a(x_1) -> a(encArg(x_1))

Rewrite Strategy: INNERMOST
----------------------------------------

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

(8)
Obligation:
Innermost TRS:
Rules:
b(d(b(x1))) -> c(d(b(x1)))
b(a(c(x1))) -> b(c(x1))
a(d(x1)) -> d(c(x1))
b(b(b(x1))) -> a(b(c(x1)))
d(c(x1)) -> b(d(x1))
d(c(x1)) -> d(b(d(x1)))
d(a(c(x1))) -> b(b(x1))
encArg(c(x_1)) -> c(encArg(x_1))
encArg(cons_b(x_1)) -> b(encArg(x_1))
encArg(cons_a(x_1)) -> a(encArg(x_1))
encArg(cons_d(x_1)) -> d(encArg(x_1))
encode_b(x_1) -> b(encArg(x_1))
encode_d(x_1) -> d(encArg(x_1))
encode_c(x_1) -> c(encArg(x_1))
encode_a(x_1) -> a(encArg(x_1))

Types:
b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encArg :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
hole_c:cons_b:cons_a:cons_d1_0 :: c:cons_b:cons_a:cons_d
gen_c:cons_b:cons_a:cons_d2_0 :: Nat -> c:cons_b:cons_a:cons_d

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

(9) OrderProof (LOWER BOUND(ID))
Heuristically decided to analyse the following defined symbols:
b, d, a, encArg

They will be analysed ascendingly in the following order:
b = d
b = a
b < encArg
d = a
d < encArg
a < encArg

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

(10)
Obligation:
Innermost TRS:
Rules:
b(d(b(x1))) -> c(d(b(x1)))
b(a(c(x1))) -> b(c(x1))
a(d(x1)) -> d(c(x1))
b(b(b(x1))) -> a(b(c(x1)))
d(c(x1)) -> b(d(x1))
d(c(x1)) -> d(b(d(x1)))
d(a(c(x1))) -> b(b(x1))
encArg(c(x_1)) -> c(encArg(x_1))
encArg(cons_b(x_1)) -> b(encArg(x_1))
encArg(cons_a(x_1)) -> a(encArg(x_1))
encArg(cons_d(x_1)) -> d(encArg(x_1))
encode_b(x_1) -> b(encArg(x_1))
encode_d(x_1) -> d(encArg(x_1))
encode_c(x_1) -> c(encArg(x_1))
encode_a(x_1) -> a(encArg(x_1))

Types:
b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encArg :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
hole_c:cons_b:cons_a:cons_d1_0 :: c:cons_b:cons_a:cons_d
gen_c:cons_b:cons_a:cons_d2_0 :: Nat -> c:cons_b:cons_a:cons_d


Generator Equations:
gen_c:cons_b:cons_a:cons_d2_0(0) <=> hole_c:cons_b:cons_a:cons_d1_0
gen_c:cons_b:cons_a:cons_d2_0(+(x, 1)) <=> c(gen_c:cons_b:cons_a:cons_d2_0(x))


The following defined symbols remain to be analysed:
d, b, a, encArg

They will be analysed ascendingly in the following order:
b = d
b = a
b < encArg
d = a
d < encArg
a < encArg

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

(11) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
d(gen_c:cons_b:cons_a:cons_d2_0(+(1, n4_0))) -> *3_0, rt in Omega(n4_0)

Induction Base:
d(gen_c:cons_b:cons_a:cons_d2_0(+(1, 0)))

Induction Step:
d(gen_c:cons_b:cons_a:cons_d2_0(+(1, +(n4_0, 1)))) ->_R^Omega(1)
b(d(gen_c:cons_b:cons_a:cons_d2_0(+(1, n4_0)))) ->_IH
b(*3_0)

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

(12)
Complex Obligation (BEST)

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

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

Innermost TRS:
Rules:
b(d(b(x1))) -> c(d(b(x1)))
b(a(c(x1))) -> b(c(x1))
a(d(x1)) -> d(c(x1))
b(b(b(x1))) -> a(b(c(x1)))
d(c(x1)) -> b(d(x1))
d(c(x1)) -> d(b(d(x1)))
d(a(c(x1))) -> b(b(x1))
encArg(c(x_1)) -> c(encArg(x_1))
encArg(cons_b(x_1)) -> b(encArg(x_1))
encArg(cons_a(x_1)) -> a(encArg(x_1))
encArg(cons_d(x_1)) -> d(encArg(x_1))
encode_b(x_1) -> b(encArg(x_1))
encode_d(x_1) -> d(encArg(x_1))
encode_c(x_1) -> c(encArg(x_1))
encode_a(x_1) -> a(encArg(x_1))

Types:
b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encArg :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
hole_c:cons_b:cons_a:cons_d1_0 :: c:cons_b:cons_a:cons_d
gen_c:cons_b:cons_a:cons_d2_0 :: Nat -> c:cons_b:cons_a:cons_d


Generator Equations:
gen_c:cons_b:cons_a:cons_d2_0(0) <=> hole_c:cons_b:cons_a:cons_d1_0
gen_c:cons_b:cons_a:cons_d2_0(+(x, 1)) <=> c(gen_c:cons_b:cons_a:cons_d2_0(x))


The following defined symbols remain to be analysed:
d, b, a, encArg

They will be analysed ascendingly in the following order:
b = d
b = a
b < encArg
d = a
d < encArg
a < encArg

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

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

(15)
BOUNDS(n^1, INF)

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

(16)
Obligation:
Innermost TRS:
Rules:
b(d(b(x1))) -> c(d(b(x1)))
b(a(c(x1))) -> b(c(x1))
a(d(x1)) -> d(c(x1))
b(b(b(x1))) -> a(b(c(x1)))
d(c(x1)) -> b(d(x1))
d(c(x1)) -> d(b(d(x1)))
d(a(c(x1))) -> b(b(x1))
encArg(c(x_1)) -> c(encArg(x_1))
encArg(cons_b(x_1)) -> b(encArg(x_1))
encArg(cons_a(x_1)) -> a(encArg(x_1))
encArg(cons_d(x_1)) -> d(encArg(x_1))
encode_b(x_1) -> b(encArg(x_1))
encode_d(x_1) -> d(encArg(x_1))
encode_c(x_1) -> c(encArg(x_1))
encode_a(x_1) -> a(encArg(x_1))

Types:
b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encArg :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
cons_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_b :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_d :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_c :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
encode_a :: c:cons_b:cons_a:cons_d -> c:cons_b:cons_a:cons_d
hole_c:cons_b:cons_a:cons_d1_0 :: c:cons_b:cons_a:cons_d
gen_c:cons_b:cons_a:cons_d2_0 :: Nat -> c:cons_b:cons_a:cons_d


Lemmas:
d(gen_c:cons_b:cons_a:cons_d2_0(+(1, n4_0))) -> *3_0, rt in Omega(n4_0)


Generator Equations:
gen_c:cons_b:cons_a:cons_d2_0(0) <=> hole_c:cons_b:cons_a:cons_d1_0
gen_c:cons_b:cons_a:cons_d2_0(+(x, 1)) <=> c(gen_c:cons_b:cons_a:cons_d2_0(x))


The following defined symbols remain to be analysed:
b, a, encArg

They will be analysed ascendingly in the following order:
b = d
b = a
b < encArg
d = a
d < encArg
a < encArg

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

(17) RewriteLemmaProof (LOWER BOUND(ID))
Proved the following rewrite lemma:
encArg(gen_c:cons_b:cons_a:cons_d2_0(+(1, n808_0))) -> *3_0, rt in Omega(0)

Induction Base:
encArg(gen_c:cons_b:cons_a:cons_d2_0(+(1, 0)))

Induction Step:
encArg(gen_c:cons_b:cons_a:cons_d2_0(+(1, +(n808_0, 1)))) ->_R^Omega(0)
c(encArg(gen_c:cons_b:cons_a:cons_d2_0(+(1, n808_0)))) ->_IH
c(*3_0)

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

(18)
BOUNDS(1, INF)