```* Step 1: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
active(b()) -> mark(a())
f(mark(X1),X2) -> mark(f(X1,X2))
f(ok(X1),ok(X2)) -> ok(f(X1,X2))
proper(a()) -> ok(a())
proper(b()) -> ok(b())
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Signature:
{active/1,f/2,proper/1,top/1} / {a/0,b/0,mark/1,ok/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {active,f,proper,top} and constructors {a,b,mark,ok}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(mark) = {1},
uargs(ok) = {1},
uargs(top) = {1}

Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(a) = 
p(active) =  x1 + 
p(b) = 
p(f) = 
p(mark) =  x1 + 
p(ok) =  x1 + 
p(proper) = 
p(top) =  x1 + 

Following rules are strictly oriented:
active(b()) = 
> 
= mark(a())

Following rules are (at-least) weakly oriented:
f(mark(X1),X2) =  
>= 
=  mark(f(X1,X2))

f(ok(X1),ok(X2)) =  
>= 
=  ok(f(X1,X2))

proper(a()) =  
>= 
=  ok(a())

proper(b()) =  
>= 
=  ok(b())

top(mark(X)) =   X + 
>= 
=  top(proper(X))

top(ok(X)) =   X + 
>=  X + 
=  top(active(X))

Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 2: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
f(mark(X1),X2) -> mark(f(X1,X2))
f(ok(X1),ok(X2)) -> ok(f(X1,X2))
proper(a()) -> ok(a())
proper(b()) -> ok(b())
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Weak TRS:
active(b()) -> mark(a())
- Signature:
{active/1,f/2,proper/1,top/1} / {a/0,b/0,mark/1,ok/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {active,f,proper,top} and constructors {a,b,mark,ok}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(mark) = {1},
uargs(ok) = {1},
uargs(top) = {1}

Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(a) = 
p(active) = 
p(b) = 
p(f) =  x1 + 
p(mark) =  x1 + 
p(ok) =  x1 + 
p(proper) =  x1 + 
p(top) =  x1 + 

Following rules are strictly oriented:
f(ok(X1),ok(X2)) =  X1 + 
>  X1 + 
= ok(f(X1,X2))

proper(a()) = 
> 
= ok(a())

proper(b()) = 
> 
= ok(b())

Following rules are (at-least) weakly oriented:
active(b()) =  
>= 
=  mark(a())

f(mark(X1),X2) =   X1 + 
>=  X1 + 
=  mark(f(X1,X2))

top(mark(X)) =   X + 
>=  X + 
=  top(proper(X))

top(ok(X)) =   X + 
>= 
=  top(active(X))

Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 3: MI WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
f(mark(X1),X2) -> mark(f(X1,X2))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Weak TRS:
active(b()) -> mark(a())
f(ok(X1),ok(X2)) -> ok(f(X1,X2))
proper(a()) -> ok(a())
proper(b()) -> ok(b())
- Signature:
{active/1,f/2,proper/1,top/1} / {a/0,b/0,mark/1,ok/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {active,f,proper,top} and constructors {a,b,mark,ok}
+ Applied Processor:
MI {miKind = MaximalMatrix (UpperTriangular (Multiplicity Nothing)), miDimension = 1, miUArgs = UArgs, miURules = URules, miSelector = Just any strict-rules}
+ Details:
We apply a matrix interpretation of kind MaximalMatrix (UpperTriangular (Multiplicity Nothing)):

The following argument positions are considered usable:
uargs(mark) = {1},
uargs(ok) = {1},
uargs(top) = {1}

Following symbols are considered usable:
{active,f,proper,top}
TcT has computed the following interpretation:
p(a) = 
p(active) =  x_1 + 
p(b) = 
p(f) =  x_1 +  x_2 + 
p(mark) =  x_1 + 
p(ok) =  x_1 + 
p(proper) =  x_1 + 
p(top) =  x_1 + 

Following rules are strictly oriented:
top(mark(X)) =  X + 
>  X + 
= top(proper(X))

Following rules are (at-least) weakly oriented:
active(b()) =  
>= 
=  mark(a())

f(mark(X1),X2) =   X1 +  X2 + 
>=  X1 +  X2 + 
=  mark(f(X1,X2))

f(ok(X1),ok(X2)) =   X1 +  X2 + 
>=  X1 +  X2 + 
=  ok(f(X1,X2))

proper(a()) =  
>= 
=  ok(a())

proper(b()) =  
>= 
=  ok(b())

top(ok(X)) =   X + 
>=  X + 
=  top(active(X))

* Step 4: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
f(mark(X1),X2) -> mark(f(X1,X2))
top(ok(X)) -> top(active(X))
- Weak TRS:
active(b()) -> mark(a())
f(ok(X1),ok(X2)) -> ok(f(X1,X2))
proper(a()) -> ok(a())
proper(b()) -> ok(b())
top(mark(X)) -> top(proper(X))
- Signature:
{active/1,f/2,proper/1,top/1} / {a/0,b/0,mark/1,ok/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {active,f,proper,top} and constructors {a,b,mark,ok}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(mark) = {1},
uargs(ok) = {1},
uargs(top) = {1}

Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(a) = 
p(active) =  x1 + 
p(b) = 
p(f) =  x1 + 
p(mark) =  x1 + 
p(ok) =  x1 + 
p(proper) =  x1 + 
p(top) =  x1 + 

Following rules are strictly oriented:
top(ok(X)) =  X + 
>  X + 
= top(active(X))

Following rules are (at-least) weakly oriented:
active(b()) =  
>= 
=  mark(a())

f(mark(X1),X2) =   X1 + 
>=  X1 + 
=  mark(f(X1,X2))

f(ok(X1),ok(X2)) =   X1 + 
>=  X1 + 
=  ok(f(X1,X2))

proper(a()) =  
>= 
=  ok(a())

proper(b()) =  
>= 
=  ok(b())

top(mark(X)) =   X + 
>=  X + 
=  top(proper(X))

Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 5: WeightGap WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
f(mark(X1),X2) -> mark(f(X1,X2))
- Weak TRS:
active(b()) -> mark(a())
f(ok(X1),ok(X2)) -> ok(f(X1,X2))
proper(a()) -> ok(a())
proper(b()) -> ok(b())
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Signature:
{active/1,f/2,proper/1,top/1} / {a/0,b/0,mark/1,ok/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {active,f,proper,top} and constructors {a,b,mark,ok}
+ Applied Processor:
WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny}
+ Details:
The weightgap principle applies using the following nonconstant growth matrix-interpretation:
We apply a matrix interpretation of kind constructor based matrix interpretation:
The following argument positions are considered usable:
uargs(mark) = {1},
uargs(ok) = {1},
uargs(top) = {1}

Following symbols are considered usable:
all
TcT has computed the following interpretation:
p(a) = 
p(active) =  x1 + 
p(b) = 
p(f) =  x1 +  x2 + 
p(mark) =  x1 + 
p(ok) =  x1 + 
p(proper) =  x1 + 
p(top) =  x1 + 

Following rules are strictly oriented:
f(mark(X1),X2) =  X1 +  X2 + 
>  X1 +  X2 + 
= mark(f(X1,X2))

Following rules are (at-least) weakly oriented:
active(b()) =  
>= 
=  mark(a())

f(ok(X1),ok(X2)) =   X1 +  X2 + 
>=  X1 +  X2 + 
=  ok(f(X1,X2))

proper(a()) =  
>= 
=  ok(a())

proper(b()) =  
>= 
=  ok(b())

top(mark(X)) =   X + 
>=  X + 
=  top(proper(X))

top(ok(X)) =   X + 
>=  X + 
=  top(active(X))

Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 6: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
active(b()) -> mark(a())
f(mark(X1),X2) -> mark(f(X1,X2))
f(ok(X1),ok(X2)) -> ok(f(X1,X2))
proper(a()) -> ok(a())
proper(b()) -> ok(b())
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Signature:
{active/1,f/2,proper/1,top/1} / {a/0,b/0,mark/1,ok/1}
- Obligation:
innermost runtime complexity wrt. defined symbols {active,f,proper,top} and constructors {a,b,mark,ok}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))
```