interpretations
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ a__f(X) -> f(X)
, a__f(f(a())) -> a__f(g(f(a())))
, mark(f(X)) -> a__f(mark(X))
, mark(a()) -> a()
, mark(g(X)) -> g(X) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(a__f) = {1}, Uargs(f) = {}, Uargs(g) = {}, Uargs(mark) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[a__f](x1) = [1] x1 + [3]
[f](x1) = [1] x1 + [2]
[a] = [3]
[g](x1) = [1]
[mark](x1) = [2] x1 + [2]
This order satisfies following ordering constraints
[a__f(X)] = [1] X + [3]
> [1] X + [2]
= [f(X)]
[a__f(f(a()))] = [8]
> [4]
= [a__f(g(f(a())))]
[mark(f(X))] = [2] X + [6]
> [2] X + [5]
= [a__f(mark(X))]
[mark(a())] = [8]
> [3]
= [a()]
[mark(g(X))] = [4]
> [1]
= [g(X)]
Hurray, we answered YES(?,O(n^1))
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__f(f(a())) -> a__f(g(f(a())))
, mark(f(X)) -> a__f(mark(X))
, mark(a()) -> a()
, mark(g(X)) -> g(X)
, a__f(X) -> f(X) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__f(f(a())) -> a__f(g(f(a())))
, mark(f(X)) -> a__f(mark(X))
, mark(a()) -> a()
, mark(g(X)) -> g(X)
, a__f(X) -> f(X) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__f(f(a())) -> a__f(g(f(a())))
, mark(f(X)) -> a__f(mark(X))
, mark(a()) -> a()
, mark(g(X)) -> g(X)
, a__f(X) -> f(X) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__f(f(a())) -> a__f(g(f(a())))
, mark(f(X)) -> a__f(mark(X))
, mark(a()) -> a()
, mark(g(X)) -> g(X)
, a__f(X) -> f(X) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..