quad2p (problem 3.2.1, positive)

Percentage Accurate: 52.5% → 85.9%

Time: 55.4s

Alternatives: 7

Speedup: 1.7×

Specification

Math

\[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

double code(double a, double b_2, double c) {
	return (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

public static double code(double a, double b_2, double c) {
	return (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Python

def code(a, b_2, c):
	return (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) + N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Initial Program: 52.5% accurate, 1.0× speedup

Math

\[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

C

double code(double a, double b_2, double c) {
	return (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function

Java

public static double code(double a, double b_2, double c) {
	return (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}

Python

def code(a, b_2, c):
	return (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) + N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Alternative 1: 85.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \mathbf{if}\;b\_2 \leq -139999999999999990570391402012014101040279878954120499602497551495632615299510876417962868570744422400:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq \frac{3215376232195769}{169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536}:\\ \;\;\;\;\frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c}{b\_2}\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (if (<=
     b_2
     -139999999999999990570391402012014101040279878954120499602497551495632615299510876417962868570744422400)
  (* -2 (/ b_2 a))
  (if (<=
       b_2
       3215376232195769/169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536)
    (- (/ (sqrt (- (* b_2 b_2) (* c a))) a) (/ b_2 a))
    (* -1/2 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.4e+101) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.9e-110) {
		tmp = (sqrt(((b_2 * b_2) - (c * a))) / a) - (b_2 / a);
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.4d+101)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1.9d-110) then
        tmp = (sqrt(((b_2 * b_2) - (c * a))) / a) - (b_2 / a)
    else
        tmp = (-0.5d0) * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.4e+101) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.9e-110) {
		tmp = (Math.sqrt(((b_2 * b_2) - (c * a))) / a) - (b_2 / a);
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.4e+101:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.9e-110:
		tmp = (math.sqrt(((b_2 * b_2) - (c * a))) / a) - (b_2 / a)
	else:
		tmp = -0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.4e+101)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.9e-110)
		tmp = Float64(Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a))) / a) - Float64(b_2 / a));
	else
		tmp = Float64(-0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.4e+101)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.9e-110)
		tmp = (sqrt(((b_2 * b_2) - (c * a))) / a) - (b_2 / a);
	else
		tmp = -0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -139999999999999990570391402012014101040279878954120499602497551495632615299510876417962868570744422400], N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 3215376232195769/169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536], N[(N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / a), $MachinePrecision] - N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], N[(-1/2 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.3999999999999999e101

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-/.f64 35.1%

         \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

   4. Applied rewrites 35.1%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]

   if -1.3999999999999999e101 < b_2 < 1.8999999999999999e-110

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}} \]

      2. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}}{a} \]

      3. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} + \left(-b\_2\right)}}{a} \]

      4. lift-neg.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c} + \color{blue}{\left(\mathsf{neg}\left(b\_2\right)\right)}}{a} \]

      5. sub-flip-reverse N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - b\_2}}{a} \]

      6. div-sub N/A

         \[\leadsto \color{blue}{\frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} - \frac{b\_2}{a}} \]

      7. lower--.f64 N/A

         \[\leadsto \color{blue}{\frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} - \frac{b\_2}{a}} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a}} - \frac{b\_2}{a} \]

      9. lift-*.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}}}{a} - \frac{b\_2}{a} \]

      10. *-commutative N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{c \cdot a}}}{a} - \frac{b\_2}{a} \]

      11. lower-*.f64 N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{c \cdot a}}}{a} - \frac{b\_2}{a} \]

      12. remove-double-neg N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{b\_2}{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)}} \]

      13. remove-double-neg N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{\color{blue}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b\_2\right)\right)\right)}}{\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)} \]

      14. lift-neg.f64 N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{\mathsf{neg}\left(\color{blue}{\left(-b\_2\right)}\right)}{\mathsf{neg}\left(\left(\mathsf{neg}\left(a\right)\right)\right)} \]

      15. remove-double-neg N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{\mathsf{neg}\left(\left(-b\_2\right)\right)}{\color{blue}{a}} \]

      16. lower-/.f64 N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \color{blue}{\frac{\mathsf{neg}\left(\left(-b\_2\right)\right)}{a}} \]

      17. lift-neg.f64 N/A

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(b\_2\right)\right)}\right)}{a} \]

      18. remove-double-neg 52.2%

          \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{\color{blue}{b\_2}}{a} \]

   3. Applied rewrites 52.2%

      \[\leadsto \color{blue}{\frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a}}{a} - \frac{b\_2}{a}} \]

   if 1.8999999999999999e-110 < b_2

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 35.3%

         \[\leadsto \frac{-1}{2} \cdot \frac{c}{\color{blue}{b\_2}} \]

   4. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 85.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \mathbf{if}\;b\_2 \leq -139999999999999990570391402012014101040279878954120499602497551495632615299510876417962868570744422400:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq \frac{3215376232195769}{169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536}:\\ \;\;\;\;\frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c}{b\_2}\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (if (<=
     b_2
     -139999999999999990570391402012014101040279878954120499602497551495632615299510876417962868570744422400)
  (* -2 (/ b_2 a))
  (if (<=
       b_2
       3215376232195769/169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536)
    (/ (- (sqrt (- (* b_2 b_2) (* c a))) b_2) a)
    (* -1/2 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.4e+101) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.9e-110) {
		tmp = (sqrt(((b_2 * b_2) - (c * a))) - b_2) / a;
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1.4d+101)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1.9d-110) then
        tmp = (sqrt(((b_2 * b_2) - (c * a))) - b_2) / a
    else
        tmp = (-0.5d0) * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1.4e+101) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.9e-110) {
		tmp = (Math.sqrt(((b_2 * b_2) - (c * a))) - b_2) / a;
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1.4e+101:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.9e-110:
		tmp = (math.sqrt(((b_2 * b_2) - (c * a))) - b_2) / a
	else:
		tmp = -0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1.4e+101)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.9e-110)
		tmp = Float64(Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a))) - b_2) / a);
	else
		tmp = Float64(-0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1.4e+101)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.9e-110)
		tmp = (sqrt(((b_2 * b_2) - (c * a))) - b_2) / a;
	else
		tmp = -0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -139999999999999990570391402012014101040279878954120499602497551495632615299510876417962868570744422400], N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 3215376232195769/169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536], N[(N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(-1/2 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -1.3999999999999999e101

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-/.f64 35.1%

         \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

   4. Applied rewrites 35.1%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]

   if -1.3999999999999999e101 < b_2 < 1.8999999999999999e-110

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}}{a} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} + \left(-b\_2\right)}}{a} \]

      3. add-flip N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}}{a} \]

      4. lower--.f64 N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}}{a} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}{a} \]

      6. *-commutative N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{c \cdot a}} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}{a} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{c \cdot a}} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}{a} \]

      8. lift-neg.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(b\_2\right)\right)}\right)\right)}{a} \]

      9. remove-double-neg 52.5%

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - \color{blue}{b\_2}}{a} \]

   3. Applied rewrites 52.5%

      \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - b\_2}}{a} \]

   if 1.8999999999999999e-110 < b_2

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 35.3%

         \[\leadsto \frac{-1}{2} \cdot \frac{c}{\color{blue}{b\_2}} \]

   4. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 80.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \mathbf{if}\;b\_2 \leq -29000000000:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq \frac{3215376232195769}{169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536}:\\ \;\;\;\;\frac{\sqrt{-a \cdot c} - b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c}{b\_2}\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (if (<= b_2 -29000000000)
  (* -2 (/ b_2 a))
  (if (<=
       b_2
       3215376232195769/169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536)
    (/ (- (sqrt (- (* a c))) b_2) a)
    (* -1/2 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -29000000000.0) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.9e-110) {
		tmp = (sqrt(-(a * c)) - b_2) / a;
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-29000000000.0d0)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1.9d-110) then
        tmp = (sqrt(-(a * c)) - b_2) / a
    else
        tmp = (-0.5d0) * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -29000000000.0) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1.9e-110) {
		tmp = (Math.sqrt(-(a * c)) - b_2) / a;
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -29000000000.0:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1.9e-110:
		tmp = (math.sqrt(-(a * c)) - b_2) / a
	else:
		tmp = -0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -29000000000.0)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1.9e-110)
		tmp = Float64(Float64(sqrt(Float64(-Float64(a * c))) - b_2) / a);
	else
		tmp = Float64(-0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -29000000000.0)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1.9e-110)
		tmp = (sqrt(-(a * c)) - b_2) / a;
	else
		tmp = -0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -29000000000], N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 3215376232195769/169230328010303641331690318856389386196071598838855992136870091590247882556495704531248437872567112920983350278405979725889536], N[(N[(N[Sqrt[(-N[(a * c), $MachinePrecision])], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(-1/2 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -2.9e10

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-/.f64 35.1%

         \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

   4. Applied rewrites 35.1%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]

   if -2.9e10 < b_2 < 1.8999999999999999e-110

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]
   2. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}}{a} \]

      2. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} + \left(-b\_2\right)}}{a} \]

      3. add-flip N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}}{a} \]

      4. lower--.f64 N/A

         \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - a \cdot c} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}}{a} \]

      5. lift-*.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{a \cdot c}} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}{a} \]

      6. *-commutative N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{c \cdot a}} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}{a} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - \color{blue}{c \cdot a}} - \left(\mathsf{neg}\left(\left(-b\_2\right)\right)\right)}{a} \]

      8. lift-neg.f64 N/A

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(b\_2\right)\right)}\right)\right)}{a} \]

      9. remove-double-neg 52.5%

         \[\leadsto \frac{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - \color{blue}{b\_2}}{a} \]

   3. Applied rewrites 52.5%

      \[\leadsto \frac{\color{blue}{\sqrt{b\_2 \cdot b\_2 - c \cdot a} - b\_2}}{a} \]

   4. Taylor expanded in b_2 around 0

      \[\leadsto \frac{\color{blue}{\sqrt{\mathsf{neg}\left(a \cdot c\right)}} - b\_2}{a} \]
   5. Step-by-step derivation

      1. lower-sqrt.f64 N/A

         \[\leadsto \frac{\sqrt{\mathsf{neg}\left(a \cdot c\right)} - b\_2}{a} \]

      2. lower-neg.f64 N/A

         \[\leadsto \frac{\sqrt{-a \cdot c} - b\_2}{a} \]

      3. lower-*.f64 34.1%

         \[\leadsto \frac{\sqrt{-a \cdot c} - b\_2}{a} \]

   6. Applied rewrites 34.1%

      \[\leadsto \frac{\color{blue}{\sqrt{-a \cdot c}} - b\_2}{a} \]

   if 1.8999999999999999e-110 < b_2

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 35.3%

         \[\leadsto \frac{-1}{2} \cdot \frac{c}{\color{blue}{b\_2}} \]

   4. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 79.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \mathbf{if}\;b\_2 \leq \frac{-7404544304199621}{21778071482940061661655974875633165533184}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq \frac{5002207817901643}{9619630419041620901435312524449124464130795720328478190417063819395928166869436184427311097384012607618805661696}:\\ \;\;\;\;\frac{\sqrt{-a \cdot c}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c}{b\_2}\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (if (<=
     b_2
     -7404544304199621/21778071482940061661655974875633165533184)
  (* -2 (/ b_2 a))
  (if (<=
       b_2
       5002207817901643/9619630419041620901435312524449124464130795720328478190417063819395928166869436184427311097384012607618805661696)
    (/ (sqrt (- (* a c))) a)
    (* -1/2 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.4e-25) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 5.2e-97) {
		tmp = sqrt(-(a * c)) / a;
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-3.4d-25)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 5.2d-97) then
        tmp = sqrt(-(a * c)) / a
    else
        tmp = (-0.5d0) * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -3.4e-25) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 5.2e-97) {
		tmp = Math.sqrt(-(a * c)) / a;
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -3.4e-25:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 5.2e-97:
		tmp = math.sqrt(-(a * c)) / a
	else:
		tmp = -0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -3.4e-25)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 5.2e-97)
		tmp = Float64(sqrt(Float64(-Float64(a * c))) / a);
	else
		tmp = Float64(-0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -3.4e-25)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 5.2e-97)
		tmp = sqrt(-(a * c)) / a;
	else
		tmp = -0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -7404544304199621/21778071482940061661655974875633165533184], N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 5002207817901643/9619630419041620901435312524449124464130795720328478190417063819395928166869436184427311097384012607618805661696], N[(N[Sqrt[(-N[(a * c), $MachinePrecision])], $MachinePrecision] / a), $MachinePrecision], N[(-1/2 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -3.4e-25

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-/.f64 35.1%

         \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

   4. Applied rewrites 35.1%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]

   if -3.4e-25 < b_2 < 5.2000000000000001e-97

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around 0

      \[\leadsto \color{blue}{\frac{\sqrt{\mathsf{neg}\left(a \cdot c\right)}}{a}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\sqrt{\mathsf{neg}\left(a \cdot c\right)}}{\color{blue}{a}} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \frac{\sqrt{\mathsf{neg}\left(a \cdot c\right)}}{a} \]

      3. lower-neg.f64 N/A

         \[\leadsto \frac{\sqrt{-a \cdot c}}{a} \]

      4. lower-*.f64 29.6%

         \[\leadsto \frac{\sqrt{-a \cdot c}}{a} \]

   4. Applied rewrites 29.6%

      \[\leadsto \color{blue}{\frac{\sqrt{-a \cdot c}}{a}} \]

   if 5.2000000000000001e-97 < b_2

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 35.3%

         \[\leadsto \frac{-1}{2} \cdot \frac{c}{\color{blue}{b\_2}} \]

   4. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 71.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \mathbf{if}\;b\_2 \leq \frac{-8535058474086213}{853505847408621347082221029212320998034529065256436244530720999905796766440656905154743321711558949215095028555959454777073766611727278730286509574698346245900180170177793863483274020596712195165307522065393485053656415748796987045268976304128}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{elif}\;b\_2 \leq \frac{4290498537581631}{429049853758163107186368799942587076079339706258956588087153966199096448962353503257659977541340909686081019461967553627320124249982290238285876768194691072}:\\ \;\;\;\;-\sqrt{\frac{c}{-a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c}{b\_2}\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (if (<=
     b_2
     -8535058474086213/853505847408621347082221029212320998034529065256436244530720999905796766440656905154743321711558949215095028555959454777073766611727278730286509574698346245900180170177793863483274020596712195165307522065393485053656415748796987045268976304128)
  (* -2 (/ b_2 a))
  (if (<=
       b_2
       4290498537581631/429049853758163107186368799942587076079339706258956588087153966199096448962353503257659977541340909686081019461967553627320124249982290238285876768194691072)
    (- (sqrt (/ c (- a))))
    (* -1/2 (/ c b_2)))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1e-227) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1e-140) {
		tmp = -sqrt((c / -a));
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-1d-227)) then
        tmp = (-2.0d0) * (b_2 / a)
    else if (b_2 <= 1d-140) then
        tmp = -sqrt((c / -a))
    else
        tmp = (-0.5d0) * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -1e-227) {
		tmp = -2.0 * (b_2 / a);
	} else if (b_2 <= 1e-140) {
		tmp = -Math.sqrt((c / -a));
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -1e-227:
		tmp = -2.0 * (b_2 / a)
	elif b_2 <= 1e-140:
		tmp = -math.sqrt((c / -a))
	else:
		tmp = -0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -1e-227)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	elseif (b_2 <= 1e-140)
		tmp = Float64(-sqrt(Float64(c / Float64(-a))));
	else
		tmp = Float64(-0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -1e-227)
		tmp = -2.0 * (b_2 / a);
	elseif (b_2 <= 1e-140)
		tmp = -sqrt((c / -a));
	else
		tmp = -0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -8535058474086213/853505847408621347082221029212320998034529065256436244530720999905796766440656905154743321711558949215095028555959454777073766611727278730286509574698346245900180170177793863483274020596712195165307522065393485053656415748796987045268976304128], N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 4290498537581631/429049853758163107186368799942587076079339706258956588087153966199096448962353503257659977541340909686081019461967553627320124249982290238285876768194691072], (-N[Sqrt[N[(c / (-a)), $MachinePrecision]], $MachinePrecision]), N[(-1/2 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -9.9999999999999994e-228

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-/.f64 35.1%

         \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

   4. Applied rewrites 35.1%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]

   if -9.9999999999999994e-228 < b_2 < 9.9999999999999998e-141

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in a around -inf

      \[\leadsto \color{blue}{-1 \cdot \sqrt{-1 \cdot \frac{c}{a}}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{\sqrt{-1 \cdot \frac{c}{a}}} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto -1 \cdot \sqrt{-1 \cdot \frac{c}{a}} \]

      3. lower-*.f64 N/A

         \[\leadsto -1 \cdot \sqrt{-1 \cdot \frac{c}{a}} \]

      4. lower-/.f64 17.6%

         \[\leadsto -1 \cdot \sqrt{-1 \cdot \frac{c}{a}} \]

   4. Applied rewrites 17.6%

      \[\leadsto \color{blue}{-1 \cdot \sqrt{-1 \cdot \frac{c}{a}}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{\sqrt{-1 \cdot \frac{c}{a}}} \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{neg}\left(\sqrt{-1 \cdot \frac{c}{a}}\right) \]

      3. lower-neg.f64 17.6%

         \[\leadsto -\sqrt{-1 \cdot \frac{c}{a}} \]

      4. lift-*.f64 N/A

         \[\leadsto -\sqrt{-1 \cdot \frac{c}{a}} \]

      5. mul-1-neg N/A

         \[\leadsto -\sqrt{\mathsf{neg}\left(\frac{c}{a}\right)} \]

      6. lift-/.f64 N/A

         \[\leadsto -\sqrt{\mathsf{neg}\left(\frac{c}{a}\right)} \]

      7. frac-2neg N/A

         \[\leadsto -\sqrt{\mathsf{neg}\left(\frac{\mathsf{neg}\left(c\right)}{\mathsf{neg}\left(a\right)}\right)} \]

      8. distribute-neg-frac N/A

         \[\leadsto -\sqrt{\frac{\mathsf{neg}\left(\left(\mathsf{neg}\left(c\right)\right)\right)}{\mathsf{neg}\left(a\right)}} \]

      9. lower-/.f64 N/A

         \[\leadsto -\sqrt{\frac{\mathsf{neg}\left(\left(\mathsf{neg}\left(c\right)\right)\right)}{\mathsf{neg}\left(a\right)}} \]

      10. mul-1-neg N/A

          \[\leadsto -\sqrt{\frac{\mathsf{neg}\left(-1 \cdot c\right)}{\mathsf{neg}\left(a\right)}} \]

      11. *-commutative N/A

          \[\leadsto -\sqrt{\frac{\mathsf{neg}\left(c \cdot -1\right)}{\mathsf{neg}\left(a\right)}} \]

      12. distribute-rgt-neg-out N/A

          \[\leadsto -\sqrt{\frac{c \cdot \left(\mathsf{neg}\left(-1\right)\right)}{\mathsf{neg}\left(a\right)}} \]

      13. metadata-eval N/A

          \[\leadsto -\sqrt{\frac{c \cdot 1}{\mathsf{neg}\left(a\right)}} \]

      14. *-rgt-identity N/A

          \[\leadsto -\sqrt{\frac{c}{\mathsf{neg}\left(a\right)}} \]

      15. lower-neg.f64 17.6%

          \[\leadsto -\sqrt{\frac{c}{-a}} \]

   6. Applied rewrites 17.6%

      \[\leadsto -\sqrt{\frac{c}{-a}} \]

   if 9.9999999999999998e-141 < b_2

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 35.3%

         \[\leadsto \frac{-1}{2} \cdot \frac{c}{\color{blue}{b\_2}} \]

   4. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 68.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \mathbf{if}\;b\_2 \leq \frac{5033540777614485}{359538626972463181545861038157804946723595395788461314546860162315465351611001926265416954644815072042240227759742786715317579537628833244985694861278948248755535786849730970552604439202492188238906165904170011537676301364684925762947826221081654474326701021369172596479894491876959432609670712659248448274432}:\\ \;\;\;\;-2 \cdot \frac{b\_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{c}{b\_2}\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (if (<=
     b_2
     5033540777614485/359538626972463181545861038157804946723595395788461314546860162315465351611001926265416954644815072042240227759742786715317579537628833244985694861278948248755535786849730970552604439202492188238906165904170011537676301364684925762947826221081654474326701021369172596479894491876959432609670712659248448274432)
  (* -2 (/ b_2 a))
  (* -1/2 (/ c b_2))))

C

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 1.4e-293) {
		tmp = -2.0 * (b_2 / a);
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= 1.4d-293) then
        tmp = (-2.0d0) * (b_2 / a)
    else
        tmp = (-0.5d0) * (c / b_2)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= 1.4e-293) {
		tmp = -2.0 * (b_2 / a);
	} else {
		tmp = -0.5 * (c / b_2);
	}
	return tmp;
}

Python

def code(a, b_2, c):
	tmp = 0
	if b_2 <= 1.4e-293:
		tmp = -2.0 * (b_2 / a)
	else:
		tmp = -0.5 * (c / b_2)
	return tmp

Julia

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= 1.4e-293)
		tmp = Float64(-2.0 * Float64(b_2 / a));
	else
		tmp = Float64(-0.5 * Float64(c / b_2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= 1.4e-293)
		tmp = -2.0 * (b_2 / a);
	else
		tmp = -0.5 * (c / b_2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, 5033540777614485/359538626972463181545861038157804946723595395788461314546860162315465351611001926265416954644815072042240227759742786715317579537628833244985694861278948248755535786849730970552604439202492188238906165904170011537676301364684925762947826221081654474326701021369172596479894491876959432609670712659248448274432], N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision], N[(-1/2 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b_2 < 1.4000000000000001e-293

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

      2. lower-/.f64 35.1%

         \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

   4. Applied rewrites 35.1%

      \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]

   if 1.4000000000000001e-293 < b_2

   1. Initial program 52.5%

      \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\frac{c}{b\_2}} \]

      2. lower-/.f64 35.3%

         \[\leadsto \frac{-1}{2} \cdot \frac{c}{\color{blue}{b\_2}} \]

   4. Applied rewrites 35.3%

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{c}{b\_2}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 35.1% accurate, 2.4× speedup

Math

\[-2 \cdot \frac{b\_2}{a} \]

FPCore

(FPCore (a b_2 c)
  :precision binary64
  (* -2 (/ b_2 a)))

C

double code(double a, double b_2, double c) {
	return -2.0 * (b_2 / a);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b_2, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-2.0d0) * (b_2 / a)
end function

Java

public static double code(double a, double b_2, double c) {
	return -2.0 * (b_2 / a);
}

Python

def code(a, b_2, c):
	return -2.0 * (b_2 / a)

Julia

function code(a, b_2, c)
	return Float64(-2.0 * Float64(b_2 / a))
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = -2.0 * (b_2 / a);
end

Wolfram

code[a_, b$95$2_, c_] := N[(-2 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 52.5%

   \[\frac{\left(-b\_2\right) + \sqrt{b\_2 \cdot b\_2 - a \cdot c}}{a} \]

2. Taylor expanded in b_2 around -inf

   \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
3. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto -2 \cdot \color{blue}{\frac{b\_2}{a}} \]

   2. lower-/.f64 35.1%

      \[\leadsto -2 \cdot \frac{b\_2}{\color{blue}{a}} \]

4. Applied rewrites 35.1%

   \[\leadsto \color{blue}{-2 \cdot \frac{b\_2}{a}} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025271 -o generate:evaluate
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  :herbie-expected 10
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))