Problem Strategy outermost added 08 4.16

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 4.16

stdout:

MAYBE

Problem:
f(s(0()),g(x)) -> f(x,g(x))
g(s(x)) -> g(x)

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 4.16

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 4.16

stdout:

MAYBE

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           MAYBE
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  f(s(0()), g(x)) -> f(x, g(x))
     , g(s(x)) -> g(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: f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))
              , 2: g^#(s(x)) -> c_1(g^#(x))}

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

             ->{2}                                                       [   YES(?,O(n^2))    ]

             ->{1}                                                       [       MAYBE        ]



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

             The usable rules for this path are:

               {g(s(x)) -> g(x)}

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {1}, Uargs(g^#) = {}, Uargs(c_1) = {}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                            [0 0 0]      [0 0 0]      [0]
                            [0 0 0]      [0 0 0]      [0]
                s(x1) = [1 0 0] x1 + [2]
                        [0 0 0]      [0]
                        [0 0 0]      [0]
                0() = [0]
                      [0]
                      [0]
                g(x1) = [1 0 0] x1 + [3]
                        [0 0 0]      [3]
                        [0 0 0]      [3]
                f^#(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                              [3 3 3]      [3 3 3]      [0]
                              [3 3 3]      [3 3 3]      [0]
                c_0(x1) = [1 0 0] x1 + [0]
                          [0 1 0]      [0]
                          [0 0 1]      [0]
                g^#(x1) = [0 0 0] x1 + [0]
                          [0 0 0]      [0]
                          [0 0 0]      [0]
                c_1(x1) = [0 0 0] x1 + [0]
                          [0 0 0]      [0]
                          [0 0 0]      [0]
             Complexity induced by the adequate RMI: YES(?,O(n^1))

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 3'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    innermost DP runtime-complexity with respect to
               Strict Rules: {f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))}
               Weak Rules: {g(s(x)) -> g(x)}

             Proof Output:
               The input cannot be shown compatible

           * Path {2}: YES(?,O(n^2))
             -----------------------

             The usable rules of this path are empty.

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                            [0 0 0]      [0 0 0]      [0]
                            [0 0 0]      [0 0 0]      [0]
                s(x1) = [1 3 0] x1 + [0]
                        [0 1 0]      [0]
                        [0 0 0]      [0]
                0() = [0]
                      [0]
                      [0]
                g(x1) = [0 0 0] x1 + [0]
                        [0 0 0]      [0]
                        [0 0 0]      [0]
                f^#(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                              [0 0 0]      [0 0 0]      [0]
                              [0 0 0]      [0 0 0]      [0]
                c_0(x1) = [0 0 0] x1 + [0]
                          [0 0 0]      [0]
                          [0 0 0]      [0]
                g^#(x1) = [0 0 0] x1 + [0]
                          [3 3 3]      [0]
                          [3 3 3]      [0]
                c_1(x1) = [1 0 0] x1 + [0]
                          [0 1 0]      [0]
                          [0 0 1]      [0]

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 3'
             --------------------------------------
             Answer:           YES(?,O(n^2))
             Input Problem:    innermost DP runtime-complexity with respect to
               Strict Rules: {g^#(s(x)) -> c_1(g^#(x))}
               Weak Rules: {}

             Proof Output:
               The following argument positions are usable:
                 Uargs(s) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                s(x1) = [1 2 2] x1 + [2]
                        [0 1 2]      [2]
                        [0 0 0]      [0]
                g^#(x1) = [0 1 0] x1 + [2]
                          [6 0 0]      [0]
                          [2 3 0]      [2]
                c_1(x1) = [1 0 0] x1 + [1]
                          [2 0 2]      [0]
                          [0 0 0]      [0]

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

             {  1: f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))
              , 2: g^#(s(x)) -> c_1(g^#(x))}

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

             ->{2}                                                       [   YES(?,O(n^1))    ]

             ->{1}                                                       [       MAYBE        ]



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

             The usable rules for this path are:

               {g(s(x)) -> g(x)}

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {1}, Uargs(g^#) = {}, Uargs(c_1) = {}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                            [0 0]      [0 0]      [0]
                s(x1) = [1 0] x1 + [2]
                        [0 0]      [0]
                0() = [0]
                      [0]
                g(x1) = [1 0] x1 + [3]
                        [0 0]      [3]
                f^#(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                              [3 3]      [3 3]      [0]
                c_0(x1) = [1 0] x1 + [0]
                          [0 1]      [0]
                g^#(x1) = [0 0] x1 + [0]
                          [0 0]      [0]
                c_1(x1) = [0 0] x1 + [0]
                          [0 0]      [0]
             Complexity induced by the adequate RMI: YES(?,O(n^1))

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 2'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    innermost DP runtime-complexity with respect to
               Strict Rules: {f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))}
               Weak Rules: {g(s(x)) -> g(x)}

             Proof Output:
               The input cannot be shown compatible

           * Path {2}: YES(?,O(n^1))
             -----------------------

             The usable rules of this path are empty.

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                            [0 0]      [0 0]      [0]
                s(x1) = [1 2] x1 + [0]
                        [0 0]      [0]
                0() = [0]
                      [0]
                g(x1) = [0 0] x1 + [0]
                        [0 0]      [0]
                f^#(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                              [0 0]      [0 0]      [0]
                c_0(x1) = [0 0] x1 + [0]
                          [0 0]      [0]
                g^#(x1) = [3 3] x1 + [0]
                          [3 3]      [0]
                c_1(x1) = [1 0] x1 + [0]
                          [0 1]      [0]

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 2'
             --------------------------------------
             Answer:           YES(?,O(n^1))
             Input Problem:    innermost DP runtime-complexity with respect to
               Strict Rules: {g^#(s(x)) -> c_1(g^#(x))}
               Weak Rules: {}

             Proof Output:
               The following argument positions are usable:
                 Uargs(s) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                s(x1) = [1 0] x1 + [0]
                        [0 1]      [1]
                g^#(x1) = [0 1] x1 + [1]
                          [0 0]      [0]
                c_1(x1) = [1 0] x1 + [0]
                          [0 0]      [0]

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

             {  1: f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))
              , 2: g^#(s(x)) -> c_1(g^#(x))}

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

             ->{2}                                                       [   YES(?,O(n^1))    ]

             ->{1}                                                       [       MAYBE        ]



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

             The usable rules for this path are:

               {g(s(x)) -> g(x)}

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {1}, Uargs(g^#) = {}, Uargs(c_1) = {}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0] x1 + [0] x2 + [0]
                s(x1) = [1] x1 + [3]
                0() = [0]
                g(x1) = [2] x1 + [3]
                f^#(x1, x2) = [0] x1 + [0] x2 + [0]
                c_0(x1) = [1] x1 + [0]
                g^#(x1) = [0] x1 + [0]
                c_1(x1) = [0] x1 + [0]
             Complexity induced by the adequate RMI: YES(?,O(n^1))

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 1'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    innermost DP runtime-complexity with respect to
               Strict Rules: {f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))}
               Weak Rules: {g(s(x)) -> g(x)}

             Proof Output:
               The input cannot be shown compatible

           * Path {2}: YES(?,O(n^1))
             -----------------------

             The usable rules of this path are empty.

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0] x1 + [0] x2 + [0]
                s(x1) = [1] x1 + [0]
                0() = [0]
                g(x1) = [0] x1 + [0]
                f^#(x1, x2) = [0] x1 + [0] x2 + [0]
                c_0(x1) = [0] x1 + [0]
                g^#(x1) = [3] x1 + [0]
                c_1(x1) = [1] x1 + [0]

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 1'
             --------------------------------------
             Answer:           YES(?,O(n^1))
             Input Problem:    innermost DP runtime-complexity with respect to
               Strict Rules: {g^#(s(x)) -> c_1(g^#(x))}
               Weak Rules: {}

             Proof Output:
               The following argument positions are usable:
                 Uargs(s) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                s(x1) = [1] x1 + [4]
                g^#(x1) = [2] x1 + [0]
                c_1(x1) = [1] x1 + [7]

    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	Strategy outermost added 08 4.16

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 4.16

stdout:

MAYBE

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           MAYBE
Input Problem:    runtime-complexity with respect to
  Rules:
    {  f(s(0()), g(x)) -> f(x, g(x))
     , g(s(x)) -> g(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: f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))
              , 2: g^#(s(x)) -> c_1(g^#(x))}

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

             ->{2}                                                       [   YES(?,O(n^2))    ]

             ->{1}                                                       [       MAYBE        ]



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

             The usable rules for this path are:

               {g(s(x)) -> g(x)}

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {1}, Uargs(g^#) = {}, Uargs(c_1) = {}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                            [0 0 0]      [0 0 0]      [0]
                            [0 0 0]      [0 0 0]      [0]
                s(x1) = [1 0 0] x1 + [2]
                        [0 0 0]      [0]
                        [0 0 0]      [0]
                0() = [0]
                      [0]
                      [0]
                g(x1) = [1 0 0] x1 + [3]
                        [0 0 0]      [3]
                        [0 0 0]      [3]
                f^#(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                              [3 3 3]      [3 3 3]      [0]
                              [3 3 3]      [3 3 3]      [0]
                c_0(x1) = [1 0 0] x1 + [0]
                          [0 1 0]      [0]
                          [0 0 1]      [0]
                g^#(x1) = [0 0 0] x1 + [0]
                          [0 0 0]      [0]
                          [0 0 0]      [0]
                c_1(x1) = [0 0 0] x1 + [0]
                          [0 0 0]      [0]
                          [0 0 0]      [0]
             Complexity induced by the adequate RMI: YES(?,O(n^1))

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 3'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    DP runtime-complexity with respect to
               Strict Rules: {f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))}
               Weak Rules: {g(s(x)) -> g(x)}

             Proof Output:
               The input cannot be shown compatible

           * Path {2}: YES(?,O(n^2))
             -----------------------

             The usable rules of this path are empty.

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                            [0 0 0]      [0 0 0]      [0]
                            [0 0 0]      [0 0 0]      [0]
                s(x1) = [1 3 0] x1 + [0]
                        [0 1 0]      [0]
                        [0 0 0]      [0]
                0() = [0]
                      [0]
                      [0]
                g(x1) = [0 0 0] x1 + [0]
                        [0 0 0]      [0]
                        [0 0 0]      [0]
                f^#(x1, x2) = [0 0 0] x1 + [0 0 0] x2 + [0]
                              [0 0 0]      [0 0 0]      [0]
                              [0 0 0]      [0 0 0]      [0]
                c_0(x1) = [0 0 0] x1 + [0]
                          [0 0 0]      [0]
                          [0 0 0]      [0]
                g^#(x1) = [0 0 0] x1 + [0]
                          [3 3 3]      [0]
                          [3 3 3]      [0]
                c_1(x1) = [1 0 0] x1 + [0]
                          [0 1 0]      [0]
                          [0 0 1]      [0]

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 3'
             --------------------------------------
             Answer:           YES(?,O(n^2))
             Input Problem:    DP runtime-complexity with respect to
               Strict Rules: {g^#(s(x)) -> c_1(g^#(x))}
               Weak Rules: {}

             Proof Output:
               The following argument positions are usable:
                 Uargs(s) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                s(x1) = [1 2 2] x1 + [2]
                        [0 1 2]      [2]
                        [0 0 0]      [0]
                g^#(x1) = [0 1 0] x1 + [2]
                          [6 0 0]      [0]
                          [2 3 0]      [2]
                c_1(x1) = [1 0 0] x1 + [1]
                          [2 0 2]      [0]
                          [0 0 0]      [0]

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

             {  1: f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))
              , 2: g^#(s(x)) -> c_1(g^#(x))}

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

             ->{2}                                                       [   YES(?,O(n^1))    ]

             ->{1}                                                       [       MAYBE        ]



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

             The usable rules for this path are:

               {g(s(x)) -> g(x)}

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {1}, Uargs(g^#) = {}, Uargs(c_1) = {}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                            [0 0]      [0 0]      [0]
                s(x1) = [1 0] x1 + [2]
                        [0 0]      [0]
                0() = [0]
                      [0]
                g(x1) = [1 0] x1 + [3]
                        [0 0]      [3]
                f^#(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                              [3 3]      [3 3]      [0]
                c_0(x1) = [1 0] x1 + [0]
                          [0 1]      [0]
                g^#(x1) = [0 0] x1 + [0]
                          [0 0]      [0]
                c_1(x1) = [0 0] x1 + [0]
                          [0 0]      [0]
             Complexity induced by the adequate RMI: YES(?,O(n^1))

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 2'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    DP runtime-complexity with respect to
               Strict Rules: {f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))}
               Weak Rules: {g(s(x)) -> g(x)}

             Proof Output:
               The input cannot be shown compatible

           * Path {2}: YES(?,O(n^1))
             -----------------------

             The usable rules of this path are empty.

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                            [0 0]      [0 0]      [0]
                s(x1) = [1 2] x1 + [0]
                        [0 0]      [0]
                0() = [0]
                      [0]
                g(x1) = [0 0] x1 + [0]
                        [0 0]      [0]
                f^#(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                              [0 0]      [0 0]      [0]
                c_0(x1) = [0 0] x1 + [0]
                          [0 0]      [0]
                g^#(x1) = [3 3] x1 + [0]
                          [3 3]      [0]
                c_1(x1) = [1 0] x1 + [0]
                          [0 1]      [0]

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 2'
             --------------------------------------
             Answer:           YES(?,O(n^1))
             Input Problem:    DP runtime-complexity with respect to
               Strict Rules: {g^#(s(x)) -> c_1(g^#(x))}
               Weak Rules: {}

             Proof Output:
               The following argument positions are usable:
                 Uargs(s) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                s(x1) = [1 0] x1 + [0]
                        [0 1]      [1]
                g^#(x1) = [0 1] x1 + [1]
                          [0 0]      [0]
                c_1(x1) = [1 0] x1 + [0]
                          [0 0]      [0]

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

             {  1: f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))
              , 2: g^#(s(x)) -> c_1(g^#(x))}

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

             ->{2}                                                       [   YES(?,O(n^1))    ]

             ->{1}                                                       [       MAYBE        ]



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

             The usable rules for this path are:

               {g(s(x)) -> g(x)}

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {1}, Uargs(g^#) = {}, Uargs(c_1) = {}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0] x1 + [0] x2 + [0]
                s(x1) = [1] x1 + [3]
                0() = [0]
                g(x1) = [2] x1 + [3]
                f^#(x1, x2) = [0] x1 + [0] x2 + [0]
                c_0(x1) = [1] x1 + [0]
                g^#(x1) = [0] x1 + [0]
                c_1(x1) = [0] x1 + [0]
             Complexity induced by the adequate RMI: YES(?,O(n^1))

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 1'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    DP runtime-complexity with respect to
               Strict Rules: {f^#(s(0()), g(x)) -> c_0(f^#(x, g(x)))}
               Weak Rules: {g(s(x)) -> g(x)}

             Proof Output:
               The input cannot be shown compatible

           * Path {2}: YES(?,O(n^1))
             -----------------------

             The usable rules of this path are empty.

             The weightgap principle applies, using the following adequate RMI:
               The following argument positions are usable:
                 Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(f^#) = {},
                 Uargs(c_0) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                f(x1, x2) = [0] x1 + [0] x2 + [0]
                s(x1) = [1] x1 + [0]
                0() = [0]
                g(x1) = [0] x1 + [0]
                f^#(x1, x2) = [0] x1 + [0] x2 + [0]
                c_0(x1) = [0] x1 + [0]
                g^#(x1) = [3] x1 + [0]
                c_1(x1) = [1] x1 + [0]

             We apply the sub-processor on the resulting sub-problem:

             'matrix-interpretation of dimension 1'
             --------------------------------------
             Answer:           YES(?,O(n^1))
             Input Problem:    DP runtime-complexity with respect to
               Strict Rules: {g^#(s(x)) -> c_1(g^#(x))}
               Weak Rules: {}

             Proof Output:
               The following argument positions are usable:
                 Uargs(s) = {}, Uargs(g^#) = {}, Uargs(c_1) = {1}
               We have the following constructor-restricted matrix interpretation:
               Interpretation Functions:
                s(x1) = [1] x1 + [4]
                g^#(x1) = [2] x1 + [0]
                c_1(x1) = [1] x1 + [7]

    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.