interpretations
Execution Time (secs) | - |
Answer | TIMEOUT |
Input | SK90 2.26 |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ f(0()) -> 0()
, f(s(0())) -> s(0())
, f(s(s(x))) -> p(h(g(x)))
, f(s(s(x))) -> +(p(g(x)), q(g(x)))
, p(pair(x, y)) -> x
, h(x) -> pair(+(p(x), q(x)), p(x))
, g(0()) -> pair(s(0()), s(0()))
, g(s(x)) -> h(g(x))
, g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x)))
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))
, q(pair(x, y)) -> y }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 2.26 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> 0()
, f(s(0())) -> s(0())
, f(s(s(x))) -> p(h(g(x)))
, g(0()) -> pair(s(0()), s(0()))
, g(s(x)) -> h(g(x))
, h(x) -> pair(+(p(x), q(x)), p(x))
, p(pair(x, y)) -> x
, q(pair(x, y)) -> y
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))
, f(s(s(x))) -> +(p(g(x)), q(g(x)))
, g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 2.26 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ f(0()) -> 0()
, f(s(0())) -> s(0())
, f(s(s(x))) -> p(h(g(x)))
, g(0()) -> pair(s(0()), s(0()))
, g(s(x)) -> h(g(x))
, h(x) -> pair(+(p(x), q(x)), p(x))
, p(pair(x, y)) -> x
, q(pair(x, y)) -> y
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))
, f(s(s(x))) -> +(p(g(x)), q(g(x)))
, g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
f > p, f > h, f > g, f > +, f > q, h > p, h > pair, h > +, h > q,
g > s, g > p, g > h, g > pair, g > +, g > q, + > s .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.403 |
Answer | MAYBE |
Input | SK90 2.26 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> 0()
, f(s(0())) -> s(0())
, f(s(s(x))) -> p(h(g(x)))
, g(0()) -> pair(s(0()), s(0()))
, g(s(x)) -> h(g(x))
, h(x) -> pair(+(p(x), q(x)), p(x))
, p(pair(x, y)) -> x
, q(pair(x, y)) -> y
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))
, f(s(s(x))) -> +(p(g(x)), q(g(x)))
, g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.262 |
Answer | MAYBE |
Input | SK90 2.26 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> 0()
, f(s(0())) -> s(0())
, f(s(s(x))) -> p(h(g(x)))
, g(0()) -> pair(s(0()), s(0()))
, g(s(x)) -> h(g(x))
, h(x) -> pair(+(p(x), q(x)), p(x))
, p(pair(x, y)) -> x
, q(pair(x, y)) -> y
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y))
, f(s(s(x))) -> +(p(g(x)), q(g(x)))
, g(s(x)) -> pair(+(p(g(x)), q(g(x))), p(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..