Problem SK90 4.04

Tool Bounds

Execution Time	25.263443ms
Answer	MAYBE
Input	SK90 4.04

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	11.68521ms
Answer	MAYBE
Input	SK90 4.04

stdout:

MAYBE

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

Tool EDA

Execution Time	0.5488441ms
Answer	YES(?,O(n^2))
Input	SK90 4.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.66885686ms
Answer	YES(?,O(n^2))
Input	SK90 4.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	0.18675303ms
Answer	YES(?,O(n^2))
Input	SK90 4.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	0.15720892ms
Answer	YES(?,O(n^2))
Input	SK90 4.04

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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