Problem SK90 4.07

Tool Bounds

Execution Time	60.030712ms
Answer	TIMEOUT
Input	SK90 4.07

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  *(*(x, y), z) -> *(x, *(y, z))
     , *(x, 0()) -> 0()
     , *(1(), y) -> y
     , *(i(x), x) -> 1()}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.109050035ms
Answer	MAYBE
Input	SK90 4.07

stdout:

MAYBE

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

Tool EDA

Execution Time	0.33742905ms
Answer	YES(?,O(n^2))
Input	SK90 4.07

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  *(*(x, y), z) -> *(x, *(y, z))
     , *(x, 0()) -> 0()
     , *(1(), y) -> y
     , *(i(x), x) -> 1()}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	0.44083095ms
Answer	YES(?,O(n^2))
Input	SK90 4.07

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	0.1133461ms
Answer	YES(?,O(n^2))
Input	SK90 4.07

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  *(*(x, y), z) -> *(x, *(y, z))
     , *(x, 0()) -> 0()
     , *(1(), y) -> y
     , *(i(x), x) -> 1()}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  *(*(x, y), z) -> *(x, *(y, z))
     , *(x, 0()) -> 0()
     , *(1(), y) -> y
     , *(i(x), x) -> 1()}
  StartTerms: all
  Strategy: none

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

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

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