quadp (p42, positive)

Percentage Accurate: 51.8% → 85.4%

Time: 8.7s

Alternatives: 7

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: 51.8% 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.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.22e+153)
   (/ (- b) a)
   (if (<= b 1.4e-71)
     (/ (- (sqrt (fma (* -4.0 c) a (* b b))) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.22e+153) {
		tmp = -b / a;
	} else if (b <= 1.4e-71) {
		tmp = (sqrt(fma((-4.0 * c), a, (b * b))) - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.22e+153)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.4e-71)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * c), a, Float64(b * b))) - b) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.22000000000000007e153

   1. Initial program 36.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 \frac{b}{a}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -1.22000000000000007e153 < b < 1.4e-71

   1. Initial program 82.5%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \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 - 4 \cdot \left(a \cdot c\right)}}}{2 \cdot a} \]

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

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

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

      6. lift-*.f64 N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. metadata-eval 82.5

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

   4. Applied rewrites 82.5%

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

   if 1.4e-71 < b

   1. Initial program 12.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 c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 85.0

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

   5. Applied rewrites 85.0%

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

4. Final simplification 85.6%

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

Alternative 2: 85.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.22e+153)
   (/ (- b) a)
   (if (<= b 1.4e-71)
     (* (- (sqrt (fma -4.0 (* c a) (* b b))) b) (/ 0.5 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.22e+153) {
		tmp = -b / a;
	} else if (b <= 1.4e-71) {
		tmp = (sqrt(fma(-4.0, (c * a), (b * b))) - b) * (0.5 / a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.22e+153)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.4e-71)
		tmp = Float64(Float64(sqrt(fma(-4.0, Float64(c * a), Float64(b * b))) - b) * Float64(0.5 / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.22000000000000007e153

   1. Initial program 36.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 \frac{b}{a}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

   if -1.22000000000000007e153 < b < 1.4e-71

   1. Initial program 82.5%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \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 - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 82.3

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

          \[\leadsto \frac{\frac{1}{2}}{a} \cdot \left(\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\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{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b\right)} \]

      13. lower--.f64 82.3

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

   4. Applied rewrites 82.3%

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

   if 1.4e-71 < b

   1. Initial program 12.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 c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 85.0

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

   5. Applied rewrites 85.0%

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

4. Final simplification 85.5%

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

Alternative 3: 80.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-45}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{-71}:\\ \;\;\;\;\frac{\sqrt{\left(c \cdot a\right) \cdot -4} - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8e-45)
   (/ (- b) a)
   (if (<= b 1.4e-71)
     (/ (- (sqrt (* (* c a) -4.0)) b) (* 2.0 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -8e-45) {
		tmp = -b / a;
	} else if (b <= 1.4e-71) {
		tmp = (sqrt(((c * a) * -4.0)) - b) / (2.0 * 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 <= (-8d-45)) then
        tmp = -b / a
    else if (b <= 1.4d-71) then
        tmp = (sqrt(((c * a) * (-4.0d0))) - b) / (2.0d0 * 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 <= -8e-45) {
		tmp = -b / a;
	} else if (b <= 1.4e-71) {
		tmp = (Math.sqrt(((c * a) * -4.0)) - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -8e-45:
		tmp = -b / a
	elif b <= 1.4e-71:
		tmp = (math.sqrt(((c * a) * -4.0)) - b) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -8e-45)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.4e-71)
		tmp = Float64(Float64(sqrt(Float64(Float64(c * a) * -4.0)) - b) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -8e-45)
		tmp = -b / a;
	elseif (b <= 1.4e-71)
		tmp = (sqrt(((c * a) * -4.0)) - b) / (2.0 * a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -8e-45], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.4e-71], N[(N[(N[Sqrt[N[(N[(c * a), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -7.99999999999999987e-45

   1. Initial program 63.9%

      \[\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. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 88.7

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

   5. Applied rewrites 88.7%

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

   if -7.99999999999999987e-45 < b < 1.4e-71

   1. Initial program 80.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 c around inf

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

      1. lower-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 75.9

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

   5. Applied rewrites 75.9%

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

   if 1.4e-71 < b

   1. Initial program 12.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 c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 85.0

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

   5. Applied rewrites 85.0%

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

4. Final simplification 83.2%

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

Alternative 4: 80.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-45}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{-71}:\\ \;\;\;\;\left(\sqrt{\left(-4 \cdot c\right) \cdot a} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8e-45)
   (/ (- b) a)
   (if (<= b 1.4e-71)
     (* (- (sqrt (* (* -4.0 c) a)) b) (/ 0.5 a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -8e-45) {
		tmp = -b / a;
	} else if (b <= 1.4e-71) {
		tmp = (sqrt(((-4.0 * c) * a)) - b) * (0.5 / 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 <= (-8d-45)) then
        tmp = -b / a
    else if (b <= 1.4d-71) then
        tmp = (sqrt((((-4.0d0) * c) * a)) - b) * (0.5d0 / 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 <= -8e-45) {
		tmp = -b / a;
	} else if (b <= 1.4e-71) {
		tmp = (Math.sqrt(((-4.0 * c) * a)) - b) * (0.5 / a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -8e-45:
		tmp = -b / a
	elif b <= 1.4e-71:
		tmp = (math.sqrt(((-4.0 * c) * a)) - b) * (0.5 / a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -8e-45)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 1.4e-71)
		tmp = Float64(Float64(sqrt(Float64(Float64(-4.0 * c) * a)) - b) * Float64(0.5 / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -8e-45)
		tmp = -b / a;
	elseif (b <= 1.4e-71)
		tmp = (sqrt(((-4.0 * c) * a)) - b) * (0.5 / a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -8e-45], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 1.4e-71], N[(N[(N[Sqrt[N[(N[(-4.0 * c), $MachinePrecision] * a), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] * N[(0.5 / a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -7.99999999999999987e-45

   1. Initial program 63.9%

      \[\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. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 88.7

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

   5. Applied rewrites 88.7%

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

   if -7.99999999999999987e-45 < b < 1.4e-71

   1. Initial program 80.6%

      \[\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \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 - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}} \]

      2. clear-num N/A

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

      3. associate-/r/ N/A

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

      4. lower-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. associate-/r* N/A

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

      7. metadata-eval N/A

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

      8. lower-/.f64 80.5

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

      9. lift-+.f64 N/A

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

      10. +-commutative N/A

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

      11. lift-neg.f64 N/A

          \[\leadsto \frac{\frac{1}{2}}{a} \cdot \left(\sqrt{b \cdot b - 4 \cdot \left(a \cdot c\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{b \cdot b - 4 \cdot \left(a \cdot c\right)} - b\right)} \]

      13. lower--.f64 80.5

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

   4. Applied rewrites 80.5%

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

   5. Taylor expanded in c around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 75.8

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

   7. Applied rewrites 75.8%

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

   if 1.4e-71 < b

   1. Initial program 12.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 c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 85.0

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

   5. Applied rewrites 85.0%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8 \cdot 10^{-45}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.4 \cdot 10^{-71}:\\ \;\;\;\;\left(\sqrt{\left(-4 \cdot c\right) \cdot a} - b\right) \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 67.2% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 3e-309) (/ (- b) a) (/ (- c) b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 3e-309) {
		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 <= 3d-309) 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 <= 3e-309) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

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

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 3e-309)
		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 <= 3e-309)
		tmp = -b / a;
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 3.000000000000001e-309

   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 \frac{b}{a}} \]
   4. Step-by-step derivation

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 63.3

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

   5. Applied rewrites 63.3%

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

   if 3.000000000000001e-309 < b

   1. Initial program 30.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 c around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 66.9

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

   5. Applied rewrites 66.9%

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

Alternative 6: 42.1% accurate, 2.5× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 4.6e+56) {
		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 <= 4.6d+56) 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 <= 4.6e+56) {
		tmp = -b / a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

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

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 4.6e+56)
		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 <= 4.6e+56)
		tmp = -b / a;
	else
		tmp = c / b;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 4.60000000000000029e56

   1. Initial program 64.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. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 38.8

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

   5. Applied rewrites 38.8%

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

   if 4.60000000000000029e56 < b

   1. Initial program 6.8%

      \[\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. mul-1-neg N/A

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

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

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

      6. remove-double-neg N/A

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

      7. associate-*l/ N/A

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

      8. *-lft-identity N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. associate-/r* N/A

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

      12. lower-/.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. distribute-frac-neg N/A

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

      15. lower-/.f64 N/A

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

      16. lower-neg.f64 2.8

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

   5. Applied rewrites 2.8%

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

   6. Taylor expanded in c around inf

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

   8. Applied rewrites 22.0%

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

Alternative 7: 10.6% 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 46.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 \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. mul-1-neg N/A

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

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

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

   6. remove-double-neg N/A

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

   7. associate-*l/ N/A

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

   8. *-lft-identity N/A

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

   9. lower-fma.f64 N/A

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

   10. unpow2 N/A

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

   11. associate-/r* N/A

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

   12. lower-/.f64 N/A

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

   13. lower-/.f64 N/A

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

   14. distribute-frac-neg N/A

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

   15. lower-/.f64 N/A

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

   16. lower-neg.f64 27.3

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

5. Applied rewrites 27.3%

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

6. Taylor expanded in c around inf

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

8. Applied rewrites 8.9%

   \[\leadsto \frac{c}{\color{blue}{b}} \]
9. 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 2024255 
(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)))