Quadratic roots, medium range

Percentage Accurate: 31.1% → 95.6%

Time: 14.5s

Alternatives: 9

Speedup: 29.0×

Specification

\[\left(\left(1.1102230246251565 \cdot 10^{-16} < a \land a < 9007199254740992\right) \land \left(1.1102230246251565 \cdot 10^{-16} < b \land b < 9007199254740992\right)\right) \land \left(1.1102230246251565 \cdot 10^{-16} < c \land c < 9007199254740992\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: 31.1% 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: 95.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ 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} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (-
  (*
   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) {
	return (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);
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (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 function

Java

public static double code(double a, double b, double c) {
	return (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);
}

Python

def code(a, b, c):
	return (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)

Julia

function code(a, b, c)
	return 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

MATLAB

function tmp = code(a, b, c)
	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

Wolfram

code[a_, b_, c_] := 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. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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 96.1%

   \[\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 96.1%

   \[\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. associate-*r/ 96.1%

      \[\leadsto \color{blue}{\frac{-1 \cdot 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) \]

   2. neg-mul-1 96.1%

      \[\leadsto \frac{\color{blue}{-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 96.1%

   \[\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/ 96.1%

      \[\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 96.1%

    \[\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/ 96.1%

       \[\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 96.1%

       \[\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 96.1%

       \[\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 96.1%

    \[\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) \]

13. Final simplification 96.1%

    \[\leadsto 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} \]
14. Add Preprocessing

Alternative 2: 94.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return ((((-2.0 * (pow(c, 3.0) * pow(a, 2.0))) / pow(b, 4.0)) - c) - (a * pow((c / -b), 2.0))) / 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 = (((((-2.0d0) * ((c ** 3.0d0) * (a ** 2.0d0))) / (b ** 4.0d0)) - c) - (a * ((c / -b) ** 2.0d0))) / b
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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 94.0%

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

6. Taylor expanded in b around inf 94.3%

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

8. Simplified 94.3%

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

9. Final simplification 94.3%

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

Alternative 3: 94.1% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return (a * ((-2.0 * ((a * pow(c, 3.0)) / pow(b, 5.0))) - (pow(c, 2.0) / pow(b, 3.0)))) - (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 = (a * (((-2.0d0) * ((a * (c ** 3.0d0)) / (b ** 5.0d0))) - ((c ** 2.0d0) / (b ** 3.0d0)))) - (c / b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := N[(N[(a * N[(N[(-2.0 * N[(N[(a * N[Power[c, 3.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 5.0], $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. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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 94.3%

   \[\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. Final simplification 94.3%

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

Alternative 4: 93.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ 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} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  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) {
	return c * ((c * ((-2.0 * ((c * pow(a, 2.0)) / pow(b, 5.0))) - (a / pow(b, 3.0)))) + (-1.0 / 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 * ((c * (((-2.0d0) * ((c * (a ** 2.0d0)) / (b ** 5.0d0))) - (a / (b ** 3.0d0)))) + ((-1.0d0) / b))
end function

Java

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

Python

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

Julia

function code(a, b, c)
	return 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

MATLAB

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

Wolfram

code[a_, b_, c_] := 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. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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 94.0%

   \[\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)} \]

6. Final simplification 94.0%

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

Alternative 5: 91.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}} \end{array} \]

FPCore

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

C

double code(double a, double b, double c) {
	return (c / -b) - (a * (pow(c, 2.0) / 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 / -b) - (a * ((c ** 2.0d0) / (b ** 3.0d0)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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.9%

   \[\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.9%

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

   2. unsub-neg 89.9%

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

   3. mul-1-neg 89.9%

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

   4. distribute-neg-frac2 89.9%

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

   5. associate-/l* 89.9%

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

7. Simplified 89.9%

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

Alternative 6: 91.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return (-c - (a * pow((c / -b), 2.0))) / 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 - (a * ((c / -b) ** 2.0d0))) / b
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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.7%

   \[\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.7%

      \[\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.7%

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

   3. distribute-rgt-neg-in 89.7%

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

7. Simplified 89.7%

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

8. Taylor expanded in b around inf 89.9%

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

   1. neg-mul-1 89.9%

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

   2. +-commutative 89.9%

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

   3. unsub-neg 89.9%

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

   4. mul-1-neg 89.9%

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

   5. associate-/l* 89.9%

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

   6. distribute-lft-neg-in 89.9%

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

   7. unpow2 89.9%

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

   8. unpow2 89.9%

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

   9. times-frac 89.9%

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

   10. sqr-neg 89.9%

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

   11. unpow1 89.9%

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

   12. pow-plus 89.9%

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

   13. distribute-neg-frac 89.9%

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

   14. metadata-eval 89.9%

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

10. Simplified 89.9%

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

11. Final simplification 89.9%

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

Alternative 7: 90.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.2%

   \[\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 35.2%

      \[\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{\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.7%

   \[\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.7%

      \[\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.7%

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

   3. distribute-rgt-neg-in 89.7%

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

7. Simplified 89.7%

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

   1. pow1 89.7%

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

   2. div-inv 89.7%

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

   3. fmm-def 89.7%

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

   4. distribute-rgt-neg-out 89.7%

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

   5. pow-flip 89.7%

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

   6. metadata-eval 89.7%

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

9. Applied egg-rr 89.7%

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

    1. unpow1 89.7%

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

    2. fma-define 89.7%

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

    3. +-commutative 89.7%

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

    4. distribute-lft-neg-out 89.7%

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

    5. unsub-neg 89.7%

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

    6. distribute-neg-frac 89.7%

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

    7. metadata-eval 89.7%

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

11. Simplified 89.7%

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

12. Final simplification 89.7%

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

Alternative 8: 81.5% 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(c / Float64(-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 35.2%

   \[\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 35.2%

      \[\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{\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 78.5%

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

   1. associate-*r/ 78.5%

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

   2. mul-1-neg 78.5%

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

7. Simplified 78.5%

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

8. Final simplification 78.5%

   \[\leadsto \frac{c}{-b} \]
9. 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 35.2%

   \[\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 35.2%

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

3. Simplified 35.2%

   \[\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. Step-by-step derivation

   1. add-cbrt-cube 34.9%

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

   2. pow1/3 35.1%

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

   3. pow3 35.1%

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

   4. pow2 35.1%

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

   5. pow-pow 35.1%

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

   6. metadata-eval 35.1%

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

6. Applied egg-rr 35.1%

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

   1. unpow1/3 35.0%

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

8. Simplified 35.0%

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

   1. add-log-exp 24.9%

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

   2. neg-mul-1 24.9%

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

   3. fma-define 24.9%

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

   4. pow1/3 26.7%

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

   5. pow-pow 25.0%

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

   6. metadata-eval 25.0%

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

   7. associate-*l* 25.0%

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

10. Applied egg-rr 25.0%

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

11. Taylor expanded in a around 0 3.2%

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

    1. associate-*r/ 3.2%

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

    2. distribute-rgt1-in 3.2%

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

    3. metadata-eval 3.2%

       \[\leadsto \frac{0.5 \cdot \left(\color{blue}{0} \cdot b\right)}{a} \]

    4. mul0-lft 3.2%

       \[\leadsto \frac{0.5 \cdot \color{blue}{0}}{a} \]

    5. metadata-eval 3.2%

       \[\leadsto \frac{\color{blue}{0}}{a} \]

13. Simplified 3.2%

    \[\leadsto \color{blue}{\frac{0}{a}} \]

14. Taylor expanded in a around 0 3.2%

    \[\leadsto \color{blue}{0} \]
15. Add Preprocessing

Reproduce

herbie shell --seed 2024165 
(FPCore (a b c)
  :name "Quadratic roots, medium range"
  :precision binary64
  :pre (and (and (and (< 1.1102230246251565e-16 a) (< a 9007199254740992.0)) (and (< 1.1102230246251565e-16 b) (< b 9007199254740992.0))) (and (< 1.1102230246251565e-16 c) (< c 9007199254740992.0)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))