Analysing control-flow refined program

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

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

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

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

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

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

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

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

All Bounds

Timebounds

Overall timebound:3⋅X₃⋅X₃⋅X₃⋅X₃+18⋅X₃⋅X₃⋅X₃+46⋅X₃⋅X₃+57⋅X₃+38 {O(n^4)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}
t₁₁: X₃+1 {O(n)}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: X₃⋅X₃+2⋅X₃ {O(n^2)}
t₁₇: X₃+1 {O(n)}
t₁₈: X₃⋅X₃+2⋅X₃ {O(n^2)}
t₁₉: X₃⋅X₃⋅X₃⋅X₃+6⋅X₃⋅X₃⋅X₃+13⋅X₃⋅X₃+13⋅X₃+6 {O(n^4)}
t₂₀: X₃⋅X₃+2⋅X₃ {O(n^2)}
t₂₁: X₃⋅X₃⋅X₃⋅X₃+6⋅X₃⋅X₃⋅X₃+13⋅X₃⋅X₃+12⋅X₃+4 {O(n^4)}
t₂₂: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₃: X₃⋅X₃⋅X₃⋅X₃+6⋅X₃⋅X₃⋅X₃+13⋅X₃⋅X₃+12⋅X₃+4 {O(n^4)}
t₂₄: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₇: 1 {O(1)}

Costbounds

Overall costbound: 3⋅X₃⋅X₃⋅X₃⋅X₃+18⋅X₃⋅X₃⋅X₃+46⋅X₃⋅X₃+57⋅X₃+38 {O(n^4)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}
t₁₁: X₃+1 {O(n)}
t₁₃: 1 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 1 {O(1)}
t₁₆: X₃⋅X₃+2⋅X₃ {O(n^2)}
t₁₇: X₃+1 {O(n)}
t₁₈: X₃⋅X₃+2⋅X₃ {O(n^2)}
t₁₉: X₃⋅X₃⋅X₃⋅X₃+6⋅X₃⋅X₃⋅X₃+13⋅X₃⋅X₃+13⋅X₃+6 {O(n^4)}
t₂₀: X₃⋅X₃+2⋅X₃ {O(n^2)}
t₂₁: X₃⋅X₃⋅X₃⋅X₃+6⋅X₃⋅X₃⋅X₃+13⋅X₃⋅X₃+12⋅X₃+4 {O(n^4)}
t₂₂: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₃: X₃⋅X₃⋅X₃⋅X₃+6⋅X₃⋅X₃⋅X₃+13⋅X₃⋅X₃+12⋅X₃+4 {O(n^4)}
t₂₄: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
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₀: 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₀: 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₀: 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₃⋅X₃+3⋅X₃+X₁+2 {O(n^2)}
t₁₁, X₃: X₃ {O(n)}
t₁₁, X₅: 0 {O(1)}
t₁₁, X₆: 3⋅X₃⋅X₃+9⋅X₃+X₆+6 {O(n^2)}
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₃⋅X₃+3⋅X₃+X₁+2 {O(n^2)}
t₁₄, X₃: 2⋅X₃ {O(n)}
t₁₄, X₄: 1 {O(1)}
t₁₄, X₅: X₃⋅X₃+3⋅X₃+X₅+2 {O(n^2)}
t₁₄, X₆: 3⋅X₃⋅X₃+9⋅X₃+X₆+6 {O(n^2)}
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⋅X₃⋅X₃+6⋅X₃+X₁+4 {O(n^2)}
t₁₆, X₃: X₃ {O(n)}
t₁₆, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₁₆, X₆: 6⋅X₃⋅X₃+18⋅X₃+X₆+12 {O(n^2)}
t₁₇, X₁: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₁₇, X₃: X₃ {O(n)}
t₁₇, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₁₇, X₆: 3⋅X₃⋅X₃+9⋅X₃+6 {O(n^2)}
t₁₈, X₁: 2⋅X₃⋅X₃+6⋅X₃+X₁+4 {O(n^2)}
t₁₈, X₃: X₃ {O(n)}
t₁₈, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₁₈, X₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₁₉, X₁: 2⋅X₃⋅X₃+6⋅X₃+X₁+4 {O(n^2)}
t₁₉, X₃: X₃ {O(n)}
t₁₉, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₁₉, X₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₀, X₁: 4⋅X₃⋅X₃+12⋅X₃+2⋅X₁+8 {O(n^2)}
t₂₀, X₃: X₃ {O(n)}
t₂₀, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₀, X₆: 2⋅X₃⋅X₃+6⋅X₃+4 {O(n^2)}
t₂₁, X₁: 2⋅X₃⋅X₃+6⋅X₃+X₁+4 {O(n^2)}
t₂₁, X₃: X₃ {O(n)}
t₂₁, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₁, X₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₂, X₁: 2⋅X₃⋅X₃+6⋅X₃+X₁+4 {O(n^2)}
t₂₂, X₃: X₃ {O(n)}
t₂₂, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₂, X₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₃, X₁: 2⋅X₃⋅X₃+6⋅X₃+X₁+4 {O(n^2)}
t₂₃, X₃: X₃ {O(n)}
t₂₃, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₃, X₆: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₄, X₁: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₄, X₃: X₃ {O(n)}
t₂₄, X₅: 2⋅X₃⋅X₃+6⋅X₃+4 {O(n^2)}
t₂₄, X₆: 3⋅X₃⋅X₃+9⋅X₃+6 {O(n^2)}
t₂₅, X₁: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₅, X₃: X₃ {O(n)}
t₂₅, X₅: 2⋅X₃⋅X₃+6⋅X₃+4 {O(n^2)}
t₂₅, X₆: 3⋅X₃⋅X₃+9⋅X₃+6 {O(n^2)}
t₂₆, X₁: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₆, X₃: X₃ {O(n)}
t₂₆, X₅: X₃⋅X₃+3⋅X₃+2 {O(n^2)}
t₂₆, X₆: 3⋅X₃⋅X₃+9⋅X₃+6 {O(n^2)}
t₂₇, X₁: X₃⋅X₃+3⋅X₁+3⋅X₃+2 {O(n^2)}
t₂₇, X₃: 4⋅X₃ {O(n)}
t₂₇, X₄: X₃+1 {O(n)}
t₂₇, X₅: X₃⋅X₃+3⋅X₃+3⋅X₅+2 {O(n^2)}
t₂₇, X₆: 3⋅X₃⋅X₃+3⋅X₆+9⋅X₃+6 {O(n^2)}