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