Problem SK90 2.47

Tool Bounds

Execution Time	60.024387ms
Answer	TIMEOUT
Input	SK90 2.47

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a(c(x)) -> x
     , a(b(x)) -> b(a(x))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	8.790493e-2ms
Answer	MAYBE
Input	SK90 2.47

stdout:

MAYBE

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

Tool EDA

Execution Time	0.34325695ms
Answer	YES(?,O(n^2))
Input	SK90 2.47

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  a(c(x)) -> x
     , a(b(x)) -> b(a(x))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	0.431952ms
Answer	YES(?,O(n^2))
Input	SK90 2.47

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  a(c(x)) -> x
     , a(b(x)) -> b(a(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:
   b(x1) = [1 0] x1 + [0]
           [0 1]      [1]
   a(x1) = [1 1] x1 + [0]
           [0 1]      [0]
   c(x1) = [1 2] x1 + [3]
           [0 1]      [3]

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

Tool TRI

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  a(c(x)) -> x
     , a(b(x)) -> b(a(x))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   b(x1) = [1 0] x1 + [2]
           [0 1]      [2]
   a(x1) = [1 1] x1 + [0]
           [0 1]      [3]
   c(x1) = [1 1] x1 + [0]
           [0 1]      [1]

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

Tool TRI2

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  a(c(x)) -> x
     , a(b(x)) -> b(a(x))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   b(x1) = [1 0] x1 + [2]
           [0 1]      [2]
   a(x1) = [1 1] x1 + [0]
           [0 1]      [3]
   c(x1) = [1 1] x1 + [0]
           [0 1]      [1]

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