Problem Transformed outermost 08 ex5.3

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Transformed outermost 08 ex5.3

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	MAYBE
Input	Transformed outermost 08 ex5.3

stdout:

MAYBE

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           MAYBE
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}

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: from_2^#(x) -> c_0(from_3^#(s_0(x)))
              , 2: from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
              , 3: from_1^#(x) -> c_2(from_3^#(s_0(x)))
              , 4: cons_1^#(s_0(x), xs) -> c_3()}

           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)

             ->{3}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]

             ->{1}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]



         Sub-problems:
         -------------
           * Path {1}: inherited
             -------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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.

           * Path {3}: inherited
             -------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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: from_2^#(x) -> c_0(from_3^#(s_0(x)))
              , 2: from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
              , 3: from_1^#(x) -> c_2(from_3^#(s_0(x)))
              , 4: cons_1^#(s_0(x), xs) -> c_3()}

           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)

             ->{3}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]

             ->{1}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [       MAYBE        ]



         Sub-problems:
         -------------
           * Path {1}: inherited
             -------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}->{4}: MAYBE
             -------------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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:
                 {  from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
                  , from_2^#(x) -> c_0(from_3^#(s_0(x)))
                  , cons_1^#(s_0(x), xs) -> c_3()
                  , from_3(x) -> cons_1(x, from_3(s_0(x)))
                  , cons_1(s_0(x), xs) -> overflow_0()}

             Proof Output:
               The input cannot be shown compatible

           * Path {3}: inherited
             -------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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.

    3) 'wdg' failed due to the following reason:
         Transformation Details:
         -----------------------
           We have computed the following set of weak (innermost) dependency pairs:

             {  1: from_2^#(x) -> c_0(from_3^#(s_0(x)))
              , 2: from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
              , 3: from_1^#(x) -> c_2(from_3^#(s_0(x)))
              , 4: cons_1^#(s_0(x), xs) -> c_3()}

           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)

             ->{3}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]

             ->{1}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [       MAYBE        ]



         Sub-problems:
         -------------
           * Path {1}: inherited
             -------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}->{4}: MAYBE
             -------------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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:
                 {  from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
                  , from_2^#(x) -> c_0(from_3^#(s_0(x)))
                  , cons_1^#(s_0(x), xs) -> c_3()
                  , from_3(x) -> cons_1(x, from_3(s_0(x)))
                  , cons_1(s_0(x), xs) -> overflow_0()}

             Proof Output:
               The input cannot be shown compatible

           * Path {3}: inherited
             -------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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.

    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

Execution Time	Unknown
Answer	MAYBE
Input	Transformed outermost 08 ex5.3

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	MAYBE
Input	Transformed outermost 08 ex5.3

stdout:

MAYBE

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           MAYBE
Input Problem:    runtime-complexity with respect to
  Rules:
    {  from_2(x) -> cons_0(x, from_3(s_0(x)))
     , from_3(x) -> cons_1(x, from_3(s_0(x)))
     , from_1(x) -> cons_0(x, from_3(s_0(x)))
     , cons_1(s_0(x), xs) -> overflow_0()}

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: from_2^#(x) -> c_0(x, from_3^#(s_0(x)))
              , 2: from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
              , 3: from_1^#(x) -> c_2(x, from_3^#(s_0(x)))
              , 4: cons_1^#(s_0(x), xs) -> c_3()}

           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)

             ->{3}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]

             ->{1}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]



         Sub-problems:
         -------------
           * Path {1}: inherited
             -------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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.

           * Path {3}: inherited
             -------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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: from_2^#(x) -> c_0(x, from_3^#(s_0(x)))
              , 2: from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
              , 3: from_1^#(x) -> c_2(x, from_3^#(s_0(x)))
              , 4: cons_1^#(s_0(x), xs) -> c_3()}

           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)

             ->{3}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [       MAYBE        ]

             ->{1}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]



         Sub-problems:
         -------------
           * Path {1}: inherited
             -------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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.

           * Path {3}: inherited
             -------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}->{4}: MAYBE
             -------------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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:
                 {  from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
                  , from_1^#(x) -> c_2(x, from_3^#(s_0(x)))
                  , cons_1^#(s_0(x), xs) -> c_3()
                  , from_3(x) -> cons_1(x, from_3(s_0(x)))
                  , cons_1(s_0(x), xs) -> overflow_0()}

             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: from_2^#(x) -> c_0(x, from_3^#(s_0(x)))
              , 2: from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
              , 3: from_1^#(x) -> c_2(x, from_3^#(s_0(x)))
              , 4: cons_1^#(s_0(x), xs) -> c_3()}

           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)

             ->{3}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [         NA         ]

             ->{1}                                                       [     inherited      ]
                |
                `->{2}                                                   [     inherited      ]
                    |
                    `->{4}                                               [       MAYBE        ]



         Sub-problems:
         -------------
           * Path {1}: inherited
             -------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {1}->{2}->{4}.

           * Path {1}->{2}->{4}: MAYBE
             -------------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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:
                 {  from_3^#(x) -> c_1(cons_1^#(x, from_3(s_0(x))))
                  , from_2^#(x) -> c_0(x, from_3^#(s_0(x)))
                  , cons_1^#(s_0(x), xs) -> c_3()
                  , from_3(x) -> cons_1(x, from_3(s_0(x)))
                  , cons_1(s_0(x), xs) -> overflow_0()}

             Proof Output:
               The input cannot be shown compatible

           * Path {3}: inherited
             -------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}: inherited
             ------------------------

             This path is subsumed by the proof of path {3}->{2}->{4}.

           * Path {3}->{2}->{4}: NA
             ----------------------

             The usable rules for this path are:

               {  from_3(x) -> cons_1(x, from_3(s_0(x)))
                , cons_1(s_0(x), xs) -> overflow_0()}

             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.

    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.