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


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


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

(0) CpxTRS
(1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


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

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


The TRS R consists of the following rules:

   a__c -> a__f(g(c))
   a__f(g(X)) -> g(X)
   mark(c) -> a__c
   mark(f(X)) -> a__f(X)
   mark(g(X)) -> g(X)
   a__c -> c
   a__f(X) -> f(X)

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

(1) NarrowingOnBasicTermsTerminatesProof (FINISHED)
Constant runtime complexity proven by termination of constructor-based narrowing.

The maximal most general narrowing sequences give rise to the following rewrite sequences:

mark(g(x0)) ->^* g(x0)

mark(f(x0)) ->^* f(x0)

mark(f(g(x0))) ->^* g(x0)

mark(c) ->^* c

mark(c) ->^* f(g(c))

mark(c) ->^* g(c)

a__f(x0) ->^* f(x0)

a__f(g(x0)) ->^* g(x0)

a__c ->^* c

a__c ->^* f(g(c))

a__c ->^* g(c)




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

(2)
BOUNDS(1, 1)