The quadratic formula (r2)

Percentage Accurate: 52.1% → 84.3%

Time: 16.4s

Alternatives: 7

Speedup: 12.9×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 52.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a} \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-127}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 5.2 \cdot 10^{+30}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - c \cdot \left(4 \cdot a\right)}}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.9e-127)
   (- (/ c b))
   (if (<= b 5.2e+30)
     (/ (- (- b) (sqrt (- (* b b) (* c (* 4.0 a))))) (* a 2.0))
     (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-127) {
		tmp = -(c / b);
	} else if (b <= 5.2e+30) {
		tmp = (-b - sqrt(((b * b) - (c * (4.0 * a))))) / (a * 2.0);
	} else {
		tmp = -b / a;
	}
	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
    real(8) :: tmp
    if (b <= (-2.9d-127)) then
        tmp = -(c / b)
    else if (b <= 5.2d+30) then
        tmp = (-b - sqrt(((b * b) - (c * (4.0d0 * a))))) / (a * 2.0d0)
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-127) {
		tmp = -(c / b);
	} else if (b <= 5.2e+30) {
		tmp = (-b - Math.sqrt(((b * b) - (c * (4.0 * a))))) / (a * 2.0);
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.9e-127:
		tmp = -(c / b)
	elif b <= 5.2e+30:
		tmp = (-b - math.sqrt(((b * b) - (c * (4.0 * a))))) / (a * 2.0)
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.9e-127)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 5.2e+30)
		tmp = Float64(Float64(Float64(-b) - sqrt(Float64(Float64(b * b) - Float64(c * Float64(4.0 * a))))) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.9e-127)
		tmp = -(c / b);
	elseif (b <= 5.2e+30)
		tmp = (-b - sqrt(((b * b) - (c * (4.0 * a))))) / (a * 2.0);
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.9e-127], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 5.2e+30], N[(N[((-b) - N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(c * N[(4.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.9e-127

   1. Initial program 17.6%

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

      1. *-commutative 17.6%

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

      2. sqr-neg 17.6%

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

      3. *-commutative 17.6%

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

      4. sqr-neg 17.6%

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

      5. associate-*r* 17.6%

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

      6. *-commutative 17.6%

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

   3. Simplified 17.6%

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

   5. Taylor expanded in b around -inf 87.3%

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

      1. mul-1-neg 87.3%

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

   7. Simplified 87.3%

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

   if -2.9e-127 < b < 5.19999999999999977e30

   1. Initial program 88.3%

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

      1. *-commutative 88.3%

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

      2. sqr-neg 88.3%

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

      3. *-commutative 88.3%

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

      4. sqr-neg 88.3%

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

      5. associate-*r* 88.3%

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

      6. *-commutative 88.3%

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

   3. Simplified 88.3%

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

   if 5.19999999999999977e30 < b

   1. Initial program 58.1%

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

      1. *-commutative 58.1%

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

      2. sqr-neg 58.1%

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

      3. *-commutative 58.1%

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

      4. sqr-neg 58.1%

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

      5. associate-*r* 58.1%

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

      6. *-commutative 58.1%

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

   3. Simplified 58.1%

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

   5. Taylor expanded in b around inf 97.3%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   6. Step-by-step derivation

      1. associate-*r/ 97.3%

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

      2. mul-1-neg 97.3%

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

   7. Simplified 97.3%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-127}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 5.2 \cdot 10^{+30}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - c \cdot \left(4 \cdot a\right)}}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 84.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-127}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 5.2 \cdot 10^{+30}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(c \cdot a\right)}}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.9e-127)
   (- (/ c b))
   (if (<= b 5.2e+30)
     (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* c a))))) (* a 2.0))
     (/ (- b) a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-127) {
		tmp = -(c / b);
	} else if (b <= 5.2e+30) {
		tmp = (-b - sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	} else {
		tmp = -b / a;
	}
	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
    real(8) :: tmp
    if (b <= (-2.9d-127)) then
        tmp = -(c / b)
    else if (b <= 5.2d+30) then
        tmp = (-b - sqrt(((b * b) - (4.0d0 * (c * a))))) / (a * 2.0d0)
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-127) {
		tmp = -(c / b);
	} else if (b <= 5.2e+30) {
		tmp = (-b - Math.sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.9e-127:
		tmp = -(c / b)
	elif b <= 5.2e+30:
		tmp = (-b - math.sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0)
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.9e-127)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 5.2e+30)
		tmp = Float64(Float64(Float64(-b) - sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(c * a))))) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.9e-127)
		tmp = -(c / b);
	elseif (b <= 5.2e+30)
		tmp = (-b - sqrt(((b * b) - (4.0 * (c * a))))) / (a * 2.0);
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.9e-127], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 5.2e+30], N[(N[((-b) - N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-b) / a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.9e-127

   1. Initial program 17.6%

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

      1. *-commutative 17.6%

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

      2. sqr-neg 17.6%

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

      3. *-commutative 17.6%

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

      4. sqr-neg 17.6%

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

      5. associate-*r* 17.6%

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

      6. *-commutative 17.6%

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

   3. Simplified 17.6%

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

   5. Taylor expanded in b around -inf 87.3%

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

      1. mul-1-neg 87.3%

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

   7. Simplified 87.3%

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

   if -2.9e-127 < b < 5.19999999999999977e30

   1. Initial program 88.3%

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

   if 5.19999999999999977e30 < b

   1. Initial program 58.1%

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

      1. *-commutative 58.1%

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

      2. sqr-neg 58.1%

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

      3. *-commutative 58.1%

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

      4. sqr-neg 58.1%

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

      5. associate-*r* 58.1%

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

      6. *-commutative 58.1%

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

   3. Simplified 58.1%

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

   5. Taylor expanded in b around inf 97.3%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   6. Step-by-step derivation

      1. associate-*r/ 97.3%

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

      2. mul-1-neg 97.3%

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

   7. Simplified 97.3%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-127}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 5.2 \cdot 10^{+30}:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(c \cdot a\right)}}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 80.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.9e-127)
   (- (/ c b))
   (if (<= b 2.5e-41)
     (* -0.5 (/ (+ b (sqrt (* a (* c -4.0)))) a))
     (- (/ c b) (/ b a)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-127) {
		tmp = -(c / b);
	} else if (b <= 2.5e-41) {
		tmp = -0.5 * ((b + sqrt((a * (c * -4.0)))) / a);
	} else {
		tmp = (c / b) - (b / a);
	}
	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
    real(8) :: tmp
    if (b <= (-2.9d-127)) then
        tmp = -(c / b)
    else if (b <= 2.5d-41) then
        tmp = (-0.5d0) * ((b + sqrt((a * (c * (-4.0d0))))) / a)
    else
        tmp = (c / b) - (b / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.9e-127) {
		tmp = -(c / b);
	} else if (b <= 2.5e-41) {
		tmp = -0.5 * ((b + Math.sqrt((a * (c * -4.0)))) / a);
	} else {
		tmp = (c / b) - (b / a);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.9e-127:
		tmp = -(c / b)
	elif b <= 2.5e-41:
		tmp = -0.5 * ((b + math.sqrt((a * (c * -4.0)))) / a)
	else:
		tmp = (c / b) - (b / a)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.9e-127)
		tmp = Float64(-Float64(c / b));
	elseif (b <= 2.5e-41)
		tmp = Float64(-0.5 * Float64(Float64(b + sqrt(Float64(a * Float64(c * -4.0)))) / a));
	else
		tmp = Float64(Float64(c / b) - Float64(b / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.9e-127)
		tmp = -(c / b);
	elseif (b <= 2.5e-41)
		tmp = -0.5 * ((b + sqrt((a * (c * -4.0)))) / a);
	else
		tmp = (c / b) - (b / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.9e-127], (-N[(c / b), $MachinePrecision]), If[LessEqual[b, 2.5e-41], N[(-0.5 * N[(N[(b + N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.9e-127

   1. Initial program 17.6%

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

      1. *-commutative 17.6%

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

      2. sqr-neg 17.6%

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

      3. *-commutative 17.6%

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

      4. sqr-neg 17.6%

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

      5. associate-*r* 17.6%

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

      6. *-commutative 17.6%

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

   3. Simplified 17.6%

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

   5. Taylor expanded in b around -inf 87.3%

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

      1. mul-1-neg 87.3%

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

   7. Simplified 87.3%

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

   if -2.9e-127 < b < 2.4999999999999998e-41

   1. Initial program 86.5%

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

      1. sub-neg 86.5%

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

      2. distribute-neg-out 86.5%

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

      3. neg-mul-1 86.5%

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

      4. times-frac 86.5%

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

      5. metadata-eval 86.5%

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

      6. sub-neg 86.5%

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

      7. +-commutative 86.5%

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

      8. *-commutative 86.5%

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

      9. distribute-lft-neg-in 86.5%

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

      10. distribute-rgt-neg-out 86.5%

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

      11. associate-*l* 86.5%

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

      12. fma-def 86.5%

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

      13. distribute-lft-neg-in 86.5%

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

      14. distribute-rgt-neg-in 86.5%

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

      15. metadata-eval 86.5%

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

   3. Simplified 86.5%

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

   5. Taylor expanded in a around inf 83.8%

      \[\leadsto -0.5 \cdot \frac{b + \sqrt{\color{blue}{-4 \cdot \left(a \cdot c\right)}}}{a} \]
   6. Step-by-step derivation

      1. *-commutative 83.8%

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

      2. associate-*r* 83.8%

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

   7. Simplified 83.8%

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

   if 2.4999999999999998e-41 < b

   1. Initial program 65.9%

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

      1. *-commutative 65.9%

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

      2. sqr-neg 65.9%

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

      3. *-commutative 65.9%

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

      4. sqr-neg 65.9%

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

      5. associate-*r* 65.9%

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

      6. *-commutative 65.9%

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

   3. Simplified 65.9%

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

   5. Taylor expanded in b around inf 90.4%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}} \]
   6. Step-by-step derivation

      1. +-commutative 90.4%

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

      2. mul-1-neg 90.4%

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

      3. unsub-neg 90.4%

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

   7. Simplified 90.4%

      \[\leadsto \color{blue}{\frac{c}{b} - \frac{b}{a}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.9 \cdot 10^{-127}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{elif}\;b \leq 2.5 \cdot 10^{-41}:\\ \;\;\;\;-0.5 \cdot \frac{b + \sqrt{a \cdot \left(c \cdot -4\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 67.9% accurate, 9.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-310) (- (/ c b)) (- (/ c b) (/ b a))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = -(c / b);
	} else {
		tmp = (c / b) - (b / a);
	}
	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
    real(8) :: tmp
    if (b <= (-1d-310)) then
        tmp = -(c / b)
    else
        tmp = (c / b) - (b / a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = -(c / b);
	} else {
		tmp = (c / b) - (b / a);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1e-310:
		tmp = -(c / b)
	else:
		tmp = (c / b) - (b / a)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-310)
		tmp = Float64(-Float64(c / b));
	else
		tmp = Float64(Float64(c / b) - Float64(b / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e-310)
		tmp = -(c / b);
	else
		tmp = (c / b) - (b / a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e-310], (-N[(c / b), $MachinePrecision]), N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -9.999999999999969e-311

   1. Initial program 35.2%

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

      1. *-commutative 35.2%

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

      2. sqr-neg 35.2%

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

      3. *-commutative 35.2%

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

      4. sqr-neg 35.2%

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

      5. associate-*r* 35.3%

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

      6. *-commutative 35.3%

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

   3. Simplified 35.3%

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

   5. Taylor expanded in b around -inf 67.8%

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

      1. mul-1-neg 67.8%

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

   7. Simplified 67.8%

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

   if -9.999999999999969e-311 < b

   1. Initial program 70.8%

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

      1. *-commutative 70.8%

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

      2. sqr-neg 70.8%

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

      3. *-commutative 70.8%

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

      4. sqr-neg 70.8%

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

      5. associate-*r* 70.8%

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

      6. *-commutative 70.8%

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

   3. Simplified 70.8%

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

   5. Taylor expanded in b around inf 69.4%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}} \]
   6. Step-by-step derivation

      1. +-commutative 69.4%

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

      2. mul-1-neg 69.4%

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

      3. unsub-neg 69.4%

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

   7. Simplified 69.4%

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

4. Final simplification 68.6%

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

Alternative 5: 67.8% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.95e-295) (- (/ c b)) (/ (- b) a)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.95e-295) {
		tmp = -(c / b);
	} else {
		tmp = -b / a;
	}
	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
    real(8) :: tmp
    if (b <= (-1.95d-295)) then
        tmp = -(c / b)
    else
        tmp = -b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.95e-295) {
		tmp = -(c / b);
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.95e-295:
		tmp = -(c / b)
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.95e-295)
		tmp = Float64(-Float64(c / b));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.95e-295)
		tmp = -(c / b);
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.95e-295], (-N[(c / b), $MachinePrecision]), N[((-b) / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -1.95e-295

   1. Initial program 34.7%

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

      1. *-commutative 34.7%

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

      2. sqr-neg 34.7%

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

      3. *-commutative 34.7%

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

      4. sqr-neg 34.7%

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

      5. associate-*r* 34.8%

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

      6. *-commutative 34.8%

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

   3. Simplified 34.8%

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

   5. Taylor expanded in b around -inf 68.4%

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

      1. mul-1-neg 68.4%

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

   7. Simplified 68.4%

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

   if -1.95e-295 < b

   1. Initial program 71.0%

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

      1. *-commutative 71.0%

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

      2. sqr-neg 71.0%

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

      3. *-commutative 71.0%

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

      4. sqr-neg 71.0%

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

      5. associate-*r* 71.0%

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

      6. *-commutative 71.0%

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

   3. Simplified 71.0%

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

   5. Taylor expanded in b around inf 68.5%

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   6. Step-by-step derivation

      1. associate-*r/ 68.5%

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

      2. mul-1-neg 68.5%

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

   7. Simplified 68.5%

      \[\leadsto \color{blue}{\frac{-b}{a}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 68.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.95 \cdot 10^{-295}:\\ \;\;\;\;-\frac{c}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 34.9% accurate, 29.0× speedup

Math

\[\begin{array}{l} \\ -\frac{c}{b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (- (/ c b)))

C

double code(double a, double b, double c) {
	return -(c / b);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = -(c / b)
end function

Java

public static double code(double a, double b, double c) {
	return -(c / b);
}

Python

def code(a, b, c):
	return -(c / b)

Julia

function code(a, b, c)
	return Float64(-Float64(c / b))
end

MATLAB

function tmp = code(a, b, c)
	tmp = -(c / b);
end

Wolfram

code[a_, b_, c_] := (-N[(c / b), $MachinePrecision])

Derivation

1. Initial program 52.9%

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

   1. *-commutative 52.9%

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

   2. sqr-neg 52.9%

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

   3. *-commutative 52.9%

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

   4. sqr-neg 52.9%

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

   5. associate-*r* 52.9%

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

   6. *-commutative 52.9%

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

3. Simplified 52.9%

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

5. Taylor expanded in b around -inf 35.3%

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

   1. mul-1-neg 35.3%

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

7. Simplified 35.3%

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

8. Final simplification 35.3%

   \[\leadsto -\frac{c}{b} \]
9. Add Preprocessing

Alternative 7: 11.5% accurate, 38.7× speedup

Math

\[\begin{array}{l} \\ \frac{c}{b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ c b))

C

double code(double a, double b, double c) {
	return c / b;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = c / b
end function

Java

public static double code(double a, double b, double c) {
	return c / b;
}

Python

def code(a, b, c):
	return c / b

Julia

function code(a, b, c)
	return Float64(c / b)
end

MATLAB

function tmp = code(a, b, c)
	tmp = c / b;
end

Wolfram

code[a_, b_, c_] := N[(c / b), $MachinePrecision]

Derivation

1. Initial program 52.9%

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

   1. *-commutative 52.9%

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

   2. sqr-neg 52.9%

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

   3. *-commutative 52.9%

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

   4. sqr-neg 52.9%

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

   5. associate-*r* 52.9%

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

   6. *-commutative 52.9%

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

3. Simplified 52.9%

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

5. Taylor expanded in b around -inf 26.7%

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

   1. associate-/l* 30.3%

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

   2. associate-*r/ 30.3%

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

7. Simplified 30.3%

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

   1. clear-num 30.3%

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

   2. inv-pow 30.3%

      \[\leadsto \color{blue}{{\left(\frac{a \cdot 2}{\frac{-2 \cdot a}{\frac{b}{c}}}\right)}^{-1}} \]

   3. associate-/r/ 28.2%

      \[\leadsto {\left(\frac{a \cdot 2}{\color{blue}{\frac{-2 \cdot a}{b} \cdot c}}\right)}^{-1} \]

   4. *-commutative 28.2%

      \[\leadsto {\left(\frac{a \cdot 2}{\frac{\color{blue}{a \cdot -2}}{b} \cdot c}\right)}^{-1} \]

9. Applied egg-rr 28.2%

   \[\leadsto \color{blue}{{\left(\frac{a \cdot 2}{\frac{a \cdot -2}{b} \cdot c}\right)}^{-1}} \]
10. Step-by-step derivation

    1. unpow-1 28.2%

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

    2. associate-/l* 28.2%

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

    3. associate-*l/ 26.6%

       \[\leadsto \frac{1}{\frac{a}{\frac{\color{blue}{\frac{\left(a \cdot -2\right) \cdot c}{b}}}{2}}} \]

    4. associate-*r/ 30.3%

       \[\leadsto \frac{1}{\frac{a}{\frac{\color{blue}{\left(a \cdot -2\right) \cdot \frac{c}{b}}}{2}}} \]

    5. associate-*l* 30.3%

       \[\leadsto \frac{1}{\frac{a}{\frac{\color{blue}{a \cdot \left(-2 \cdot \frac{c}{b}\right)}}{2}}} \]

11. Simplified 30.3%

    \[\leadsto \color{blue}{\frac{1}{\frac{a}{\frac{a \cdot \left(-2 \cdot \frac{c}{b}\right)}{2}}}} \]

12. Taylor expanded in a around 0 34.9%

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

    1. associate-*r/ 34.9%

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

    2. mul-1-neg 34.9%

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

14. Simplified 34.9%

    \[\leadsto \frac{1}{\color{blue}{\frac{-b}{c}}} \]
15. Step-by-step derivation

    1. clear-num 35.3%

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

    2. add-sqr-sqrt 34.0%

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

    3. sqrt-unprod 26.2%

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

    4. sqr-neg 26.2%

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

    5. sqrt-unprod 1.8%

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

    6. add-sqr-sqrt 12.2%

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

    7. expm1-log1p-u 11.6%

       \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{c}{b}\right)\right)} \]

    8. expm1-udef 11.9%

       \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{c}{b}\right)} - 1} \]

16. Applied egg-rr 11.9%

    \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{c}{b}\right)} - 1} \]
17. Step-by-step derivation

    1. expm1-def 11.6%

       \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{c}{b}\right)\right)} \]

    2. expm1-log1p 12.2%

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

18. Simplified 12.2%

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

19. Final simplification 12.2%

    \[\leadsto \frac{c}{b} \]
20. Add Preprocessing

Developer target: 70.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{c}{a \cdot \frac{\left(-b\right) + t\_0}{2 \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* 4.0 (* a c))))))
   (if (< b 0.0)
     (/ c (* a (/ (+ (- b) t_0) (* 2.0 a))))
     (/ (- (- b) t_0) (* 2.0 a)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - (4.0 * (a * c))));
	double tmp;
	if (b < 0.0) {
		tmp = c / (a * ((-b + t_0) / (2.0 * a)));
	} else {
		tmp = (-b - t_0) / (2.0 * a);
	}
	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
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - (4.0d0 * (a * c))))
    if (b < 0.0d0) then
        tmp = c / (a * ((-b + t_0) / (2.0d0 * a)))
    else
        tmp = (-b - t_0) / (2.0d0 * a)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - (4.0 * (a * c))));
	double tmp;
	if (b < 0.0) {
		tmp = c / (a * ((-b + t_0) / (2.0 * a)));
	} else {
		tmp = (-b - t_0) / (2.0 * a);
	}
	return tmp;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - (4.0 * (a * c))))
	tmp = 0
	if b < 0.0:
		tmp = c / (a * ((-b + t_0) / (2.0 * a)))
	else:
		tmp = (-b - t_0) / (2.0 * a)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))
	tmp = 0.0
	if (b < 0.0)
		tmp = Float64(c / Float64(a * Float64(Float64(Float64(-b) + t_0) / Float64(2.0 * a))));
	else
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	t_0 = sqrt(((b * b) - (4.0 * (a * c))));
	tmp = 0.0;
	if (b < 0.0)
		tmp = c / (a * ((-b + t_0) / (2.0 * a)));
	else
		tmp = (-b - t_0) / (2.0 * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[Less[b, 0.0], N[(c / N[(a * N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024041 
(FPCore (a b c)
  :name "The quadratic formula (r2)"
  :precision binary64

  :herbie-target
  (if (< b 0.0) (/ c (* a (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))) (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

  (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))