Problem CSR 04 Ex1 GM99

Tool LMPO

Execution Time
0.026
Answer
MAYBE
InputCSR 04 Ex1 GM99

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.023
Answer
MAYBE
InputCSR 04 Ex1 GM99

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.023
Answer
MAYBE
InputCSR 04 Ex1 GM99

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.024
Answer
MAYBE
InputCSR 04 Ex1 GM99

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.023
Answer
MAYBE
InputCSR 04 Ex1 GM99

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.028
Answer
MAYBE
InputCSR 04 Ex1 GM99

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..