Quadratic roots, wide range

Percentage Accurate: 17.8% → 97.6%

Time: 16.2s

Alternatives: 7

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: 17.8% 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.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ a \cdot \left(a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + -0.25 \cdot \frac{a \cdot \frac{{c}^{4} \cdot 20}{{b}^{6}}}{b}\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)))
      (* -0.25 (/ (* a (/ (* (pow c 4.0) 20.0) (pow b 6.0))) b))))
    (/ (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))) + (-0.25 * ((a * ((pow(c, 4.0) * 20.0) / pow(b, 6.0))) / b)))) - (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))) + ((-0.25d0) * ((a * (((c ** 4.0d0) * 20.0d0) / (b ** 6.0d0))) / b)))) - ((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))) + (-0.25 * ((a * ((Math.pow(c, 4.0) * 20.0) / Math.pow(b, 6.0))) / b)))) - (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))) + (-0.25 * ((a * ((math.pow(c, 4.0) * 20.0) / math.pow(b, 6.0))) / b)))) - (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(-0.25 * Float64(Float64(a * Float64(Float64((c ^ 4.0) * 20.0) / (b ^ 6.0))) / b)))) - 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))) + (-0.25 * ((a * (((c ^ 4.0) * 20.0) / (b ^ 6.0))) / b)))) - ((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[(-0.25 * N[(N[(a * N[(N[(N[Power[c, 4.0], $MachinePrecision] * 20.0), $MachinePrecision] / N[Power[b, 6.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $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 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 97.9%

   \[\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 b around 0 97.9%

   \[\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}} + -0.25 \cdot \frac{a \cdot \color{blue}{\frac{4 \cdot {c}^{4} + 16 \cdot {c}^{4}}{{b}^{6}}}}{b}\right)\right) \]
7. Step-by-step derivation

   1. distribute-rgt-out 97.9%

      \[\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}} + -0.25 \cdot \frac{a \cdot \frac{\color{blue}{{c}^{4} \cdot \left(4 + 16\right)}}{{b}^{6}}}{b}\right)\right) \]

   2. metadata-eval 97.9%

      \[\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}} + -0.25 \cdot \frac{a \cdot \frac{{c}^{4} \cdot \color{blue}{20}}{{b}^{6}}}{b}\right)\right) \]

8. Simplified 97.9%

   \[\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}} + -0.25 \cdot \frac{a \cdot \color{blue}{\frac{{c}^{4} \cdot 20}{{b}^{6}}}}{b}\right)\right) \]

9. Final simplification 97.9%

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

Alternative 2: 96.8% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

   \[\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 0 97.4%

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

   1. mul-1-neg 97.4%

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

   2. unsub-neg 97.4%

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

   3. associate-*r/ 97.4%

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

   4. *-commutative 97.4%

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

   5. associate-*r* 97.4%

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

8. Simplified 97.4%

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

9. Final simplification 97.4%

   \[\leadsto {c}^{2} \cdot \left(\frac{\left(c \cdot -2\right) \cdot {a}^{2}}{{b}^{5}} - \frac{a}{{b}^{3}}\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 97.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 97.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 4: 95.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[a_, b_, c_] := N[(N[(a * N[Power[(-N[(c / b), $MachinePrecision]), 2.0], $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 c around 0 95.3%

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

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

   2. neg-mul-1 95.3%

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

   3. distribute-rgt-neg-in 95.3%

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

7. Simplified 95.3%

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

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

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

   2. *-commutative 95.0%

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

10. Simplified 95.0%

    \[\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 a around 0 95.6%

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

    1. fma-define 95.6%

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

    2. mul-1-neg 95.6%

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

    3. fma-neg 95.6%

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

    4. associate-*r/ 95.6%

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

    5. unpow3 95.6%

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

    6. unpow2 95.6%

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

    7. associate-/r* 95.6%

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

    8. div-sub 95.6%

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

    9. unsub-neg 95.6%

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

    10. mul-1-neg 95.6%

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

    11. distribute-lft-out 95.6%

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

    12. mul-1-neg 95.6%

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

    13. distribute-neg-frac 95.6%

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

    14. distribute-neg-frac2 95.6%

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

13. Simplified 95.6%

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

14. Final simplification 95.6%

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

Alternative 5: 94.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c \cdot \left(\frac{-1}{b} - a \cdot \frac{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(a * Float64(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[(a * N[(c / N[Power[b, 3.0], $MachinePrecision]), $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 95.3%

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

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

   2. neg-mul-1 95.3%

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

   3. distribute-rgt-neg-in 95.3%

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

7. Simplified 95.3%

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

8. Taylor expanded in c around 0 95.3%

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

   1. sub-neg 95.3%

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

   2. associate-*r/ 95.3%

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

   3. mul-1-neg 95.3%

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

   4. distribute-rgt-neg-out 95.3%

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

   5. associate-*r/ 95.3%

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

   6. +-commutative 95.3%

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

   7. distribute-frac-neg 95.3%

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

   8. distribute-rgt-neg-in 95.3%

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

   9. associate-/l* 95.3%

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

   10. unsub-neg 95.3%

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

   11. distribute-neg-frac 95.3%

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

   12. metadata-eval 95.3%

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

   13. associate-/l* 95.3%

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

10. Simplified 95.3%

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

11. Final simplification 95.3%

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

Alternative 6: 90.4% 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 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.3%

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

   1. associate-*r/ 90.3%

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

   2. mul-1-neg 90.3%

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

7. Simplified 90.3%

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

8. Final simplification 90.3%

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

Alternative 7: 3.3% 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 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 95.3%

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

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

   2. neg-mul-1 95.3%

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

   3. distribute-rgt-neg-in 95.3%

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

7. Simplified 95.3%

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

8. Taylor expanded in a around 0 89.9%

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

   1. expm1-log1p-u 75.8%

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

   2. expm1-undefine 18.1%

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

10. Applied egg-rr 18.1%

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

    1. sub-neg 18.1%

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

    2. metadata-eval 18.1%

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

    3. +-commutative 18.1%

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

    4. log1p-undefine 18.1%

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

    5. rem-exp-log 32.2%

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

    6. associate-*r/ 32.2%

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

    7. *-commutative 32.2%

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

    8. associate-*r/ 32.2%

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

    9. mul-1-neg 32.2%

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

    10. unsub-neg 32.2%

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

12. Simplified 32.2%

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

13. Taylor expanded in c around 0 3.3%

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

14. Final simplification 3.3%

    \[\leadsto 0 \]
15. Add Preprocessing

Reproduce

herbie shell --seed 2024075 
(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)))