Problem Mixed innermost muladd

LMPO

Execution Time (secs)
0.039
Answer
MAYBE
InputMixed innermost muladd
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

Execution Time (secs)
0.056
Answer
MAYBE
InputMixed innermost muladd
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*

Execution Time (secs)
0.038
Answer
MAYBE
InputMixed innermost muladd
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)

Execution Time (secs)
0.042
Answer
MAYBE
InputMixed innermost muladd
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*

Execution Time (secs)
0.029
Answer
MAYBE
InputMixed innermost muladd
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)

Execution Time (secs)
0.034
Answer
MAYBE
InputMixed innermost muladd
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..