MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(X) -> f(X)
, c() -> a()
, c() -> b() }
Obligation:
runtime complexity
Answer:
MAYBE
The input is overlay and right-linear. Switching to innermost
rewriting.
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(X) -> f(X)
, c() -> a()
, c() -> b() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'Best' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'WithProblem (timeout of 60 seconds)' failed due to the
following reason:
We add the following innermost weak dependency pairs:
Strict DPs:
{ f^#(X) -> c_1(f^#(X))
, c^#() -> c_2()
, c^#() -> c_3() }
and mark the set of starting terms.
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict DPs:
{ f^#(X) -> c_1(f^#(X))
, c^#() -> c_2()
, c^#() -> c_3() }
Strict Trs:
{ f(X) -> f(X)
, c() -> a()
, c() -> b() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
No rule is usable, rules are removed from the input problem.
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict DPs:
{ f^#(X) -> c_1(f^#(X))
, c^#() -> c_2()
, c^#() -> c_3() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The weightgap principle applies (using the following constant
growth matrix-interpretation)
The following argument positions are usable:
Uargs(c_1) = {1}
TcT has computed the following constructor-restricted matrix
interpretation.
[f^#](x1) = [1 2] x1 + [1]
[2 2] [1]
[c_1](x1) = [1 0] x1 + [2]
[0 1] [2]
[c^#] = [2]
[1]
[c_2] = [1]
[1]
[c_3] = [1]
[1]
The following symbols are considered usable
{f^#, c^#}
The order satisfies the following ordering constraints:
[f^#(X)] = [1 2] X + [1]
[2 2] [1]
? [1 2] X + [3]
[2 2] [3]
= [c_1(f^#(X))]
[c^#()] = [2]
[1]
> [1]
[1]
= [c_2()]
[c^#()] = [2]
[1]
> [1]
[1]
= [c_3()]
Further, it can be verified that all rules not oriented are covered by the weightgap condition.
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict DPs: { f^#(X) -> c_1(f^#(X)) }
Weak DPs:
{ c^#() -> c_2()
, c^#() -> c_3() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The following weak DPs constitute a sub-graph of the DG that is
closed under successors. The DPs are removed.
{ c^#() -> c_2()
, c^#() -> c_3() }
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict DPs: { f^#(X) -> c_1(f^#(X)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'Fastest' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'Fastest (timeout of 5 seconds)' failed due to the following
reason:
Computation stopped due to timeout after 5.0 seconds.
2) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'Polynomial Path Order (PS)' failed due to the following reason:
The input cannot be shown compatible
3) 'Polynomial Path Order (PS)' failed due to the following reason:
The input cannot be shown compatible
2) 'Best' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
due to the following reason:
Computation stopped due to timeout after 5.0 seconds.
2) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)'
failed due to the following reason:
The weightgap principle applies (using the following nonconstant
growth matrix-interpretation)
The following argument positions are usable:
none
TcT has computed the following matrix interpretation satisfying
not(EDA) and not(IDA(1)).
[f](x1) = [1] x1 + [0]
[c] = [7]
[a] = [6]
[b] = [6]
The following symbols are considered usable
{f, c}
The order satisfies the following ordering constraints:
[f(X)] = [1] X + [0]
>= [1] X + [0]
= [f(X)]
[c()] = [7]
> [6]
= [a()]
[c()] = [7]
> [6]
= [b()]
Further, it can be verified that all rules not oriented are covered by the weightgap condition.
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { f(X) -> f(X) }
Weak Trs:
{ c() -> a()
, c() -> b() }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'Fastest' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'WithProblem' failed due to the following reason:
Empty strict component of the problem is NOT empty.
3) 'Best' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
to the following reason:
The input cannot be shown compatible
2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..