Problem Rubio 04 gmnp

Tool LMPO

Execution Time
0.031
Answer
MAYBE
InputRubio 04 gmnp

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.055
Answer
MAYBE
InputRubio 04 gmnp

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.035
Answer
MAYBE
InputRubio 04 gmnp

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.039
Answer
MAYBE
InputRubio 04 gmnp

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.034
Answer
MAYBE
InputRubio 04 gmnp

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.023
Answer
MAYBE
InputRubio 04 gmnp

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..