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


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


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


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

(0) DCpxTrs
(1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxRelTRS
(3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 39 ms]
(4) CpxRelTRS
(5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms]
(6) CpxTRS
(7) CpxTrsMatchBoundsProof [FINISHED, 6 ms]
(8) BOUNDS(1, n^1)


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

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


The TRS R consists of the following rules:

   f(0) -> cons(0)
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0

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

(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(0) -> 0
   encArg(cons(x_1)) -> cons(encArg(x_1))
   encArg(s(x_1)) -> s(encArg(x_1))
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encArg(cons_p(x_1)) -> p(encArg(x_1))
   encode_f(x_1) -> f(encArg(x_1))
   encode_0 -> 0
   encode_cons(x_1) -> cons(encArg(x_1))
   encode_s(x_1) -> s(encArg(x_1))
   encode_p(x_1) -> p(encArg(x_1))


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

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


The TRS R consists of the following rules:

   f(0) -> cons(0)
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0

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

   encArg(0) -> 0
   encArg(cons(x_1)) -> cons(encArg(x_1))
   encArg(s(x_1)) -> s(encArg(x_1))
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encArg(cons_p(x_1)) -> p(encArg(x_1))
   encode_f(x_1) -> f(encArg(x_1))
   encode_0 -> 0
   encode_cons(x_1) -> cons(encArg(x_1))
   encode_s(x_1) -> s(encArg(x_1))
   encode_p(x_1) -> p(encArg(x_1))

Rewrite Strategy: FULL
----------------------------------------

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

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


The TRS R consists of the following rules:

   f(0) -> cons(0)
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0

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

   encArg(0) -> 0
   encArg(cons(x_1)) -> cons(encArg(x_1))
   encArg(s(x_1)) -> s(encArg(x_1))
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encArg(cons_p(x_1)) -> p(encArg(x_1))
   encode_f(x_1) -> f(encArg(x_1))
   encode_0 -> 0
   encode_cons(x_1) -> cons(encArg(x_1))
   encode_s(x_1) -> s(encArg(x_1))
   encode_p(x_1) -> p(encArg(x_1))

Rewrite Strategy: FULL
----------------------------------------

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

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

   f(0) -> cons(0)
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0
   encArg(0) -> 0
   encArg(cons(x_1)) -> cons(encArg(x_1))
   encArg(s(x_1)) -> s(encArg(x_1))
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encArg(cons_p(x_1)) -> p(encArg(x_1))
   encode_f(x_1) -> f(encArg(x_1))
   encode_0 -> 0
   encode_cons(x_1) -> cons(encArg(x_1))
   encode_s(x_1) -> s(encArg(x_1))
   encode_p(x_1) -> p(encArg(x_1))

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

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

"[7, 8, 17, 18, 19, 20, 21, 22, 23, 24, 25]
{(7,8,[f_1|0, p_1|0, encArg_1|0, encode_f_1|0, encode_0|0, encode_cons_1|0, encode_s_1|0, encode_p_1|0, 0|1, 0|2]), (7,17,[cons_1|1, s_1|1, f_1|1, p_1|1]), (7,18,[f_1|1]), (7,21,[cons_1|2]), (7,22,[f_1|2]), (7,25,[cons_1|3]), (8,8,[0|0, cons_1|0, s_1|0, cons_f_1|0, cons_p_1|0]), (17,8,[0|1, encArg_1|1, 0|2]), (17,17,[cons_1|1, s_1|1, f_1|1, p_1|1]), (17,21,[cons_1|2]), (17,22,[f_1|2]), (17,25,[cons_1|3]), (18,19,[p_1|1]), (18,8,[0|2]), (19,20,[s_1|1]), (20,8,[0|1]), (21,8,[0|2]), (22,23,[p_1|2]), (22,8,[0|3]), (23,24,[s_1|2]), (24,8,[0|2]), (25,8,[0|3])}"
----------------------------------------

(8)
BOUNDS(1, n^1)