Problem Mixed TRS jones5

LMPO

Execution Time (secs)
0.039
Answer
MAYBE
InputMixed TRS jones5
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, empty()) -> x
     , f(empty(), cons(a, k)) -> f(cons(a, k), k)
     , f(cons(a, k), y) -> f(y, k)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.033
Answer
MAYBE
InputMixed TRS jones5
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, empty()) -> x
     , f(empty(), cons(a, k)) -> f(cons(a, k), k)
     , f(cons(a, k), y) -> f(y, k)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.030
Answer
MAYBE
InputMixed TRS jones5
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, empty()) -> x
     , f(empty(), cons(a, k)) -> f(cons(a, k), k)
     , f(cons(a, k), y) -> f(y, k)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.032
Answer
MAYBE
InputMixed TRS jones5
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, empty()) -> x
     , f(empty(), cons(a, k)) -> f(cons(a, k), k)
     , f(cons(a, k), y) -> f(y, k)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.032
Answer
MAYBE
InputMixed TRS jones5
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, empty()) -> x
     , f(empty(), cons(a, k)) -> f(cons(a, k), k)
     , f(cons(a, k), y) -> f(y, k)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.027
Answer
MAYBE
InputMixed TRS jones5
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(x, empty()) -> x
     , f(empty(), cons(a, k)) -> f(cons(a, k), k)
     , f(cons(a, k), y) -> f(y, k)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..