Problem Transformed CSR 04 Ex15 Luc06 FR

Tool Bounds

Execution Time	60.034275ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex15 Luc06 FR

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__g(X)) -> g(activate(X))
     , activate(n__a()) -> a()
     , activate(n__f(X)) -> f(X)
     , g(X) -> n__g(X)
     , a() -> n__a()
     , f(X) -> n__f(X)
     , f(n__f(n__a())) -> f(n__g(n__f(n__a())))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	2.963967ms
Answer	MAYBE
Input	Transformed CSR 04 Ex15 Luc06 FR

stdout:

MAYBE

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

Tool EDA

Execution Time	1.7008588ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 Ex15 Luc06 FR

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__g(X)) -> g(activate(X))
     , activate(n__a()) -> a()
     , activate(n__f(X)) -> f(X)
     , g(X) -> n__g(X)
     , a() -> n__a()
     , f(X) -> n__f(X)
     , f(n__f(n__a())) -> f(n__g(n__f(n__a())))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	4.09982ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 Ex15 Luc06 FR

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__g(X)) -> g(activate(X))
     , activate(n__a()) -> a()
     , activate(n__f(X)) -> f(X)
     , g(X) -> n__g(X)
     , a() -> n__a()
     , f(X) -> n__f(X)
     , f(n__f(n__a())) -> f(n__g(n__f(n__a())))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following EDA-non-satisfying and IDA(3)-non-satisfying matrix interpretation:
  Interpretation Functions:
   n__a() = [1]
            [1]
            [0]
   n__f(x1) = [1 0 0] x1 + [0]
              [0 0 2]      [1]
              [0 0 0]      [1]
   f(x1) = [1 0 2] x1 + [1]
           [0 0 2]      [1]
           [0 0 0]      [1]
   n__g(x1) = [1 1 0] x1 + [0]
              [0 1 0]      [2]
              [0 0 0]      [0]
   a() = [3]
         [1]
         [0]
   g(x1) = [1 1 0] x1 + [3]
           [0 1 0]      [2]
           [0 0 0]      [0]
   activate(x1) = [1 2 0] x1 + [1]
                  [0 1 0]      [0]
                  [0 0 1]      [0]

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

Tool TRI

Execution Time	0.4662969ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 Ex15 Luc06 FR

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__g(X)) -> g(activate(X))
     , activate(n__a()) -> a()
     , activate(n__f(X)) -> f(X)
     , g(X) -> n__g(X)
     , a() -> n__a()
     , f(X) -> n__f(X)
     , f(n__f(n__a())) -> f(n__g(n__f(n__a())))}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	0.24348903ms
Answer	MAYBE
Input	Transformed CSR 04 Ex15 Luc06 FR

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__g(X)) -> g(activate(X))
     , activate(n__a()) -> a()
     , activate(n__f(X)) -> f(X)
     , g(X) -> n__g(X)
     , a() -> n__a()
     , f(X) -> n__f(X)
     , f(n__f(n__a())) -> f(n__g(n__f(n__a())))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..