Problem SK90 2.04

Tool Bounds

Execution Time	15.877592ms
Answer	MAYBE
Input	SK90 2.04

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	0.1952002ms
Answer	MAYBE
Input	SK90 2.04

stdout:

MAYBE

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

Tool EDA

Execution Time	0.3024211ms
Answer	YES(?,O(n^2))
Input	SK90 2.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.452389ms
Answer	YES(?,O(n^2))
Input	SK90 2.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	0.115259886ms
Answer	YES(?,O(n^2))
Input	SK90 2.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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