Problem Rubio 04 nestrec

Tool LMPO

Execution Time
0.023
Answer
MAYBE
InputRubio 04 nestrec

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.030
Answer
MAYBE
InputRubio 04 nestrec

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.023
Answer
MAYBE
InputRubio 04 nestrec

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.022
Answer
MAYBE
InputRubio 04 nestrec

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.025
Answer
MAYBE
InputRubio 04 nestrec

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.027
Answer
MAYBE
InputRubio 04 nestrec

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..