Quadratic roots, full range

Average Accuracy: 46.5% → 84.0%

Time: 21.9s

Precision: binary64

Cost: 7624

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+117}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.3 \cdot 10^{-61}:\\ \;\;\;\;\frac{\sqrt{b \cdot b + c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{c}{\frac{\frac{{b}^{3}}{a}}{c}}\\ \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))

↓

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e+117)
   (- (/ c b) (/ b a))
   (if (<= b 1.3e-61)
     (/ (- (sqrt (+ (* b b) (* c (* a -4.0)))) b) (* a 2.0))
     (- (/ (- c) b) (/ c (/ (/ (pow b 3.0) a) c))))))

C

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

↓

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+117) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.3e-61) {
		tmp = (sqrt(((b * b) + (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (-c / b) - (c / ((pow(b, 3.0) / a) / c));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - ((4.0d0 * a) * c)))) / (2.0d0 * a)
end function

↓

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-5d+117)) then
        tmp = (c / b) - (b / a)
    else if (b <= 1.3d-61) then
        tmp = (sqrt(((b * b) + (c * (a * (-4.0d0))))) - b) / (a * 2.0d0)
    else
        tmp = (-c / b) - (c / (((b ** 3.0d0) / a) / c))
    end if
    code = tmp
end function

Java

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

↓

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+117) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.3e-61) {
		tmp = (Math.sqrt(((b * b) + (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (-c / b) - (c / ((Math.pow(b, 3.0) / a) / c));
	}
	return tmp;
}

Python

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

↓

def code(a, b, c):
	tmp = 0
	if b <= -5e+117:
		tmp = (c / b) - (b / a)
	elif b <= 1.3e-61:
		tmp = (math.sqrt(((b * b) + (c * (a * -4.0)))) - b) / (a * 2.0)
	else:
		tmp = (-c / b) - (c / ((math.pow(b, 3.0) / a) / c))
	return tmp

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))) / Float64(2.0 * a))
end

↓

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e+117)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 1.3e-61)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) + Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(Float64(-c) / b) - Float64(c / Float64(Float64((b ^ 3.0) / a) / c)));
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5e+117)
		tmp = (c / b) - (b / a);
	elseif (b <= 1.3e-61)
		tmp = (sqrt(((b * b) + (c * (a * -4.0)))) - b) / (a * 2.0);
	else
		tmp = (-c / b) - (c / (((b ^ 3.0) / a) / c));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

↓

code[a_, b_, c_] := If[LessEqual[b, -5e+117], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.3e-61], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] + N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[((-c) / b), $MachinePrecision] - N[(c / N[(N[(N[Power[b, 3.0], $MachinePrecision] / a), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.99999999999999983e117

   1. Initial program 19.4%

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

   2. Simplified 19.4%

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

      [Start] 19.4	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
      *-commutative [=>] 19.4	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{a \cdot 2}} \]

   3. Taylor expanded in b around -inf 95.9%

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

   4. Simplified 95.9%

      \[\leadsto \color{blue}{\frac{c}{b} - \frac{b}{a}} \]
      Proof

      [Start] 95.9	\[ \frac{c}{b} + -1 \cdot \frac{b}{a} \]
      mul-1-neg [=>] 95.9	\[ \frac{c}{b} + \color{blue}{\left(-\frac{b}{a}\right)} \]
      unsub-neg [=>] 95.9	\[ \color{blue}{\frac{c}{b} - \frac{b}{a}} \]

   if -4.99999999999999983e117 < b < 1.30000000000000005e-61

   1. Initial program 78.7%

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

   if 1.30000000000000005e-61 < b

   1. Initial program 16.7%

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

   2. Simplified 16.7%

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

      [Start] 16.7	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
      *-commutative [=>] 16.7	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{a \cdot 2}} \]

   3. Taylor expanded in b around inf 68.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{{c}^{2} \cdot a}{{b}^{3}} + -1 \cdot \frac{c}{b}} \]

   4. Simplified 86.0%

      \[\leadsto \color{blue}{\frac{-c}{b} - \frac{c}{\frac{\frac{{b}^{3}}{a}}{c}}} \]
      Proof

      [Start] 68.0	\[ -1 \cdot \frac{{c}^{2} \cdot a}{{b}^{3}} + -1 \cdot \frac{c}{b} \]
      +-commutative [=>] 68.0	\[ \color{blue}{-1 \cdot \frac{c}{b} + -1 \cdot \frac{{c}^{2} \cdot a}{{b}^{3}}} \]
      mul-1-neg [=>] 68.0	\[ -1 \cdot \frac{c}{b} + \color{blue}{\left(-\frac{{c}^{2} \cdot a}{{b}^{3}}\right)} \]
      unsub-neg [=>] 68.0	\[ \color{blue}{-1 \cdot \frac{c}{b} - \frac{{c}^{2} \cdot a}{{b}^{3}}} \]
      mul-1-neg [=>] 68.0	\[ \color{blue}{\left(-\frac{c}{b}\right)} - \frac{{c}^{2} \cdot a}{{b}^{3}} \]
      distribute-neg-frac [=>] 68.0	\[ \color{blue}{\frac{-c}{b}} - \frac{{c}^{2} \cdot a}{{b}^{3}} \]
      associate-/l* [=>] 71.1	\[ \frac{-c}{b} - \color{blue}{\frac{{c}^{2}}{\frac{{b}^{3}}{a}}} \]
      unpow2 [=>] 71.1	\[ \frac{-c}{b} - \frac{\color{blue}{c \cdot c}}{\frac{{b}^{3}}{a}} \]
      associate-/l* [=>] 86.0	\[ \frac{-c}{b} - \color{blue}{\frac{c}{\frac{\frac{{b}^{3}}{a}}{c}}} \]

3. Recombined 3 regimes into one program.

4. Final simplification 84.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+117}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.3 \cdot 10^{-61}:\\ \;\;\;\;\frac{\sqrt{b \cdot b + c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{c}{\frac{\frac{{b}^{3}}{a}}{c}}\\ \end{array} \]

Alternatives

Alternative 1
Accuracy	83.9%
Cost	7624

\[\begin{array}{l} \mathbf{if}\;b \leq -1.5 \cdot 10^{+89}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.5 \cdot 10^{-66}:\\ \;\;\;\;\left(\sqrt{b \cdot b + a \cdot \left(c \cdot -4\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{c}{\frac{\frac{{b}^{3}}{a}}{c}}\\ \end{array} \]

Alternative 2
Accuracy	78.8%
Cost	7496

\[\begin{array}{l} \mathbf{if}\;b \leq -9.2 \cdot 10^{-60}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{-64}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b} - \frac{c}{\frac{\frac{{b}^{3}}{a}}{c}}\\ \end{array} \]

Alternative 3
Accuracy	79.0%
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -2.05 \cdot 10^{-63}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{-66}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{c \cdot \left(a \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4
Accuracy	78.9%
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -1.5 \cdot 10^{-60}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 8.2 \cdot 10^{-64}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 5
Accuracy	64.4%
Cost	580

\[\begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 6
Accuracy	38.1%
Cost	388

\[\begin{array}{l} \mathbf{if}\;b \leq 0.12:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b}\\ \end{array} \]

Alternative 7
Accuracy	64.4%
Cost	388

\[\begin{array}{l} \mathbf{if}\;b \leq 1.9 \cdot 10^{-302}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 8
Accuracy	11.5%
Cost	192

\[\frac{c}{b} \]

Reproduce

herbie shell --seed 2023136 
(FPCore (a b c)
  :name "Quadratic roots, full range"
  :precision binary64
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))