Quadratic roots, medium range

Percentage Accurate: 31.6% → 95.4%

Time: 20.3s

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: 31.6% 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.4% 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 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in a around 0 95.7%

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

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

   1. associate-/l* 95.7%

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

   2. distribute-rgt-out 95.7%

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

   3. metadata-eval 95.7%

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

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

9. Final simplification 95.7%

   \[\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: 93.8% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (a * (((-2.0d0) * ((a * (c ** 3.0d0)) / (b ** 5.0d0))) - ((c ** 2.0d0) / (b ** 3.0d0)))) - (c / b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in c around 0 93.8%

   \[\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. Taylor expanded in a around 0 94.1%

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

   1. neg-mul-1 94.1%

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

   2. +-commutative 94.1%

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

   3. unsub-neg 94.1%

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

   4. mul-1-neg 94.1%

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

   5. unsub-neg 94.1%

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

8. Simplified 94.1%

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

9. Final simplification 94.1%

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

Alternative 3: 93.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in c around 0 93.8%

   \[\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. Taylor expanded in b around inf 94.1%

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

8. Simplified 94.1%

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

   1. unpow2 94.1%

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

   2. distribute-frac-neg2 94.1%

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

   3. distribute-frac-neg2 94.1%

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

10. Applied egg-rr 94.1%

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

11. Final simplification 94.1%

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

Alternative 4: 93.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in c around 0 93.8%

   \[\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. Taylor expanded in b around 0 93.8%

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

   1. mul-1-neg 93.8%

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

   2. unsub-neg 93.8%

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

   3. unpow2 93.8%

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

   4. unpow2 93.8%

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

   5. swap-sqr 93.8%

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

   6. unpow2 93.8%

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

   7. *-commutative 93.8%

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

8. Simplified 93.8%

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

9. Final simplification 93.8%

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

Alternative 5: 93.6% 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 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in c around 0 93.8%

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

   \[\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 6: 90.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in a around 0 91.2%

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

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

   2. unsub-neg 91.2%

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

   3. mul-1-neg 91.2%

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

   4. distribute-neg-frac2 91.2%

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

   5. associate-/l* 91.2%

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

7. Simplified 91.2%

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

8. Final simplification 91.2%

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

Alternative 7: 90.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in a around 0 91.2%

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

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

   2. unsub-neg 91.2%

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

   3. mul-1-neg 91.2%

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

   4. distribute-neg-frac2 91.2%

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

   5. associate-/l* 91.2%

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

7. Simplified 91.2%

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

8. Taylor expanded in b around inf 91.2%

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

   1. mul-1-neg 91.2%

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

   2. unsub-neg 91.2%

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

   3. mul-1-neg 91.2%

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

   4. associate-/l* 91.2%

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

   5. unpow2 91.2%

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

   6. unpow2 91.2%

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

   7. times-frac 91.2%

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

   8. sqr-neg 91.2%

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

   9. unpow2 91.2%

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

   10. distribute-neg-frac2 91.2%

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

10. Simplified 91.2%

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

11. Final simplification 91.2%

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

Alternative 8: 81.1% 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 31.2%

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

   1. *-commutative 31.2%

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

3. Simplified 31.2%

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

5. Taylor expanded in b around inf 81.8%

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

   1. associate-*r/ 81.8%

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

   2. mul-1-neg 81.8%

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

7. Simplified 81.8%

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

8. Final simplification 81.8%

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

Reproduce

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