LMPO
Execution Time (secs) | 0.039 |
Answer | MAYBE |
Input | AG01 3.38 |
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.076 |
Answer | MAYBE |
Input | AG01 3.38 |
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.038 |
Answer | MAYBE |
Input | AG01 3.38 |
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.045 |
Answer | MAYBE |
Input | AG01 3.38 |
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.037 |
Answer | MAYBE |
Input | AG01 3.38 |
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.049 |
Answer | MAYBE |
Input | AG01 3.38 |
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..