Tool IRC1
stdout:
YES(?,O(n^1))
Tool IRC2
stdout:
YES(?,O(n^1))
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ f(f(X)) -> c(f(g(f(X))))
, c(X) -> d(X)
, h(X) -> c(d(X))}
Proof Output:
'Bounds with minimal-enrichment and initial automaton 'match'' proved the best result:
Details:
--------
'Bounds with minimal-enrichment and initial automaton 'match'' succeeded with the following output:
'Bounds with minimal-enrichment and initial automaton 'match''
--------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ f(f(X)) -> c(f(g(f(X))))
, c(X) -> d(X)
, h(X) -> c(d(X))}
Proof Output:
The problem is match-bounded by 2.
The enriched problem is compatible with the following automaton:
{ f_0(2) -> 1
, c_0(2) -> 1
, c_1(1) -> 1
, g_0(2) -> 2
, d_0(2) -> 2
, d_1(2) -> 1
, d_2(1) -> 1
, h_0(2) -> 1}Tool RC1
stdout:
YES(?,O(n^1))
Tool RC2
stdout:
YES(?,O(n^1))
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: YES(?,O(n^1))
Input Problem: runtime-complexity with respect to
Rules:
{ f(f(X)) -> c(f(g(f(X))))
, c(X) -> d(X)
, h(X) -> c(d(X))}
Proof Output:
'Bounds with minimal-enrichment and initial automaton 'match'' proved the best result:
Details:
--------
'Bounds with minimal-enrichment and initial automaton 'match'' succeeded with the following output:
'Bounds with minimal-enrichment and initial automaton 'match''
--------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: runtime-complexity with respect to
Rules:
{ f(f(X)) -> c(f(g(f(X))))
, c(X) -> d(X)
, h(X) -> c(d(X))}
Proof Output:
The problem is match-bounded by 2.
The enriched problem is compatible with the following automaton:
{ f_0(2) -> 1
, c_0(2) -> 1
, c_1(1) -> 1
, g_0(2) -> 2
, d_0(2) -> 2
, d_1(2) -> 1
, d_2(1) -> 1
, h_0(2) -> 1}