Cubic critical

Percentage Accurate: 51.3% → 85.8%

Time: 7.7s

Alternatives: 11

Speedup: 2.2×

Specification

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))

C

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

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(3.0 * a) * c)))) / Float64(3.0 * a))
end

MATLAB

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

Wolfram

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

Initial Program: 51.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))

C

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

Java

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

Python

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

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(Float64(3.0 * a) * c)))) / Float64(3.0 * a))
end

MATLAB

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

Wolfram

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

Alternative 1: 85.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+85}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-3 \cdot a, c, b \cdot b\right)} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e+85)
   (/ (- b) (* 1.5 a))
   (if (<= b 1.35e-68)
     (/ (- (sqrt (fma (* -3.0 a) c (* b b))) b) (* a 3.0))
     (* (/ c b) -0.5))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e+85) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (sqrt(fma((-3.0 * a), c, (b * b))) - b) / (a * 3.0);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e+85)
		tmp = Float64(Float64(-b) / Float64(1.5 * a));
	elseif (b <= 1.35e-68)
		tmp = Float64(Float64(sqrt(fma(Float64(-3.0 * a), c, Float64(b * b))) - b) / Float64(a * 3.0));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e+85], N[((-b) / N[(1.5 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.35e-68], N[(N[(N[Sqrt[N[(N[(-3.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.79999999999999993e85

   1. Initial program 58.0%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 93.2

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 93.2%

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

   7. Applied rewrites 93.3%

      \[\leadsto \frac{-b}{\color{blue}{a \cdot 1.5}} \]

   if -4.79999999999999993e85 < b < 1.3500000000000001e-68

   1. Initial program 81.9%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. distribute-lft-neg-in N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. distribute-lft-neg-in N/A

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

      9. lower-*.f64 N/A

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

      10. metadata-eval 81.9

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

   4. Applied rewrites 81.9%

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

   if 1.3500000000000001e-68 < b

   1. Initial program 15.6%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+85}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-3 \cdot a, c, b \cdot b\right)} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+85}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-3 \cdot c, a, b \cdot b\right)} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e+85)
   (/ (- b) (* 1.5 a))
   (if (<= b 1.35e-68)
     (/ (- (sqrt (fma (* -3.0 c) a (* b b))) b) (* a 3.0))
     (* (/ c b) -0.5))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e+85) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (sqrt(fma((-3.0 * c), a, (b * b))) - b) / (a * 3.0);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e+85)
		tmp = Float64(Float64(-b) / Float64(1.5 * a));
	elseif (b <= 1.35e-68)
		tmp = Float64(Float64(sqrt(fma(Float64(-3.0 * c), a, Float64(b * b))) - b) / Float64(a * 3.0));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e+85], N[((-b) / N[(1.5 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.35e-68], N[(N[(N[Sqrt[N[(N[(-3.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.79999999999999993e85

   1. Initial program 58.0%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 93.2

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 93.2%

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

   7. Applied rewrites 93.3%

      \[\leadsto \frac{-b}{\color{blue}{a \cdot 1.5}} \]

   if -4.79999999999999993e85 < b < 1.3500000000000001e-68

   1. Initial program 81.9%

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

   4. Applied rewrites 81.8%

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

   if 1.3500000000000001e-68 < b

   1. Initial program 15.6%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+85}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-3 \cdot c, a, b \cdot b\right)} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+85}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{0.3333333333333333}{a} \cdot \left(\sqrt{\mathsf{fma}\left(-3 \cdot c, a, b \cdot b\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e+85)
   (/ (- b) (* 1.5 a))
   (if (<= b 1.35e-68)
     (* (/ 0.3333333333333333 a) (- (sqrt (fma (* -3.0 c) a (* b b))) b))
     (* (/ c b) -0.5))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e+85) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (0.3333333333333333 / a) * (sqrt(fma((-3.0 * c), a, (b * b))) - b);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e+85)
		tmp = Float64(Float64(-b) / Float64(1.5 * a));
	elseif (b <= 1.35e-68)
		tmp = Float64(Float64(0.3333333333333333 / a) * Float64(sqrt(fma(Float64(-3.0 * c), a, Float64(b * b))) - b));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e+85], N[((-b) / N[(1.5 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.35e-68], N[(N[(0.3333333333333333 / a), $MachinePrecision] * N[(N[Sqrt[N[(N[(-3.0 * c), $MachinePrecision] * a + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.79999999999999993e85

   1. Initial program 58.0%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 93.2

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 93.2%

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

   7. Applied rewrites 93.3%

      \[\leadsto \frac{-b}{\color{blue}{a \cdot 1.5}} \]

   if -4.79999999999999993e85 < b < 1.3500000000000001e-68

   1. Initial program 81.9%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. lower-/.f64 N/A

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

      8. metadata-eval 81.7

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 81.7

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

   4. Applied rewrites 81.8%

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

   if 1.3500000000000001e-68 < b

   1. Initial program 15.6%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{+85}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{0.3333333333333333}{a} \cdot \left(\sqrt{\mathsf{fma}\left(-3 \cdot c, a, b \cdot b\right)} - b\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{-40}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\left(-3 \cdot a\right) \cdot c} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e-40)
   (/ (- b) (* 1.5 a))
   (if (<= b 1.35e-68)
     (/ (- (sqrt (* (* -3.0 a) c)) b) (* a 3.0))
     (* (/ c b) -0.5))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-40) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (sqrt(((-3.0 * a) * c)) - b) / (a * 3.0);
	} else {
		tmp = (c / b) * -0.5;
	}
	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 <= (-1.25d-40)) then
        tmp = -b / (1.5d0 * a)
    else if (b <= 1.35d-68) then
        tmp = (sqrt((((-3.0d0) * a) * c)) - b) / (a * 3.0d0)
    else
        tmp = (c / b) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-40) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (Math.sqrt(((-3.0 * a) * c)) - b) / (a * 3.0);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.25e-40:
		tmp = -b / (1.5 * a)
	elif b <= 1.35e-68:
		tmp = (math.sqrt(((-3.0 * a) * c)) - b) / (a * 3.0)
	else:
		tmp = (c / b) * -0.5
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e-40)
		tmp = Float64(Float64(-b) / Float64(1.5 * a));
	elseif (b <= 1.35e-68)
		tmp = Float64(Float64(sqrt(Float64(Float64(-3.0 * a) * c)) - b) / Float64(a * 3.0));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.25e-40)
		tmp = -b / (1.5 * a);
	elseif (b <= 1.35e-68)
		tmp = (sqrt(((-3.0 * a) * c)) - b) / (a * 3.0);
	else
		tmp = (c / b) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e-40], N[((-b) / N[(1.5 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.35e-68], N[(N[(N[Sqrt[N[(N[(-3.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 3.0), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.24999999999999991e-40

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 87.7

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 87.7%

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

   7. Applied rewrites 87.9%

      \[\leadsto \frac{-b}{\color{blue}{a \cdot 1.5}} \]

   if -1.24999999999999991e-40 < b < 1.3500000000000001e-68

   1. Initial program 76.8%

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

   3. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 67.4

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

   5. Applied rewrites 67.4%

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

   6. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 67.6

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

   8. Applied rewrites 67.6%

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

   if 1.3500000000000001e-68 < b

   1. Initial program 15.6%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

4. Final simplification 80.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{-40}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\frac{\sqrt{\left(-3 \cdot a\right) \cdot c} - b}{a \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 81.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{-40}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\left(\sqrt{\left(-3 \cdot c\right) \cdot a} - b\right) \cdot \frac{0.3333333333333333}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.25e-40)
   (/ (- b) (* 1.5 a))
   (if (<= b 1.35e-68)
     (* (- (sqrt (* (* -3.0 c) a)) b) (/ 0.3333333333333333 a))
     (* (/ c b) -0.5))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-40) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (sqrt(((-3.0 * c) * a)) - b) * (0.3333333333333333 / a);
	} else {
		tmp = (c / b) * -0.5;
	}
	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 <= (-1.25d-40)) then
        tmp = -b / (1.5d0 * a)
    else if (b <= 1.35d-68) then
        tmp = (sqrt((((-3.0d0) * c) * a)) - b) * (0.3333333333333333d0 / a)
    else
        tmp = (c / b) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.25e-40) {
		tmp = -b / (1.5 * a);
	} else if (b <= 1.35e-68) {
		tmp = (Math.sqrt(((-3.0 * c) * a)) - b) * (0.3333333333333333 / a);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.25e-40:
		tmp = -b / (1.5 * a)
	elif b <= 1.35e-68:
		tmp = (math.sqrt(((-3.0 * c) * a)) - b) * (0.3333333333333333 / a)
	else:
		tmp = (c / b) * -0.5
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.25e-40)
		tmp = Float64(Float64(-b) / Float64(1.5 * a));
	elseif (b <= 1.35e-68)
		tmp = Float64(Float64(sqrt(Float64(Float64(-3.0 * c) * a)) - b) * Float64(0.3333333333333333 / a));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.25e-40)
		tmp = -b / (1.5 * a);
	elseif (b <= 1.35e-68)
		tmp = (sqrt(((-3.0 * c) * a)) - b) * (0.3333333333333333 / a);
	else
		tmp = (c / b) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.25e-40], N[((-b) / N[(1.5 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.35e-68], N[(N[(N[Sqrt[N[(N[(-3.0 * c), $MachinePrecision] * a), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.3333333333333333 / a), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.24999999999999991e-40

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 87.7

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 87.7%

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

   7. Applied rewrites 87.9%

      \[\leadsto \frac{-b}{\color{blue}{a \cdot 1.5}} \]

   if -1.24999999999999991e-40 < b < 1.3500000000000001e-68

   1. Initial program 76.8%

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

   3. Taylor expanded in a around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 67.4

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

   5. Applied rewrites 67.4%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. lower-/.f64 N/A

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

      8. metadata-eval 67.5

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 67.5

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

   7. Applied rewrites 67.5%

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

   if 1.3500000000000001e-68 < b

   1. Initial program 15.6%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 85.3

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

   5. Applied rewrites 85.3%

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

4. Final simplification 80.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.25 \cdot 10^{-40}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{-68}:\\ \;\;\;\;\left(\sqrt{\left(-3 \cdot c\right) \cdot a} - b\right) \cdot \frac{0.3333333333333333}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 68.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\mathsf{fma}\left(0.5, \frac{c}{b}, -0.6666666666666666 \cdot \frac{b}{a}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e-310)
   (fma 0.5 (/ c b) (* -0.6666666666666666 (/ b a)))
   (* (/ c b) -0.5)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = fma(0.5, (c / b), (-0.6666666666666666 * (b / a)));
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e-310)
		tmp = fma(0.5, Float64(c / b), Float64(-0.6666666666666666 * Float64(b / a)));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e-310], N[(0.5 * N[(c / b), $MachinePrecision] + N[(-0.6666666666666666 * N[(b / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 75.6%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. associate-/r* N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 65.3

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

   5. Applied rewrites 65.3%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 65.4%

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

   if -4.999999999999985e-310 < b

   1. Initial program 28.4%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 67.3

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

   5. Applied rewrites 67.3%

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

4. Final simplification 66.3%

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

Alternative 7: 68.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.7 \cdot 10^{-308}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.7e-308) (/ (- b) (* 1.5 a)) (* (/ c b) -0.5)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-308) {
		tmp = -b / (1.5 * a);
	} else {
		tmp = (c / b) * -0.5;
	}
	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.7d-308) then
        tmp = -b / (1.5d0 * a)
    else
        tmp = (c / b) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-308) {
		tmp = -b / (1.5 * a);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.7e-308:
		tmp = -b / (1.5 * a)
	else:
		tmp = (c / b) * -0.5
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.7e-308)
		tmp = Float64(Float64(-b) / Float64(1.5 * a));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.7e-308)
		tmp = -b / (1.5 * a);
	else
		tmp = (c / b) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 2.7e-308], N[((-b) / N[(1.5 * a), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 2.70000000000000015e-308

   1. Initial program 75.6%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 64.9

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 64.9%

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

   7. Applied rewrites 65.0%

      \[\leadsto \frac{-b}{\color{blue}{a \cdot 1.5}} \]

   if 2.70000000000000015e-308 < b

   1. Initial program 28.4%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 67.3

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

   5. Applied rewrites 67.3%

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

4. Final simplification 66.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.7 \cdot 10^{-308}:\\ \;\;\;\;\frac{-b}{1.5 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 68.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.7 \cdot 10^{-308}:\\ \;\;\;\;\frac{-0.6666666666666666 \cdot b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.7e-308) (/ (* -0.6666666666666666 b) a) (* (/ c b) -0.5)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-308) {
		tmp = (-0.6666666666666666 * b) / a;
	} else {
		tmp = (c / b) * -0.5;
	}
	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.7d-308) then
        tmp = ((-0.6666666666666666d0) * b) / a
    else
        tmp = (c / b) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-308) {
		tmp = (-0.6666666666666666 * b) / a;
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.7e-308:
		tmp = (-0.6666666666666666 * b) / a
	else:
		tmp = (c / b) * -0.5
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.7e-308)
		tmp = Float64(Float64(-0.6666666666666666 * b) / a);
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.7e-308)
		tmp = (-0.6666666666666666 * b) / a;
	else
		tmp = (c / b) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 2.7e-308], N[(N[(-0.6666666666666666 * b), $MachinePrecision] / a), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 2.70000000000000015e-308

   1. Initial program 75.6%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 64.9

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 64.9%

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

   7. Applied rewrites 64.9%

      \[\leadsto \frac{-0.6666666666666666 \cdot b}{\color{blue}{a}} \]

   if 2.70000000000000015e-308 < b

   1. Initial program 28.4%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 67.3

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

   5. Applied rewrites 67.3%

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

4. Final simplification 66.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.7 \cdot 10^{-308}:\\ \;\;\;\;\frac{-0.6666666666666666 \cdot b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 68.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.7 \cdot 10^{-308}:\\ \;\;\;\;-0.6666666666666666 \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.7e-308) (* -0.6666666666666666 (/ b a)) (* (/ c b) -0.5)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-308) {
		tmp = -0.6666666666666666 * (b / a);
	} else {
		tmp = (c / b) * -0.5;
	}
	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.7d-308) then
        tmp = (-0.6666666666666666d0) * (b / a)
    else
        tmp = (c / b) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-308) {
		tmp = -0.6666666666666666 * (b / a);
	} else {
		tmp = (c / b) * -0.5;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 2.7e-308:
		tmp = -0.6666666666666666 * (b / a)
	else:
		tmp = (c / b) * -0.5
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 2.7e-308)
		tmp = Float64(-0.6666666666666666 * Float64(b / a));
	else
		tmp = Float64(Float64(c / b) * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 2.7e-308)
		tmp = -0.6666666666666666 * (b / a);
	else
		tmp = (c / b) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 2.7e-308], N[(-0.6666666666666666 * N[(b / a), $MachinePrecision]), $MachinePrecision], N[(N[(c / b), $MachinePrecision] * -0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 2.70000000000000015e-308

   1. Initial program 75.6%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 64.9

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 64.9%

      \[\leadsto \color{blue}{-0.6666666666666666 \cdot \frac{b}{a}} \]

   if 2.70000000000000015e-308 < b

   1. Initial program 28.4%

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

   3. Taylor expanded in a around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 67.3

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

   5. Applied rewrites 67.3%

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

4. Final simplification 66.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.7 \cdot 10^{-308}:\\ \;\;\;\;-0.6666666666666666 \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b} \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 43.0% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 4.4 \cdot 10^{-8}:\\ \;\;\;\;-0.6666666666666666 \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 4.4e-8) (* -0.6666666666666666 (/ b a)) (* 0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 4.4e-8) {
		tmp = -0.6666666666666666 * (b / a);
	} else {
		tmp = 0.5 * (c / b);
	}
	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 <= 4.4d-8) then
        tmp = (-0.6666666666666666d0) * (b / a)
    else
        tmp = 0.5d0 * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 4.4e-8) {
		tmp = -0.6666666666666666 * (b / a);
	} else {
		tmp = 0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 4.4e-8:
		tmp = -0.6666666666666666 * (b / a)
	else:
		tmp = 0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 4.4e-8)
		tmp = Float64(-0.6666666666666666 * Float64(b / a));
	else
		tmp = Float64(0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 4.4e-8)
		tmp = -0.6666666666666666 * (b / a);
	else
		tmp = 0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 4.4e-8], N[(-0.6666666666666666 * N[(b / a), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 4.3999999999999997e-8

   1. Initial program 69.6%

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

   3. Taylor expanded in b around -inf

      \[\leadsto \color{blue}{\frac{-2}{3} \cdot \frac{b}{a}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower-/.f64 49.3

         \[\leadsto -0.6666666666666666 \cdot \color{blue}{\frac{b}{a}} \]

   5. Applied rewrites 49.3%

      \[\leadsto \color{blue}{-0.6666666666666666 \cdot \frac{b}{a}} \]

   if 4.3999999999999997e-8 < b

   1. Initial program 14.7%

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

   3. Taylor expanded in b around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. unpow2 N/A

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

      8. associate-/r* N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 2.4

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

   5. Applied rewrites 2.4%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 26.2%

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

Alternative 11: 10.6% accurate, 2.9× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (* 0.5 (/ c b)))

C

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

Java

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

Python

def code(a, b, c):
	return 0.5 * (c / b)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 53.1%

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

3. Taylor expanded in b around -inf

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

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lower-*.f64 N/A

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

   4. lower-neg.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 N/A

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

   7. unpow2 N/A

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

   8. associate-/r* N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. associate-*r/ N/A

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

   12. metadata-eval N/A

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

   13. lower-/.f64 35.2

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

5. Applied rewrites 35.2%

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

6. Taylor expanded in a around inf

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

8. Applied rewrites 10.1%

   \[\leadsto 0.5 \cdot \color{blue}{\frac{c}{b}} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024283 
(FPCore (a b c)
  :name "Cubic critical"
  :precision binary64
  (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))