Problem AG01 3.33

Tool LMPO

Execution Time
0.042
Answer
MAYBE
InputAG01 3.33

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.058
Answer
MAYBE
InputAG01 3.33

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.042
Answer
MAYBE
InputAG01 3.33

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.053
Answer
MAYBE
InputAG01 3.33

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.045
Answer
MAYBE
InputAG01 3.33

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.045
Answer
MAYBE
InputAG01 3.33

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..