Problem Transformed CSR 04 Ex25 Luc06 iGM

Tool Bounds

Execution Time	60.039852ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex25 Luc06 iGM

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.04159ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex25 Luc06 iGM

stdout:

TIMEOUT

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

Tool EDA

Execution Time	19.446587ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 Ex25 Luc06 iGM

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

Proof:
  We have the following EDA-non-satisfying matrix interpretation:
  Interpretation Functions:
   f(x1) = [1 0 2] x1 + [0]
           [0 0 0]      [0]
           [0 0 1]      [3]
   active(x1) = [1 1 0] x1 + [1]
                [0 0 0]      [0]
                [0 0 1]      [0]
   g(x1) = [1 0 0] x1 + [0]
           [0 0 0]      [0]
           [0 0 0]      [1]
   c(x1) = [1 0 0] x1 + [1]
           [0 0 0]      [1]
           [0 0 0]      [2]
   mark(x1) = [1 0 1] x1 + [1]
              [0 0 0]      [0]
              [0 0 1]      [0]
   d(x1) = [1 0 0] x1 + [0]
           [0 0 0]      [0]
           [0 0 0]      [1]
   h(x1) = [1 0 0] x1 + [3]
           [0 0 0]      [1]
           [0 0 1]      [3]

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

Tool IDA

Execution Time	26.516373ms
Answer	YES(?,O(n^2))
Input	Transformed CSR 04 Ex25 Luc06 iGM

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  h(active(X)) -> h(X)
     , h(mark(X)) -> h(X)
     , d(active(X)) -> d(X)
     , d(mark(X)) -> d(X)
     , g(active(X)) -> g(X)
     , g(mark(X)) -> g(X)
     , c(active(X)) -> c(X)
     , c(mark(X)) -> c(X)
     , f(active(X)) -> f(X)
     , f(mark(X)) -> f(X)
     , mark(h(X)) -> active(h(mark(X)))
     , mark(d(X)) -> active(d(X))
     , mark(g(X)) -> active(g(X))
     , mark(c(X)) -> active(c(X))
     , mark(f(X)) -> active(f(mark(X)))
     , active(h(X)) -> mark(c(d(X)))
     , active(c(X)) -> mark(d(X))
     , active(f(f(X))) -> mark(c(f(g(f(X)))))}
  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:
   f(x1) = [1 0 2] x1 + [0]
           [0 1 0]      [2]
           [0 1 0]      [0]
   active(x1) = [1 0 2] x1 + [1]
                [0 1 0]      [0]
                [0 0 0]      [0]
   g(x1) = [1 0 0] x1 + [0]
           [0 0 0]      [1]
           [0 0 0]      [0]
   c(x1) = [1 0 0] x1 + [0]
           [0 0 0]      [1]
           [0 0 0]      [1]
   mark(x1) = [1 1 2] x1 + [1]
              [0 1 0]      [0]
              [0 0 0]      [0]
   d(x1) = [1 0 0] x1 + [0]
           [0 0 0]      [1]
           [0 0 0]      [0]
   h(x1) = [1 0 2] x1 + [2]
           [0 1 0]      [3]
           [0 0 0]      [3]

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

Tool TRI

Execution Time	2.07078ms
Answer	YES(?,O(n^3))
Input	Transformed CSR 04 Ex25 Luc06 iGM

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	0.4457569ms
Answer	MAYBE
Input	Transformed CSR 04 Ex25 Luc06 iGM

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..