LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, x) -> f(0(), 1())
, 0() -> 2()
, 1() -> 2()
, f(x, 2()) -> 2()
, f(2(), x) -> 2()}
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(x, x) -> f(0(), 1())
, 0() -> 2()
, 1() -> 2()
, f(x, 2()) -> 2()
, f(2(), x) -> 2()}
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(x, x) -> f(0(), 1())
, 0() -> 2()
, 1() -> 2()
, f(x, 2()) -> 2()
, f(2(), x) -> 2()}
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(x, x) -> f(0(), 1())
, 0() -> 2()
, 1() -> 2()
, f(x, 2()) -> 2()
, f(2(), x) -> 2()}
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(x, x) -> f(0(), 1())
, 0() -> 2()
, 1() -> 2()
, f(x, 2()) -> 2()
, f(2(), x) -> 2()}
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(x, x) -> f(0(), 1())
, 0() -> 2()
, 1() -> 2()
, f(x, 2()) -> 2()
, f(2(), x) -> 2()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..