LMPO
| Execution Time (secs) | 0.047 |
| Answer | MAYBE |
| Input | SK90 2.39 |
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.162 |
| Answer | YES(?,PRIMREC) |
| Input | SK90 2.39 |
YES(?,PRIMREC)
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,PRIMREC)
Proof:
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)
POP*
| Execution Time (secs) | 0.041 |
| Answer | MAYBE |
| Input | SK90 2.39 |
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.056 |
| Answer | MAYBE |
| Input | SK90 2.39 |
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.044 |
| Answer | MAYBE |
| Input | SK90 2.39 |
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.043 |
| Answer | MAYBE |
| Input | SK90 2.39 |
MAYBE
We consider the following Problem:
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))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..