Problem CSR 04 Ex9 Luc06

LMPO

Execution Time (secs)
0.023
Answer
MAYBE
InputCSR 04 Ex9 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.026
Answer
MAYBE
InputCSR 04 Ex9 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.037
Answer
MAYBE
InputCSR 04 Ex9 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.029
Answer
MAYBE
InputCSR 04 Ex9 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.032
Answer
MAYBE
InputCSR 04 Ex9 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.031
Answer
MAYBE
InputCSR 04 Ex9 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..