YES(?,O(1))
* Step 1: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B) -> eval(A,B) True         (1,1)
          1. eval(A,B)  -> eval(B,A) [A >= 1 + B] (?,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,1)]
* Step 2: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B) -> eval(A,B) True         (1,1)
          1. eval(A,B)  -> eval(B,A) [A >= 1 + B] (?,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{1},1->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 3: KnowledgePropagation WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B) -> eval(A,B) True         (1,1)
          1. eval(A,B)  -> eval(B,A) [A >= 1 + B] (1,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{1},1->{}]
        
    + Applied Processor:
        KnowledgePropagation
    + Details:
        The problem is already solved.

YES(?,O(1))