interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ a__f(X) -> f(X)
, a__f(0()) -> cons(0(), f(s(0())))
, a__f(s(0())) -> a__f(a__p(s(0())))
, a__p(X) -> p(X)
, a__p(s(X)) -> mark(X)
, mark(0()) -> 0()
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(f(X)) -> a__f(mark(X))
, mark(s(X)) -> s(mark(X))
, mark(p(X)) -> a__p(mark(X)) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__f(0()) -> cons(0(), f(s(0())))
, a__f(s(0())) -> a__f(a__p(s(0())))
, a__p(s(X)) -> mark(X)
, mark(f(X)) -> a__f(mark(X))
, mark(p(X)) -> a__p(mark(X))
, mark(0()) -> 0()
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(s(X)) -> s(mark(X))
, a__f(X) -> f(X)
, a__p(X) -> p(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(0()) -> cons(0(), f(s(0())))
, a__f(s(0())) -> a__f(a__p(s(0())))
, a__p(s(X)) -> mark(X)
, mark(f(X)) -> a__f(mark(X))
, mark(p(X)) -> a__p(mark(X))
, mark(0()) -> 0()
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(s(X)) -> s(mark(X))
, a__f(X) -> f(X)
, a__p(X) -> p(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(0()) -> cons(0(), f(s(0())))
, a__f(s(0())) -> a__f(a__p(s(0())))
, a__p(s(X)) -> mark(X)
, mark(f(X)) -> a__f(mark(X))
, mark(p(X)) -> a__p(mark(X))
, mark(0()) -> 0()
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(s(X)) -> s(mark(X))
, a__f(X) -> f(X)
, a__p(X) -> p(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(0()) -> cons(0(), f(s(0())))
, a__f(s(0())) -> a__f(a__p(s(0())))
, a__p(s(X)) -> mark(X)
, mark(f(X)) -> a__f(mark(X))
, mark(p(X)) -> a__p(mark(X))
, mark(0()) -> 0()
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(s(X)) -> s(mark(X))
, a__f(X) -> f(X)
, a__p(X) -> p(X) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..