Quadratic roots, narrow range

Percentage Accurate: 55.2% → 91.5%

Time: 13.1s

Alternatives: 9

Speedup: 29.0×

Specification

\[\left(\left(1.0536712127723509 \cdot 10^{-8} < a \land a < 94906265.62425156\right) \land \left(1.0536712127723509 \cdot 10^{-8} < b \land b < 94906265.62425156\right)\right) \land \left(1.0536712127723509 \cdot 10^{-8} < c \land c < 94906265.62425156\right)\]

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{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(Float64(4.0 * 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[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 55.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{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(Float64(4.0 * 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[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 91.5% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.9)
   (/ (- (sqrt (- (* b b) (* (* 4.0 a) c))) b) (* a 2.0))
   (-
    (*
     a
     (-
      (*
       a
       (+
        (* -2.0 (/ (pow c 3.0) (pow b 5.0)))
        (* -5.0 (/ (* a (pow c 4.0)) (pow b 7.0)))))
      (/ (pow c 2.0) (pow b 3.0))))
    (/ c b))))

C

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

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.9:
		tmp = (math.sqrt(((b * b) - ((4.0 * a) * c))) - b) / (a * 2.0)
	else:
		tmp = (a * ((a * ((-2.0 * (math.pow(c, 3.0) / math.pow(b, 5.0))) + (-5.0 * ((a * math.pow(c, 4.0)) / math.pow(b, 7.0))))) - (math.pow(c, 2.0) / math.pow(b, 3.0)))) - (c / b)
	return tmp

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 2.9], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(N[(a * N[(N[(-2.0 * N[(N[Power[c, 3.0], $MachinePrecision] / N[Power[b, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-5.0 * N[(N[(a * N[Power[c, 4.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 7.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[Power[c, 2.0], $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 2.89999999999999991

   1. Initial program 83.9%

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

   if 2.89999999999999991 < b

   1. Initial program 45.7%

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

      1. *-commutative 45.7%

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

      2. +-commutative 45.7%

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

      3. sqr-neg 45.7%

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

      4. unsub-neg 45.7%

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

      5. sqr-neg 45.7%

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

      6. fma-neg 45.7%

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

      7. distribute-lft-neg-in 45.7%

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

      8. *-commutative 45.7%

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

      9. *-commutative 45.7%

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

      10. distribute-rgt-neg-in 45.7%

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

      11. metadata-eval 45.7%

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

   3. Simplified 45.7%

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

   5. Taylor expanded in a around 0 95.0%

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b} + a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + -0.25 \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right)} \]

   6. Taylor expanded in c around 0 95.0%

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

      1. mul-1-neg 95.0%

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

      2. distribute-frac-neg 95.0%

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

   8. Applied egg-rr 95.0%

      \[\leadsto \color{blue}{\frac{-c}{b}} + a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + -5 \cdot \frac{a \cdot {c}^{4}}{{b}^{7}}\right)\right) \]
   9. Step-by-step derivation

      1. associate-*r/ 95.0%

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

   10. Applied egg-rr 95.0%

       \[\leadsto \frac{-c}{b} + a \cdot \left(\color{blue}{\frac{-1 \cdot {c}^{2}}{{b}^{3}}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + -5 \cdot \frac{a \cdot {c}^{4}}{{b}^{7}}\right)\right) \]
   11. Step-by-step derivation

       1. associate-*r/ 95.0%

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

       2. mul-1-neg 95.0%

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

       3. distribute-neg-frac2 95.0%

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

   12. Simplified 95.0%

       \[\leadsto \frac{-c}{b} + a \cdot \left(\color{blue}{\frac{{c}^{2}}{-{b}^{3}}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + -5 \cdot \frac{a \cdot {c}^{4}}{{b}^{7}}\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.8%

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

Alternative 2: 89.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.2)
   (/ (- (sqrt (- (* b b) (* (* 4.0 a) c))) b) (* a 2.0))
   (-
    (*
     a
     (* (pow c 3.0) (+ (/ (* a -2.0) (pow b 5.0)) (/ -1.0 (* c (pow b 3.0))))))
    (/ c b))))

C

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

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= 6.2:
		tmp = (math.sqrt(((b * b) - ((4.0 * a) * c))) - b) / (a * 2.0)
	else:
		tmp = (a * (math.pow(c, 3.0) * (((a * -2.0) / math.pow(b, 5.0)) + (-1.0 / (c * math.pow(b, 3.0)))))) - (c / b)
	return tmp

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 6.2], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(N[Power[c, 3.0], $MachinePrecision] * N[(N[(N[(a * -2.0), $MachinePrecision] / N[Power[b, 5.0], $MachinePrecision]), $MachinePrecision] + N[(-1.0 / N[(c * N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.20000000000000018

   1. Initial program 83.3%

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

   if 6.20000000000000018 < b

   1. Initial program 45.3%

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

      1. *-commutative 45.3%

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

      2. +-commutative 45.3%

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

      3. sqr-neg 45.3%

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

      4. unsub-neg 45.3%

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

      5. sqr-neg 45.3%

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

      6. fma-neg 45.3%

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

      7. distribute-lft-neg-in 45.3%

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

      8. *-commutative 45.3%

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

      9. *-commutative 45.3%

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

      10. distribute-rgt-neg-in 45.3%

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

      11. metadata-eval 45.3%

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

   3. Simplified 45.3%

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

   5. Taylor expanded in a around 0 93.5%

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

   6. Taylor expanded in c around inf 93.5%

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

      1. associate-*r/ 93.5%

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

      2. *-commutative 93.5%

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

   8. Simplified 93.5%

      \[\leadsto -1 \cdot \frac{c}{b} + a \cdot \color{blue}{\left({c}^{3} \cdot \left(\frac{-2 \cdot a}{{b}^{5}} - \frac{1}{c \cdot {b}^{3}}\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 6.2:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;a \cdot \left({c}^{3} \cdot \left(\frac{a \cdot -2}{{b}^{5}} + \frac{-1}{c \cdot {b}^{3}}\right)\right) - \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 89.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.4)
   (/ (- (sqrt (- (* b b) (* (* 4.0 a) c))) b) (* a 2.0))
   (*
    c
    (+
     (* c (- (* -2.0 (/ (* c (pow a 2.0)) (pow b 5.0))) (/ a (pow b 3.0))))
     (/ -1.0 b)))))

C

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

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= 6.4:
		tmp = (math.sqrt(((b * b) - ((4.0 * a) * c))) - b) / (a * 2.0)
	else:
		tmp = c * ((c * ((-2.0 * ((c * math.pow(a, 2.0)) / math.pow(b, 5.0))) - (a / math.pow(b, 3.0)))) + (-1.0 / b))
	return tmp

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 6.4], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c * N[(N[(c * N[(N[(-2.0 * N[(N[(c * N[Power[a, 2.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.4000000000000004

   1. Initial program 83.3%

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

   if 6.4000000000000004 < b

   1. Initial program 45.3%

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

      1. *-commutative 45.3%

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

      2. +-commutative 45.3%

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

      3. sqr-neg 45.3%

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

      4. unsub-neg 45.3%

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

      5. sqr-neg 45.3%

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

      6. fma-neg 45.3%

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

      7. distribute-lft-neg-in 45.3%

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

      8. *-commutative 45.3%

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

      9. *-commutative 45.3%

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

      10. distribute-rgt-neg-in 45.3%

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

      11. metadata-eval 45.3%

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

   3. Simplified 45.3%

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

   5. Taylor expanded in c around 0 93.3%

      \[\leadsto \color{blue}{c \cdot \left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 6.4:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(c \cdot \left(-2 \cdot \frac{c \cdot {a}^{2}}{{b}^{5}} - \frac{a}{{b}^{3}}\right) + \frac{-1}{b}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 85.4% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.5)
   (/ (- (sqrt (- (* b b) (* (* 4.0 a) c))) b) (* a 2.0))
   (- (* a (/ (- (pow c 2.0)) (pow b 3.0))) (/ c b))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 6.5

   1. Initial program 83.3%

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

   if 6.5 < b

   1. Initial program 45.3%

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

      1. *-commutative 45.3%

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

      2. +-commutative 45.3%

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

      3. sqr-neg 45.3%

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

      4. unsub-neg 45.3%

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

      5. sqr-neg 45.3%

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

      6. fma-neg 45.3%

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

      7. distribute-lft-neg-in 45.3%

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

      8. *-commutative 45.3%

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

      9. *-commutative 45.3%

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

      10. distribute-rgt-neg-in 45.3%

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

      11. metadata-eval 45.3%

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

   3. Simplified 45.3%

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

   5. Taylor expanded in a around 0 89.4%

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

      1. mul-1-neg 89.4%

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

      2. unsub-neg 89.4%

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

      3. mul-1-neg 89.4%

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

      4. distribute-neg-frac2 89.4%

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

      5. associate-/l* 89.4%

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

   7. Simplified 89.4%

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

4. Final simplification 88.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 6.5:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;a \cdot \frac{-{c}^{2}}{{b}^{3}} - \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.2:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{2}, c\right)}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.2)
   (/ (- (sqrt (- (* b b) (* (* 4.0 a) c))) b) (* a 2.0))
   (/ (fma a (pow (/ c b) 2.0) c) (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.2) {
		tmp = (sqrt(((b * b) - ((4.0 * a) * c))) - b) / (a * 2.0);
	} else {
		tmp = fma(a, pow((c / b), 2.0), c) / -b;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 6.20000000000000018

   1. Initial program 83.3%

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

   if 6.20000000000000018 < b

   1. Initial program 45.3%

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

      1. *-commutative 45.3%

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

      2. +-commutative 45.3%

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

      3. sqr-neg 45.3%

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

      4. unsub-neg 45.3%

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

      5. sqr-neg 45.3%

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

      6. fma-neg 45.3%

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

      7. distribute-lft-neg-in 45.3%

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

      8. *-commutative 45.3%

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

      9. *-commutative 45.3%

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

      10. distribute-rgt-neg-in 45.3%

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

      11. metadata-eval 45.3%

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

   3. Simplified 45.3%

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

   5. Taylor expanded in c around 0 89.2%

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

      1. associate-*r/ 89.2%

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

      2. neg-mul-1 89.2%

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

      3. distribute-rgt-neg-in 89.2%

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

   7. Simplified 89.2%

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

   8. Taylor expanded in c around inf 89.1%

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

      1. mul-1-neg 89.1%

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

      2. *-commutative 89.1%

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

   10. Simplified 89.1%

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

   11. Taylor expanded in b around inf 89.4%

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

       1. distribute-lft-out 89.4%

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

       2. associate-*r/ 89.4%

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

       3. mul-1-neg 89.4%

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

       4. distribute-neg-frac2 89.4%

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

       5. +-commutative 89.4%

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

       6. associate-/l* 89.4%

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

       7. fma-define 89.4%

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(a, \frac{{c}^{2}}{{b}^{2}}, c\right)}}{-b} \]

       8. unpow2 89.4%

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

       9. unpow2 89.4%

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

       10. times-frac 89.4%

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

       11. unpow1 89.4%

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

       12. pow-plus 89.4%

           \[\leadsto \frac{\mathsf{fma}\left(a, \color{blue}{{\left(\frac{c}{b}\right)}^{\left(1 + 1\right)}}, c\right)}{-b} \]

       13. metadata-eval 89.4%

           \[\leadsto \frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{\color{blue}{2}}, c\right)}{-b} \]

   13. Simplified 89.4%

       \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{2}, c\right)}{-b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 6.2:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{2}, c\right)}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 85.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.2:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1 + \left(1 - a \cdot c\right)}{{b}^{3}} + \frac{-1}{b}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.2)
   (/ (- (sqrt (- (* b b) (* (* 4.0 a) c))) b) (* a 2.0))
   (* c (+ (/ (+ -1.0 (- 1.0 (* a c))) (pow b 3.0)) (/ -1.0 b)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 6.20000000000000018

   1. Initial program 83.3%

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

   if 6.20000000000000018 < b

   1. Initial program 45.3%

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

      1. *-commutative 45.3%

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

      2. +-commutative 45.3%

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

      3. sqr-neg 45.3%

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

      4. unsub-neg 45.3%

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

      5. sqr-neg 45.3%

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

      6. fma-neg 45.3%

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

      7. distribute-lft-neg-in 45.3%

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

      8. *-commutative 45.3%

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

      9. *-commutative 45.3%

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

      10. distribute-rgt-neg-in 45.3%

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

      11. metadata-eval 45.3%

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

   3. Simplified 45.3%

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

   5. Taylor expanded in c around 0 89.2%

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

      1. associate-*r/ 89.2%

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

      2. neg-mul-1 89.2%

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

      3. distribute-rgt-neg-in 89.2%

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

   7. Simplified 89.2%

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

      1. expm1-log1p-u 62.1%

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

      2. expm1-undefine 62.1%

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

   9. Applied egg-rr 62.1%

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

       1. sub-neg 62.1%

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

       2. metadata-eval 62.1%

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

       3. +-commutative 62.1%

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

       4. log1p-undefine 62.1%

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

       5. rem-exp-log 89.2%

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

       6. distribute-rgt-neg-in 89.2%

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

       7. unsub-neg 89.2%

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

   11. Simplified 89.2%

       \[\leadsto c \cdot \left(\frac{\color{blue}{-1 + \left(1 - a \cdot c\right)}}{{b}^{3}} - \frac{1}{b}\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 6.2:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1 + \left(1 - a \cdot c\right)}{{b}^{3}} + \frac{-1}{b}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 81.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c \cdot \left(\frac{-1}{b} - \frac{a \cdot c}{{b}^{3}}\right) \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (* c (- (/ -1.0 b) (/ (* a c) (pow b 3.0)))))

C

double code(double a, double b, double c) {
	return c * ((-1.0 / b) - ((a * c) / pow(b, 3.0)));
}

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 * (((-1.0d0) / b) - ((a * c) / (b ** 3.0d0)))
end function

Java

public static double code(double a, double b, double c) {
	return c * ((-1.0 / b) - ((a * c) / Math.pow(b, 3.0)));
}

Python

def code(a, b, c):
	return c * ((-1.0 / b) - ((a * c) / math.pow(b, 3.0)))

Julia

function code(a, b, c)
	return Float64(c * Float64(Float64(-1.0 / b) - Float64(Float64(a * c) / (b ^ 3.0))))
end

MATLAB

function tmp = code(a, b, c)
	tmp = c * ((-1.0 / b) - ((a * c) / (b ^ 3.0)));
end

Wolfram

code[a_, b_, c_] := N[(c * N[(N[(-1.0 / b), $MachinePrecision] - N[(N[(a * c), $MachinePrecision] / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 53.3%

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

   1. *-commutative 53.3%

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

   2. +-commutative 53.3%

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

   3. sqr-neg 53.3%

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

   4. unsub-neg 53.3%

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

   5. sqr-neg 53.3%

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

   6. fma-neg 53.3%

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

   7. distribute-lft-neg-in 53.3%

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

   8. *-commutative 53.3%

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

   9. *-commutative 53.3%

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

   10. distribute-rgt-neg-in 53.3%

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

   11. metadata-eval 53.3%

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

3. Simplified 53.3%

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

5. Taylor expanded in c around 0 82.4%

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

   1. associate-*r/ 82.4%

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

   2. neg-mul-1 82.4%

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

   3. distribute-rgt-neg-in 82.4%

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

7. Simplified 82.4%

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

8. Final simplification 82.4%

   \[\leadsto c \cdot \left(\frac{-1}{b} - \frac{a \cdot c}{{b}^{3}}\right) \]
9. Add Preprocessing

Alternative 8: 64.6% 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 53.3%

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

   1. *-commutative 53.3%

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

   2. +-commutative 53.3%

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

   3. sqr-neg 53.3%

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

   4. unsub-neg 53.3%

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

   5. sqr-neg 53.3%

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

   6. fma-neg 53.3%

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

   7. distribute-lft-neg-in 53.3%

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

   8. *-commutative 53.3%

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

   9. *-commutative 53.3%

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

   10. distribute-rgt-neg-in 53.3%

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

   11. metadata-eval 53.3%

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

3. Simplified 53.3%

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

5. Taylor expanded in b around inf 65.7%

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

   1. associate-*r/ 65.7%

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

   2. mul-1-neg 65.7%

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

7. Simplified 65.7%

   \[\leadsto \color{blue}{\frac{-c}{b}} \]
8. Add Preprocessing

Alternative 9: 3.2% accurate, 116.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

function code(a, b, c)
	return 0.0
end

MATLAB

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

Wolfram

code[a_, b_, c_] := 0.0

Derivation

1. Initial program 53.3%

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

   1. *-commutative 53.3%

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

   2. +-commutative 53.3%

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

   3. sqr-neg 53.3%

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

   4. unsub-neg 53.3%

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

   5. sqr-neg 53.3%

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

   6. fma-neg 53.3%

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

   7. distribute-lft-neg-in 53.3%

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

   8. *-commutative 53.3%

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

   9. *-commutative 53.3%

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

   10. distribute-rgt-neg-in 53.3%

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

   11. metadata-eval 53.3%

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

3. Simplified 53.3%

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

5. Taylor expanded in b around inf 65.7%

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

   1. associate-*r/ 65.7%

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

   2. mul-1-neg 65.7%

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

7. Simplified 65.7%

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

   1. distribute-frac-neg 65.7%

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

   2. mul-1-neg 65.7%

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

   3. expm1-log1p-u 60.0%

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

   4. expm1-undefine 46.1%

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

   5. mul-1-neg 46.1%

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

   6. distribute-frac-neg 46.1%

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

9. Applied egg-rr 46.1%

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

    1. sub-neg 46.1%

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

    2. metadata-eval 46.1%

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

    3. +-commutative 46.1%

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

    4. log1p-undefine 46.1%

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

    5. rem-exp-log 51.9%

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

    6. distribute-frac-neg 51.9%

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

    7. unsub-neg 51.9%

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

11. Simplified 51.9%

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

12. Taylor expanded in c around 0 3.2%

    \[\leadsto -1 + \color{blue}{1} \]

13. Final simplification 3.2%

    \[\leadsto 0 \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2024135 
(FPCore (a b c)
  :name "Quadratic roots, narrow range"
  :precision binary64
  :pre (and (and (and (< 1.0536712127723509e-8 a) (< a 94906265.62425156)) (and (< 1.0536712127723509e-8 b) (< b 94906265.62425156))) (and (< 1.0536712127723509e-8 c) (< c 94906265.62425156)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))