Problem SK90 2.36

Tool Bounds

Execution Time	60.031597ms
Answer	TIMEOUT
Input	SK90 2.36

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  implies(x, or(y, z)) -> or(y, implies(x, z))
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(not(x), y) -> or(x, y)}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.16661501ms
Answer	MAYBE
Input	SK90 2.36

stdout:

MAYBE

Statistics:
Number of monomials: 185
Last formula building started for bound 3
Last SAT solving started for bound 3

Tool EDA

Execution Time	0.35617304ms
Answer	YES(?,O(n^2))
Input	SK90 2.36

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  implies(x, or(y, z)) -> or(y, implies(x, z))
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(not(x), y) -> or(x, y)}
  StartTerms: all
  Strategy: none

Certificate: YES(?,O(n^2))

Proof:
  We have the following EDA-non-satisfying matrix interpretation:
  Interpretation Functions:
   not(x1) = [1 2] x1 + [2]
             [0 0]      [2]
   implies(x1, x2) = [1 1] x1 + [1 1] x2 + [2]
                     [0 0]      [0 1]      [2]
   or(x1, x2) = [1 1] x1 + [1 0] x2 + [0]
                [0 0]      [0 1]      [2]

Hurray, we answered YES(?,O(n^2))

Tool IDA

Execution Time	0.57050586ms
Answer	YES(?,O(n^2))
Input	SK90 2.36

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  implies(x, or(y, z)) -> or(y, implies(x, z))
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(not(x), y) -> or(x, y)}
  StartTerms: all
  Strategy: none

Certificate: YES(?,O(n^2))

Proof:
  We have the following EDA-non-satisfying and IDA(2)-non-satisfying matrix interpretation:
  Interpretation Functions:
   not(x1) = [1 1] x1 + [0]
             [0 1]      [2]
   implies(x1, x2) = [1 2] x1 + [1 1] x2 + [0]
                     [0 0]      [0 1]      [3]
   or(x1, x2) = [1 2] x1 + [1 0] x2 + [0]
                [0 0]      [0 1]      [1]

Hurray, we answered YES(?,O(n^2))

Tool TRI

Execution Time	0.13200712ms
Answer	YES(?,O(n^2))
Input	SK90 2.36

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  implies(x, or(y, z)) -> or(y, implies(x, z))
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(not(x), y) -> or(x, y)}
  StartTerms: all
  Strategy: none

Certificate: YES(?,O(n^2))

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   not(x1) = [1 3] x1 + [2]
             [0 1]      [3]
   implies(x1, x2) = [1 2] x1 + [1 1] x2 + [0]
                     [0 1]      [0 1]      [0]
   or(x1, x2) = [1 3] x1 + [1 0] x2 + [0]
                [0 1]      [0 1]      [1]

Hurray, we answered YES(?,O(n^2))

Tool TRI2

Execution Time	9.161615e-2ms
Answer	YES(?,O(n^2))
Input	SK90 2.36

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  implies(x, or(y, z)) -> or(y, implies(x, z))
     , implies(not(x), or(y, z)) -> implies(y, or(x, z))
     , implies(not(x), y) -> or(x, y)}
  StartTerms: all
  Strategy: none

Certificate: YES(?,O(n^2))

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   not(x1) = [1 3] x1 + [1]
             [0 1]      [3]
   implies(x1, x2) = [1 1] x1 + [1 1] x2 + [0]
                     [0 1]      [0 1]      [0]
   or(x1, x2) = [1 3] x1 + [1 0] x2 + [0]
                [0 1]      [0 1]      [1]

Hurray, we answered YES(?,O(n^2))