MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            cond(true(),x) -> cond(odd(x),p(x))
            odd(0()) -> false()
            odd(s(0())) -> true()
            odd(s(s(x))) -> odd(x)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond/2,odd/1,p/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond,odd,p} and constructors {0,false,s,true}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
          odd#(0()) -> c_2()
          odd#(s(0())) -> c_3()
          odd#(s(s(x))) -> c_4(odd#(x))
          p#(0()) -> c_5()
          p#(s(x)) -> c_6()
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: UsableRules MAYBE
    + Considered Problem:
        - Strict DPs:
            cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
            odd#(0()) -> c_2()
            odd#(s(0())) -> c_3()
            odd#(s(s(x))) -> c_4(odd#(x))
            p#(0()) -> c_5()
            p#(s(x)) -> c_6()
        - Weak TRS:
            cond(true(),x) -> cond(odd(x),p(x))
            odd(0()) -> false()
            odd(s(0())) -> true()
            odd(s(s(x))) -> odd(x)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          odd(0()) -> false()
          odd(s(0())) -> true()
          odd(s(s(x))) -> odd(x)
          p(0()) -> 0()
          p(s(x)) -> x
          cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
          odd#(0()) -> c_2()
          odd#(s(0())) -> c_3()
          odd#(s(s(x))) -> c_4(odd#(x))
          p#(0()) -> c_5()
          p#(s(x)) -> c_6()
* Step 3: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
            odd#(0()) -> c_2()
            odd#(s(0())) -> c_3()
            odd#(s(s(x))) -> c_4(odd#(x))
            p#(0()) -> c_5()
            p#(s(x)) -> c_6()
        - Weak TRS:
            odd(0()) -> false()
            odd(s(0())) -> true()
            odd(s(s(x))) -> odd(x)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {2,3,5,6}
        by application of
          Pre({2,3,5,6}) = {1,4}.
        Here rules are labelled as follows:
          1: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
          2: odd#(0()) -> c_2()
          3: odd#(s(0())) -> c_3()
          4: odd#(s(s(x))) -> c_4(odd#(x))
          5: p#(0()) -> c_5()
          6: p#(s(x)) -> c_6()
* Step 4: RemoveWeakSuffixes MAYBE
    + Considered Problem:
        - Strict DPs:
            cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
            odd#(s(s(x))) -> c_4(odd#(x))
        - Weak DPs:
            odd#(0()) -> c_2()
            odd#(s(0())) -> c_3()
            p#(0()) -> c_5()
            p#(s(x)) -> c_6()
        - Weak TRS:
            odd(0()) -> false()
            odd(s(0())) -> true()
            odd(s(s(x))) -> odd(x)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:S:cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
             -->_2 odd#(s(s(x))) -> c_4(odd#(x)):2
             -->_3 p#(s(x)) -> c_6():6
             -->_3 p#(0()) -> c_5():5
             -->_2 odd#(s(0())) -> c_3():4
             -->_2 odd#(0()) -> c_2():3
             -->_1 cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)):1
          
          2:S:odd#(s(s(x))) -> c_4(odd#(x))
             -->_1 odd#(s(0())) -> c_3():4
             -->_1 odd#(0()) -> c_2():3
             -->_1 odd#(s(s(x))) -> c_4(odd#(x)):2
          
          3:W:odd#(0()) -> c_2()
             
          
          4:W:odd#(s(0())) -> c_3()
             
          
          5:W:p#(0()) -> c_5()
             
          
          6:W:p#(s(x)) -> c_6()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          5: p#(0()) -> c_5()
          6: p#(s(x)) -> c_6()
          3: odd#(0()) -> c_2()
          4: odd#(s(0())) -> c_3()
* Step 5: SimplifyRHS MAYBE
    + Considered Problem:
        - Strict DPs:
            cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
            odd#(s(s(x))) -> c_4(odd#(x))
        - Weak TRS:
            odd(0()) -> false()
            odd(s(0())) -> true()
            odd(s(s(x))) -> odd(x)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true}
    + Applied Processor:
        SimplifyRHS
    + Details:
        Consider the dependency graph
          1:S:cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x))
             -->_2 odd#(s(s(x))) -> c_4(odd#(x)):2
             -->_1 cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)):1
          
          2:S:odd#(s(s(x))) -> c_4(odd#(x))
             -->_1 odd#(s(s(x))) -> c_4(odd#(x)):2
          
        Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified:
          cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x))
* Step 6: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x))
          odd#(s(s(x))) -> c_4(odd#(x))
      - Weak TRS:
          odd(0()) -> false()
          odd(s(0())) -> true()
          odd(s(s(x))) -> odd(x)
          p(0()) -> 0()
          p(s(x)) -> x
      - Signature:
          {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE