interpretations
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ f(c(X, s(Y))) -> f(c(s(X), Y))
, g(c(s(X), Y)) -> f(c(X, s(Y))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(f) = {}, Uargs(c) = {}, Uargs(s) = {}, Uargs(g) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[f](x1) = [1] x1 + [0]
[c](x1, x2) = [1] x2 + [0]
[s](x1) = [1] x1 + [1]
[g](x1) = [2] x1 + [3]
This order satisfies following ordering constraints
[f(c(X, s(Y)))] = [1] Y + [1]
> [1] Y + [0]
= [f(c(s(X), Y))]
[g(c(s(X), Y))] = [2] Y + [3]
> [1] Y + [1]
= [f(c(X, s(Y)))]
Hurray, we answered YES(?,O(n^1))
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(c(X, s(Y))) -> f(c(s(X), Y))
, g(c(s(X), Y)) -> f(c(X, s(Y))) }
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:
{ f(c(X, s(Y))) -> f(c(s(X), Y))
, g(c(s(X), Y)) -> f(c(X, s(Y))) }
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:
{ f(c(X, s(Y))) -> f(c(s(X), Y))
, g(c(s(X), Y)) -> f(c(X, s(Y))) }
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:
{ f(c(X, s(Y))) -> f(c(s(X), Y))
, g(c(s(X), Y)) -> f(c(X, s(Y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..