Problem SK90 4.19

Tool Bounds

Execution Time	2.8339863e-2ms
Answer	MAYBE
Input	SK90 4.19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  None of the processors succeeded.

  Details of failed attempt(s):
  -----------------------------
    1) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.

    2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.


Arrrr..

Tool CDI

Execution Time	60.041424ms
Answer	TIMEOUT
Input	SK90 4.19

stdout:

TIMEOUT

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

Tool EDA

Execution Time	9.94122e-2ms
Answer	YES(?,O(n^1))
Input	SK90 4.19

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.27647114ms
Answer	YES(?,O(n^1))
Input	SK90 4.19

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI

Execution Time	9.031296e-2ms
Answer	YES(?,O(n^1))
Input	SK90 4.19

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	0.24380112ms
Answer	YES(?,O(n^1))
Input	SK90 4.19

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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