quadp (p42, positive)

Percentage Accurate: 52.7% → 85.2%

Time: 9.5s

Alternatives: 10

Speedup: 2.5×

Specification

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{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(4.0 * Float64(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[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 52.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{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(4.0 * Float64(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[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 85.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5 \cdot 10^{+101}:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{elif}\;b \leq 1.5 \cdot 10^{-17}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{a}{b} - \frac{b}{c}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5e+101)
   (- (/ b a))
   (if (<= b 1.5e-17)
     (/ (- (sqrt (- (* b b) (* 4.0 (* a c)))) b) (* a 2.0))
     (/ 1.0 (- (/ a b) (/ b c))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+101) {
		tmp = -(b / a);
	} else if (b <= 1.5e-17) {
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	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 <= (-5d+101)) then
        tmp = -(b / a)
    else if (b <= 1.5d-17) then
        tmp = (sqrt(((b * b) - (4.0d0 * (a * c)))) - b) / (a * 2.0d0)
    else
        tmp = 1.0d0 / ((a / b) - (b / c))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e+101) {
		tmp = -(b / a);
	} else if (b <= 1.5e-17) {
		tmp = (Math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5e+101:
		tmp = -(b / a)
	elif b <= 1.5e-17:
		tmp = (math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0)
	else:
		tmp = 1.0 / ((a / b) - (b / c))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5e+101)
		tmp = Float64(-Float64(b / a));
	elseif (b <= 1.5e-17)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(1.0 / Float64(Float64(a / b) - Float64(b / c)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5e+101)
		tmp = -(b / a);
	elseif (b <= 1.5e-17)
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	else
		tmp = 1.0 / ((a / b) - (b / c));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5e+101], (-N[(b / a), $MachinePrecision]), If[LessEqual[b, 1.5e-17], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(a / b), $MachinePrecision] - N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.99999999999999989e101

   1. Initial program 54.2%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{b}{a}\right)} \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{b}{\mathsf{neg}\left(a\right)}} \]

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \frac{b}{\color{blue}{\mathsf{neg}\left(a\right)}} \]

      6. lower-neg.f64 96.7

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

   5. Applied rewrites 96.7%

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

   if -4.99999999999999989e101 < b < 1.50000000000000003e-17

   1. Initial program 79.1%

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

   if 1.50000000000000003e-17 < b

   1. Initial program 14.4%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 7.5

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

   5. Applied rewrites 7.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 7.5

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 7.5

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-neg.f64 N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 7.5

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

   7. Applied rewrites 7.5%

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

   8. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 87.5

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

   10. Applied rewrites 87.5%

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

4. Final simplification 86.1%

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

Alternative 2: 84.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.3 \cdot 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(b, \frac{c}{b \cdot b}, -\frac{b}{a}\right)\\ \mathbf{elif}\;b \leq 1.5 \cdot 10^{-17}:\\ \;\;\;\;\frac{-0.5}{a} \cdot \left(b - \sqrt{\mathsf{fma}\left(a, c \cdot -4, b \cdot b\right)}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{a}{b} - \frac{b}{c}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.3e+17)
   (fma b (/ c (* b b)) (- (/ b a)))
   (if (<= b 1.5e-17)
     (* (/ -0.5 a) (- b (sqrt (fma a (* c -4.0) (* b b)))))
     (/ 1.0 (- (/ a b) (/ b c))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.3e+17) {
		tmp = fma(b, (c / (b * b)), -(b / a));
	} else if (b <= 1.5e-17) {
		tmp = (-0.5 / a) * (b - sqrt(fma(a, (c * -4.0), (b * b))));
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.3e+17)
		tmp = fma(b, Float64(c / Float64(b * b)), Float64(-Float64(b / a)));
	elseif (b <= 1.5e-17)
		tmp = Float64(Float64(-0.5 / a) * Float64(b - sqrt(fma(a, Float64(c * -4.0), Float64(b * b)))));
	else
		tmp = Float64(1.0 / Float64(Float64(a / b) - Float64(b / c)));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.3e+17], N[(b * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + (-N[(b / a), $MachinePrecision])), $MachinePrecision], If[LessEqual[b, 1.5e-17], N[(N[(-0.5 / a), $MachinePrecision] * N[(b - N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(a / b), $MachinePrecision] - N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.3e17

   1. Initial program 62.7%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. distribute-neg-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-commutative N/A

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

      7. mul-1-neg N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. remove-double-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. distribute-neg-frac2 N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

      17. mul-1-neg N/A

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

      18. lower-neg.f64 94.9

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

   5. Applied rewrites 94.9%

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

   if -4.3e17 < b < 1.50000000000000003e-17

   1. Initial program 76.9%

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

   4. Applied rewrites 76.8%

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

   if 1.50000000000000003e-17 < b

   1. Initial program 14.4%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 7.5

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

   5. Applied rewrites 7.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 7.5

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 7.5

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-neg.f64 N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 7.5

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

   7. Applied rewrites 7.5%

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

   8. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 87.5

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

   10. Applied rewrites 87.5%

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

4. Final simplification 86.0%

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

Alternative 3: 80.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.2e-71)
   (fma b (/ c (* b b)) (- (/ b a)))
   (if (<= b 5.8e-18)
     (/ (- (sqrt (* a (* c -4.0))) b) (* a 2.0))
     (/ 1.0 (- (/ a b) (/ b c))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.2e-71) {
		tmp = fma(b, (c / (b * b)), -(b / a));
	} else if (b <= 5.8e-18) {
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.2e-71)
		tmp = fma(b, Float64(c / Float64(b * b)), Float64(-Float64(b / a)));
	elseif (b <= 5.8e-18)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(1.0 / Float64(Float64(a / b) - Float64(b / c)));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.2e-71], N[(b * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + (-N[(b / a), $MachinePrecision])), $MachinePrecision], If[LessEqual[b, 5.8e-18], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(a / b), $MachinePrecision] - N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.19999999999999997e-71

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. distribute-neg-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-commutative N/A

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

      7. mul-1-neg N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. remove-double-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. distribute-neg-frac2 N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

      17. mul-1-neg N/A

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

      18. lower-neg.f64 89.9

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

   5. Applied rewrites 89.9%

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

   if -2.19999999999999997e-71 < b < 5.8e-18

   1. Initial program 70.6%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 68.6

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

   5. Applied rewrites 68.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-neg.f64 N/A

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

      4. unsub-neg N/A

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

      5. lower--.f64 68.6

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 68.6

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

   7. Applied rewrites 68.6%

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

   if 5.8e-18 < b

   1. Initial program 14.4%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 7.5

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

   5. Applied rewrites 7.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 7.5

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 7.5

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-neg.f64 N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 7.5

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

   7. Applied rewrites 7.5%

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

   8. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 87.5

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

   10. Applied rewrites 87.5%

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

4. Final simplification 83.4%

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

Alternative 4: 80.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.2 \cdot 10^{-71}:\\ \;\;\;\;\mathsf{fma}\left(b, \frac{c}{b \cdot b}, -\frac{b}{a}\right)\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{-18}:\\ \;\;\;\;\left(\sqrt{a \cdot \left(c \cdot -4\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{a}{b} - \frac{b}{c}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.2e-71)
   (fma b (/ c (* b b)) (- (/ b a)))
   (if (<= b 5.8e-18)
     (* (- (sqrt (* a (* c -4.0))) b) (/ 0.5 a))
     (/ 1.0 (- (/ a b) (/ b c))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.2e-71) {
		tmp = fma(b, (c / (b * b)), -(b / a));
	} else if (b <= 5.8e-18) {
		tmp = (sqrt((a * (c * -4.0))) - b) * (0.5 / a);
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.2e-71)
		tmp = fma(b, Float64(c / Float64(b * b)), Float64(-Float64(b / a)));
	elseif (b <= 5.8e-18)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) * Float64(0.5 / a));
	else
		tmp = Float64(1.0 / Float64(Float64(a / b) - Float64(b / c)));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.2e-71], N[(b * N[(c / N[(b * b), $MachinePrecision]), $MachinePrecision] + (-N[(b / a), $MachinePrecision])), $MachinePrecision], If[LessEqual[b, 5.8e-18], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(a / b), $MachinePrecision] - N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.19999999999999997e-71

   1. Initial program 70.3%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. distribute-rgt-in N/A

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

      3. distribute-neg-in N/A

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

      4. associate-*l/ N/A

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

      5. *-lft-identity N/A

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

      6. *-commutative N/A

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

      7. mul-1-neg N/A

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

      8. distribute-rgt-neg-out N/A

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

      9. remove-double-neg N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. unpow2 N/A

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

      13. lower-*.f64 N/A

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

      14. distribute-neg-frac2 N/A

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

      15. mul-1-neg N/A

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

      16. lower-/.f64 N/A

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

      17. mul-1-neg N/A

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

      18. lower-neg.f64 89.9

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

   5. Applied rewrites 89.9%

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

   if -2.19999999999999997e-71 < b < 5.8e-18

   1. Initial program 70.6%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 68.6

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

   5. Applied rewrites 68.6%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 68.4

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 68.4

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

   7. Applied rewrites 68.4%

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

   if 5.8e-18 < b

   1. Initial program 14.4%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 7.5

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

   5. Applied rewrites 7.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 7.5

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 7.5

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-neg.f64 N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 7.5

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

   7. Applied rewrites 7.5%

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

   8. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 87.5

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

   10. Applied rewrites 87.5%

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

4. Final simplification 83.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.2 \cdot 10^{-71}:\\ \;\;\;\;\mathsf{fma}\left(b, \frac{c}{b \cdot b}, -\frac{b}{a}\right)\\ \mathbf{elif}\;b \leq 5.8 \cdot 10^{-18}:\\ \;\;\;\;\left(\sqrt{a \cdot \left(c \cdot -4\right)} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{a}{b} - \frac{b}{c}}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 67.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{a}{b} - \frac{b}{c}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-310) (- (/ c b) (/ b a)) (/ 1.0 (- (/ a b) (/ b c)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	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 <= (-1d-310)) then
        tmp = (c / b) - (b / a)
    else
        tmp = 1.0d0 / ((a / b) - (b / c))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = 1.0 / ((a / b) - (b / c));
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1e-310:
		tmp = (c / b) - (b / a)
	else:
		tmp = 1.0 / ((a / b) - (b / c))
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-310)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	else
		tmp = Float64(1.0 / Float64(Float64(a / b) - Float64(b / c)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e-310)
		tmp = (c / b) - (b / a);
	else
		tmp = 1.0 / ((a / b) - (b / c));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e-310], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(N[(a / b), $MachinePrecision] - N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < -9.999999999999969e-311

   1. Initial program 70.4%

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

   4. Applied rewrites 52.0%

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

   5. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. unsub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 71.1

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

   7. Applied rewrites 71.1%

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

   8. Taylor expanded in a around inf

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

   10. Applied rewrites 73.2%

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

   if -9.999999999999969e-311 < b

   1. Initial program 31.3%

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

   3. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 26.0

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

   5. Applied rewrites 26.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 26.0

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 26.0

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

      8. lift-+.f64 N/A

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

      9. +-commutative N/A

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

      10. lift-neg.f64 N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 26.0

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

   7. Applied rewrites 26.0%

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

   8. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. unsub-neg N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 66.8

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

   10. Applied rewrites 66.8%

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

Alternative 6: 68.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-310) (- (/ c b) (/ b a)) (- (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = -(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 <= (-1d-310)) then
        tmp = (c / b) - (b / a)
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = -(c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1e-310:
		tmp = (c / b) - (b / a)
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-310)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e-310)
		tmp = (c / b) - (b / a);
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e-310], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], (-N[(c / b), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if b < -9.999999999999969e-311

   1. Initial program 70.4%

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

   4. Applied rewrites 52.0%

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

   5. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. *-commutative N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. unsub-neg N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. unpow2 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 71.1

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

   7. Applied rewrites 71.1%

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

   8. Taylor expanded in a around inf

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

   10. Applied rewrites 73.2%

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

   if -9.999999999999969e-311 < b

   1. Initial program 31.3%

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

   3. Taylor expanded in b around inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{c}{b}\right)} \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{c}{\mathsf{neg}\left(b\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{c}{\mathsf{neg}\left(b\right)}} \]

      4. lower-neg.f64 66.6

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

   5. Applied rewrites 66.6%

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

4. Final simplification 69.7%

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

Alternative 7: 67.8% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;-\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-310) (- (/ b a)) (- (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = -(b / a);
	} else {
		tmp = -(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 <= (-1d-310)) then
        tmp = -(b / a)
    else
        tmp = -(c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-310) {
		tmp = -(b / a);
	} else {
		tmp = -(c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1e-310:
		tmp = -(b / a)
	else:
		tmp = -(c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-310)
		tmp = Float64(-Float64(b / a));
	else
		tmp = Float64(-Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1e-310)
		tmp = -(b / a);
	else
		tmp = -(c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e-310], (-N[(b / a), $MachinePrecision]), (-N[(c / b), $MachinePrecision])]

Derivation

1. Split input into 2 regimes

2. if b < -9.999999999999969e-311

   1. Initial program 70.4%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{b}{a}\right)} \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{b}{\mathsf{neg}\left(a\right)}} \]

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \frac{b}{\color{blue}{\mathsf{neg}\left(a\right)}} \]

      6. lower-neg.f64 72.3

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

   5. Applied rewrites 72.3%

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

   if -9.999999999999969e-311 < b

   1. Initial program 31.3%

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

   3. Taylor expanded in b around inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{c}{b}\right)} \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{c}{\mathsf{neg}\left(b\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{c}{\mathsf{neg}\left(b\right)}} \]

      4. lower-neg.f64 66.6

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

   5. Applied rewrites 66.6%

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

4. Final simplification 69.3%

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

Alternative 8: 44.0% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 3.8 \cdot 10^{+29}:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 3.8e+29) (- (/ b a)) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 3.8e+29) {
		tmp = -(b / a);
	} else {
		tmp = 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 <= 3.8d+29) then
        tmp = -(b / a)
    else
        tmp = c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 3.8e+29) {
		tmp = -(b / a);
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 3.8e+29:
		tmp = -(b / a)
	else:
		tmp = c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 3.8e+29)
		tmp = Float64(-Float64(b / a));
	else
		tmp = Float64(c / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 3.8e+29)
		tmp = -(b / a);
	else
		tmp = c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 3.8e+29], (-N[(b / a), $MachinePrecision]), N[(c / b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 3.79999999999999971e29

   1. Initial program 65.6%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{b}{a}\right)} \]

      2. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{b}{\mathsf{neg}\left(a\right)}} \]

      3. mul-1-neg N/A

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

      4. lower-/.f64 N/A

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

      5. mul-1-neg N/A

         \[\leadsto \frac{b}{\color{blue}{\mathsf{neg}\left(a\right)}} \]

      6. lower-neg.f64 50.1

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

   5. Applied rewrites 50.1%

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

   if 3.79999999999999971e29 < b

   1. Initial program 14.0%

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

   4. Applied rewrites 7.3%

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

   5. Taylor expanded in b around -inf

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

      1. lower-/.f64 30.2

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

   7. Applied rewrites 30.2%

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

4. Final simplification 43.9%

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

Alternative 9: 11.1% accurate, 4.2× 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 / 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 49.6%

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

4. Applied rewrites 32.4%

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

5. Taylor expanded in b around -inf

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

   1. lower-/.f64 11.5

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

7. Applied rewrites 11.5%

   \[\leadsto \color{blue}{\frac{c}{b}} \]
8. Add Preprocessing

Alternative 10: 2.5% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ \frac{b}{a} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 49.6%

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

4. Applied rewrites 32.4%

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

5. Taylor expanded in b around inf

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

   1. lower-/.f64 2.6

      \[\leadsto \color{blue}{\frac{b}{a}} \]

7. Applied rewrites 2.6%

   \[\leadsto \color{blue}{\frac{b}{a}} \]
8. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left|\frac{b}{2}\right|\\ t_1 := \sqrt{\left|a\right|} \cdot \sqrt{\left|c\right|}\\ t_2 := \begin{array}{l} \mathbf{if}\;\mathsf{copysign}\left(a, c\right) = a:\\ \;\;\;\;\sqrt{t\_0 - t\_1} \cdot \sqrt{t\_0 + t\_1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\frac{b}{2}, t\_1\right)\\ \end{array}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{t\_2 - \frac{b}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{\frac{b}{2} + t\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (fabs (/ b 2.0)))
        (t_1 (* (sqrt (fabs a)) (sqrt (fabs c))))
        (t_2
         (if (== (copysign a c) a)
           (* (sqrt (- t_0 t_1)) (sqrt (+ t_0 t_1)))
           (hypot (/ b 2.0) t_1))))
   (if (< b 0.0) (/ (- t_2 (/ b 2.0)) a) (/ (- c) (+ (/ b 2.0) t_2)))))

C

double code(double a, double b, double c) {
	double t_0 = fabs((b / 2.0));
	double t_1 = sqrt(fabs(a)) * sqrt(fabs(c));
	double tmp;
	if (copysign(a, c) == a) {
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	} else {
		tmp = hypot((b / 2.0), t_1);
	}
	double t_2 = tmp;
	double tmp_1;
	if (b < 0.0) {
		tmp_1 = (t_2 - (b / 2.0)) / a;
	} else {
		tmp_1 = -c / ((b / 2.0) + t_2);
	}
	return tmp_1;
}

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.abs((b / 2.0));
	double t_1 = Math.sqrt(Math.abs(a)) * Math.sqrt(Math.abs(c));
	double tmp;
	if (Math.copySign(a, c) == a) {
		tmp = Math.sqrt((t_0 - t_1)) * Math.sqrt((t_0 + t_1));
	} else {
		tmp = Math.hypot((b / 2.0), t_1);
	}
	double t_2 = tmp;
	double tmp_1;
	if (b < 0.0) {
		tmp_1 = (t_2 - (b / 2.0)) / a;
	} else {
		tmp_1 = -c / ((b / 2.0) + t_2);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.fabs((b / 2.0))
	t_1 = math.sqrt(math.fabs(a)) * math.sqrt(math.fabs(c))
	tmp = 0
	if math.copysign(a, c) == a:
		tmp = math.sqrt((t_0 - t_1)) * math.sqrt((t_0 + t_1))
	else:
		tmp = math.hypot((b / 2.0), t_1)
	t_2 = tmp
	tmp_1 = 0
	if b < 0.0:
		tmp_1 = (t_2 - (b / 2.0)) / a
	else:
		tmp_1 = -c / ((b / 2.0) + t_2)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = abs(Float64(b / 2.0))
	t_1 = Float64(sqrt(abs(a)) * sqrt(abs(c)))
	tmp = 0.0
	if (copysign(a, c) == a)
		tmp = Float64(sqrt(Float64(t_0 - t_1)) * sqrt(Float64(t_0 + t_1)));
	else
		tmp = hypot(Float64(b / 2.0), t_1);
	end
	t_2 = tmp
	tmp_1 = 0.0
	if (b < 0.0)
		tmp_1 = Float64(Float64(t_2 - Float64(b / 2.0)) / a);
	else
		tmp_1 = Float64(Float64(-c) / Float64(Float64(b / 2.0) + t_2));
	end
	return tmp_1
end

MATLAB

function tmp_3 = code(a, b, c)
	t_0 = abs((b / 2.0));
	t_1 = sqrt(abs(a)) * sqrt(abs(c));
	tmp = 0.0;
	if ((sign(c) * abs(a)) == a)
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	else
		tmp = hypot((b / 2.0), t_1);
	end
	t_2 = tmp;
	tmp_2 = 0.0;
	if (b < 0.0)
		tmp_2 = (t_2 - (b / 2.0)) / a;
	else
		tmp_2 = -c / ((b / 2.0) + t_2);
	end
	tmp_3 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Abs[N[(b / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[Abs[a], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[c], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = If[Equal[N[With[{TMP1 = Abs[a], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], a], N[(N[Sqrt[N[(t$95$0 - t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(b / 2.0), $MachinePrecision] ^ 2 + t$95$1 ^ 2], $MachinePrecision]]}, If[Less[b, 0.0], N[(N[(t$95$2 - N[(b / 2.0), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[((-c) / N[(N[(b / 2.0), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]]]]]

Reproduce

herbie shell --seed 2024223 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

  :alt
  (! :herbie-platform default (let ((sqtD (let ((x (* (sqrt (fabs a)) (sqrt (fabs c))))) (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2)) x)) (sqrt (+ (fabs (/ b 2)) x))) (hypot (/ b 2) x))))) (if (< b 0) (/ (- sqtD (/ b 2)) a) (/ (- c) (+ (/ b 2) sqtD)))))

  (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))