Tool CaT
stdout:
MAYBE
Problem:
cons(x,cons(y,cons(z,xs))) -> big()
inf(x) -> cons(x,inf(s(x)))
Proof:
OpenTool IRC1
stdout:
MAYBE
Warning when parsing problem:
Unsupported strategy 'OUTERMOST'Tool IRC2
stdout:
MAYBE
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: MAYBE
Input Problem: innermost runtime-complexity with respect to
Rules:
{ cons(x, cons(y, cons(z, xs))) -> big()
, inf(x) -> cons(x, inf(s(x)))}
Proof Output:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'wdg' failed due to the following reason:
Transformation Details:
-----------------------
We have computed the following set of weak (innermost) dependency pairs:
{ 1: cons^#(x, cons(y, cons(z, xs))) -> c_0()
, 2: inf^#(x) -> c_1(cons^#(x, inf(s(x))))}
Following Dependency Graph (modulo SCCs) was computed. (Answers to
subproofs are indicated to the right.)
->{2} [ inherited ]
|
`->{1} [ NA ]
Sub-problems:
-------------
* Path {2}: inherited
-------------------
This path is subsumed by the proof of path {2}->{1}.
* Path {2}->{1}: NA
-----------------
The usable rules for this path are:
{ inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
The weight gap principle does not apply:
The input cannot be shown compatible
Complexity induced by the adequate RMI: MAYBE
We have not generated a proof for the resulting sub-problem.
2) 'wdg' failed due to the following reason:
Transformation Details:
-----------------------
We have computed the following set of weak (innermost) dependency pairs:
{ 1: cons^#(x, cons(y, cons(z, xs))) -> c_0()
, 2: inf^#(x) -> c_1(cons^#(x, inf(s(x))))}
Following Dependency Graph (modulo SCCs) was computed. (Answers to
subproofs are indicated to the right.)
->{2} [ inherited ]
|
`->{1} [ MAYBE ]
Sub-problems:
-------------
* Path {2}: inherited
-------------------
This path is subsumed by the proof of path {2}->{1}.
* Path {2}->{1}: MAYBE
--------------------
The usable rules for this path are:
{ inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
The weight gap principle does not apply:
The input cannot be shown compatible
Complexity induced by the adequate RMI: MAYBE
We apply the sub-processor on the resulting sub-problem:
'matrix-interpretation of dimension 2'
--------------------------------------
Answer: MAYBE
Input Problem: innermost runtime-complexity with respect to
Rules:
{ inf^#(x) -> c_1(cons^#(x, inf(s(x))))
, cons^#(x, cons(y, cons(z, xs))) -> c_0()
, inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
Proof Output:
The input cannot be shown compatible
3) 'wdg' failed due to the following reason:
Transformation Details:
-----------------------
We have computed the following set of weak (innermost) dependency pairs:
{ 1: cons^#(x, cons(y, cons(z, xs))) -> c_0()
, 2: inf^#(x) -> c_1(cons^#(x, inf(s(x))))}
Following Dependency Graph (modulo SCCs) was computed. (Answers to
subproofs are indicated to the right.)
->{2} [ inherited ]
|
`->{1} [ MAYBE ]
Sub-problems:
-------------
* Path {2}: inherited
-------------------
This path is subsumed by the proof of path {2}->{1}.
* Path {2}->{1}: MAYBE
--------------------
The usable rules for this path are:
{ inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
The weight gap principle does not apply:
The input cannot be shown compatible
Complexity induced by the adequate RMI: MAYBE
We apply the sub-processor on the resulting sub-problem:
'matrix-interpretation of dimension 1'
--------------------------------------
Answer: MAYBE
Input Problem: innermost runtime-complexity with respect to
Rules:
{ inf^#(x) -> c_1(cons^#(x, inf(s(x))))
, cons^#(x, cons(y, cons(z, xs))) -> c_0()
, inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
Proof Output:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
5) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
6) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
Tool RC1
stdout:
MAYBE
Warning when parsing problem:
Unsupported strategy 'OUTERMOST'Tool RC2
stdout:
MAYBE
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: MAYBE
Input Problem: runtime-complexity with respect to
Rules:
{ cons(x, cons(y, cons(z, xs))) -> big()
, inf(x) -> cons(x, inf(s(x)))}
Proof Output:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'wdg' failed due to the following reason:
Transformation Details:
-----------------------
We have computed the following set of weak (innermost) dependency pairs:
{ 1: cons^#(x, cons(y, cons(z, xs))) -> c_0()
, 2: inf^#(x) -> c_1(cons^#(x, inf(s(x))))}
Following Dependency Graph (modulo SCCs) was computed. (Answers to
subproofs are indicated to the right.)
->{2} [ inherited ]
|
`->{1} [ NA ]
Sub-problems:
-------------
* Path {2}: inherited
-------------------
This path is subsumed by the proof of path {2}->{1}.
* Path {2}->{1}: NA
-----------------
The usable rules for this path are:
{ inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
The weight gap principle does not apply:
The input cannot be shown compatible
Complexity induced by the adequate RMI: MAYBE
We have not generated a proof for the resulting sub-problem.
2) 'wdg' failed due to the following reason:
Transformation Details:
-----------------------
We have computed the following set of weak (innermost) dependency pairs:
{ 1: cons^#(x, cons(y, cons(z, xs))) -> c_0()
, 2: inf^#(x) -> c_1(cons^#(x, inf(s(x))))}
Following Dependency Graph (modulo SCCs) was computed. (Answers to
subproofs are indicated to the right.)
->{2} [ inherited ]
|
`->{1} [ MAYBE ]
Sub-problems:
-------------
* Path {2}: inherited
-------------------
This path is subsumed by the proof of path {2}->{1}.
* Path {2}->{1}: MAYBE
--------------------
The usable rules for this path are:
{ inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
The weight gap principle does not apply:
The input cannot be shown compatible
Complexity induced by the adequate RMI: MAYBE
We apply the sub-processor on the resulting sub-problem:
'matrix-interpretation of dimension 2'
--------------------------------------
Answer: MAYBE
Input Problem: runtime-complexity with respect to
Rules:
{ inf^#(x) -> c_1(cons^#(x, inf(s(x))))
, cons^#(x, cons(y, cons(z, xs))) -> c_0()
, inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
Proof Output:
The input cannot be shown compatible
3) 'wdg' failed due to the following reason:
Transformation Details:
-----------------------
We have computed the following set of weak (innermost) dependency pairs:
{ 1: cons^#(x, cons(y, cons(z, xs))) -> c_0()
, 2: inf^#(x) -> c_1(cons^#(x, inf(s(x))))}
Following Dependency Graph (modulo SCCs) was computed. (Answers to
subproofs are indicated to the right.)
->{2} [ inherited ]
|
`->{1} [ MAYBE ]
Sub-problems:
-------------
* Path {2}: inherited
-------------------
This path is subsumed by the proof of path {2}->{1}.
* Path {2}->{1}: MAYBE
--------------------
The usable rules for this path are:
{ inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
The weight gap principle does not apply:
The input cannot be shown compatible
Complexity induced by the adequate RMI: MAYBE
We apply the sub-processor on the resulting sub-problem:
'matrix-interpretation of dimension 1'
--------------------------------------
Answer: MAYBE
Input Problem: runtime-complexity with respect to
Rules:
{ inf^#(x) -> c_1(cons^#(x, inf(s(x))))
, cons^#(x, cons(y, cons(z, xs))) -> c_0()
, inf(x) -> cons(x, inf(s(x)))
, cons(x, cons(y, cons(z, xs))) -> big()}
Proof Output:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
5) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
6) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.