quad2m (problem 3.2.1, negative)

Average Accuracy: 46.7% → 84.0%

Time: 13.9s

Precision: binary64

Cost: 7432

Math

\[\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

↓

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -2.25 \cdot 10^{-60}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.6 \cdot 10^{+115}:\\ \;\;\;\;\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - c \cdot a}}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + \frac{c}{b_2} \cdot 0.5\\ \end{array} \]

FPCore

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

↓

(FPCore (a b_2 c)
 :precision binary64
 (if (<= b_2 -2.25e-60)
   (* -0.5 (/ c b_2))
   (if (<= b_2 1.6e+115)
     (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* c a)))) a)
     (+ (* -2.0 (/ b_2 a)) (* (/ c b_2) 0.5)))))

C

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

↓

double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.25e-60) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 1.6e+115) {
		tmp = (-b_2 - sqrt(((b_2 * b_2) - (c * a)))) / a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + ((c / b_2) * 0.5);
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    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

↓

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b_2 <= (-2.25d-60)) then
        tmp = (-0.5d0) * (c / b_2)
    else if (b_2 <= 1.6d+115) then
        tmp = (-b_2 - sqrt(((b_2 * b_2) - (c * a)))) / a
    else
        tmp = ((-2.0d0) * (b_2 / a)) + ((c / b_2) * 0.5d0)
    end if
    code = tmp
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;
}

↓

public static double code(double a, double b_2, double c) {
	double tmp;
	if (b_2 <= -2.25e-60) {
		tmp = -0.5 * (c / b_2);
	} else if (b_2 <= 1.6e+115) {
		tmp = (-b_2 - Math.sqrt(((b_2 * b_2) - (c * a)))) / a;
	} else {
		tmp = (-2.0 * (b_2 / a)) + ((c / b_2) * 0.5);
	}
	return tmp;
}

Python

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

↓

def code(a, b_2, c):
	tmp = 0
	if b_2 <= -2.25e-60:
		tmp = -0.5 * (c / b_2)
	elif b_2 <= 1.6e+115:
		tmp = (-b_2 - math.sqrt(((b_2 * b_2) - (c * a)))) / a
	else:
		tmp = (-2.0 * (b_2 / a)) + ((c / b_2) * 0.5)
	return tmp

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

↓

function code(a, b_2, c)
	tmp = 0.0
	if (b_2 <= -2.25e-60)
		tmp = Float64(-0.5 * Float64(c / b_2));
	elseif (b_2 <= 1.6e+115)
		tmp = Float64(Float64(Float64(-b_2) - sqrt(Float64(Float64(b_2 * b_2) - Float64(c * a)))) / a);
	else
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(Float64(c / b_2) * 0.5));
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(a, b_2, c)
	tmp = 0.0;
	if (b_2 <= -2.25e-60)
		tmp = -0.5 * (c / b_2);
	elseif (b_2 <= 1.6e+115)
		tmp = (-b_2 - sqrt(((b_2 * b_2) - (c * a)))) / a;
	else
		tmp = (-2.0 * (b_2 / a)) + ((c / b_2) * 0.5);
	end
	tmp_2 = tmp;
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]

↓

code[a_, b$95$2_, c_] := If[LessEqual[b$95$2, -2.25e-60], N[(-0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 1.6e+115], N[(N[((-b$95$2) - N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(N[(c / b$95$2), $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -2.25e-60

   1. Initial program 15.5%

      \[\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around -inf 87.3%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b_2}} \]

   if -2.25e-60 < b_2 < 1.6e115

   1. Initial program 78.3%

      \[\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   if 1.6e115 < b_2

   1. Initial program 20.9%

      \[\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   2. Taylor expanded in b_2 around inf 94.6%

      \[\leadsto \color{blue}{-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 84.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -2.25 \cdot 10^{-60}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.6 \cdot 10^{+115}:\\ \;\;\;\;\frac{\left(-b_2\right) - \sqrt{b_2 \cdot b_2 - c \cdot a}}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + \frac{c}{b_2} \cdot 0.5\\ \end{array} \]

Alternatives

Alternative 1
Accuracy	79.1%
Cost	7240

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -5 \cdot 10^{-60}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.36 \cdot 10^{-67}:\\ \;\;\;\;\frac{\left(-b_2\right) - \sqrt{c \cdot \left(-a\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + \frac{c}{b_2} \cdot 0.5\\ \end{array} \]

Alternative 2
Accuracy	42.5%
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -5.6 \cdot 10^{-197}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b_2}{a}\\ \end{array} \]

Alternative 3
Accuracy	64.1%
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -1.56 \cdot 10^{-201}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{\frac{a}{b_2}}\\ \end{array} \]

Alternative 4
Accuracy	64.2%
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -2.9 \cdot 10^{-201}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b_2}\\ \mathbf{else}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \end{array} \]

Alternative 5
Accuracy	16.4%
Cost	388

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -1.42 \cdot 10^{-300}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\frac{-b_2}{a}\\ \end{array} \]

Alternative 6
Accuracy	11.6%
Cost	64

\[0 \]

Reproduce

herbie shell --seed 2023147 
(FPCore (a b_2 c)
  :name "quad2m (problem 3.2.1, negative)"
  :precision binary64
  (/ (- (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))