Theorem: Groth16TypeIII.is_sound_quotient_version (FormalSnarksProject/Other/Groth16TypeIIIQuotientVersion.lean)

State before:
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
t : Polynomial F
stmt : Groth16TypeIII.Stmt
prover : Prover F Groth16TypeIII
h0012 :
  (-if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 0) + fun₀ | Vars.β => 2) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 0) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 1) +
                                fun₀ | Vars.δ => 2 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 1 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 1 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 1 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 1 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 1 then
                          (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1)) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + fun₀ | Vars.δ => 1) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.α => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.β => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      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
                          (fun₀ | Vars.γ => 1) +
                              ((fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.δ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                  (fun₀ | Vars.β => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                  (fun₀ | Vars.α => 1) +
                                      ((fun₀ | Vars.γ => 1) +
                                        ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                      fun₀ | Vars.δ => 2 then
                                (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
                                (fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.β => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    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
                        (fun₀ | Vars.γ => 1) +
                            ((fun₀ | Vars.δ => 1) +
                              ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                          (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                            (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.δ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.δ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                                (fun₀ | Vars.β => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                                (fun₀ | Vars.α => 1) +
                                    ((fun₀ | Vars.γ => 1) +
                                      ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                    fun₀ | Vars.δ => 2 then
                              (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
                              (fun₀ | Vars.γ => 1) +
                                  ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              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
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                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
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  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
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
            (fun₀ | Vars.γ => 1) +
                ((fun₀ | Vars.δ => 1) +
                  ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.β => 1)))) =
              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
          1
        else 0) +
        ((((if
                  (fun₀ | Vars.β => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  (fun₀ | Vars.α => 1) +
                      ((fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                (fun₀ | Vars.δ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.γ => 1)) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                (fun₀ | Vars.γ => 1) +
                    ((fun₀ | Vars.δ => 1) +
                      ((fun₀ | Vars.α => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                  (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  (fun₀ | Vars.γ => 1) +
                      ((fun₀ | Vars.δ => 1) +
                        ((fun₀ | Vars.β => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                    (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    (fun₀ | Vars.γ => 1) +
                        ((fun₀ | Vars.δ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)))) =
                      (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      (fun₀ | Vars.γ => 1) +
                          ((fun₀ | Vars.δ => 1) +
                            ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                        (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                    (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
                        (fun₀ | Vars.γ => 1) + ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                          (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) + fun₀ | Vars.δ => 2 then
                      (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
                    else 0) +
                    ((((if
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.δ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.δ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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
                              (fun₀ | Vars.β => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                              (fun₀ | Vars.α => 1) +
                                  ((fun₀ | Vars.γ => 1) +
                                    ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1))) =
                                (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                  fun₀ | Vars.δ => 2 then
                            (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
                            (fun₀ | Vars.γ => 1) +
                                ((fun₀ | Vars.γ => 1) + ((fun₀ | Vars.δ => 1) + fun₀ | Vars.δ => 1)) =
                              (((fun₀ | Vars.α => 1) + fun₀ | Vars.β => 1) + fun₀ | Vars.γ => 2) +
                                fun₀ | Vars.δ => 2 then
                          (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 ((fun prover i => prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) prover 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 ((fun prover i => prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) prover 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 ((fun prover i => prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) prover i) * w_wit i)
                (List.finRange n_wit)).sum)).modByMonic
      t =
    0
Tactic:
simp only [Vars.finsupp_eq_ext, Finsupp.single_apply, Finsupp.add_apply] at h0012 h0021 h0022 h0112 h0121 h0122 h0212 h0221 h0222 h1022 h1112 h1121 h1122
State after:
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
t : Polynomial F
stmt : Groth16TypeIII.Stmt
prover : Prover F Groth16TypeIII
h0012 :
  (-if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                  if False then 1 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                    if False then 1 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                      if False then 1 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if True then 1 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                  if False then 1 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                    if False then 1 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                      if False then 1 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if True then 1 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                  if False then 1 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                    if False then 1 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                      if False then 1 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if True then 1 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 0 else 0) + if False then 2 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 0 else 0) + if True then 2 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 0 else 0) + if False then 2 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 0 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 0 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 0 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 1 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 1 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 1 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 1 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 1 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 1 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 1 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 1 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 1 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 1 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 1 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                  if False then 1 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                    if False then 1 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                      if False then 1 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if True then 1 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 1 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 1 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 1 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 1 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 1 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 1 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 1 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 1 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 1 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 1 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 1 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 1 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 1 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 1 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 1 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 1 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 1 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 1 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 1 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 1 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 1 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 1 else 0 then
                          (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0)) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      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 False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (List.map
                                (fun x =>
                                  Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                    (Polynomial.X ^ ↑x * t))
                                (List.finRange (n_var - 1))).sum *
                            Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.δ)
                        else 0) +
                      ((((-if
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if True then 1 else 0) +
                                                ((if False then 1 else 0) + if False then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if True then 2 else 0) +
                                            if False then 2 else 0) ∧
                                        (if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if False then 1 else 0) +
                                                ((if True then 1 else 0) + if True then 1 else 0))) =
                                          (((if False then 1 else 0) + if False then 1 else 0) +
                                              if False then 2 else 0) +
                                            if True then 2 else 0 then
                                (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 False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0)) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    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 False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if False then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if True then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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 False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if True then 1 else 0) +
                                    ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                    if False then 2 else 0) ∧
                                (if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if True then 2 else 0 then
                        (List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * t))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.γ)
                      else 0) +
                    ((((-if
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if True then 1 else 0) +
                                              ((if False then 1 else 0) + if True then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                          if False then 2 else 0) ∧
                                      (if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if False then 1 else 0) +
                                              ((if True then 1 else 0) + if False then 1 else 0))) =
                                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                          if True then 2 else 0 then
                              (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 False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if True then 1 else 0) +
                                        ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) + if False then 1 else 0)) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              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 False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                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 False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  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 False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_G1_Idx.A (SRS_Elements_G1_Idx.x_pow_times_t x)) *
                                (Polynomial.X ^ ↑x * t))
                            (List.finRange (n_var - 1))).sum *
                        Polynomial.C (prover.2 Proof_G2_Idx.B SRS_Elements_G2_Idx.β)
                    else 0) +
                  ((((-if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if True then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                  ((if False then 1 else 0) +
                    ((if True then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                  if False then 2 else 0) ∧
              ((if False then 1 else 0) +
                    ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)))) =
                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                    if False then 2 else 0) ∧
                ((if True then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                      if False then 2 else 0) ∧
                  (if False then 1 else 0) +
                      ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)))) =
                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if True then 2 else 0 then
          1
        else 0) +
        ((((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum
              else 0) +
              if
                  ((if True then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum
              else 0) +
            if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if True then 1 else 0) + ((if False then 1 else 0) + if True then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if True then 1 else 0) + if False then 1 else 0)) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum
            else 0) +
          ((if
                ((if False then 1 else 0) +
                      ((if False then 1 else 0) +
                        ((if True then 1 else 0) +
                          ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                    (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                      if False then 2 else 0) ∧
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if True then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                          if False then 2 else 0) ∧
                      (if False then 1 else 0) +
                          ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                        (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if True then 2 else 0 then
              Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.α)
            else 0) +
            ((if
                  ((if False then 1 else 0) +
                        ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                      (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                        if False then 2 else 0) ∧
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if True then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                            if False then 2 else 0) ∧
                        (if False then 1 else 0) +
                            ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                          (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if True then 2 else 0 then
                Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.β)
              else 0) +
              ((if
                    ((if False then 1 else 0) +
                          ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                        (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                          if False then 2 else 0) ∧
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                          (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if True then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                              if False then 2 else 0) ∧
                          (if False then 1 else 0) +
                              ((if True then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)))) =
                            (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if True then 2 else 0 then
                  Polynomial.C (prover.1 Proof_G1_Idx.C SRS_Elements_G1_Idx.δ)
                else 0) +
                ((if
                      ((if False then 1 else 0) +
                            ((if False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                          (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                            if False then 2 else 0) ∧
                        ((if False then 1 else 0) +
                              ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                            (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if True then 1 else 0) +
                                ((if False then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                if False then 2 else 0) ∧
                            (if False then 1 else 0) +
                                ((if True then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0))) =
                              (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                if True then 2 else 0 then
                    (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 False then 1 else 0) +
                              ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                            (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                              if False then 2 else 0) ∧
                          ((if False then 1 else 0) +
                                ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                              (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                if False then 2 else 0) ∧
                            ((if True then 1 else 0) +
                                  ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                  if False then 2 else 0) ∧
                              (if False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if True then 2 else 0 then
                      (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
                    else 0) +
                    ((((if
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if True then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 False then 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 1 else 0) +
                                    ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) + if False then 1 else 0))) =
                                  (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if False then 1 else 0) +
                                      ((if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) + if False then 1 else 0))) =
                                    (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  ((if False then 1 else 0) +
                                        ((if True then 1 else 0) +
                                          ((if True then 1 else 0) +
                                            ((if False then 1 else 0) + if False then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                        if False then 2 else 0) ∧
                                    (if False then 1 else 0) +
                                        ((if False then 1 else 0) +
                                          ((if False then 1 else 0) +
                                            ((if True then 1 else 0) + if True then 1 else 0))) =
                                      (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                        if True then 2 else 0 then
                            (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 False then 1 else 0) +
                                  ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                (((if True then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                  if False then 2 else 0) ∧
                              ((if False then 1 else 0) +
                                    ((if False then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                  (((if False then 1 else 0) + if True then 1 else 0) + if False then 2 else 0) +
                                    if False then 2 else 0) ∧
                                ((if True then 1 else 0) +
                                      ((if True then 1 else 0) + ((if False then 1 else 0) + if False then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if True then 2 else 0) +
                                      if False then 2 else 0) ∧
                                  (if False then 1 else 0) +
                                      ((if False then 1 else 0) + ((if True then 1 else 0) + if True then 1 else 0)) =
                                    (((if False then 1 else 0) + if False then 1 else 0) + if False then 2 else 0) +
                                      if True then 2 else 0 then
                          (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 ((fun prover i => prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) prover 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 ((fun prover i => prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) prover 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 ((fun prover i => prover.1 Proof_G1_Idx.C (SRS_Elements_G1_Idx.q i)) prover i) * w_wit i)
                (List.finRange n_wit)).sum)).modByMonic
      t =
    0