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