simp (config := {decide := true}) only [ite_false, ite_true] at h0012 h0021 h0022 h0112 h0121 h0122 h0212 h0221 h0222 h1022 h1112 h1121 h1122
case intro
F : Type
inst✝ : Field F
n_stmt n_wit n_var : ℕ
u_stmt : Fin n_stmt → Polynomial F
u_wit : Fin n_wit → Polynomial F
v_stmt : Fin n_stmt → Polynomial F
v_wit : Fin n_wit → Polynomial F
w_stmt : Fin n_stmt → Polynomial F
w_wit : Fin n_wit → Polynomial F
r : Fin n_wit → F
stmt : Lipmaa.Stmt
prover : Prover F Lipmaa
t : Polynomial F := ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))
h0012 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0021 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0022 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0112 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0121 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0122 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0212 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0221 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h0222 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 0 + 25 * 2 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h1022 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 0 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h1112 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 1 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h1121 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 1 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
h1122 :
  (-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) + ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum)))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0)) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          (List.map
                                              (fun x =>
                                                Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                  Polynomial.X ^ ↑x)
                                              (List.finRange n_var)).sum))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) + if True then 1 * 1 else 0) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                              Polynomial.X ^ ↑x)
                                          (List.finRange n_var)).sum)))
                            else 0)))))) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 75 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 75 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 25 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                            if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                      else 0) +
                    ((-if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                        (List.finRange (n_var - 1))).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                        else 0) +
                      ((((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    u_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                    v_stmt x)
                                                (List.finRange n_stmt)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                w_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0) +
                        (((-if
                                  (if True then 25 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 25 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    u_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                            -if
                                  (if True then 75 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 5 * 1 else 0) +
                                          ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                                1 ^ 75 *
                                  (1 ^ 5 *
                                    (1 ^ 5 *
                                      (1 ^ 1 *
                                        (1 ^ 1 *
                                          ((List.map
                                                (fun x =>
                                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                    v_wit x)
                                                (List.finRange n_wit)).sum *
                                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))
                              else 0) +
                          -if
                                (if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                w_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))
                            else 0))))))) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 75 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 25 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 5 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 1 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                          Polynomial.X ^ ↑x)
                                      (List.finRange n_var)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                    else 0) +
                  ((-if
                          (if True then 5 * 1 else 0) +
                              ((if True then 5 * 1 else 0) +
                                ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                            if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                      else 0) +
                    ((((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  u_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                  v_stmt x)
                                              (List.finRange n_stmt)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 1 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0) +
                      (((-if
                                (if True then 25 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                          -if
                                (if True then 75 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 5 * 1 else 0) +
                                        ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                              1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 5 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))
                            else 0) +
                        -if
                              (if True then 5 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))
                          else 0))))))) +
        ((-if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
            else 0) +
          ((-if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
              else 0) +
            ((-if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.δ) *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))
                else 0) +
              ((-if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                  else 0) +
                ((-if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 25 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                    else 0) +
                  ((((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0) +
                    (((-if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                        -if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 25 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                v_wit x)
                                            (List.finRange n_wit)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))
                          else 0) +
                      -if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 25 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))
                        else 0))))))) +
      ((if
            (if True then 5 * 1 else 0) +
                ((if True then 1 * 1 else 0) +
                  ((if True then 75 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 25 * 1 else 0)))) =
              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
          1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25))))
        else 0) +
        ((((if
                  (if True then 25 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 25 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
              if
                  (if True then 75 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 75 *
                  (1 ^ 1 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum))))
              else 0) +
            if
                (if True then 1 * 1 else 0) +
                    ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 5 * 1 else 0)) =
                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 1 *
                (1 ^ 5 *
                  (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum)))
            else 0) +
          ((if
                (if True then 5 * 1 else 0) +
                    ((if True then 1 * 1 else 0) +
                      ((if True then 75 * 1 else 0) +
                        ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                  if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
              1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α))))))
            else 0) +
            ((if
                  (if True then 5 * 1 else 0) +
                      ((if True then 1 * 1 else 0) +
                        ((if True then 25 * 1 else 0) +
                          ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                    if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 25 *
                      (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β))))))
              else 0) +
              ((if
                    (if True then 5 * 1 else 0) +
                        ((if True then 1 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) +
                              ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)))) =
                      if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                  1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 1 *
                        (1 ^ 5 * (1 ^ 1 * (1 ^ 1 * Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ))))))
                else 0) +
                ((if
                      (if True then 5 * 1 else 0) +
                          ((if True then 1 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                        if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                    1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))
                  else 0) +
                  ((if
                        (if True then 5 * 1 else 0) +
                            ((if True then 5 * 1 else 0) + ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                          if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                      1 ^ 5 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (1 ^ 1 *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum)))
                    else 0) +
                    ((((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum))))
                          else 0) +
                        if
                            (if True then 1 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum)))
                        else 0) +
                      (((if
                              (if True then 25 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 25 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                          if
                              (if True then 75 * 1 else 0) +
                                  ((if True then 5 * 1 else 0) +
                                    ((if True then 5 * 1 else 0) +
                                      ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0))) =
                                if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                            1 ^ 75 *
                              (1 ^ 5 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 1 *
                                      (List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum))))
                          else 0) +
                        if
                            (if True then 5 * 1 else 0) +
                                ((if True then 5 * 1 else 0) +
                                  ((if True then 1 * 1 else 0) + if True then 1 * 1 else 0)) =
                              if True then 75 * 1 + 25 * 1 + 5 * 2 + 1 * 2 else 0 then
                          1 ^ 5 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 1 *
                                  (List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum)))
                        else 0))))))))) =
    0
⊢ ((List.map (fun i => Polynomial.C (stmt i) * u_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) * u_wit i)
            (List.finRange n_wit)).sum) *
      ((List.map (fun i => Polynomial.C (stmt i) * v_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) * v_wit i)
            (List.finRange n_wit)).sum) =
    (List.map (fun i => Polynomial.C (stmt i) * w_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) * w_wit i)
            (List.finRange n_wit)).sum +
      (List.map
          (fun x =>
            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) * (Polynomial.X ^ ↑x * t))
          (List.finRange (n_var - 1))).sum
case intro
F : Type
inst✝ : Field F
n_stmt n_wit n_var : ℕ
u_stmt : Fin n_stmt → Polynomial F
u_wit : Fin n_wit → Polynomial F
v_stmt : Fin n_stmt → Polynomial F
v_wit : Fin n_wit → Polynomial F
w_stmt : Fin n_stmt → Polynomial F
w_wit : Fin n_wit → Polynomial F
r : Fin n_wit → F
stmt : Lipmaa.Stmt
prover : Prover F Lipmaa
t : Polynomial F := ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))
h0012 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 +
                          -(1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    (List.map
                                        (fun x =>
                                          Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum)))) +
                        (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0021 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-(1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                    (List.finRange (n_var - 1))).sum *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum)))) +
                      (-0 + -0 + -0 +
                        (-0 + -0 +
                          -(1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                        (List.finRange n_wit)).sum *
                                    (List.map
                                        (fun x =>
                                          Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                            Polynomial.X ^ ↑x)
                                        (List.finRange n_var)).sum)))))))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0022 :
  -0 +
              (-0 +
                (-0 +
                  (-(1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              ((List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum))))) +
                    (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-(1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                          (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                      (List.finRange (n_var - 1))).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)))))) +
                      (-0 + -0 + -0 +
                        (-0 + -0 +
                          -(1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 1 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))))))))) +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 + -0 +
                        -(1 ^ 1 *
                            (1 ^ 5 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  ((List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                        (List.finRange n_stmt)).sum *
                                    Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)))))) +
                      (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 +
        (0 + 0 +
            1 ^ 1 *
              (1 ^ 5 *
                (1 ^ 1 * (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum))) +
          (0 +
            (0 +
              (0 +
                (0 +
                  (1 ^ 5 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 1 *
                            (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                (List.finRange (n_var - 1))).sum))) +
                    (0 + 0 + 0 +
                      (0 + 0 +
                        1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 1 *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                    (List.finRange n_wit)).sum)))))))))))) =
    0
h0112 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-(1 ^ 25 *
                                (1 ^ 1 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        (List.map
                                            (fun x =>
                                              Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                Polynomial.X ^ ↑x)
                                            (List.finRange n_var)).sum))))) +
                            -0 +
                          -0 +
                        (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 + -0 +
                      -(1 ^ 1 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 25 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * w_stmt x)
                                      (List.finRange n_stmt)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))) +
                    (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0121 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 + -0 +
                        (-(1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                u_wit x)
                                            (List.finRange n_wit)).sum *
                                        (List.map
                                            (fun x =>
                                              Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                                Polynomial.X ^ ↑x)
                                            (List.finRange n_var)).sum))))) +
                            -0 +
                          -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-(1 ^ 5 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            ((List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                                  (List.finRange (n_var - 1))).sum *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))) +
                  (-0 + -0 + -0 +
                    (-0 + -0 +
                      -(1 ^ 5 *
                          (1 ^ 5 *
                            (1 ^ 1 *
                              (1 ^ 25 *
                                ((List.map
                                      (fun x =>
                                        Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * w_wit x)
                                      (List.finRange n_wit)).sum *
                                  Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0122 :
  -0 +
              (-(1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (1 ^ 5 *
                          (1 ^ 1 *
                            (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum)))))) +
                (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 + -0 +
                        (-(1 ^ 25 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  u_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))) +
                            -0 +
                          -0))))))) +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-(1 ^ 25 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                u_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))) +
                          -0 +
                        -0 +
                      (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-(1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (1 ^ 25 *
                            ((List.map
                                  (fun x =>
                                    Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow x)) *
                                      Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum *
                              Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))) +
                (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 +
        (1 ^ 25 *
                (1 ^ 1 *
                  (1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum)))) +
              0 +
            0 +
          (0 +
            (0 +
              (0 +
                (0 +
                  (0 +
                    (0 + 0 + 0 +
                      (1 ^ 25 *
                            (1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 1 *
                                    (List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                        (List.finRange n_wit)).sum)))) +
                          0 +
                        0))))))))) =
    0
h0212 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-(1 ^ 25 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 25 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * u_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))) +
                        -0 +
                      -0 +
                    (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0221 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 + -0 + -0 +
                    (-(1 ^ 25 *
                            (1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 25 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * u_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))) +
                        -0 +
                      -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0222 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-(1 ^ 5 *
                (1 ^ 1 *
                  (1 ^ 25 *
                    (1 ^ 5 *
                      (1 ^ 1 *
                        (1 ^ 25 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.β) *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))) +
            (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h1022 :
  -(1 ^ 5 *
                  (1 ^ 1 *
                    (1 ^ 75 *
                      (1 ^ 5 *
                        (1 ^ 1 *
                          (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                            (List.map
                                (fun x =>
                                  Polynomial.C (prover.2 Proof_G2_Idx.B (SRS_Elements_G2_Idx.x_pow x)) *
                                    Polynomial.X ^ ↑x)
                                (List.finRange n_var)).sum)))))) +
              (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 + -0 +
                        (-0 +
                            -(1 ^ 75 *
                                (1 ^ 5 *
                                  (1 ^ 5 *
                                    (1 ^ 1 *
                                      (1 ^ 1 *
                                        ((List.map
                                              (fun x =>
                                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) *
                                                  v_wit x)
                                              (List.finRange n_wit)).sum *
                                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ))))))) +
                          -0))))))) +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                          -(1 ^ 75 *
                              (1 ^ 1 *
                                (1 ^ 5 *
                                  (1 ^ 1 *
                                    (1 ^ 5 *
                                      ((List.map
                                            (fun x =>
                                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) *
                                                v_stmt x)
                                            (List.finRange n_stmt)).sum *
                                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ))))))) +
                        -0 +
                      (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 +
        (0 +
              1 ^ 75 *
                (1 ^ 1 *
                  (1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 5 * (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum)))) +
            0 +
          (0 +
            (0 +
              (0 +
                (0 +
                  (0 +
                    (0 + 0 + 0 +
                      (0 +
                          1 ^ 75 *
                            (1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 1 *
                                    (List.map
                                        (fun x =>
                                          Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                        (List.finRange n_wit)).sum)))) +
                        0))))))))) =
    0
h1112 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                        -(1 ^ 75 *
                            (1 ^ 1 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 25 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.y x)) * v_stmt x)
                                          (List.finRange n_stmt)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))) +
                      -0 +
                    (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h1121 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 + -0 + -0 +
                    (-0 +
                        -(1 ^ 75 *
                            (1 ^ 5 *
                              (1 ^ 5 *
                                (1 ^ 1 *
                                  (1 ^ 25 *
                                    ((List.map
                                          (fun x =>
                                            Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.q x)) * v_wit x)
                                          (List.finRange n_wit)).sum *
                                      Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β))))))) +
                      -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h1122 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-(1 ^ 5 *
              (1 ^ 1 *
                (1 ^ 75 *
                  (1 ^ 5 *
                    (1 ^ 1 *
                      (1 ^ 25 *
                        (Polynomial.C (prover.1 Proof_G1_Idx.A SRS_Elements_G1_Idx.α) *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (1 ^ 5 * (1 ^ 1 * (1 ^ 75 * (1 ^ 5 * (1 ^ 1 * 1 ^ 25)))) +
        (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
⊢ ((List.map (fun i => Polynomial.C (stmt i) * u_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) * u_wit i)
            (List.finRange n_wit)).sum) *
      ((List.map (fun i => Polynomial.C (stmt i) * v_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) * v_wit i)
            (List.finRange n_wit)).sum) =
    (List.map (fun i => Polynomial.C (stmt i) * w_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) * w_wit i)
            (List.finRange n_wit)).sum +
      (List.map
          (fun x =>
            Polynomial.C (prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.x_pow_times_t x)) * (Polynomial.X ^ ↑x * t))
          (List.finRange (n_var - 1))).sum