Problem Transformed CSR 04 ExProp7 Luc06 Z

Tool Bounds

Execution Time	3.586507e-2ms
Answer	YES(?,O(n^1))
Input	Transformed CSR 04 ExProp7 Luc06 Z

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(X)
     , f(X) -> n__f(X)
     , p(s(X)) -> X
     , f(s(0())) -> f(p(s(0())))
     , f(0()) -> cons(0(), n__f(s(0())))}
  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:
  {  0_0() -> 1
   , 0_1() -> 1
   , 0_1() -> 3
   , 0_2() -> 5
   , 0_2() -> 8
   , f_0(1) -> 1
   , f_1(1) -> 1
   , s_0(1) -> 1
   , s_1(3) -> 2
   , s_2(8) -> 7
   , n__f_0(1) -> 1
   , n__f_1(1) -> 1
   , n__f_1(2) -> 4
   , n__f_2(1) -> 1
   , n__f_2(7) -> 6
   , cons_0(1, 1) -> 1
   , cons_1(3, 4) -> 1
   , cons_2(5, 6) -> 1
   , p_0(1) -> 1
   , p_1(2) -> 1
   , activate_0(1) -> 1}

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

Tool CDI

Execution Time	22.747284ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 Z

stdout:

MAYBE

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

Tool EDA

Execution Time	2.3980172ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 ExProp7 Luc06 Z

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(X)
     , f(X) -> n__f(X)
     , p(s(X)) -> X
     , f(s(0())) -> f(p(s(0())))
     , f(0()) -> cons(0(), n__f(s(0())))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	49.72213ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 Z

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(X)
     , f(X) -> n__f(X)
     , p(s(X)) -> X
     , f(s(0())) -> f(p(s(0())))
     , f(0()) -> cons(0(), n__f(s(0())))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  None of the processors succeeded.

  Details of failed attempt(s):
  -----------------------------
    1) 'matrix-interpretation of dimension 3' failed due to the following reason:
         The input cannot be shown compatible

    2) 'matrix-interpretation of dimension 3' failed due to the following reason:
         The input cannot be shown compatible

    3) 'matrix-interpretation of dimension 3' failed due to the following reason:
         The input cannot be shown compatible

    4) 'matrix-interpretation of dimension 2' failed due to the following reason:
         The input cannot be shown compatible

    5) 'matrix-interpretation of dimension 2' failed due to the following reason:
         The input cannot be shown compatible

    6) 'matrix-interpretation of dimension 1' failed due to the following reason:
         The input cannot be shown compatible


Arrrr..

Tool TRI

Execution Time	60.0293ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 Z

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  activate(X) -> X
     , activate(n__f(X)) -> f(X)
     , f(X) -> n__f(X)
     , p(s(X)) -> X
     , f(s(0())) -> f(p(s(0())))
     , f(0()) -> cons(0(), n__f(s(0())))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time	0.305686ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 Z