WORST_CASE(?,O(1))
* Step 1: DependencyPairs WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            =(x,y) -> xor(x,xor(y,true()))
            implies(x,y) -> xor(and(x,y),xor(x,true()))
            not(x) -> xor(x,true())
            or(x,y) -> xor(and(x,y),xor(x,y))
        - Signature:
            {=/2,implies/2,not/1,or/2} / {and/2,true/0,xor/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {=,implies,not,or} and constructors {and,true,xor}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          =#(x,y) -> c_1()
          implies#(x,y) -> c_2()
          not#(x) -> c_3()
          or#(x,y) -> c_4()
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 2: PredecessorEstimation WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            =#(x,y) -> c_1()
            implies#(x,y) -> c_2()
            not#(x) -> c_3()
            or#(x,y) -> c_4()
        - Weak TRS:
            =(x,y) -> xor(x,xor(y,true()))
            implies(x,y) -> xor(and(x,y),xor(x,true()))
            not(x) -> xor(x,true())
            or(x,y) -> xor(and(x,y),xor(x,y))
        - Signature:
            {=/2,implies/2,not/1,or/2,=#/2,implies#/2,not#/1,or#/2} / {and/2,true/0,xor/2,c_1/0,c_2/0,c_3/0,c_4/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {=#,implies#,not#,or#} and constructors {and,true,xor}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {1,2,3,4}
        by application of
          Pre({1,2,3,4}) = {}.
        Here rules are labelled as follows:
          1: =#(x,y) -> c_1()
          2: implies#(x,y) -> c_2()
          3: not#(x) -> c_3()
          4: or#(x,y) -> c_4()
* Step 3: RemoveWeakSuffixes WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak DPs:
            =#(x,y) -> c_1()
            implies#(x,y) -> c_2()
            not#(x) -> c_3()
            or#(x,y) -> c_4()
        - Weak TRS:
            =(x,y) -> xor(x,xor(y,true()))
            implies(x,y) -> xor(and(x,y),xor(x,true()))
            not(x) -> xor(x,true())
            or(x,y) -> xor(and(x,y),xor(x,y))
        - Signature:
            {=/2,implies/2,not/1,or/2,=#/2,implies#/2,not#/1,or#/2} / {and/2,true/0,xor/2,c_1/0,c_2/0,c_3/0,c_4/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {=#,implies#,not#,or#} and constructors {and,true,xor}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:W:=#(x,y) -> c_1()
             
          
          2:W:implies#(x,y) -> c_2()
             
          
          3:W:not#(x) -> c_3()
             
          
          4:W:or#(x,y) -> c_4()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          4: or#(x,y) -> c_4()
          3: not#(x) -> c_3()
          2: implies#(x,y) -> c_2()
          1: =#(x,y) -> c_1()
* Step 4: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            =(x,y) -> xor(x,xor(y,true()))
            implies(x,y) -> xor(and(x,y),xor(x,true()))
            not(x) -> xor(x,true())
            or(x,y) -> xor(and(x,y),xor(x,y))
        - Signature:
            {=/2,implies/2,not/1,or/2,=#/2,implies#/2,not#/1,or#/2} / {and/2,true/0,xor/2,c_1/0,c_2/0,c_3/0,c_4/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {=#,implies#,not#,or#} and constructors {and,true,xor}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))