Quadratic roots, medium range

Percentage Accurate: 30.9% → 95.7%

Time: 13.8s

Alternatives: 8

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: 30.9% 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.7% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.4%

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

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

3. Simplified 35.4%

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

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

   \[\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 b around -inf 95.3%

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

9. Final simplification 95.3%

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

Alternative 2: 95.4% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  c
  (+
   (*
    c
    (-
     (*
      c
      (+
       (* -5.0 (/ (* c (pow a 3.0)) (pow b 7.0)))
       (* -2.0 (/ (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 * ((c * ((-5.0 * ((c * pow(a, 3.0)) / pow(b, 7.0))) + (-2.0 * (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 * ((c * (((-5.0d0) * ((c * (a ** 3.0d0)) / (b ** 7.0d0))) + ((-2.0d0) * ((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 * ((c * ((-5.0 * ((c * Math.pow(a, 3.0)) / Math.pow(b, 7.0))) + (-2.0 * (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 * ((c * ((-5.0 * ((c * math.pow(a, 3.0)) / math.pow(b, 7.0))) + (-2.0 * (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(c * Float64(Float64(-5.0 * Float64(Float64(c * (a ^ 3.0)) / (b ^ 7.0))) + Float64(-2.0 * Float64((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 * ((c * ((-5.0 * ((c * (a ^ 3.0)) / (b ^ 7.0))) + (-2.0 * ((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[(c * N[(N[(-5.0 * N[(N[(c * N[Power[a, 3.0], $MachinePrecision]), $MachinePrecision] / N[Power[b, 7.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-2.0 * N[(N[Power[a, 2.0], $MachinePrecision] / N[Power[b, 5.0], $MachinePrecision]), $MachinePrecision]), $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.4%

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

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

3. Simplified 35.4%

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

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

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

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

9. Final simplification 95.1%

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

Alternative 3: 94.2% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.4%

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

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

3. Simplified 35.4%

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

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

6. Taylor expanded in c around inf 93.9%

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

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

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

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

   4. *-commutative 93.9%

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

   5. associate-/r* 93.9%

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

8. Simplified 93.9%

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

9. Final simplification 93.9%

   \[\leadsto {c}^{3} \cdot \left(\frac{{a}^{2} \cdot -2}{{b}^{5}} - \frac{\frac{a}{c}}{{b}^{3}}\right) - \frac{c}{b} \]
10. 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.4%

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

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

3. Simplified 35.4%

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

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

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

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

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

3. Simplified 35.4%

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

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

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

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

9. Taylor expanded in b around inf 90.8%

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

    1. distribute-lft-out 90.8%

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

    2. associate-*r/ 90.8%

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

    3. mul-1-neg 90.8%

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

    4. distribute-neg-frac2 90.8%

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

    5. +-commutative 90.8%

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

    6. associate-/l* 90.8%

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

    7. fma-define 90.8%

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

    8. unpow2 90.8%

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

    9. unpow2 90.8%

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

    10. times-frac 90.8%

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

    11. unpow2 90.8%

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

11. Simplified 90.8%

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

Alternative 6: 90.9% 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 35.4%

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

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

3. Simplified 35.4%

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

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

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

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

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

   2. associate-*r/ 90.6%

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

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

   4. distribute-rgt-neg-out 90.6%

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

   5. associate-*r/ 90.6%

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

   6. +-commutative 90.6%

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

   7. distribute-frac-neg 90.6%

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

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

   9. associate-/l* 90.6%

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

   10. unsub-neg 90.6%

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

   11. distribute-neg-frac 90.6%

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

   12. metadata-eval 90.6%

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

10. Simplified 90.6%

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

11. Final simplification 90.6%

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

Alternative 7: 81.6% accurate, 29.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 35.4%

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

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

3. Simplified 35.4%

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

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

   1. associate-*r/ 78.8%

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

   2. mul-1-neg 78.8%

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

7. Simplified 78.8%

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

8. Final simplification 78.8%

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

Alternative 8: 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.4%

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

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

3. Simplified 35.4%

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

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

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

   2. neg-mul-1 90.6%

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

   3. distribute-rgt-neg-in 90.6%

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

7. Simplified 90.6%

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

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

   1. expm1-log1p-u 66.4%

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

   2. expm1-undefine 30.6%

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

10. Applied egg-rr 30.6%

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

    1. sub-neg 30.6%

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

    2. metadata-eval 30.6%

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

    3. +-commutative 30.6%

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

    4. log1p-undefine 30.6%

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

    5. rem-exp-log 42.8%

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

    6. associate-*r/ 42.8%

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

    7. *-commutative 42.8%

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

    8. associate-*r/ 42.8%

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

    9. mul-1-neg 42.8%

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

    10. unsub-neg 42.8%

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

12. Simplified 42.8%

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

13. Taylor expanded in c around 0 3.2%

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

14. Final simplification 3.2%

    \[\leadsto 0 \]
15. Add Preprocessing

Reproduce

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