Problem Transformed CSR 04 ExConc Zan97 FR

Tool Bounds

Execution Time	60.033485ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExConc Zan97 FR

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(activate(X))
     , activate(n__h(X)) -> h(activate(X))
     , f(X) -> n__f(X)
     , h(X) -> n__h(X)
     , f(X) -> g(n__h(n__f(X)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.34784102ms
Answer	MAYBE
Input	Transformed CSR 04 ExConc Zan97 FR

stdout:

MAYBE

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

Tool EDA

Execution Time	0.3751061ms
Answer	YES(?,O(n^2))
Input	Transformed CSR 04 ExConc Zan97 FR

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(activate(X))
     , activate(n__h(X)) -> h(activate(X))
     , f(X) -> n__f(X)
     , h(X) -> n__h(X)
     , f(X) -> g(n__h(n__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 + [2]
           [0 1]      [3]
   n__f(x1) = [1 0] x1 + [0]
              [0 1]      [3]
   n__h(x1) = [1 0] x1 + [1]
              [0 1]      [3]
   g(x1) = [1 0] x1 + [0]
           [0 0]      [3]
   h(x1) = [1 0] x1 + [3]
           [0 1]      [3]
   activate(x1) = [1 1] x1 + [1]
                  [0 1]      [0]

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

Tool IDA

Execution Time	0.59935904ms
Answer	YES(?,O(n^2))
Input	Transformed CSR 04 ExConc Zan97 FR

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(activate(X))
     , activate(n__h(X)) -> h(activate(X))
     , f(X) -> n__f(X)
     , h(X) -> n__h(X)
     , f(X) -> g(n__h(n__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 1]      [2]
   n__f(x1) = [1 0] x1 + [0]
              [0 1]      [2]
   n__h(x1) = [1 0] x1 + [0]
              [0 1]      [2]
   g(x1) = [1 0] x1 + [0]
           [0 0]      [1]
   h(x1) = [1 0] x1 + [1]
           [0 1]      [2]
   activate(x1) = [1 1] x1 + [1]
                  [0 1]      [0]

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

Tool TRI

Execution Time	0.16185188ms
Answer	YES(?,O(n^2))
Input	Transformed CSR 04 ExConc Zan97 FR

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(activate(X))
     , activate(n__h(X)) -> h(activate(X))
     , f(X) -> n__f(X)
     , h(X) -> n__h(X)
     , f(X) -> g(n__h(n__f(X)))}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	0.11250496ms
Answer	YES(?,O(n^2))
Input	Transformed CSR 04 ExConc Zan97 FR

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(activate(X))
     , activate(n__h(X)) -> h(activate(X))
     , f(X) -> n__f(X)
     , h(X) -> n__h(X)
     , f(X) -> g(n__h(n__f(X)))}
  StartTerms: all
  Strategy: none

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

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

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