Problem Rubio 04 gmnp

LMPO

Execution Time (secs)
0.031
Answer
MAYBE
InputRubio 04 gmnp
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..

MPO

Execution Time (secs)
0.055
Answer
MAYBE
InputRubio 04 gmnp
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..

POP*

Execution Time (secs)
0.035
Answer
MAYBE
InputRubio 04 gmnp
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..

POP* (PS)

Execution Time (secs)
0.039
Answer
MAYBE
InputRubio 04 gmnp
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..

Small POP*

Execution Time (secs)
0.034
Answer
MAYBE
InputRubio 04 gmnp
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..

Small POP* (PS)

Execution Time (secs)
0.023
Answer
MAYBE
InputRubio 04 gmnp
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..