LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, l1)
, ifappend(l1, l2, nil()) -> l2
, ifappend(l1, l2, cons(x, l)) -> cons(x, append(l, l2))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, l1)
, ifappend(l1, l2, nil()) -> l2
, ifappend(l1, l2, cons(x, l)) -> cons(x, append(l, l2))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, l1)
, ifappend(l1, l2, nil()) -> l2
, ifappend(l1, l2, cons(x, l)) -> cons(x, append(l, l2))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, l1)
, ifappend(l1, l2, nil()) -> l2
, ifappend(l1, l2, cons(x, l)) -> cons(x, append(l, l2))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, l1)
, ifappend(l1, l2, nil()) -> l2
, ifappend(l1, l2, cons(x, l)) -> cons(x, append(l, l2))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ is_empty(nil()) -> true()
, is_empty(cons(x, l)) -> false()
, hd(cons(x, l)) -> x
, tl(cons(x, l)) -> l
, append(l1, l2) -> ifappend(l1, l2, l1)
, ifappend(l1, l2, nil()) -> l2
, ifappend(l1, l2, cons(x, l)) -> cons(x, append(l, l2))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..