Quadratic roots, full range

Average Accuracy: 46.6% → 83.8%

Time: 16.4s

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 -4.15 \cdot 10^{+139}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 4.7 \cdot 10^{-33}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(a \cdot 4\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \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 -4.15e+139)
   (/ (- b) a)
   (if (<= b 4.7e-33)
     (/ (- (sqrt (- (* b b) (* (* a 4.0) c))) b) (* a 2.0))
     (/ (- c) b))))

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 <= -4.15e+139) {
		tmp = -b / a;
	} else if (b <= 4.7e-33) {
		tmp = (sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	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 <= (-4.15d+139)) then
        tmp = -b / a
    else if (b <= 4.7d-33) then
        tmp = (sqrt(((b * b) - ((a * 4.0d0) * c))) - b) / (a * 2.0d0)
    else
        tmp = -c / b
    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 <= -4.15e+139) {
		tmp = -b / a;
	} else if (b <= 4.7e-33) {
		tmp = (Math.sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	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 <= -4.15e+139:
		tmp = -b / a
	elif b <= 4.7e-33:
		tmp = (math.sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0)
	else:
		tmp = -c / b
	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 <= -4.15e+139)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 4.7e-33)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(Float64(a * 4.0) * c))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-c) / b);
	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 <= -4.15e+139)
		tmp = -b / a;
	elseif (b <= 4.7e-33)
		tmp = (sqrt(((b * b) - ((a * 4.0) * c))) - b) / (a * 2.0);
	else
		tmp = -c / b;
	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, -4.15e+139], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 4.7e-33], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(a * 4.0), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.15000000000000024e139

   1. Initial program 7.6%

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

   2. Simplified 7.5%

      \[\leadsto \color{blue}{\left(\sqrt{\mathsf{fma}\left(b, b, \left(a \cdot c\right) \cdot -4\right)} - b\right) \cdot \frac{0.5}{a}} \]
      Proof

      [Start] 7.6	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
      /-rgt-identity [<=] 7.6	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{\frac{2 \cdot a}{1}}} \]
      metadata-eval [<=] 7.6	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\frac{2 \cdot a}{\color{blue}{--1}}} \]
      *-commutative [=>] 7.6	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\frac{\color{blue}{a \cdot 2}}{--1}} \]
      associate-/l* [=>] 7.6	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{\frac{a}{\frac{--1}{2}}}} \]
      associate-/l* [<=] 7.6	\[ \color{blue}{\frac{\left(\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\right) \cdot \frac{--1}{2}}{a}} \]
      associate-*r/ [<=] 7.5	\[ \color{blue}{\left(\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\right) \cdot \frac{\frac{--1}{2}}{a}} \]
      /-rgt-identity [<=] 7.5	\[ \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{1}} \cdot \frac{\frac{--1}{2}}{a} \]
      metadata-eval [<=] 7.5	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{\color{blue}{--1}} \cdot \frac{\frac{--1}{2}}{a} \]

   3. Taylor expanded in b around -inf 96.5%

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

   4. Simplified 96.5%

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

      [Start] 96.5	\[ -1 \cdot \frac{b}{a} \]
      associate-*r/ [=>] 96.5	\[ \color{blue}{\frac{-1 \cdot b}{a}} \]
      mul-1-neg [=>] 96.5	\[ \frac{\color{blue}{-b}}{a} \]

   if -4.15000000000000024e139 < b < 4.7000000000000002e-33

   1. Initial program 77.2%

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

   if 4.7000000000000002e-33 < b

   1. Initial program 14.8%

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

   2. Simplified 14.8%

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

      [Start] 14.8	\[ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
      *-commutative [=>] 14.8	\[ \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 89.2%

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

   4. Simplified 89.2%

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

      [Start] 89.2	\[ -1 \cdot \frac{c}{b} \]
      mul-1-neg [=>] 89.2	\[ \color{blue}{-\frac{c}{b}} \]
      distribute-neg-frac [=>] 89.2	\[ \color{blue}{\frac{-c}{b}} \]

3. Recombined 3 regimes into one program.

4. Final simplification 83.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.15 \cdot 10^{+139}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 4.7 \cdot 10^{-33}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(a \cdot 4\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternatives

Alternative 1
Accuracy	83.6%
Cost	7624

\[\begin{array}{l} \mathbf{if}\;b \leq -7 \cdot 10^{+103}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 4.4 \cdot 10^{-33}:\\ \;\;\;\;\left(\sqrt{b \cdot b + a \cdot \left(c \cdot -4\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 2
Accuracy	77.2%
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -5.7 \cdot 10^{-15}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.6 \cdot 10^{-33}:\\ \;\;\;\;\frac{0.5}{a} \cdot \left(\sqrt{c \cdot \left(a \cdot -4\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 3
Accuracy	77.2%
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -8.5 \cdot 10^{-14}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.55 \cdot 10^{-33}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4
Accuracy	65.3%
Cost	580

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

Alternative 5
Accuracy	38.1%
Cost	388

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

Alternative 6
Accuracy	65.2%
Cost	388

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

Alternative 7
Accuracy	11.7%
Cost	192

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

Reproduce

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