Problem SK90 4.11

Tool Bounds

Execution Time	60.029465ms
Answer	TIMEOUT
Input	SK90 4.11

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.2462411ms
Answer	MAYBE
Input	SK90 4.11

stdout:

MAYBE

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

Tool EDA

Execution Time	0.389261ms
Answer	YES(?,O(n^2))
Input	SK90 4.11

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.508903ms
Answer	YES(?,O(n^2))
Input	SK90 4.11

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	0.18790197ms
Answer	YES(?,O(n^2))
Input	SK90 4.11

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	0.11208105ms
Answer	YES(?,O(n^2))
Input	SK90 4.11

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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