Problem SK90 4.15

Tool Bounds

Execution Time	60.03087ms
Answer	TIMEOUT
Input	SK90 4.15

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.10510588ms
Answer	MAYBE
Input	SK90 4.15

stdout:

MAYBE

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

Tool EDA

Execution Time	0.19730401ms
Answer	YES(?,O(n^2))
Input	SK90 4.15

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.35630107ms
Answer	YES(?,O(n^2))
Input	SK90 4.15

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  -(+(x, y), y) -> x
     , +(-(x, y), z) -> -(+(x, z), 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:
   -(x1, x2) = [1 0] x1 + [1 0] x2 + [0]
               [0 1]      [0 0]      [3]
   +(x1, x2) = [1 1] x1 + [1 2] x2 + [1]
               [0 1]      [0 1]      [1]

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

Tool TRI

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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