Problem Der95 27

Tool Bounds

Execution Time	60.031445ms
Answer	TIMEOUT
Input	Der95 27

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.14124393ms
Answer	YES(?,O(n^2))
Input	Der95 27

stdout:

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

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

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

Tool EDA

Execution Time	0.23245597ms
Answer	YES(?,O(n^2))
Input	Der95 27

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	0.44053602ms
Answer	YES(?,O(n^2))
Input	Der95 27

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

Execution Time	9.895396e-2ms
Answer	YES(?,O(n^2))
Input	Der95 27

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	5.8943033e-2ms
Answer	YES(?,O(n^2))
Input	Der95 27

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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