Problem Waldmann 07 size12 size-12-alpha-3-num-296

Tool LMPO

Execution Time
0.027
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-296

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> x1
     , a(b(b(x1))) -> b(b(b(a(a(c(x1))))))
     , c(b(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.029
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-296

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> x1
     , a(b(b(x1))) -> b(b(b(a(a(c(x1))))))
     , c(b(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.039
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-296

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> x1
     , a(b(b(x1))) -> b(b(b(a(a(c(x1))))))
     , c(b(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.033
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-296

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> x1
     , a(b(b(x1))) -> b(b(b(a(a(c(x1))))))
     , c(b(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.025
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-296

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> x1
     , a(b(b(x1))) -> b(b(b(a(a(c(x1))))))
     , c(b(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.038
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-296

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(x1) -> x1
     , a(b(b(x1))) -> b(b(b(a(a(c(x1))))))
     , c(b(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..