interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ fact(X) -> if(zero(X), s(0()), prod(X, fact(p(X))))
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, zero(s(X)) -> false()
, zero(0()) -> true()
, prod(s(X), Y) -> add(Y, prod(X, Y))
, prod(0(), X) -> 0()
, p(s(X)) -> X
, add(s(X), Y) -> s(add(X, Y))
, add(0(), X) -> 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:
{ fact(X) -> if(zero(X), s(0()), prod(X, fact(p(X))))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, prod(0(), X) -> 0()
, prod(s(X), Y) -> add(Y, prod(X, Y))
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, zero(0()) -> true()
, zero(s(X)) -> false()
, p(s(X)) -> 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:
{ fact(X) -> if(zero(X), s(0()), prod(X, fact(p(X))))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, prod(0(), X) -> 0()
, prod(s(X), Y) -> add(Y, prod(X, Y))
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, zero(0()) -> true()
, zero(s(X)) -> false()
, p(s(X)) -> 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:
{ fact(X) -> if(zero(X), s(0()), prod(X, fact(p(X))))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, prod(0(), X) -> 0()
, prod(s(X), Y) -> add(Y, prod(X, Y))
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, zero(0()) -> true()
, zero(s(X)) -> false()
, p(s(X)) -> 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:
{ fact(X) -> if(zero(X), s(0()), prod(X, fact(p(X))))
, add(0(), X) -> X
, add(s(X), Y) -> s(add(X, Y))
, prod(0(), X) -> 0()
, prod(s(X), Y) -> add(Y, prod(X, Y))
, if(true(), X, Y) -> X
, if(false(), X, Y) -> Y
, zero(0()) -> true()
, zero(s(X)) -> false()
, p(s(X)) -> X }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..