Analysing control-flow refined program

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

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

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₄₉: eval_realheapsort_bb8_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb9_in_v1(X₀, X₁, X₂, X₃, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₀: eval_realheapsort_bb8_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb10_in_v1(X₀, X₁, X₂, X₃, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₁: eval_realheapsort_bb10_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb12_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, 1+2⋅X₈) :|: X₆ ≤ 3+2⋅X₈+X₁₀ ∧ X₆ ≤ 3+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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3+2⋅X₈+X₁₀ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₂: eval_realheapsort_bb12_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_35_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) :|: X₆ ≤ 3+2⋅X₈+X₁₀ ∧ X₆ ≤ 3+X₁₀ ∧ X₉ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3+2⋅X₈ ≤ X₆ ∧ 3+2⋅X₈+X₁₀ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₃: eval_realheapsort_35_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_36_v1(X₀, X₁, nondef.7, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) :|: X₆ ≤ 3+2⋅X₈+X₁₀ ∧ X₆ ≤ 3+X₁₀ ∧ X₉ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3+2⋅X₈ ≤ X₆ ∧ 3+2⋅X₈+X₁₀ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₄: eval_realheapsort_36_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_37_v1(X₀, X₁, X₂, nondef.8, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) :|: X₆ ≤ 3+2⋅X₈+X₁₀ ∧ X₆ ≤ 3+X₁₀ ∧ X₉ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3+2⋅X₈ ≤ X₆ ∧ 3+2⋅X₈+X₁₀ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₅: eval_realheapsort_37_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb7_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₆, X₉, X₁₀, X₁₁) :|: X₂ ≤ X₃ ∧ X₆ ≤ 3+2⋅X₈+X₁₀ ∧ X₆ ≤ 3+X₁₀ ∧ X₉ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3+2⋅X₈ ≤ X₆ ∧ 3+2⋅X₈+X₁₀ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₆: eval_realheapsort_37_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb13_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) :|: 1+X₃ ≤ X₂ ∧ X₆ ≤ 3+2⋅X₈+X₁₀ ∧ X₆ ≤ 3+X₁₀ ∧ X₉ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3+2⋅X₈ ≤ X₆ ∧ 3+2⋅X₈+X₁₀ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₇: eval_realheapsort_bb13_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_38_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) :|: X₆ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₈: eval_realheapsort_38_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_39_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) :|: X₆ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₅₉: eval_realheapsort_39_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb7_in_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₁₁, X₉, X₁₀, X₁₁) :|: X₆ ≤ 3+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₆ ∧ 2+X₁₁ ≤ X₉ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₂: eval_realheapsort_bb9_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_26_v1(X₀, X₁, 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₆ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₃: eval_realheapsort_26_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_27_v1(nondef.5, X₁, 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₆ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₄: eval_realheapsort_27_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_28_v1(X₀, nondef.6, 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₆ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₅: eval_realheapsort_28_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb11_in_v1(X₀, X₁, X₂, X₃, 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₆ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₆: eval_realheapsort_28_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb10_in_v2(X₀, X₁, X₂, X₃, 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₆ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₇: eval_realheapsort_bb10_in_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb12_in_v2(X₀, X₁, X₂, X₃, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₈: eval_realheapsort_bb12_in_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_35_v2(X₀, X₁, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₆₉: eval_realheapsort_35_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_36_v2(X₀, X₁, nondef.7, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₇₀: eval_realheapsort_36_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_37_v2(X₀, X₁, X₂, nondef.8, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₇₁: eval_realheapsort_37_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb7_in_v1(X₀, X₁, X₂, X₃, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₇₂: eval_realheapsort_37_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb13_in_v2(X₀, X₁, X₂, X₃, 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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₇₃: eval_realheapsort_bb13_in_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_38_v2(X₀, X₁, 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+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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₇₄: eval_realheapsort_38_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_39_v2(X₀, X₁, 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+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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₅₇₅: eval_realheapsort_39_v2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb7_in_v3(X₀, X₁, 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+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₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ 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₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 5 ≤ X₆+X₁₁ ∧ 5 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 8 ≤ X₆+X₉ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₂: eval_realheapsort_bb11_in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb12_in_v6(X₀, X₁, X₂, X₃, 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₆ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₃: eval_realheapsort_bb12_in_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_35_v6(X₀, X₁, 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₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4+2⋅X₈+X₁₀ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₄: eval_realheapsort_35_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_36_v6(X₀, X₁, nondef.7, 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₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4+2⋅X₈+X₁₀ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₅: eval_realheapsort_36_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_37_v6(X₀, X₁, X₂, nondef.8, 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₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4+2⋅X₈+X₁₀ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₆: eval_realheapsort_37_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb7_in_v1(X₀, X₁, X₂, X₃, 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₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4+2⋅X₈+X₁₀ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₇: eval_realheapsort_37_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb13_in_v6(X₀, X₁, X₂, X₃, 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₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4+2⋅X₈+X₁₀ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₈: eval_realheapsort_bb13_in_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_38_v6(X₀, X₁, 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₁₀+X₁₁ ∧ 1 ≤ X₁₁ ∧ 2+X₁₁ ≤ X₆ ∧ 2 ≤ X₈+X₁₁ ∧ 2+X₈ ≤ X₁₁ ∧ 2+2⋅X₈ ≤ X₁₁ ∧ 2+X₁₀+X₁₁ ≤ X₉ ∧ 2+X₁₁ ≤ X₉ ∧ 2 ≤ X₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₁₉: eval_realheapsort_38_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_39_v6(X₀, X₁, 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₁₀+X₁₁ ∧ 1 ≤ X₁₁ ∧ 2+X₁₁ ≤ X₆ ∧ 2 ≤ X₈+X₁₁ ∧ 2+X₈ ≤ X₁₁ ∧ 2+2⋅X₈ ≤ X₁₁ ∧ 2+X₁₀+X₁₁ ≤ X₉ ∧ 2+X₁₁ ≤ X₉ ∧ 2 ≤ X₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

knowledge_propagation leads to new time bound X₆+3 {O(n)} for transition t₆₂₀: eval_realheapsort_39_v6(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁) → eval_realheapsort_bb7_in_v3(X₀, X₁, 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₁₀+X₁₁ ∧ 1 ≤ X₁₁ ∧ 2+X₁₁ ≤ X₆ ∧ 2 ≤ X₈+X₁₁ ∧ 2+X₈ ≤ X₁₁ ∧ 2+2⋅X₈ ≤ X₁₁ ∧ 2+X₁₀+X₁₁ ≤ X₉ ∧ 2+X₁₁ ≤ X₉ ∧ 2 ≤ X₁₀+X₁₁ ∧ 2 ≤ X₁₁ ∧ 3 ≤ X₆ ∧ 3 ≤ X₆+X₈ ∧ 3+X₈ ≤ X₆ ∧ 3 ≤ X₆+X₁₀ ∧ 3+X₁₀ ≤ X₆ ∧ 3 ≤ X₈+X₉ ∧ 3+X₈ ≤ X₉ ∧ 3 ≤ X₉ ∧ 3 ≤ X₉+X₁₀ ∧ 3+X₁₀ ≤ X₉ ∧ 4 ≤ X₆ ∧ 4 ≤ X₆+X₈ ∧ 4+X₈ ≤ X₆ ∧ 4 ≤ X₆+X₁₀ ∧ 4+X₁₀ ≤ X₆ ∧ 4 ≤ X₆+X₁₁ ∧ 4 ≤ X₈+X₉ ∧ 4+X₈ ≤ X₉ ∧ 4 ≤ X₉ ∧ 4 ≤ X₉+X₁₀ ∧ 4+X₁₀ ≤ X₉ ∧ 4 ≤ X₉+X₁₁ ∧ 6 ≤ X₆+X₉ ∧ 6 ≤ X₆+X₁₁ ∧ 6 ≤ X₉+X₁₁ ∧ 8 ≤ X₆+X₉ ∧ X₁ ≤ X₀ ∧ X₉ ≤ X₆ ∧ X₆ ≤ X₉ ∧ 0 ≤ X₈ ∧ 0 ≤ X₈+X₁₀ ∧ X₈ ≤ 0 ∧ X₈ ≤ X₁₀ ∧ 0 ≤ X₁₀

All Bounds

Timebounds

Overall timebound:40⋅X₆⋅X₆+144⋅X₆+148 {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₅: 2⋅X₆⋅X₆+7⋅X₆+8 {O(n^2)}
t₆: X₆+2 {O(n)}
t₇: 2⋅X₆⋅X₆+6⋅X₆+6 {O(n^2)}
t₉: 2⋅X₆⋅X₆+6⋅X₆+6 {O(n^2)}
t₁₁: 2⋅X₆⋅X₆+6⋅X₆+6 {O(n^2)}
t₁₂: 2⋅X₆⋅X₆+7⋅X₆+8 {O(n^2)}
t₁₃: X₆+1 {O(n)}
t₁₄: 3⋅X₆⋅X₆+10⋅X₆+11 {O(n^2)}
t₁₆: 2⋅X₆⋅X₆+10⋅X₆+14 {O(n^2)}
t₁₈: 2⋅X₆⋅X₆+8⋅X₆+9 {O(n^2)}
t₂₀: X₆+1 {O(n)}
t₂₁: X₆+2 {O(n)}
t₂₂: 1 {O(1)}
t₂₃: X₆+1 {O(n)}
t₂₅: X₆+3 {O(n)}
t₂₆: X₆+3 {O(n)}
t₂₇: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₂₈: X₆+3 {O(n)}
t₂₉: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₃₀: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₃₂: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₃₄: 2⋅X₆⋅X₆+8⋅X₆+8 {O(n^2)}
t₃₆: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₃₇: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₃₈: 2⋅X₆⋅X₆+6⋅X₆+4 {O(n^2)}
t₃₉: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₀: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₁: 2⋅X₆⋅X₆+8⋅X₆+8 {O(n^2)}
t₄₃: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₅: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₄₆: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₇: 3⋅X₆⋅X₆+12⋅X₆+12 {O(n^2)}
t₄₈: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₅₀: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₅₁: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₅₂: X₆+1 {O(n)}
t₅₃: 1 {O(1)}

Costbounds

Overall costbound: 40⋅X₆⋅X₆+144⋅X₆+148 {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₅: 2⋅X₆⋅X₆+7⋅X₆+8 {O(n^2)}
t₆: X₆+2 {O(n)}
t₇: 2⋅X₆⋅X₆+6⋅X₆+6 {O(n^2)}
t₉: 2⋅X₆⋅X₆+6⋅X₆+6 {O(n^2)}
t₁₁: 2⋅X₆⋅X₆+6⋅X₆+6 {O(n^2)}
t₁₂: 2⋅X₆⋅X₆+7⋅X₆+8 {O(n^2)}
t₁₃: X₆+1 {O(n)}
t₁₄: 3⋅X₆⋅X₆+10⋅X₆+11 {O(n^2)}
t₁₆: 2⋅X₆⋅X₆+10⋅X₆+14 {O(n^2)}
t₁₈: 2⋅X₆⋅X₆+8⋅X₆+9 {O(n^2)}
t₂₀: X₆+1 {O(n)}
t₂₁: X₆+2 {O(n)}
t₂₂: 1 {O(1)}
t₂₃: X₆+1 {O(n)}
t₂₅: X₆+3 {O(n)}
t₂₆: X₆+3 {O(n)}
t₂₇: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₂₈: X₆+3 {O(n)}
t₂₉: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₃₀: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₃₂: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₃₄: 2⋅X₆⋅X₆+8⋅X₆+8 {O(n^2)}
t₃₆: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₃₇: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₃₈: 2⋅X₆⋅X₆+6⋅X₆+4 {O(n^2)}
t₃₉: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₀: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₁: 2⋅X₆⋅X₆+8⋅X₆+8 {O(n^2)}
t₄₃: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₅: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₄₆: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₄₇: 3⋅X₆⋅X₆+12⋅X₆+12 {O(n^2)}
t₄₈: X₆⋅X₆+2⋅X₆ {O(n^2)}
t₅₀: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₅₁: X₆⋅X₆+4⋅X₆+4 {O(n^2)}
t₅₂: X₆+1 {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₂: 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₉: 1 {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₈: 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₆+3 {O(n)}
t₃, X₈: X₈ {O(n)}
t₃, X₉: X₆+2 {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₆+3 {O(n)}
t₄, X₈: X₈ {O(n)}
t₄, X₉: X₆+2 {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₆+3 {O(n)}
t₅, X₈: X₈ {O(n)}
t₅, X₉: X₆+2 {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₆+2 {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₆+3 {O(n)}
t₇, X₈: X₈ {O(n)}
t₇, X₉: X₆+2 {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₆+3 {O(n)}
t₉, X₈: X₈ {O(n)}
t₉, X₉: X₆+2 {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₆+3 {O(n)}
t₁₁, X₈: X₈ {O(n)}
t₁₁, X₉: X₆+2 {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₆+3 {O(n)}
t₁₂, X₈: X₈ {O(n)}
t₁₂, X₉: X₆+2 {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₆+3 {O(n)}
t₁₃, X₈: X₈ {O(n)}
t₁₃, X₉: X₆+2 {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₆+3 {O(n)}
t₁₄, X₈: X₈ {O(n)}
t₁₄, X₉: X₆+2 {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₆+3 {O(n)}
t₁₆, X₈: X₈ {O(n)}
t₁₆, X₉: X₆+2 {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₆+3 {O(n)}
t₁₈, X₈: X₈ {O(n)}
t₁₈, X₉: X₆+2 {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₆+3 {O(n)}
t₂₀, X₈: X₈ {O(n)}
t₂₀, X₉: X₆+2 {O(n)}
t₂₀, X₁₀: X₁₀ {O(n)}
t₂₀, X₁₁: X₁₁ {O(n)}
t₂₁, X₆: X₆ {O(n)}
t₂₁, X₇: X₆+3 {O(n)}
t₂₁, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆+X₈ {O(EXP)}
t₂₁, X₉: X₆+2 {O(n)}
t₂₁, X₁₀: X₆+1 {O(n)}
t₂₁, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₂, X₆: X₆ {O(n)}
t₂₂, X₇: X₆+3 {O(n)}
t₂₂, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆ {O(EXP)}
t₂₂, X₉: X₆+2 {O(n)}
t₂₂, X₁₀: X₆+1 {O(n)}
t₂₂, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₃, X₆: X₆ {O(n)}
t₂₃, X₇: X₆+3 {O(n)}
t₂₃, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆+X₈ {O(EXP)}
t₂₃, X₉: X₆+2 {O(n)}
t₂₃, X₁₀: X₆+1 {O(n)}
t₂₃, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₅, X₆: X₆ {O(n)}
t₂₅, X₇: X₆+3 {O(n)}
t₂₅, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆+X₈ {O(EXP)}
t₂₅, X₉: X₆+2 {O(n)}
t₂₅, X₁₀: X₆+1 {O(n)}
t₂₅, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₆, X₆: X₆ {O(n)}
t₂₆, X₇: X₆+3 {O(n)}
t₂₆, X₈: 0 {O(1)}
t₂₆, X₉: X₆+2 {O(n)}
t₂₆, X₁₀: X₆+1 {O(n)}
t₂₆, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₇, X₆: X₆ {O(n)}
t₂₇, X₇: X₆+3 {O(n)}
t₂₇, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₂₇, X₉: X₆+2 {O(n)}
t₂₇, X₁₀: X₆+1 {O(n)}
t₂₇, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₈, X₆: X₆ {O(n)}
t₂₈, X₇: X₆+3 {O(n)}
t₂₈, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆ {O(EXP)}
t₂₈, X₉: X₆+2 {O(n)}
t₂₈, X₁₀: X₆+1 {O(n)}
t₂₈, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₂₉, X₆: X₆ {O(n)}
t₂₉, X₇: X₆+3 {O(n)}
t₂₉, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₂₉, X₉: X₆+2 {O(n)}
t₂₉, X₁₀: X₆+1 {O(n)}
t₂₉, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₀, X₆: X₆ {O(n)}
t₃₀, X₇: X₆+3 {O(n)}
t₃₀, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₃₀, X₉: X₆+2 {O(n)}
t₃₀, X₁₀: X₆+1 {O(n)}
t₃₀, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₂, X₆: X₆ {O(n)}
t₃₂, X₇: X₆+3 {O(n)}
t₃₂, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₃₂, X₉: X₆+2 {O(n)}
t₃₂, X₁₀: X₆+1 {O(n)}
t₃₂, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₄, X₆: X₆ {O(n)}
t₃₄, X₇: X₆+3 {O(n)}
t₃₄, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₃₄, X₉: X₆+2 {O(n)}
t₃₄, X₁₀: X₆+1 {O(n)}
t₃₄, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₆, X₆: X₆ {O(n)}
t₃₆, X₇: X₆+3 {O(n)}
t₃₆, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₃₆, X₉: X₆+2 {O(n)}
t₃₆, X₁₀: X₆+1 {O(n)}
t₃₆, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₇, X₆: X₆ {O(n)}
t₃₇, X₇: X₆+3 {O(n)}
t₃₇, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₃₇, X₉: X₆+2 {O(n)}
t₃₇, X₁₀: X₆+1 {O(n)}
t₃₇, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₈, X₆: X₆ {O(n)}
t₃₈, X₇: X₆+3 {O(n)}
t₃₈, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₃₈, X₉: X₆+2 {O(n)}
t₃₈, X₁₀: X₆+1 {O(n)}
t₃₈, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₃₉, X₆: X₆ {O(n)}
t₃₉, X₇: X₆+3 {O(n)}
t₃₉, X₈: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₃₉, X₉: X₆+2 {O(n)}
t₃₉, X₁₀: X₆+1 {O(n)}
t₃₉, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₀, X₆: X₆ {O(n)}
t₄₀, X₇: X₆+3 {O(n)}
t₄₀, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₀, X₉: X₆+2 {O(n)}
t₄₀, X₁₀: X₆+1 {O(n)}
t₄₀, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₁, X₆: X₆ {O(n)}
t₄₁, X₇: X₆+3 {O(n)}
t₄₁, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₄₁, X₉: X₆+2 {O(n)}
t₄₁, X₁₀: X₆+1 {O(n)}
t₄₁, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₃, X₆: X₆ {O(n)}
t₄₃, X₇: X₆+3 {O(n)}
t₄₃, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₄₃, X₉: X₆+2 {O(n)}
t₄₃, X₁₀: X₆+1 {O(n)}
t₄₃, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₅, X₆: X₆ {O(n)}
t₄₅, X₇: X₆+3 {O(n)}
t₄₅, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₄₅, X₉: X₆+2 {O(n)}
t₄₅, X₁₀: X₆+1 {O(n)}
t₄₅, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₆, X₆: X₆ {O(n)}
t₄₆, X₇: X₆+3 {O(n)}
t₄₆, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₄₆, X₉: X₆+2 {O(n)}
t₄₆, X₁₀: X₆+1 {O(n)}
t₄₆, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₇, X₆: X₆ {O(n)}
t₄₇, X₇: X₆+3 {O(n)}
t₄₇, X₈: X₆ {O(n)}
t₄₇, X₉: X₆+2 {O(n)}
t₄₇, X₁₀: X₆+1 {O(n)}
t₄₇, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₄₈, X₆: X₆ {O(n)}
t₄₈, X₇: X₆+3 {O(n)}
t₄₈, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₄₈, X₉: X₆+2 {O(n)}
t₄₈, X₁₀: X₆+1 {O(n)}
t₄₈, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₅₀, X₆: X₆ {O(n)}
t₅₀, X₇: X₆+3 {O(n)}
t₅₀, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆ {O(EXP)}
t₅₀, X₉: X₆+2 {O(n)}
t₅₀, X₁₀: X₆+1 {O(n)}
t₅₀, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₅₁, X₆: X₆ {O(n)}
t₅₁, X₇: X₆+3 {O(n)}
t₅₁, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₅₁, X₉: X₆+2 {O(n)}
t₅₁, X₁₀: X₆+1 {O(n)}
t₅₁, X₁₁: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆ {O(EXP)}
t₅₂, X₆: X₆ {O(n)}
t₅₂, X₇: X₆+3 {O(n)}
t₅₂, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆ {O(EXP)}
t₅₂, X₉: X₆+2 {O(n)}
t₅₂, X₁₀: X₆+1 {O(n)}
t₅₂, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+X₁₁ {O(EXP)}
t₅₃, X₆: 2⋅X₆ {O(n)}
t₅₃, X₇: X₆+X₇+3 {O(n)}
t₅₃, X₈: 2⋅2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆+X₆+X₈ {O(EXP)}
t₅₃, X₉: X₆+X₉+2 {O(n)}
t₅₃, X₁₀: X₁₀+X₆+1 {O(n)}
t₅₃, X₁₁: 2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅4⋅X₆⋅X₆+2^(2⋅X₆)⋅2^(2⋅X₆)⋅2^(X₆⋅X₆)⋅2^(X₆⋅X₆)⋅8⋅X₆+2⋅X₁₁ {O(EXP)}