Problem CSR 04 Ex16 Luc06

LMPO

Execution Time (secs)
0.034
Answer
MAYBE
InputCSR 04 Ex16 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.022
Answer
MAYBE
InputCSR 04 Ex16 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.017
Answer
MAYBE
InputCSR 04 Ex16 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.020
Answer
MAYBE
InputCSR 04 Ex16 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.022
Answer
MAYBE
InputCSR 04 Ex16 Luc06
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(X, X) -> f(a(), 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.020
Answer
MAYBE
InputCSR 04 Ex16 Luc06
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..