quadp (p42, positive)

Percentage Accurate: 53.0% → 85.9%

Time: 3.3s

Alternatives: 10

Speedup: 2.7×

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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    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: 53.0% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    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.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2e+122)
   (+ (/ (- b) a) (/ c b))
   (if (<= b 4.9e-48)
     (+ (* (/ b a) -0.5) (/ (sqrt (fma (* -4.0 a) c (* b b))) (+ a a)))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e+122) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = ((b / a) * -0.5) + (sqrt(fma((-4.0 * a), c, (b * b))) / (a + a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e+122)
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	elseif (b <= 4.9e-48)
		tmp = Float64(Float64(Float64(b / a) * -0.5) + Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) / Float64(a + a)));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2e+122], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.9e-48], N[(N[(N[(b / a), $MachinePrecision] * -0.5), $MachinePrecision] + N[(N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.00000000000000003e122

   1. Initial program 50.7%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 96.1

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

   4. Applied rewrites 96.1%

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

   5. Taylor expanded in a around inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      5. lift-/.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      6. lower-/.f64 96.5

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

   7. Applied rewrites 96.5%

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

   if -2.00000000000000003e122 < b < 4.9000000000000002e-48

   1. Initial program 80.2%

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

      1. lift-*.f64 N/A

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

      2. 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}} \]

      3. lift-+.f64 N/A

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

      4. lift-sqrt.f64 N/A

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

      5. 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} \]

      6. 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} \]

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. div-add N/A

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

      10. lower-+.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. count-2-rev N/A

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

      13. lower-+.f64 N/A

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

      14. lower-/.f64 N/A

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

   3. Applied rewrites 80.1%

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

   4. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 80.1

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

   6. Applied rewrites 80.1%

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

   if 4.9000000000000002e-48 < b

   1. Initial program 17.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.7

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

   4. Applied rewrites 87.7%

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

Alternative 2: 85.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2e+122)
   (+ (/ (- b) a) (/ c b))
   (if (<= b 4.9e-48)
     (/ (+ (sqrt (fma (* -4.0 a) c (* b b))) (- b)) (+ a a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2e+122) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = (sqrt(fma((-4.0 * a), c, (b * b))) + -b) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2e+122)
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	elseif (b <= 4.9e-48)
		tmp = Float64(Float64(sqrt(fma(Float64(-4.0 * a), c, Float64(b * b))) + Float64(-b)) / Float64(a + a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2e+122], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.9e-48], N[(N[(N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c + N[(b * b), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + (-b)), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.00000000000000003e122

   1. Initial program 50.7%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 96.1

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

   4. Applied rewrites 96.1%

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

   5. Taylor expanded in a around inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      5. lift-/.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      6. lower-/.f64 96.5

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

   7. Applied rewrites 96.5%

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

   if -2.00000000000000003e122 < b < 4.9000000000000002e-48

   1. Initial program 80.2%

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

   3. Applied rewrites 80.1%

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

   if 4.9000000000000002e-48 < b

   1. Initial program 17.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.7

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

   4. Applied rewrites 87.7%

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

Alternative 3: 80.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.02 \cdot 10^{-13}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \mathbf{elif}\;b \leq 4.9 \cdot 10^{-48}:\\ \;\;\;\;\frac{\sqrt{\left(a \cdot -4\right) \cdot c} + \left(-b\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.02e-13)
   (+ (/ (- b) a) (/ c b))
   (if (<= b 4.9e-48)
     (/ (+ (sqrt (* (* a -4.0) c)) (- b)) (+ a a))
     (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.02e-13) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = (sqrt(((a * -4.0) * c)) + -b) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.02d-13)) then
        tmp = (-b / a) + (c / b)
    else if (b <= 4.9d-48) then
        tmp = (sqrt(((a * (-4.0d0)) * c)) + -b) / (a + 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 <= -1.02e-13) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = (Math.sqrt(((a * -4.0) * c)) + -b) / (a + a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.02e-13:
		tmp = (-b / a) + (c / b)
	elif b <= 4.9e-48:
		tmp = (math.sqrt(((a * -4.0) * c)) + -b) / (a + a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.02e-13)
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	elseif (b <= 4.9e-48)
		tmp = Float64(Float64(sqrt(Float64(Float64(a * -4.0) * c)) + Float64(-b)) / Float64(a + a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.02e-13)
		tmp = (-b / a) + (c / b);
	elseif (b <= 4.9e-48)
		tmp = (sqrt(((a * -4.0) * c)) + -b) / (a + a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.02e-13], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.9e-48], N[(N[(N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision] + (-b)), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.0199999999999999e-13

   1. Initial program 66.7%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 90.9

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

   4. Applied rewrites 90.9%

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

   5. Taylor expanded in a around inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      5. lift-/.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      6. lower-/.f64 91.2

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

   7. Applied rewrites 91.2%

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

   if -1.0199999999999999e-13 < b < 4.9000000000000002e-48

   1. Initial program 75.6%

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

   3. Applied rewrites 75.6%

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

   4. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 63.0

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

   6. Applied rewrites 63.0%

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

   if 4.9000000000000002e-48 < b

   1. Initial program 17.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.7

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

   4. Applied rewrites 87.7%

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

Alternative 4: 79.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.02 \cdot 10^{-13}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \mathbf{elif}\;b \leq 4.9 \cdot 10^{-48}:\\ \;\;\;\;\left(-c\right) \cdot \sqrt{\frac{\frac{-1}{c}}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.02e-13)
   (+ (/ (- b) a) (/ c b))
   (if (<= b 4.9e-48) (* (- c) (sqrt (/ (/ -1.0 c) a))) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.02e-13) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = -c * sqrt(((-1.0 / c) / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.02d-13)) then
        tmp = (-b / a) + (c / b)
    else if (b <= 4.9d-48) then
        tmp = -c * sqrt((((-1.0d0) / c) / 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 <= -1.02e-13) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = -c * Math.sqrt(((-1.0 / c) / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.02e-13:
		tmp = (-b / a) + (c / b)
	elif b <= 4.9e-48:
		tmp = -c * math.sqrt(((-1.0 / c) / a))
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.02e-13)
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	elseif (b <= 4.9e-48)
		tmp = Float64(Float64(-c) * sqrt(Float64(Float64(-1.0 / c) / a)));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.02e-13)
		tmp = (-b / a) + (c / b);
	elseif (b <= 4.9e-48)
		tmp = -c * sqrt(((-1.0 / c) / a));
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.02e-13], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.9e-48], N[((-c) * N[Sqrt[N[(N[(-1.0 / c), $MachinePrecision] / a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.0199999999999999e-13

   1. Initial program 66.7%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 90.9

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

   4. Applied rewrites 90.9%

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

   5. Taylor expanded in a around inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      5. lift-/.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      6. lower-/.f64 91.2

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

   7. Applied rewrites 91.2%

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

   if -1.0199999999999999e-13 < b < 4.9000000000000002e-48

   1. Initial program 75.6%

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

   2. Taylor expanded in c around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. sqrt-unprod N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 61.0

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

   4. Applied rewrites 61.0%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. sqrt-prod N/A

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

      3. lower-sqrt.f64 N/A

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

      4. associate-*l/ N/A

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

      5. metadata-eval N/A

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

      6. *-commutative N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 60.7

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

   7. Applied rewrites 60.7%

      \[\leadsto \left(-c\right) \cdot \sqrt{\frac{-1}{c \cdot a}} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 61.3

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

   9. Applied rewrites 61.3%

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

   if 4.9000000000000002e-48 < b

   1. Initial program 17.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.7

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

   4. Applied rewrites 87.7%

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

Alternative 5: 79.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.02 \cdot 10^{-13}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \mathbf{elif}\;b \leq 4.9 \cdot 10^{-48}:\\ \;\;\;\;\left(-c\right) \cdot \sqrt{\frac{-1}{c \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.02e-13)
   (+ (/ (- b) a) (/ c b))
   (if (<= b 4.9e-48) (* (- c) (sqrt (/ -1.0 (* c a)))) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.02e-13) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = -c * sqrt((-1.0 / (c * a)));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.02d-13)) then
        tmp = (-b / a) + (c / b)
    else if (b <= 4.9d-48) then
        tmp = -c * sqrt(((-1.0d0) / (c * 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 <= -1.02e-13) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 4.9e-48) {
		tmp = -c * Math.sqrt((-1.0 / (c * a)));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.02e-13:
		tmp = (-b / a) + (c / b)
	elif b <= 4.9e-48:
		tmp = -c * math.sqrt((-1.0 / (c * a)))
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.02e-13)
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	elseif (b <= 4.9e-48)
		tmp = Float64(Float64(-c) * sqrt(Float64(-1.0 / Float64(c * a))));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.02e-13)
		tmp = (-b / a) + (c / b);
	elseif (b <= 4.9e-48)
		tmp = -c * sqrt((-1.0 / (c * a)));
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.02e-13], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.9e-48], N[((-c) * N[Sqrt[N[(-1.0 / N[(c * a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.0199999999999999e-13

   1. Initial program 66.7%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 90.9

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

   4. Applied rewrites 90.9%

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

   5. Taylor expanded in a around inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      5. lift-/.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      6. lower-/.f64 91.2

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

   7. Applied rewrites 91.2%

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

   if -1.0199999999999999e-13 < b < 4.9000000000000002e-48

   1. Initial program 75.6%

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

   2. Taylor expanded in c around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. sqrt-unprod N/A

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

      11. lower-sqrt.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. lower-*.f64 61.0

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

   4. Applied rewrites 61.0%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. sqrt-prod N/A

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

      3. lower-sqrt.f64 N/A

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

      4. associate-*l/ N/A

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

      5. metadata-eval N/A

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

      6. *-commutative N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lift-*.f64 60.7

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

   7. Applied rewrites 60.7%

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

   if 4.9000000000000002e-48 < b

   1. Initial program 17.0%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 87.7

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

   4. Applied rewrites 87.7%

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

Alternative 6: 71.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.35 \cdot 10^{-103}:\\ \;\;\;\;\frac{-b}{a} + \frac{c}{b}\\ \mathbf{elif}\;b \leq 2.25 \cdot 10^{-259}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.35e-103)
   (+ (/ (- b) a) (/ c b))
   (if (<= b 2.25e-259) (sqrt (/ (- c) a)) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.35e-103) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 2.25e-259) {
		tmp = sqrt((-c / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.35d-103)) then
        tmp = (-b / a) + (c / b)
    else if (b <= 2.25d-259) then
        tmp = sqrt((-c / 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 <= -1.35e-103) {
		tmp = (-b / a) + (c / b);
	} else if (b <= 2.25e-259) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.35e-103:
		tmp = (-b / a) + (c / b)
	elif b <= 2.25e-259:
		tmp = math.sqrt((-c / a))
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.35e-103)
		tmp = Float64(Float64(Float64(-b) / a) + Float64(c / b));
	elseif (b <= 2.25e-259)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.35e-103)
		tmp = (-b / a) + (c / b);
	elseif (b <= 2.25e-259)
		tmp = sqrt((-c / a));
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.35e-103], N[(N[((-b) / a), $MachinePrecision] + N[(c / b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.25e-259], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.35000000000000005e-103

   1. Initial program 70.9%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 84.7

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

   4. Applied rewrites 84.7%

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

   5. Taylor expanded in a around inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. distribute-frac-neg N/A

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

      4. lift-neg.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      5. lift-/.f64 N/A

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

      6. lower-/.f64 85.1

         \[\leadsto \frac{-b}{a} + \frac{c}{b} \]

   7. Applied rewrites 85.1%

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

   if -1.35000000000000005e-103 < b < 2.24999999999999987e-259

   1. Initial program 78.5%

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

   2. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

         \[\leadsto -\sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]

      3. sqrt-unprod N/A

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

      5. lower-*.f64 N/A

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

      6. lower-/.f64 35.6

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

   4. Applied rewrites 35.6%

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

   5. Taylor expanded in c around -inf

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

      1. sqrt-prod N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{-1 \cdot \frac{c}{a}} \]

      4. associate-*r/ N/A

         \[\leadsto \sqrt{\frac{-1 \cdot c}{a}} \]

      5. mul-1-neg N/A

         \[\leadsto \sqrt{\frac{\mathsf{neg}\left(c\right)}{a}} \]

      6. lower-/.f64 N/A

         \[\leadsto \sqrt{\frac{\mathsf{neg}\left(c\right)}{a}} \]

      7. lift-neg.f64 34.1

         \[\leadsto \sqrt{\frac{-c}{a}} \]

   7. Applied rewrites 34.1%

      \[\leadsto \sqrt{\frac{-c}{a}} \]

   if 2.24999999999999987e-259 < b

   1. Initial program 29.9%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 71.6

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

   4. Applied rewrites 71.6%

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

Alternative 7: 70.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.35 \cdot 10^{-103}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 2.25 \cdot 10^{-259}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.35e-103)
   (/ (- b) a)
   (if (<= b 2.25e-259) (sqrt (/ (- c) a)) (/ (- c) b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.35e-103) {
		tmp = -b / a;
	} else if (b <= 2.25e-259) {
		tmp = sqrt((-c / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-1.35d-103)) then
        tmp = -b / a
    else if (b <= 2.25d-259) then
        tmp = sqrt((-c / 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 <= -1.35e-103) {
		tmp = -b / a;
	} else if (b <= 2.25e-259) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.35e-103:
		tmp = -b / a
	elif b <= 2.25e-259:
		tmp = math.sqrt((-c / a))
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.35e-103)
		tmp = Float64(Float64(-b) / a);
	elseif (b <= 2.25e-259)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.35e-103)
		tmp = -b / a;
	elseif (b <= 2.25e-259)
		tmp = sqrt((-c / a));
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.35e-103], N[((-b) / a), $MachinePrecision], If[LessEqual[b, 2.25e-259], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.35000000000000005e-103

   1. Initial program 70.9%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 84.6

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

   4. Applied rewrites 84.6%

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

   if -1.35000000000000005e-103 < b < 2.24999999999999987e-259

   1. Initial program 78.5%

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

   2. Taylor expanded in a around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

         \[\leadsto -\sqrt{\frac{c}{a}} \cdot \sqrt{-1} \]

      3. sqrt-unprod N/A

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

      4. lower-sqrt.f64 N/A

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

      5. lower-*.f64 N/A

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

      6. lower-/.f64 35.6

         \[\leadsto -\sqrt{\frac{c}{a} \cdot -1} \]

   4. Applied rewrites 35.6%

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

   5. Taylor expanded in c around -inf

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

      1. sqrt-prod N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      2. lower-sqrt.f64 N/A

         \[\leadsto \sqrt{\frac{c}{a} \cdot -1} \]

      3. *-commutative N/A

         \[\leadsto \sqrt{-1 \cdot \frac{c}{a}} \]

      4. associate-*r/ N/A

         \[\leadsto \sqrt{\frac{-1 \cdot c}{a}} \]

      5. mul-1-neg N/A

         \[\leadsto \sqrt{\frac{\mathsf{neg}\left(c\right)}{a}} \]

      6. lower-/.f64 N/A

         \[\leadsto \sqrt{\frac{\mathsf{neg}\left(c\right)}{a}} \]

      7. lift-neg.f64 34.1

         \[\leadsto \sqrt{\frac{-c}{a}} \]

   7. Applied rewrites 34.1%

      \[\leadsto \sqrt{\frac{-c}{a}} \]

   if 2.24999999999999987e-259 < b

   1. Initial program 29.9%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 71.6

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

   4. Applied rewrites 71.6%

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

Alternative 8: 68.1% accurate, 2.7× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 2.7e-289) (/ (- b) a) (/ (- c) b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 2.7e-289) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 2.7d-289) 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 <= 2.7e-289) {
		tmp = -b / a;
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.7e-289

   1. Initial program 72.8%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 66.9

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

   4. Applied rewrites 66.9%

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

   if 2.7e-289 < b

   1. Initial program 31.5%

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

   2. Taylor expanded in a around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lower-/.f64 N/A

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

      4. lower-neg.f64 69.4

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

   4. Applied rewrites 69.4%

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

Alternative 9: 43.8% accurate, 2.7× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 1.3e-5) (/ (- b) a) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 1.3e-5) {
		tmp = -b / a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= 1.3d-5) 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 <= 1.3e-5) {
		tmp = -b / a;
	} else {
		tmp = c / b;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.29999999999999992e-5

   1. Initial program 69.8%

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

   2. Taylor expanded in b around -inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 50.8

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

   4. Applied rewrites 50.8%

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

   if 1.29999999999999992e-5 < b

   1. Initial program 14.9%

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

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lower-+.f64 N/A

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

      6. associate-*r/ N/A

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

      7. mul-1-neg N/A

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

      8. lower-/.f64 N/A

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

      9. lower-neg.f64 N/A

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

      10. pow2 N/A

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

      11. lift-*.f64 N/A

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

      12. lower-/.f64 2.6

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

   4. Applied rewrites 2.6%

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

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 27.8

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

   7. Applied rewrites 27.8%

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

Alternative 10: 10.6% accurate, 5.6× 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, c)
use fmin_fmax_functions
    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 53.0%

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

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

   1. associate-*r* N/A

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

   2. mul-1-neg N/A

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

   3. lift-neg.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. lower-+.f64 N/A

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

   6. associate-*r/ N/A

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

   7. mul-1-neg N/A

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

   8. lower-/.f64 N/A

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

   9. lower-neg.f64 N/A

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

   10. pow2 N/A

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

   11. lift-*.f64 N/A

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

   12. lower-/.f64 35.2

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

4. Applied rewrites 35.2%

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

5. Taylor expanded in a around inf

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

   1. lower-/.f64 10.6

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

7. Applied rewrites 10.6%

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

Developer Target 1: 99.7% accurate, 0.4× 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 2025115 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

  :alt
  (! :herbie-platform c (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)))