The quadratic formula (r2)

Percentage Accurate: 50.4% → 84.3%

Time: 4.5s

Alternatives: 8

Speedup: 2.5×

Specification

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

C

double code(double a, double b, double c) {
	return (-b - sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Fortran

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: 50.4% 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: 84.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -0.007)
   (/ (- c) b)
   (if (<= b 4.6e+102)
     (/ (- (- b) (sqrt (fma b b (* (* a -4.0) c)))) (+ a a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -0.007) {
		tmp = -c / b;
	} else if (b <= 4.6e+102) {
		tmp = (-b - sqrt(fma(b, b, ((a * -4.0) * c)))) / (a + a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -0.007], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 4.6e+102], N[(N[((-b) - N[Sqrt[N[(b * b + N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -0.00700000000000000015

   1. Initial program 12.4%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 88.3

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

   5. Applied rewrites 88.3%

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

   if -0.00700000000000000015 < b < 4.5999999999999998e102

   1. Initial program 77.6%

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

      1. lift--.f64 N/A

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

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

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

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 77.6

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

   4. Applied rewrites 77.6%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 77.6

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

   6. Applied rewrites 77.6%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. pow2 N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. pow2 N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 77.6

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

   8. Applied rewrites 77.6%

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

   if 4.5999999999999998e102 < b

   1. Initial program 42.2%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 88.5

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

   5. Applied rewrites 88.5%

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

4. Final simplification 83.2%

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

Alternative 2: 79.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1e-12)
   (/ (- c) b)
   (if (<= b 1.75e-112)
     (/ (+ b (sqrt (* (* a -4.0) c))) (- (- a) a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1e-12) {
		tmp = -c / b;
	} else if (b <= 1.75e-112) {
		tmp = (b + sqrt(((a * -4.0) * c))) / (-a - a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1e-12)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 1.75e-112)
		tmp = Float64(Float64(b + sqrt(Float64(Float64(a * -4.0) * c))) / Float64(Float64(-a) - a));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1e-12], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 1.75e-112], N[(N[(b + N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[((-a) - a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -9.9999999999999998e-13

   1. Initial program 13.4%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 87.4

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

   5. Applied rewrites 87.4%

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

   if -9.9999999999999998e-13 < b < 1.74999999999999997e-112

   1. Initial program 70.3%

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

      1. lift--.f64 N/A

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

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

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

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 70.3

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

   4. Applied rewrites 70.3%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 70.3

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

   6. Applied rewrites 70.3%

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

   7. Taylor expanded in a around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 67.3

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

   9. Applied rewrites 67.3%

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

   if 1.74999999999999997e-112 < b

   1. Initial program 64.7%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 79.0

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

   5. Applied rewrites 79.0%

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

4. Final simplification 78.2%

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

Alternative 3: 79.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -0.0019)
   (/ (- c) b)
   (if (<= b 1.75e-112)
     (/ (- (sqrt (* (* a -4.0) c))) (+ a a))
     (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -0.0019) {
		tmp = -c / b;
	} else if (b <= 1.75e-112) {
		tmp = -sqrt(((a * -4.0) * c)) / (a + a);
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

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

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -0.0019], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 1.75e-112], N[((-N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]) / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -0.0019

   1. Initial program 12.4%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 88.3

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

   5. Applied rewrites 88.3%

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

   if -0.0019 < b < 1.74999999999999997e-112

   1. Initial program 69.9%

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

      1. lift--.f64 N/A

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

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

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

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 69.9

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

   4. Applied rewrites 69.9%

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

      1. lift-*.f64 N/A

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

      2. count-2-rev N/A

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

      3. lower-+.f64 69.9

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

   6. Applied rewrites 69.9%

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

   7. Taylor expanded in a around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. sqrt-unprod N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. lower-sqrt.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 66.8

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

   9. Applied rewrites 66.8%

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

   if 1.74999999999999997e-112 < b

   1. Initial program 64.7%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 79.0

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

   5. Applied rewrites 79.0%

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

4. Final simplification 78.1%

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

Alternative 4: 72.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.5 \cdot 10^{-168}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 1.3 \cdot 10^{-112}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5.5e-168)
   (/ (- c) b)
   (if (<= b 1.3e-112) (sqrt (/ (- c) a)) (fma (/ b a) -1.0 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.5e-168) {
		tmp = -c / b;
	} else if (b <= 1.3e-112) {
		tmp = sqrt((-c / a));
	} else {
		tmp = fma((b / a), -1.0, (c / b));
	}
	return tmp;
}

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5.5e-168)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 1.3e-112)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = fma(Float64(b / a), -1.0, Float64(c / b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5.5e-168], N[((-c) / b), $MachinePrecision], If[LessEqual[b, 1.3e-112], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(b / a), $MachinePrecision] * -1.0 + N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.4999999999999999e-168

   1. Initial program 25.1%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 73.1

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

   5. Applied rewrites 73.1%

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

   if -5.4999999999999999e-168 < b < 1.29999999999999996e-112

   1. Initial program 79.0%

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

      1. lift--.f64 N/A

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

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

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

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 79.0

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

   4. Applied rewrites 79.0%

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

   5. Taylor expanded in a around -inf

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

      1. div-sub N/A

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

      2. pow2 N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. metadata-eval N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. pow2 N/A

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

      8. div-sub N/A

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

      9. sqrt-prod N/A

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

      10. lower-sqrt.f64 N/A

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

      11. *-commutative N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 N/A

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

      14. lift-/.f64 48.0

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

   7. Applied rewrites 48.0%

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

   if 1.29999999999999996e-112 < b

   1. Initial program 64.7%

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

   3. Taylor expanded in c around 0

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

      1. *-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 79.0

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

   5. Applied rewrites 79.0%

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

4. Final simplification 70.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5.5 \cdot 10^{-168}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 1.3 \cdot 10^{-112}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{b}{a}, -1, \frac{c}{b}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 72.4% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5.5e-168)
   (/ (- c) b)
   (if (<= b 1.3e-112) (sqrt (/ (- c) a)) (/ (- b) a))))

C

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

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.5e-168) {
		tmp = -c / b;
	} else if (b <= 1.3e-112) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = -b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5.5e-168:
		tmp = -c / b
	elif b <= 1.3e-112:
		tmp = math.sqrt((-c / a))
	else:
		tmp = -b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5.5e-168)
		tmp = Float64(Float64(-c) / b);
	elseif (b <= 1.3e-112)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(-b) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5.5e-168)
		tmp = -c / b;
	elseif (b <= 1.3e-112)
		tmp = sqrt((-c / a));
	else
		tmp = -b / a;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -5.4999999999999999e-168

   1. Initial program 25.1%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 73.1

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

   5. Applied rewrites 73.1%

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

   if -5.4999999999999999e-168 < b < 1.29999999999999996e-112

   1. Initial program 79.0%

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

      1. lift--.f64 N/A

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

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

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

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

      5. pow2 N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. metadata-eval N/A

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

      8. +-commutative N/A

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

      9. associate-*r* N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-*.f64 N/A

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

      12. pow2 N/A

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

      13. lift-*.f64 79.0

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

   4. Applied rewrites 79.0%

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

   5. Taylor expanded in a around -inf

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

      1. div-sub N/A

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

      2. pow2 N/A

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

      3. +-commutative N/A

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

      4. associate-*r* N/A

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

      5. metadata-eval N/A

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

      6. fp-cancel-sub-sign-inv N/A

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

      7. pow2 N/A

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

      8. div-sub N/A

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

      9. sqrt-prod N/A

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

      10. lower-sqrt.f64 N/A

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

      11. *-commutative N/A

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

      12. mul-1-neg N/A

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

      13. lower-neg.f64 N/A

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

      14. lift-/.f64 48.0

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

   7. Applied rewrites 48.0%

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

   if 1.29999999999999996e-112 < b

   1. Initial program 64.7%

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   4. 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. lower-/.f64 N/A

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

      4. lift-neg.f64 78.2

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

   5. Applied rewrites 78.2%

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

4. Final simplification 70.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5.5 \cdot 10^{-168}:\\ \;\;\;\;\frac{-c}{b}\\ \mathbf{elif}\;b \leq 1.3 \cdot 10^{-112}:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-b}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 68.4% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.8e-307) (/ (- c) b) (/ (- b) a)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -1.80000000000000003e-307

   1. Initial program 29.7%

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

   3. Taylor expanded in b around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 65.6

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

   5. Applied rewrites 65.6%

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

   if -1.80000000000000003e-307 < b

   1. Initial program 70.6%

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

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{b}{a}} \]
   4. 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. lower-/.f64 N/A

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

      4. lift-neg.f64 61.7

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

   5. Applied rewrites 61.7%

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

4. Final simplification 63.6%

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

Alternative 7: 36.3% accurate, 3.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(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 50.2%

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

3. Taylor expanded in b around -inf

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

   1. mul-1-neg N/A

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

   2. lower-neg.f64 N/A

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

   3. lower-/.f64 34.1

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

5. Applied rewrites 34.1%

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

6. Final simplification 34.1%

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

Alternative 8: 11.3% accurate, 4.2× speedup

Math

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

FPCore

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

C

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

Fortran

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 50.2%

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

3. Taylor expanded in a around 0

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

   1. lower-/.f64 N/A

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

   2. mul-1-neg N/A

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

   3. +-commutative N/A

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

   4. associate-/l* N/A

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

   5. lower-fma.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. lift-neg.f64 32.3

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

5. Applied rewrites 32.3%

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

6. Taylor expanded in a around inf

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

   1. lift-/.f64 9.8

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

8. Applied rewrites 9.8%

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

Developer Target 1: 69.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{c}{a \cdot \frac{\left(-b\right) + t\_0}{2 \cdot a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* 4.0 (* a c))))))
   (if (< b 0.0)
     (/ c (* a (/ (+ (- b) t_0) (* 2.0 a))))
     (/ (- (- b) t_0) (* 2.0 a)))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - (4.0 * (a * c))));
	double tmp;
	if (b < 0.0) {
		tmp = c / (a * ((-b + t_0) / (2.0 * a)));
	} else {
		tmp = (-b - t_0) / (2.0 * a);
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b * b) - (4.0d0 * (a * c))))
    if (b < 0.0d0) then
        tmp = c / (a * ((-b + t_0) / (2.0d0 * a)))
    else
        tmp = (-b - t_0) / (2.0d0 * a)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[Less[b, 0.0], N[(c / N[(a * N[(N[((-b) + t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-b) - t$95$0), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2025084 
(FPCore (a b c)
  :name "The quadratic formula (r2)"
  :precision binary64

  :alt
  (! :herbie-platform default (let ((d (sqrt (- (* b b) (* 4 (* a c)))))) (let ((r1 (/ (+ (- b) d) (* 2 a)))) (let ((r2 (/ (- (- b) d) (* 2 a)))) (if (< b 0) (/ c (* a r1)) r2)))))

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