Problem AG01 innermost 4.20

Tool Bounds

Execution Time	60.0263ms
Answer	TIMEOUT
Input	AG01 innermost 4.20

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  g(0()) -> g(f(0()))
     , f(f(x)) -> f(x)}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.15446591ms
Answer	YES(?,O(n^2))
Input	AG01 innermost 4.20

stdout:

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

This TRS is terminating using the deltarestricted interpretation
0(delta) =  + 2 + 0*delta
g(delta, X0) =  + 0*X0 + 0 + 2*X0*delta + 0*delta
f(delta, X0) =  + 0*X0 + 0 + 1*X0*delta + 1*delta
g_tau_1(delta) = delta/(0 + 2 * delta)
f_tau_1(delta) = delta/(0 + 1 * delta)

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

Tool EDA

Execution Time	0.3224659ms
Answer	YES(?,O(n^2))
Input	AG01 innermost 4.20

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  g(0()) -> g(f(0()))
     , f(f(x)) -> f(x)}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	0.38111305ms
Answer	YES(?,O(n^2))
Input	AG01 innermost 4.20

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	0.16372705ms
Answer	YES(?,O(n^1))
Input	AG01 innermost 4.20

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {  g(0()) -> g(f(0()))
     , f(f(x)) -> f(x)}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	7.070899e-2ms
Answer	YES(?,O(n^1))
Input	AG01 innermost 4.20

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {  g(0()) -> g(f(0()))
     , f(f(x)) -> f(x)}
  StartTerms: all
  Strategy: none

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

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

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