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