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