interpretations
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 2.39 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(.(x, y)) -> ++(rev(y), .(x, nil()))
, ++(nil(), y) -> y
, ++(.(x, y), z) -> .(x, ++(y, z))
, car(.(x, y)) -> x
, cdr(.(x, y)) -> y
, null(nil()) -> true()
, null(.(x, y)) -> false() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 2.39 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(.(x, y)) -> ++(rev(y), .(x, nil()))
, car(.(x, y)) -> x
, cdr(.(x, y)) -> y
, null(nil()) -> true()
, null(.(x, y)) -> false()
, ++(nil(), y) -> y
, ++(.(x, y), z) -> .(x, ++(y, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 2.39 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ rev(nil()) -> nil()
, rev(.(x, y)) -> ++(rev(y), .(x, nil()))
, car(.(x, y)) -> x
, cdr(.(x, y)) -> y
, null(nil()) -> true()
, null(.(x, y)) -> false()
, ++(nil(), y) -> y
, ++(.(x, y), z) -> .(x, ++(y, z)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
rev > nil, rev > ., rev > ++, ++ > ., null > true, null > false .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.170 |
Answer | MAYBE |
Input | SK90 2.39 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(.(x, y)) -> ++(rev(y), .(x, nil()))
, car(.(x, y)) -> x
, cdr(.(x, y)) -> y
, null(nil()) -> true()
, null(.(x, y)) -> false()
, ++(nil(), y) -> y
, ++(.(x, y), z) -> .(x, ++(y, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.130 |
Answer | MAYBE |
Input | SK90 2.39 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(nil()) -> nil()
, rev(.(x, y)) -> ++(rev(y), .(x, nil()))
, car(.(x, y)) -> x
, cdr(.(x, y)) -> y
, null(nil()) -> true()
, null(.(x, y)) -> false()
, ++(nil(), y) -> y
, ++(.(x, y), z) -> .(x, ++(y, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..