LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(empty(), l) -> l
, f(cons(x, k), l) -> g(k, l, cons(x, k))
, g(a, b, c) -> f(a, cons(b, c))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(empty(), l) -> l
, f(cons(x, k), l) -> g(k, l, cons(x, k))
, g(a, b, c) -> f(a, cons(b, c))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ f(empty(), l) -> l
, f(cons(x, k), l) -> g(k, l, cons(x, k))
, g(a, b, c) -> f(a, cons(b, c))}
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:
{ f(empty(), l) -> l
, f(cons(x, k), l) -> g(k, l, cons(x, k))
, g(a, b, c) -> f(a, cons(b, c))}
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:
{ f(empty(), l) -> l
, f(cons(x, k), l) -> g(k, l, cons(x, k))
, g(a, b, c) -> f(a, cons(b, c))}
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:
{ f(empty(), l) -> l
, f(cons(x, k), l) -> g(k, l, cons(x, k))
, g(a, b, c) -> f(a, cons(b, c))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..