Problem SK90 2.03

Tool Bounds

Execution Time	60.031307ms
Answer	TIMEOUT
Input	SK90 2.03

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  minus(f(x, y)) -> f(minus(y), minus(x))
     , minus(h(x)) -> h(minus(x))
     , minus(minus(x)) -> x}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.41006184ms
Answer	MAYBE
Input	SK90 2.03

stdout:

MAYBE

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

Tool EDA

Execution Time	0.33339882ms
Answer	YES(?,O(n^2))
Input	SK90 2.03

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  minus(f(x, y)) -> f(minus(y), minus(x))
     , minus(h(x)) -> h(minus(x))
     , minus(minus(x)) -> x}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	0.5003412ms
Answer	YES(?,O(n^2))
Input	SK90 2.03

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	0.14282894ms
Answer	YES(?,O(n^2))
Input	SK90 2.03

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  minus(f(x, y)) -> f(minus(y), minus(x))
     , minus(h(x)) -> h(minus(x))
     , minus(minus(x)) -> x}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	0.112699986ms
Answer	YES(?,O(n^2))
Input	SK90 2.03

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  minus(f(x, y)) -> f(minus(y), minus(x))
     , minus(h(x)) -> h(minus(x))
     , minus(minus(x)) -> x}
  StartTerms: all
  Strategy: none

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

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

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