Quadratic roots, wide range

Percentage Accurate: 18.1% → 97.3%

Time: 16.2s

Alternatives: 8

Speedup: 29.0×

Specification

\[\left(\left(4.930380657631324 \cdot 10^{-32} < a \land a < 2.028240960365167 \cdot 10^{+31}\right) \land \left(4.930380657631324 \cdot 10^{-32} < b \land b < 2.028240960365167 \cdot 10^{+31}\right)\right) \land \left(4.930380657631324 \cdot 10^{-32} < c \land c < 2.028240960365167 \cdot 10^{+31}\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: 18.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: 97.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ c \cdot \left(c \cdot \mathsf{fma}\left(-1, \frac{a}{{b}^{3}}, c \cdot \mathsf{fma}\left(-2, \frac{{a}^{2}}{{b}^{5}}, -0.25 \cdot \left(\left(20 \cdot {a}^{3}\right) \cdot \frac{c}{{b}^{7}}\right)\right)\right) + \frac{-1}{b}\right) \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  c
  (+
   (*
    c
    (fma
     -1.0
     (/ a (pow b 3.0))
     (*
      c
      (fma
       -2.0
       (/ (pow a 2.0) (pow b 5.0))
       (* -0.25 (* (* 20.0 (pow a 3.0)) (/ c (pow b 7.0))))))))
   (/ -1.0 b))))

C

double code(double a, double b, double c) {
	return c * ((c * fma(-1.0, (a / pow(b, 3.0)), (c * fma(-2.0, (pow(a, 2.0) / pow(b, 5.0)), (-0.25 * ((20.0 * pow(a, 3.0)) * (c / pow(b, 7.0)))))))) + (-1.0 / b));
}

Julia

function code(a, b, c)
	return Float64(c * Float64(Float64(c * fma(-1.0, Float64(a / (b ^ 3.0)), Float64(c * fma(-2.0, Float64((a ^ 2.0) / (b ^ 5.0)), Float64(-0.25 * Float64(Float64(20.0 * (a ^ 3.0)) * Float64(c / (b ^ 7.0)))))))) + Float64(-1.0 / b)))
end

Wolfram

code[a_, b_, c_] := N[(c * N[(N[(c * N[(-1.0 * N[(a / N[Power[b, 3.0], $MachinePrecision]), $MachinePrecision] + N[(c * N[(-2.0 * N[(N[Power[a, 2.0], $MachinePrecision] / N[Power[b, 5.0], $MachinePrecision]), $MachinePrecision] + N[(-0.25 * N[(N[(20.0 * N[Power[a, 3.0], $MachinePrecision]), $MachinePrecision] * N[(c / N[Power[b, 7.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-1.0 / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in c around 0 96.9%

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

7. Simplified 96.9%

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

8. Taylor expanded in c around 0 96.9%

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

   1. associate-/l* 96.9%

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

   2. associate-*r* 96.9%

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

10. Simplified 96.9%

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

11. Final simplification 96.9%

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

Alternative 2: 96.8% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in a around 0 96.6%

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

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

   1. mul-1-neg 96.6%

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

   2. unsub-neg 96.6%

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

   3. associate-/r* 96.6%

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

8. Simplified 96.6%

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

9. Final simplification 96.6%

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

Alternative 3: 96.5% 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 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in c around 0 96.2%

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

   \[\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 4: 95.2% 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 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in a around 0 95.1%

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

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

   2. unsub-neg 95.1%

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

   3. associate-*r/ 95.1%

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

   4. mul-1-neg 95.1%

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

   5. associate-/l* 95.1%

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

7. Simplified 95.1%

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

8. Final simplification 95.1%

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

Alternative 5: 95.1% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in c around 0 94.8%

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

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

   2. neg-mul-1 94.8%

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

   3. distribute-rgt-neg-in 94.8%

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

7. Simplified 94.8%

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

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

9. Taylor expanded in c around 0 94.8%

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

    1. unpow3 94.8%

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

    2. unpow2 94.8%

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

    3. associate-/r* 94.8%

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

    4. associate-*r/ 94.8%

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

    5. associate-/l* 94.8%

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

    6. associate-*r/ 94.8%

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

    7. div-sub 94.8%

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

    8. fmm-def 94.8%

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

    9. associate-*r/ 94.8%

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

    10. metadata-eval 94.8%

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

    11. associate-*r/ 95.1%

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

    12. *-commutative 95.1%

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

    13. associate-/l* 95.1%

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

11. Simplified 95.1%

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

12. Final simplification 95.1%

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

Alternative 6: 94.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c \cdot \left(\frac{-1}{b} - \frac{c \cdot a}{{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 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in c around 0 94.8%

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

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

   2. neg-mul-1 94.8%

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

   3. distribute-rgt-neg-in 94.8%

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

7. Simplified 94.8%

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

8. Taylor expanded in a around inf 94.6%

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

   1. mul-1-neg 94.6%

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

   2. distribute-frac-neg 94.6%

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

10. Simplified 94.6%

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

11. Taylor expanded in a around 0 94.8%

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

    1. sub-neg 94.8%

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

    2. distribute-neg-frac 94.8%

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

    3. metadata-eval 94.8%

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

    4. +-commutative 94.8%

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

    5. mul-1-neg 94.8%

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

    6. unsub-neg 94.8%

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

13. Simplified 94.8%

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

14. Final simplification 94.8%

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

Alternative 7: 95.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in b around inf 95.1%

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

   1. mul-1-neg 95.1%

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

   2. unsub-neg 95.1%

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

   3. mul-1-neg 95.1%

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

   4. associate-/l* 95.1%

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

7. Simplified 95.1%

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

8. Taylor expanded in a around 0 95.1%

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

   1. associate-/l* 95.1%

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

   2. unpow2 95.1%

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

   3. unpow2 95.1%

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

   4. times-frac 95.1%

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

   5. sqr-neg 95.1%

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

   6. distribute-frac-neg 95.1%

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

   7. neg-mul-1 95.1%

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

   8. *-commutative 95.1%

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

   9. associate-*r/ 95.1%

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

   10. distribute-frac-neg 95.1%

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

   11. neg-mul-1 95.1%

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

   12. *-commutative 95.1%

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

   13. associate-*r/ 95.1%

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

   14. unpow2 95.1%

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

   15. associate-*r/ 95.1%

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

   16. *-commutative 95.1%

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

   17. neg-mul-1 95.1%

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

   18. distribute-frac-neg 95.1%

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

   19. distribute-neg-frac2 95.1%

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

10. Simplified 95.1%

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

11. Final simplification 95.1%

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

Alternative 8: 90.2% 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 18.1%

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

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

3. Simplified 18.1%

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

5. Taylor expanded in b around inf 90.1%

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

   1. associate-*r/ 90.1%

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

   2. mul-1-neg 90.1%

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

7. Simplified 90.1%

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

8. Final simplification 90.1%

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

Reproduce

herbie shell --seed 2024112 
(FPCore (a b c)
  :name "Quadratic roots, wide range"
  :precision binary64
  :pre (and (and (and (< 4.930380657631324e-32 a) (< a 2.028240960365167e+31)) (and (< 4.930380657631324e-32 b) (< b 2.028240960365167e+31))) (and (< 4.930380657631324e-32 c) (< c 2.028240960365167e+31)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))