Problem SK90 4.37

Tool Bounds

Execution Time	3.3493042e-2ms
Answer	YES(?,O(n^1))
Input	SK90 4.37

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

Proof:
  The problem is match-bounded by 2.
  The enriched problem is compatible with the following automaton:
  {  a_0(1) -> 1
   , a_1(1) -> 2
   , a_2(1) -> 3
   , b_0(1) -> 1
   , b_1(2) -> 1
   , b_1(2) -> 2
   , b_1(2) -> 3
   , b_2(3) -> 2
   , b_2(3) -> 3}

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

Tool CDI

Execution Time	0.2625599ms
Answer	YES(?,O(n^2))
Input	SK90 4.37

stdout:

YES(?,O(n^2))
QUADRATIC upper bound on the derivational complexity

This TRS is terminating using the deltarestricted interpretation
a(delta, X0) = + 1*X0 + 0 + 1*X0*delta + 0*delta
b(delta, X0) = + 0*X0 + 2 + 2*X0*delta + 0*delta
a_tau_1(delta) = delta/(1 + 1 * delta)
b_tau_1(delta) = delta/(0 + 2 * delta)

Time: 0.225079 seconds
Statistics:
Number of monomials: 93
Last formula building started for bound 3
Last SAT solving started for bound 3

Tool EDA

Execution Time	5.759096e-2ms
Answer	YES(?,O(n^1))
Input	SK90 4.37

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.17445993ms
Answer	YES(?,O(n^1))
Input	SK90 4.37

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI

Execution Time	7.584381e-2ms
Answer	YES(?,O(n^1))
Input	SK90 4.37

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	7.0206165e-2ms
Answer	YES(?,O(n^1))
Input	SK90 4.37

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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