/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) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(2) TRS for Loop Detection
(3) DecreasingLoopProof [FINISHED, 0 ms]
(4) 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)) -> f(a(g(g(f(x))), g(f(x))))

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

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

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

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)) -> f(a(g(g(f(x))), g(f(x))))

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

(3) DecreasingLoopProof (FINISHED)
The following loop(s) give(s) rise to the lower bound EXP:

The rewrite sequence

f(g(x)) ->^+ f(a(g(g(f(x))), g(f(x))))

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

The pumping substitution is [x / g(x)].

The result substitution is [ ].



The rewrite sequence

f(g(x)) ->^+ f(a(g(g(f(x))), g(f(x))))

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

The pumping substitution is [x / g(x)].

The result substitution is [ ].




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

(4)
BOUNDS(EXP, INF)