Analysing control-flow refined program

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₅₇: eval_realheapsort_step2_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb4_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 3+2⋅X₅+X₆ ≤ X₄ ∧ 2+X₆ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₅₈: eval_realheapsort_step2_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb10_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₄ ≤ 2+2⋅X₅+X₆ ∧ 2+X₆ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₅₉: eval_realheapsort_step2_bb4_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb6_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₄ ≤ 3+2⋅X₅+X₆ ∧ 3+2⋅X₅+X₆ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₀: eval_realheapsort_step2_bb4_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb5_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 4+2⋅X₅+X₆ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3+2⋅X₅+X₆ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₁: eval_realheapsort_step2_bb5_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_14_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₂: eval_realheapsort_step2_14_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_15_v1(nondef.1, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₃: eval_realheapsort_step2_15_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_16_v1(X₀, nondef.2, X₂, X₃, X₄, X₅, X₆, X₇) :|: 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₄: eval_realheapsort_step2_16_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb7_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₁ ≤ X₀ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₅: eval_realheapsort_step2_16_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb6_in_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₀ ≤ X₁ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₆: eval_realheapsort_step2_bb6_in_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb8_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, 1+2⋅X₅) :|: 1+X₀ ≤ X₁ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₇: eval_realheapsort_step2_bb8_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_23_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₈: eval_realheapsort_step2_23_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_24_v1(X₀, X₁, nondef.3, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₆₉: eval_realheapsort_step2_24_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_25_v1(X₀, X₁, X₂, nondef.4, X₄, X₅, X₆, X₇) :|: X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₆+X₇ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₇₀: eval_realheapsort_step2_25_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb9_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₃ ≤ X₂ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₇₁: eval_realheapsort_step2_25_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb3_in_v1(X₀, X₁, X₂, X₃, X₄, X₄, X₆, X₇) :|: X₂ ≤ X₃ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₇₃: eval_realheapsort_step2_bb9_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_26_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₇₄: eval_realheapsort_step2_26_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_27_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₁₇₅: eval_realheapsort_step2_27_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb3_in_v2(X₀, X₁, X₂, X₃, X₄, X₇, X₆, X₇) :|: X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₀ ≤ X₁ ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 3+X₇ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 5 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₃: eval_realheapsort_step2_bb7_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb8_in_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, 2+2⋅X₅) :|: 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₄: eval_realheapsort_step2_bb8_in_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_23_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₅: eval_realheapsort_step2_23_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_24_v5(X₀, X₁, nondef.3, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₆: eval_realheapsort_step2_24_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_25_v5(X₀, X₁, X₂, nondef.4, X₄, X₅, X₆, X₇) :|: X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₇: eval_realheapsort_step2_25_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb9_in_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₃ ≤ X₂ ∧ X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₈: eval_realheapsort_step2_25_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb3_in_v1(X₀, X₁, X₂, X₃, X₄, X₄, X₆, X₇) :|: X₂ ≤ X₃ ∧ X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₁₉: eval_realheapsort_step2_bb9_in_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_26_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₀: eval_realheapsort_step2_26_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_27_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₁: eval_realheapsort_step2_27_v5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb3_in_v2(X₀, X₁, X₂, X₃, X₄, X₇, X₆, X₇) :|: X₇ ≤ 2+2⋅X₅ ∧ X₇ ≤ 2+X₅ ∧ X₅+X₇ ≤ 2 ∧ X₇ ≤ 2+X₆ ∧ X₇ ≤ 2 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₇ ≤ X₄ ∧ 2 ≤ X₅+X₇ ∧ 2+X₅ ≤ X₇ ∧ 2+2⋅X₅ ≤ X₇ ∧ 2 ≤ X₆+X₇ ∧ 2 ≤ X₇ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄ ∧ 4 ≤ X₄+X₅ ∧ 4+X₅ ≤ X₄ ∧ 4+2⋅X₅+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₆ ∧ 4+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 6 ≤ X₄+X₇ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₂: eval_realheapsort_step2_bb6_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb8_in_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, 1+2⋅X₅) :|: X₄ ≤ 3+2⋅X₅+X₆ ∧ X₄ ≤ 3+X₆ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3+2⋅X₅+X₆ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₃: eval_realheapsort_step2_bb8_in_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_23_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₄: eval_realheapsort_step2_23_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_24_v6(X₀, X₁, nondef.3, X₃, X₄, X₅, X₆, X₇) :|: X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₅: eval_realheapsort_step2_24_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_25_v6(X₀, X₁, X₂, nondef.4, X₄, X₅, X₆, X₇) :|: X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₆: eval_realheapsort_step2_25_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb9_in_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₃ ≤ X₂ ∧ X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₇: eval_realheapsort_step2_25_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb3_in_v1(X₀, X₁, X₂, X₃, X₄, X₄, X₆, X₇) :|: X₂ ≤ X₃ ∧ X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₈: eval_realheapsort_step2_bb9_in_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_26_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₂₉: eval_realheapsort_step2_26_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_27_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

knowledge_propagation leads to new time bound X₄+1 {O(n)} for transition t₂₃₀: eval_realheapsort_step2_27_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → eval_realheapsort_step2_bb3_in_v3(X₀, X₁, X₂, X₃, X₄, X₇, X₆, X₇) :|: X₄ ≤ 3+X₆ ∧ X₄ ≤ 2+X₆+X₇ ∧ X₇ ≤ 1+2⋅X₅ ∧ X₇ ≤ 1+X₅ ∧ X₅+X₇ ≤ 1 ∧ X₇ ≤ 1+X₆ ∧ X₇ ≤ 1 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₅+X₇ ∧ 1+X₅ ≤ X₇ ∧ 1+2⋅X₅ ≤ X₇ ∧ 1 ≤ X₆+X₇ ∧ 1 ≤ X₇ ∧ 2+X₆+X₇ ≤ X₄ ∧ 2+X₇ ≤ X₄ ∧ 3 ≤ X₄ ∧ 3 ≤ X₄+X₅ ∧ 3+X₅ ≤ X₄ ∧ 3 ≤ X₄+X₆ ∧ 3+X₆ ≤ X₄ ∧ 4 ≤ X₄+X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₆ ∧ X₅ ≤ 0 ∧ X₅ ≤ X₆ ∧ 0 ≤ X₆

All Bounds

Timebounds

Overall timebound:19⋅X₄⋅X₄+35⋅X₄+20 {O(n^2)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: X₄+1 {O(n)}
t₄: 1 {O(1)}
t₅: X₄+1 {O(n)}
t₇: X₄+1 {O(n)}
t₈: X₄+1 {O(n)}
t₉: X₄⋅X₄+X₄ {O(n^2)}
t₁₀: X₄+1 {O(n)}
t₁₁: X₄⋅X₄+X₄ {O(n^2)}
t₁₂: 2⋅X₄⋅X₄+2⋅X₄ {O(n^2)}
t₁₄: X₄⋅X₄+X₄ {O(n^2)}
t₁₆: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₁₈: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₁₉: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₀: X₄⋅X₄+3⋅X₄+2 {O(n^2)}
t₂₁: X₄⋅X₄+X₄ {O(n^2)}
t₂₂: X₄⋅X₄+X₄ {O(n^2)}
t₂₃: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₅: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₇: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₈: X₄⋅X₄+X₄ {O(n^2)}
t₂₉: X₄⋅X₄+X₄ {O(n^2)}
t₃₀: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₃₂: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₃₃: X₄⋅X₄+X₄ {O(n^2)}
t₃₄: X₄ {O(n)}
t₃₅: 1 {O(1)}

Costbounds

Overall costbound: 19⋅X₄⋅X₄+35⋅X₄+20 {O(n^2)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: X₄+1 {O(n)}
t₄: 1 {O(1)}
t₅: X₄+1 {O(n)}
t₇: X₄+1 {O(n)}
t₈: X₄+1 {O(n)}
t₉: X₄⋅X₄+X₄ {O(n^2)}
t₁₀: X₄+1 {O(n)}
t₁₁: X₄⋅X₄+X₄ {O(n^2)}
t₁₂: 2⋅X₄⋅X₄+2⋅X₄ {O(n^2)}
t₁₄: X₄⋅X₄+X₄ {O(n^2)}
t₁₆: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₁₈: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₁₉: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₀: X₄⋅X₄+3⋅X₄+2 {O(n^2)}
t₂₁: X₄⋅X₄+X₄ {O(n^2)}
t₂₂: X₄⋅X₄+X₄ {O(n^2)}
t₂₃: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₅: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₇: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₂₈: X₄⋅X₄+X₄ {O(n^2)}
t₂₉: X₄⋅X₄+X₄ {O(n^2)}
t₃₀: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₃₂: X₄⋅X₄+2⋅X₄+1 {O(n^2)}
t₃₃: X₄⋅X₄+X₄ {O(n^2)}
t₃₄: X₄ {O(n)}
t₃₅: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₀, X₃: X₃ {O(n)}
t₀, X₄: X₄ {O(n)}
t₀, X₅: X₅ {O(n)}
t₀, X₆: X₆ {O(n)}
t₀, X₇: X₇ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}
t₁, X₃: X₃ {O(n)}
t₁, X₄: X₄ {O(n)}
t₁, X₅: X₅ {O(n)}
t₁, X₆: 0 {O(1)}
t₁, X₇: X₇ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₂, X₂: X₂ {O(n)}
t₂, X₃: X₃ {O(n)}
t₂, X₄: X₄ {O(n)}
t₂, X₅: X₅ {O(n)}
t₂, X₆: X₆ {O(n)}
t₂, X₇: X₇ {O(n)}
t₃, X₄: X₄ {O(n)}
t₃, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄+X₅ {O(EXP)}
t₃, X₆: X₄ {O(n)}
t₃, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₄, X₄: X₄ {O(n)}
t₄, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄ {O(EXP)}
t₄, X₆: X₄ {O(n)}
t₄, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₅, X₄: X₄ {O(n)}
t₅, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄+X₅ {O(EXP)}
t₅, X₆: X₄ {O(n)}
t₅, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₇, X₄: X₄ {O(n)}
t₇, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄+X₅ {O(EXP)}
t₇, X₆: X₄ {O(n)}
t₇, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₈, X₄: X₄ {O(n)}
t₈, X₅: 0 {O(1)}
t₈, X₆: X₄ {O(n)}
t₈, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₉, X₄: X₄ {O(n)}
t₉, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₉, X₆: X₄ {O(n)}
t₉, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₀, X₄: X₄ {O(n)}
t₁₀, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄ {O(EXP)}
t₁₀, X₆: X₄ {O(n)}
t₁₀, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₁, X₄: X₄ {O(n)}
t₁₁, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₁₁, X₆: X₄ {O(n)}
t₁₁, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₂, X₄: X₄ {O(n)}
t₁₂, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₁₂, X₆: X₄ {O(n)}
t₁₂, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₄, X₄: X₄ {O(n)}
t₁₄, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₁₄, X₆: X₄ {O(n)}
t₁₄, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₆, X₄: X₄ {O(n)}
t₁₆, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₁₆, X₆: X₄ {O(n)}
t₁₆, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₈, X₄: X₄ {O(n)}
t₁₈, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₁₈, X₆: X₄ {O(n)}
t₁₈, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₁₉, X₄: X₄ {O(n)}
t₁₉, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₁₉, X₆: X₄ {O(n)}
t₁₉, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₂₀, X₄: X₄ {O(n)}
t₂₀, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₀, X₆: X₄ {O(n)}
t₂₀, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₂₁, X₄: X₄ {O(n)}
t₂₁, X₅: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₂₁, X₆: X₄ {O(n)}
t₂₁, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₂, X₄: X₄ {O(n)}
t₂₂, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₂, X₆: X₄ {O(n)}
t₂₂, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₃, X₄: X₄ {O(n)}
t₂₃, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₂₃, X₆: X₄ {O(n)}
t₂₃, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₅, X₄: X₄ {O(n)}
t₂₅, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₂₅, X₆: X₄ {O(n)}
t₂₅, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₇, X₄: X₄ {O(n)}
t₂₇, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₂₇, X₆: X₄ {O(n)}
t₂₇, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₈, X₄: X₄ {O(n)}
t₂₈, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₂₈, X₆: X₄ {O(n)}
t₂₈, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₂₉, X₄: X₄ {O(n)}
t₂₉, X₅: X₄ {O(n)}
t₂₉, X₆: X₄ {O(n)}
t₂₉, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₃₀, X₄: X₄ {O(n)}
t₃₀, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₃₀, X₆: X₄ {O(n)}
t₃₀, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₃₂, X₄: X₄ {O(n)}
t₃₂, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄ {O(EXP)}
t₃₂, X₆: X₄ {O(n)}
t₃₂, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₃₃, X₄: X₄ {O(n)}
t₃₃, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₃₃, X₆: X₄ {O(n)}
t₃₃, X₇: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄ {O(EXP)}
t₃₄, X₄: X₄ {O(n)}
t₃₄, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄ {O(EXP)}
t₃₄, X₆: X₄ {O(n)}
t₃₄, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+X₇ {O(EXP)}
t₃₅, X₄: 2⋅X₄ {O(n)}
t₃₅, X₅: 2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄+2⋅2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅X₄⋅X₄+X₄+X₅ {O(EXP)}
t₃₅, X₆: X₄+X₆ {O(n)}
t₃₅, X₇: 2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄+2^(X₄)⋅2^(X₄)⋅2^(X₄⋅X₄)⋅2^(X₄⋅X₄)⋅4⋅X₄⋅X₄+2⋅X₇ {O(EXP)}