interpretations
Execution Time (secs) | - |
Answer | TIMEOUT |
Input | SK90 4.24 |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ rev(nil()) -> nil()
, rev(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z)))) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.24 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z)))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.24 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z)))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.190 |
Answer | MAYBE |
Input | SK90 4.24 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z)))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.257 |
Answer | MAYBE |
Input | SK90 4.24 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z)))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..