Problem Transformed CSR 04 Ex25 Luc06 GM

Tool Bounds

Execution Time	60.0355ms
Answer	TIMEOUT
Input	Transformed CSR 04 Ex25 Luc06 GM

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a__h(X) -> h(X)
     , a__c(X) -> c(X)
     , a__f(X) -> f(X)
     , mark(d(X)) -> d(X)
     , mark(g(X)) -> g(X)
     , mark(h(X)) -> a__h(mark(X))
     , mark(c(X)) -> a__c(X)
     , mark(f(X)) -> a__f(mark(X))
     , a__h(X) -> a__c(d(X))
     , a__c(X) -> d(X)
     , a__f(f(X)) -> a__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	5.167076ms
Answer	MAYBE
Input	Transformed CSR 04 Ex25 Luc06 GM

stdout:

MAYBE

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

Tool EDA

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool IDA

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

Tool TRI

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

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

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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