Problem SK90 2.36

LMPO

Execution Time (secs)
0.042
Answer
MAYBE
InputSK90 2.36
MAYBE

We consider the following Problem:

  Strict Trs:
    {  implies(not(x), y) -> or(x, y)
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(x, or(y, z)) -> or(y, implies(x, z))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.040
Answer
MAYBE
InputSK90 2.36
MAYBE

We consider the following Problem:

  Strict Trs:
    {  implies(not(x), y) -> or(x, y)
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(x, or(y, z)) -> or(y, implies(x, z))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.031
Answer
MAYBE
InputSK90 2.36
MAYBE

We consider the following Problem:

  Strict Trs:
    {  implies(not(x), y) -> or(x, y)
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(x, or(y, z)) -> or(y, implies(x, z))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.053
Answer
MAYBE
InputSK90 2.36
MAYBE

We consider the following Problem:

  Strict Trs:
    {  implies(not(x), y) -> or(x, y)
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(x, or(y, z)) -> or(y, implies(x, z))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.074
Answer
MAYBE
InputSK90 2.36
MAYBE

We consider the following Problem:

  Strict Trs:
    {  implies(not(x), y) -> or(x, y)
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(x, or(y, z)) -> or(y, implies(x, z))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.042
Answer
MAYBE
InputSK90 2.36
MAYBE

We consider the following Problem:

  Strict Trs:
    {  implies(not(x), y) -> or(x, y)
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(x, or(y, z)) -> or(y, implies(x, z))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..