Problem Strategy outermost added 08 muladd

LMPO

Execution Time (secs)
0.035
Answer
MAYBE
InputStrategy outermost added 08 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.060
Answer
MAYBE
InputStrategy outermost added 08 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.067
Answer
MAYBE
InputStrategy outermost added 08 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.039
Answer
MAYBE
InputStrategy outermost added 08 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.054
Answer
MAYBE
InputStrategy outermost added 08 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.039
Answer
MAYBE
InputStrategy outermost added 08 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..