MAYBE
* Step 1: DependencyPairs MAYBE
    + Considered Problem:
        - Strict TRS:
            f(true(),x,y) -> f(gt(x,y),s(x),s(s(y)))
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
        - Signature:
            {f/3,gt/2} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,gt} and constructors {0,false,s,true}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
          gt#(0(),v) -> c_2()
          gt#(s(u),0()) -> c_3()
          gt#(s(u),s(v)) -> c_4(gt#(u,v))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: UsableRules MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
            gt#(0(),v) -> c_2()
            gt#(s(u),0()) -> c_3()
            gt#(s(u),s(v)) -> c_4(gt#(u,v))
        - Weak TRS:
            f(true(),x,y) -> f(gt(x,y),s(x),s(s(y)))
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
        - Signature:
            {f/3,gt/2,f#/3,gt#/2} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,gt#} and constructors {0,false,s,true}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          gt(0(),v) -> false()
          gt(s(u),0()) -> true()
          gt(s(u),s(v)) -> gt(u,v)
          f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
          gt#(0(),v) -> c_2()
          gt#(s(u),0()) -> c_3()
          gt#(s(u),s(v)) -> c_4(gt#(u,v))
* Step 3: PredecessorEstimation MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
            gt#(0(),v) -> c_2()
            gt#(s(u),0()) -> c_3()
            gt#(s(u),s(v)) -> c_4(gt#(u,v))
        - Weak TRS:
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
        - Signature:
            {f/3,gt/2,f#/3,gt#/2} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,gt#} 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}
        by application of
          Pre({2,3}) = {1,4}.
        Here rules are labelled as follows:
          1: f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
          2: gt#(0(),v) -> c_2()
          3: gt#(s(u),0()) -> c_3()
          4: gt#(s(u),s(v)) -> c_4(gt#(u,v))
* Step 4: RemoveWeakSuffixes MAYBE
    + Considered Problem:
        - Strict DPs:
            f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
            gt#(s(u),s(v)) -> c_4(gt#(u,v))
        - Weak DPs:
            gt#(0(),v) -> c_2()
            gt#(s(u),0()) -> c_3()
        - Weak TRS:
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
        - Signature:
            {f/3,gt/2,f#/3,gt#/2} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#,gt#} and constructors {0,false,s,true}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:S:f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
             -->_2 gt#(s(u),s(v)) -> c_4(gt#(u,v)):2
             -->_2 gt#(s(u),0()) -> c_3():4
             -->_2 gt#(0(),v) -> c_2():3
             -->_1 f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y)):1
          
          2:S:gt#(s(u),s(v)) -> c_4(gt#(u,v))
             -->_1 gt#(s(u),0()) -> c_3():4
             -->_1 gt#(0(),v) -> c_2():3
             -->_1 gt#(s(u),s(v)) -> c_4(gt#(u,v)):2
          
          3:W:gt#(0(),v) -> c_2()
             
          
          4:W:gt#(s(u),0()) -> c_3()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          3: gt#(0(),v) -> c_2()
          4: gt#(s(u),0()) -> c_3()
* Step 5: Failure MAYBE
  + Considered Problem:
      - Strict DPs:
          f#(true(),x,y) -> c_1(f#(gt(x,y),s(x),s(s(y))),gt#(x,y))
          gt#(s(u),s(v)) -> c_4(gt#(u,v))
      - Weak TRS:
          gt(0(),v) -> false()
          gt(s(u),0()) -> true()
          gt(s(u),s(v)) -> gt(u,v)
      - Signature:
          {f/3,gt/2,f#/3,gt#/2} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f#,gt#} and constructors {0,false,s,true}
  + Applied Processor:
      EmptyProcessor
  + Details:
      The problem is still open.
MAYBE