Problem Transformed CSR 04 ExProp7 Luc06 GM

Tool Bounds

Execution Time	60.062244ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 GM

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a__p(X) -> p(X)
     , a__f(X) -> f(X)
     , mark(s(X)) -> s(mark(X))
     , mark(cons(X1, X2)) -> cons(mark(X1), X2)
     , mark(0()) -> 0()
     , mark(p(X)) -> a__p(mark(X))
     , mark(f(X)) -> a__f(mark(X))
     , a__p(s(X)) -> mark(X)
     , a__f(s(0())) -> a__f(a__p(s(0())))
     , a__f(0()) -> cons(0(), f(s(0())))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	26.270576ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 GM

stdout:

MAYBE

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

Tool EDA

Execution Time	28.465158ms
Answer	YES(?,O(n^4))
Input	Transformed CSR 04 ExProp7 Luc06 GM

stdout:

YES(?,O(n^4))

We consider the following Problem:

  Strict Trs:
    {  a__p(X) -> p(X)
     , a__f(X) -> f(X)
     , mark(s(X)) -> s(mark(X))
     , mark(cons(X1, X2)) -> cons(mark(X1), X2)
     , mark(0()) -> 0()
     , mark(p(X)) -> a__p(mark(X))
     , mark(f(X)) -> a__f(mark(X))
     , a__p(s(X)) -> mark(X)
     , a__f(s(0())) -> a__f(a__p(s(0())))
     , a__f(0()) -> cons(0(), f(s(0())))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	60.053566ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 GM

stdout:

Tool TRI

Execution Time	60.03402ms
Answer	TIMEOUT
Input	Transformed CSR 04 ExProp7 Luc06 GM

stdout:

Tool TRI2

Execution Time	0.3920369ms
Answer	MAYBE
Input	Transformed CSR 04 ExProp7 Luc06 GM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a__p(X) -> p(X)
     , a__f(X) -> f(X)
     , mark(s(X)) -> s(mark(X))
     , mark(cons(X1, X2)) -> cons(mark(X1), X2)
     , mark(0()) -> 0()
     , mark(p(X)) -> a__p(mark(X))
     , mark(f(X)) -> a__f(mark(X))
     , a__p(s(X)) -> mark(X)
     , a__f(s(0())) -> a__f(a__p(s(0())))
     , a__f(0()) -> cons(0(), f(s(0())))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..