Quadratic roots, narrow range

Percentage Accurate: 55.3% → 90.5%

Time: 13.6s

Alternatives: 11

Speedup: 29.0×

Specification

\[\left(\left(1.0536712127723509 \cdot 10^{-8} < a \land a < 94906265.62425156\right) \land \left(1.0536712127723509 \cdot 10^{-8} < b \land b < 94906265.62425156\right)\right) \land \left(1.0536712127723509 \cdot 10^{-8} < c \land c < 94906265.62425156\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: 55.3% 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: 90.5% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (-
  (*
   a
   (-
    (*
     (pow c 4.0)
     (+ (* -5.0 (/ (pow a 2.0) (pow b 7.0))) (* -2.0 (/ a (* c (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 * ((pow(c, 4.0) * ((-5.0 * (pow(a, 2.0) / pow(b, 7.0))) + (-2.0 * (a / (c * 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 * (((c ** 4.0d0) * (((-5.0d0) * ((a ** 2.0d0) / (b ** 7.0d0))) + ((-2.0d0) * (a / (c * (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 * ((Math.pow(c, 4.0) * ((-5.0 * (Math.pow(a, 2.0) / Math.pow(b, 7.0))) + (-2.0 * (a / (c * 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 * ((math.pow(c, 4.0) * ((-5.0 * (math.pow(a, 2.0) / math.pow(b, 7.0))) + (-2.0 * (a / (c * 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((c ^ 4.0) * Float64(Float64(-5.0 * Float64((a ^ 2.0) / (b ^ 7.0))) + Float64(-2.0 * Float64(a / Float64(c * (b ^ 5.0)))))) - Float64((c ^ 2.0) / (b ^ 3.0)))) - Float64(c / b))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 53.6%

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

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

3. Simplified 53.6%

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

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

6. Taylor expanded in c around inf 92.8%

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

7. Final simplification 92.8%

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

Alternative 2: 89.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 1.9:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;a \cdot \left(-2 \cdot \frac{a \cdot {c}^{3}}{{b}^{5}} - \frac{{c}^{2}}{{b}^{3}}\right) - \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 1.9)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (-
    (*
     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) {
	double tmp;
	if (b <= 1.9) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (a * ((-2.0 * ((a * pow(c, 3.0)) / pow(b, 5.0))) - (pow(c, 2.0) / pow(b, 3.0)))) - (c / b);
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 1.9)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = 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
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 1.9], N[(N[(N[Sqrt[N[(b * b + N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], 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. Split input into 2 regimes

2. if b < 1.8999999999999999

   1. Initial program 84.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 84.1%

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

      2. +-commutative 84.1%

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

      3. sqr-neg 84.1%

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

      4. unsub-neg 84.1%

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

      5. sqr-neg 84.1%

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

      6. fma-neg 84.7%

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

      7. distribute-lft-neg-in 84.7%

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

      8. *-commutative 84.7%

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

      9. *-commutative 84.7%

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

      10. distribute-rgt-neg-in 84.7%

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

      11. metadata-eval 84.7%

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

   3. Simplified 84.7%

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

   if 1.8999999999999999 < b

   1. Initial program 49.6%

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

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

   3. Simplified 49.6%

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

      \[\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)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.9:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;a \cdot \left(-2 \cdot \frac{a \cdot {c}^{3}}{{b}^{5}} - \frac{{c}^{2}}{{b}^{3}}\right) - \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 89.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 1.8:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;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} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 1.8)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (*
    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) {
	double tmp;
	if (b <= 1.8) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((c * ((-2.0 * ((c * pow(a, 2.0)) / pow(b, 5.0))) - (a / pow(b, 3.0)))) + (-1.0 / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 1.8)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = 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
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 1.8], N[(N[(N[Sqrt[N[(b * b + N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], 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. Split input into 2 regimes

2. if b < 1.80000000000000004

   1. Initial program 84.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 84.1%

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

      2. +-commutative 84.1%

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

      3. sqr-neg 84.1%

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

      4. unsub-neg 84.1%

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

      5. sqr-neg 84.1%

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

      6. fma-neg 84.7%

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

      7. distribute-lft-neg-in 84.7%

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

      8. *-commutative 84.7%

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

      9. *-commutative 84.7%

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

      10. distribute-rgt-neg-in 84.7%

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

      11. metadata-eval 84.7%

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

   3. Simplified 84.7%

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

   if 1.80000000000000004 < b

   1. Initial program 49.6%

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

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

   3. Simplified 49.6%

      \[\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.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)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 92.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.8:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;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} \]
5. Add Preprocessing

Alternative 4: 85.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.55:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, c \cdot \left(a \cdot -4\right)\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.55)
   (/ (- (sqrt (fma b b (* c (* a -4.0)))) b) (* a 2.0))
   (- (/ c (- b)) (* a (/ (pow c 2.0) (pow b 3.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.55) {
		tmp = (sqrt(fma(b, b, (c * (a * -4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (c / -b) - (a * (pow(c, 2.0) / pow(b, 3.0)));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.55)
		tmp = Float64(Float64(sqrt(fma(b, b, Float64(c * Float64(a * -4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(c / Float64(-b)) - Float64(a * Float64((c ^ 2.0) / (b ^ 3.0))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.5499999999999998

   1. Initial program 83.9%

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

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

      2. +-commutative 83.9%

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

      3. sqr-neg 83.9%

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

      4. unsub-neg 83.9%

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

      5. sqr-neg 83.9%

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

      6. fma-neg 84.5%

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

      7. distribute-lft-neg-in 84.5%

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

      8. *-commutative 84.5%

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

      9. *-commutative 84.5%

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

      10. distribute-rgt-neg-in 84.5%

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

      11. metadata-eval 84.5%

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

   3. Simplified 84.5%

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

   if 2.5499999999999998 < b

   1. Initial program 49.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 49.4%

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

   3. Simplified 49.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 87.9%

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

      1. mul-1-neg 87.9%

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

      2. unsub-neg 87.9%

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

      3. mul-1-neg 87.9%

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

      4. distribute-neg-frac2 87.9%

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

      5. associate-/l* 87.9%

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

   7. Simplified 87.9%

      \[\leadsto \color{blue}{\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 85.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.25:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.25)
   (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
   (- (/ c (- b)) (* a (/ (pow c 2.0) (pow b 3.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.25) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (c / -b) - (a * (pow(c, 2.0) / pow(b, 3.0)));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 2.25d0) then
        tmp = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = (c / -b) - (a * ((c ** 2.0d0) / (b ** 3.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.25) {
		tmp = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = (c / -b) - (a * (Math.pow(c, 2.0) / Math.pow(b, 3.0)));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.25:
		tmp = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	else:
		tmp = (c / -b) - (a * (math.pow(c, 2.0) / math.pow(b, 3.0)))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.25)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(c / Float64(-b)) - Float64(a * Float64((c ^ 2.0) / (b ^ 3.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.25)
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	else
		tmp = (c / -b) - (a * ((c ^ 2.0) / (b ^ 3.0)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.25

   1. Initial program 83.9%

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

   if 2.25 < b

   1. Initial program 49.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 49.4%

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

   3. Simplified 49.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 87.9%

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

      1. mul-1-neg 87.9%

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

      2. unsub-neg 87.9%

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

      3. mul-1-neg 87.9%

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

      4. distribute-neg-frac2 87.9%

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

      5. associate-/l* 87.9%

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

   7. Simplified 87.9%

      \[\leadsto \color{blue}{\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.25:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b} - a \cdot \frac{{c}^{2}}{{b}^{3}}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 85.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.3:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{2}, c\right)}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.3)
   (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
   (/ (fma a (pow (/ c b) 2.0) c) (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.3) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = fma(a, pow((c / b), 2.0), c) / -b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.3)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(fma(a, (Float64(c / b) ^ 2.0), c) / Float64(-b));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.2999999999999998

   1. Initial program 83.9%

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

   if 2.2999999999999998 < b

   1. Initial program 49.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 49.4%

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

   3. Simplified 49.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 87.7%

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

      1. associate-*r/ 87.7%

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

      2. neg-mul-1 87.7%

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

      3. distribute-rgt-neg-in 87.7%

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

   7. Simplified 87.7%

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

   8. Taylor expanded in a around inf 87.6%

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

      1. mul-1-neg 87.6%

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

      2. distribute-frac-neg 87.6%

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

      3. associate-/r* 87.7%

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

   10. Simplified 87.7%

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

   11. Taylor expanded in c around inf 87.5%

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

       1. mul-1-neg 87.5%

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

       2. distribute-rgt-neg-in 87.5%

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

       3. associate-/r* 87.6%

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

       4. *-commutative 87.6%

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

   13. Simplified 87.6%

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

   14. Taylor expanded in b around inf 87.9%

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

       1. distribute-lft-out 87.9%

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

       2. associate-*r/ 87.9%

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

       3. mul-1-neg 87.9%

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

       4. distribute-neg-frac2 87.9%

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

       5. +-commutative 87.9%

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

       6. associate-/l* 87.9%

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

       7. fma-define 87.9%

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

       8. unpow2 87.9%

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

       9. unpow2 87.9%

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

       10. times-frac 87.9%

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

       11. unpow2 87.9%

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

   16. Simplified 87.9%

       \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{2}, c\right)}{-b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.3:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, {\left(\frac{c}{b}\right)}^{2}, c\right)}{-b}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 85.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.95:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1}{b} - \frac{c \cdot a}{{b}^{3}}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.95)
   (/ (- (sqrt (- (* b b) (* c (* a 4.0)))) b) (* a 2.0))
   (* c (- (/ -1.0 b) (/ (* c a) (pow b 3.0))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.95) {
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - ((c * a) / pow(b, 3.0)));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 2.95d0) then
        tmp = (sqrt(((b * b) - (c * (a * 4.0d0)))) - b) / (a * 2.0d0)
    else
        tmp = c * (((-1.0d0) / b) - ((c * a) / (b ** 3.0d0)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.95) {
		tmp = (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	} else {
		tmp = c * ((-1.0 / b) - ((c * a) / Math.pow(b, 3.0)));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.95:
		tmp = (math.sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0)
	else:
		tmp = c * ((-1.0 / b) - ((c * a) / math.pow(b, 3.0)))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.95)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c * Float64(Float64(-1.0 / b) - Float64(Float64(c * a) / (b ^ 3.0))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.95)
		tmp = (sqrt(((b * b) - (c * (a * 4.0)))) - b) / (a * 2.0);
	else
		tmp = c * ((-1.0 / b) - ((c * a) / (b ^ 3.0)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.9500000000000002

   1. Initial program 83.9%

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

   if 2.9500000000000002 < b

   1. Initial program 49.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 49.4%

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

   3. Simplified 49.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 87.7%

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

      1. associate-*r/ 87.7%

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

      2. neg-mul-1 87.7%

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

      3. distribute-rgt-neg-in 87.7%

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

   7. Simplified 87.7%

      \[\leadsto \color{blue}{c \cdot \left(\frac{a \cdot \left(-c\right)}{{b}^{3}} - \frac{1}{b}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 87.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.95:\\ \;\;\;\;\frac{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;c \cdot \left(\frac{-1}{b} - \frac{c \cdot a}{{b}^{3}}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 81.3% 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 53.6%

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

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

3. Simplified 53.6%

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

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

   1. associate-*r/ 83.8%

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

   2. neg-mul-1 83.8%

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

   3. distribute-rgt-neg-in 83.8%

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

7. Simplified 83.8%

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

8. Final simplification 83.8%

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

Alternative 9: 81.3% accurate, 1.0× speedup

Math

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

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

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

3. Simplified 53.6%

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

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

   1. associate-*r/ 83.8%

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

   2. neg-mul-1 83.8%

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

   3. distribute-rgt-neg-in 83.8%

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

7. Simplified 83.8%

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

   1. pow1 83.8%

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

   2. div-inv 83.8%

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

   3. fma-neg 83.8%

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

   4. distribute-rgt-neg-out 83.8%

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

   5. pow-flip 83.8%

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

   6. metadata-eval 83.8%

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

9. Applied egg-rr 83.8%

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

    1. unpow1 83.8%

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

    2. fma-define 83.8%

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

    3. +-commutative 83.8%

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

    4. distribute-lft-neg-out 83.8%

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

    5. unsub-neg 83.8%

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

    6. distribute-neg-frac 83.8%

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

    7. metadata-eval 83.8%

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

    8. associate-*l* 83.8%

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

11. Simplified 83.8%

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

Alternative 10: 64.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(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 53.6%

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

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

3. Simplified 53.6%

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

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

   1. associate-*r/ 65.9%

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

   2. mul-1-neg 65.9%

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

7. Simplified 65.9%

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

8. Final simplification 65.9%

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

Alternative 11: 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 53.6%

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

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

3. Simplified 53.6%

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

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

   1. associate-*r/ 83.8%

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

   2. neg-mul-1 83.8%

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

   3. distribute-rgt-neg-in 83.8%

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

7. Simplified 83.8%

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

8. Taylor expanded in a around 0 65.8%

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

   1. expm1-log1p-u 59.1%

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

   2. expm1-undefine 46.9%

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

   3. associate-*r/ 46.9%

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

10. Applied egg-rr 46.9%

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

    1. sub-neg 46.9%

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

    2. log1p-undefine 46.9%

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

    3. rem-exp-log 53.6%

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

    4. *-commutative 53.6%

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

    5. associate-*r/ 53.6%

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

    6. mul-1-neg 53.6%

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

    7. unsub-neg 53.6%

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

    8. metadata-eval 53.6%

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

12. Simplified 53.6%

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

13. Taylor expanded in c around 0 3.2%

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

14. Final simplification 3.2%

    \[\leadsto 0 \]
15. Add Preprocessing

Reproduce

herbie shell --seed 2024099 
(FPCore (a b c)
  :name "Quadratic roots, narrow range"
  :precision binary64
  :pre (and (and (and (< 1.0536712127723509e-8 a) (< a 94906265.62425156)) (and (< 1.0536712127723509e-8 b) (< b 94906265.62425156))) (and (< 1.0536712127723509e-8 c) (< c 94906265.62425156)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))