Problem Mixed outermost non-lin1

LMPO

Execution Time (secs)
0.032
Answer
MAYBE
InputMixed outermost non-lin1
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.022
Answer
MAYBE
InputMixed outermost non-lin1
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.028
Answer
MAYBE
InputMixed outermost non-lin1
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.042
Answer
MAYBE
InputMixed outermost non-lin1
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.020
Answer
MAYBE
InputMixed outermost non-lin1
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.025
Answer
MAYBE
InputMixed outermost non-lin1
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..