Problem AG01 innermost 4.28

Tool Bounds

Execution Time	60.033092ms
Answer	TIMEOUT
Input	AG01 innermost 4.28

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  bits(s(x)) -> s(bits(half(s(x))))
     , bits(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(s(0())) -> 0()
     , half(0()) -> 0()}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	51.186226ms
Answer	MAYBE
Input	AG01 innermost 4.28

stdout:

MAYBE

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

Tool EDA

Execution Time	4.056066ms
Answer	YES(?,O(n^3))
Input	AG01 innermost 4.28

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  bits(s(x)) -> s(bits(half(s(x))))
     , bits(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(s(0())) -> 0()
     , half(0()) -> 0()}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following EDA-non-satisfying matrix interpretation:
  Interpretation Functions:
   0() = [3]
         [1]
         [1]
   half(x1) = [1 0 0] x1 + [1]
              [0 0 1]      [1]
              [0 0 1]      [0]
   s(x1) = [1 0 0] x1 + [1]
           [0 0 1]      [3]
           [0 0 1]      [1]
   bits(x1) = [1 3 1] x1 + [1]
              [0 1 0]      [2]
              [0 1 0]      [0]

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

Tool IDA

Execution Time	6.432185ms
Answer	YES(?,O(n^2))
Input	AG01 innermost 4.28

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  bits(s(x)) -> s(bits(half(s(x))))
     , bits(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(s(0())) -> 0()
     , half(0()) -> 0()}
  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:
   0() = [0]
         [3]
         [3]
   half(x1) = [1 0 0] x1 + [1]
              [0 0 1]      [0]
              [0 0 1]      [0]
   s(x1) = [1 0 0] x1 + [1]
           [0 0 1]      [2]
           [0 0 1]      [1]
   bits(x1) = [1 3 0] x1 + [0]
              [0 1 0]      [2]
              [0 1 0]      [1]

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

Tool TRI

Execution Time	60.02683ms
Answer	TIMEOUT
Input	AG01 innermost 4.28

stdout:

Tool TRI2

Execution Time	0.19520092ms
Answer	MAYBE
Input	AG01 innermost 4.28

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  bits(s(x)) -> s(bits(half(s(x))))
     , bits(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(s(0())) -> 0()
     , half(0()) -> 0()}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..