Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, empty()) -> x
, f(empty(), cons(a, k)) -> f(cons(a, k), k)
, f(cons(a, k), y) -> f(y, k)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, empty()) -> x
, f(empty(), cons(a, k)) -> f(cons(a, k), k)
, f(cons(a, k), y) -> f(y, k)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, empty()) -> x
, f(empty(), cons(a, k)) -> f(cons(a, k), k)
, f(cons(a, k), y) -> f(y, k)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, empty()) -> x
, f(empty(), cons(a, k)) -> f(cons(a, k), k)
, f(cons(a, k), y) -> f(y, k)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, empty()) -> x
, f(empty(), cons(a, k)) -> f(cons(a, k), k)
, f(cons(a, k), y) -> f(y, k)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, empty()) -> x
, f(empty(), cons(a, k)) -> f(cons(a, k), k)
, f(cons(a, k), y) -> f(y, k)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..