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


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


WORST_CASE(NON_POLY, ?)
proof of /export/starexec/sandbox/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(INF, INF).

(0) DCpxTrs
(1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxRelTRS
(3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 86 ms]
(4) CpxRelTRS
(5) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(6) TRS for Loop Detection
(7) InfiniteLowerBoundProof [FINISHED, 0 ms]
(8) BOUNDS(INF, INF)


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

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


The TRS R consists of the following rules:

   c -> f(g(c))
   f(g(X)) -> g(X)

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(g(x_1)) -> g(encArg(x_1))
   encArg(cons_c) -> c
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encode_c -> c
   encode_f(x_1) -> f(encArg(x_1))
   encode_g(x_1) -> g(encArg(x_1))


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

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


The TRS R consists of the following rules:

   c -> f(g(c))
   f(g(X)) -> g(X)

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

   encArg(g(x_1)) -> g(encArg(x_1))
   encArg(cons_c) -> c
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encode_c -> c
   encode_f(x_1) -> f(encArg(x_1))
   encode_g(x_1) -> g(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(INF, INF).


The TRS R consists of the following rules:

   c -> f(g(c))
   f(g(X)) -> g(X)

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

   encArg(g(x_1)) -> g(encArg(x_1))
   encArg(cons_c) -> c
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encode_c -> c
   encode_f(x_1) -> f(encArg(x_1))
   encode_g(x_1) -> g(encArg(x_1))

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

(5) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
Transformed a relative TRS into a decreasing-loop problem.
----------------------------------------

(6)
Obligation:
Analyzing the following TRS for decreasing loops:

The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(INF, INF).


The TRS R consists of the following rules:

   c -> f(g(c))
   f(g(X)) -> g(X)

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

   encArg(g(x_1)) -> g(encArg(x_1))
   encArg(cons_c) -> c
   encArg(cons_f(x_1)) -> f(encArg(x_1))
   encode_c -> c
   encode_f(x_1) -> f(encArg(x_1))
   encode_g(x_1) -> g(encArg(x_1))

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

(7) InfiniteLowerBoundProof (FINISHED)
The following loop proves infinite runtime complexity:

The rewrite sequence

c ->^+ f(g(c))

gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0].

The pumping substitution is [ ].

The result substitution is [ ].




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

(8)
BOUNDS(INF, INF)