Problem Transformed CSR 04 Ex6 GM04 C

Tool Bounds

Execution Time	60.035828ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex6 GM04 C

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , g(ok(X)) -> ok(g(X))
     , f(ok(X)) -> ok(f(X))
     , proper(g(X)) -> g(proper(X))
     , proper(f(X)) -> f(proper(X))
     , proper(c()) -> ok(c())
     , active(f(g(X))) -> mark(g(X))
     , active(c()) -> mark(f(g(c())))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.0408ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex6 GM04 C

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.038254ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex6 GM04 C

stdout:

Tool IDA

Execution Time	60.03473ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex6 GM04 C

stdout:

Tool TRI

Execution Time	5.7390103ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 Ex6 GM04 C

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , g(ok(X)) -> ok(g(X))
     , f(ok(X)) -> ok(f(X))
     , proper(g(X)) -> g(proper(X))
     , proper(f(X)) -> f(proper(X))
     , proper(c()) -> ok(c())
     , active(f(g(X))) -> mark(g(X))
     , active(c()) -> mark(f(g(c())))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   c() = [0]
         [0]
         [2]
         [2]
   active(x1) = [1 0 2 3] x1 + [0]
                [0 1 1 3]      [0]
                [0 0 0 0]      [0]
                [0 0 0 0]      [1]
   g(x1) = [1 1 0 0] x1 + [0]
           [0 1 0 0]      [2]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
   f(x1) = [1 2 0 0] x1 + [0]
           [0 1 0 0]      [3]
           [0 0 0 0]      [0]
           [0 0 0 0]      [0]
   mark(x1) = [1 1 0 3] x1 + [0]
              [0 1 0 0]      [3]
              [0 0 0 2]      [0]
              [0 0 0 0]      [1]
   proper(x1) = [1 1 0 0] x1 + [2]
                [0 1 0 0]      [1]
                [0 0 0 3]      [0]
                [0 0 0 0]      [0]
   ok(x1) = [1 0 0 0] x1 + [1]
            [0 1 0 0]      [1]
            [0 0 1 2]      [0]
            [0 0 0 0]      [0]
   top(x1) = [1 1 3 1] x1 + [0]
             [0 0 0 0]      [0]
             [0 0 0 0]      [0]
             [0 0 0 0]      [0]

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

Tool TRI2

Execution Time	0.30619597ms
Answer	MAYBE
Input	Transformed CSR 04 Ex6 GM04 C

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , g(ok(X)) -> ok(g(X))
     , f(ok(X)) -> ok(f(X))
     , proper(g(X)) -> g(proper(X))
     , proper(f(X)) -> f(proper(X))
     , proper(c()) -> ok(c())
     , active(f(g(X))) -> mark(g(X))
     , active(c()) -> mark(f(g(c())))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..