jeff quadratic root 1

Percentage Accurate: 72.6% → 90.3%

Time: 5.0s

Alternatives: 11

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \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) (/ (- (- b) t_0) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_0)))))

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 = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	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 = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    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 = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	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 = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	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 = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Initial Program: 72.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + t\_0}\\ \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) (/ (- (- b) t_0) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) t_0)))))

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 = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	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 = (-b - t_0) / (2.0d0 * a)
    else
        tmp = (2.0d0 * c) / (-b + t_0)
    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 = (-b - t_0) / (2.0 * a);
	} else {
		tmp = (2.0 * c) / (-b + t_0);
	}
	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 = (-b - t_0) / (2.0 * a)
	else:
		tmp = (2.0 * c) / (-b + t_0)
	return tmp

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(Float64(4.0 * a) * c)))
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - t_0) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) + t_0));
	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 = (-b - t_0) / (2.0 * a);
	else
		tmp = (2.0 * c) / (-b + t_0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Alternative 1: 90.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)}\\ \mathbf{if}\;b \leq -3.7 \cdot 10^{+52}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{elif}\;b \leq 4.5 \cdot 10^{+119}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (fma b b (* (* -4.0 a) c)))))
   (if (<= b -3.7e+52)
     (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))
     (if (<= b 4.5e+119)
       (if (>= b 0.0) (* (/ (+ t_0 b) a) -0.5) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(fma(b, b, ((-4.0 * a) * c)));
	double tmp_1;
	if (b <= -3.7e+52) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 4.5e+119) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = ((t_0 + b) / a) * -0.5;
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = sqrt(fma(b, b, Float64(Float64(-4.0 * a) * c)))
	tmp_1 = 0.0
	if (b <= -3.7e+52)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(-2.0 * b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 4.5e+119)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(t_0 + b) / a) * -0.5);
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(b * b + N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -3.7e+52], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 4.5e+119], If[GreaterEqual[b, 0.0], N[(N[(N[(t$95$0 + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.7e52

   1. Initial program 60.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 60.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 94.0

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 94.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 94.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -3.7e52 < b < 4.5000000000000002e119

   1. Initial program 86.2%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   3. Step-by-step derivation

   4. Applied rewrites 86.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c + b \cdot b} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      4. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right) + b \cdot b} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      5. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      6. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{{b}^{2} + -4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      7. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      8. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, -4 \cdot \left(a \cdot c\right)\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      9. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      10. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      11. lift-*.f64 86.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   6. Applied rewrites 86.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c + b \cdot b} - b}\\ \end{array} \]

      4. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right) + b \cdot b} - b}\\ \end{array} \]

      5. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}} - b}\\ \end{array} \]

      6. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{{b}^{2} + -4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]

      7. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]

      8. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, -4 \cdot \left(a \cdot c\right)\right)} - b}\\ \end{array} \]

      9. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

      10. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

      11. lift-*.f64 86.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

   8. Applied rewrites 86.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

   if 4.5000000000000002e119 < b

   1. Initial program 50.9%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 96.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 96.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 97.0

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 97.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 85.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-4 \cdot a\right) \cdot c\\ t_1 := \sqrt{t\_0}\\ \mathbf{if}\;b \leq -3.7 \cdot 10^{+52}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{elif}\;b \leq -4.4 \cdot 10^{-137}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, b + b\right)}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, t\_0\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.2 \cdot 10^{-65}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_1 + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_1 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (* (* -4.0 a) c)) (t_1 (sqrt t_0)))
   (if (<= b -3.7e+52)
     (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))
     (if (<= b -4.4e-137)
       (if (>= b 0.0)
         (* (/ (fma -2.0 (/ (* a c) b) (+ b b)) a) -0.5)
         (/ (+ c c) (- (sqrt (fma b b t_0)) b)))
       (if (<= b 3.2e-65)
         (if (>= b 0.0) (* (/ (+ t_1 b) a) -0.5) (/ (+ c c) (- t_1 b)))
         (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = (-4.0 * a) * c;
	double t_1 = sqrt(t_0);
	double tmp_1;
	if (b <= -3.7e+52) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -4.4e-137) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (fma(-2.0, ((a * c) / b), (b + b)) / a) * -0.5;
		} else {
			tmp_3 = (c + c) / (sqrt(fma(b, b, t_0)) - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 3.2e-65) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = ((t_1 + b) / a) * -0.5;
		} else {
			tmp_4 = (c + c) / (t_1 - b);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Julia

function code(a, b, c)
	t_0 = Float64(Float64(-4.0 * a) * c)
	t_1 = sqrt(t_0)
	tmp_1 = 0.0
	if (b <= -3.7e+52)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(-2.0 * b));
		end
		tmp_1 = tmp_2;
	elseif (b <= -4.4e-137)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(fma(-2.0, Float64(Float64(a * c) / b), Float64(b + b)) / a) * -0.5);
		else
			tmp_3 = Float64(Float64(c + c) / Float64(sqrt(fma(b, b, t_0)) - b));
		end
		tmp_1 = tmp_3;
	elseif (b <= 3.2e-65)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(Float64(t_1 + b) / a) * -0.5);
		else
			tmp_4 = Float64(Float64(c + c) / Float64(t_1 - b));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]}, Block[{t$95$1 = N[Sqrt[t$95$0], $MachinePrecision]}, If[LessEqual[b, -3.7e+52], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, -4.4e-137], If[GreaterEqual[b, 0.0], N[(N[(N[(-2.0 * N[(N[(a * c), $MachinePrecision] / b), $MachinePrecision] + N[(b + b), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(N[Sqrt[N[(b * b + t$95$0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.2e-65], If[GreaterEqual[b, 0.0], N[(N[(N[(t$95$1 + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$1 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -3.7e52

   1. Initial program 60.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 60.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 94.0

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 94.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 94.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -3.7e52 < b < -4.4000000000000002e-137

   1. Initial program 91.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   3. Step-by-step derivation

   4. Applied rewrites 91.5%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c + b \cdot b} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      4. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right) + b \cdot b} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      5. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      6. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{{b}^{2} + -4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      7. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      8. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, -4 \cdot \left(a \cdot c\right)\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      9. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      10. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      11. lift-*.f64 91.5

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   6. Applied rewrites 91.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lift-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c + b \cdot b} - b}\\ \end{array} \]

      4. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right) + b \cdot b} - b}\\ \end{array} \]

      5. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right) + {b}^{2}} - b}\\ \end{array} \]

      6. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{{b}^{2} + -4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]

      7. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]

      8. lower-fma.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, -4 \cdot \left(a \cdot c\right)\right)} - b}\\ \end{array} \]

      9. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

      10. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

      11. lift-*.f64 91.5

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

   8. Applied rewrites 91.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

   9. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \frac{a \cdot c}{b} + 2 \cdot b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]
   10. Step-by-step derivation

       1. lower-fma.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, 2 \cdot b\right)}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

       2. lower-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, 2 \cdot b\right)}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, 2 \cdot b\right)}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

       4. count-2-rev N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, b + b\right)}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

       5. lower-+.f64 91.5

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, b + b\right)}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

   11. Applied rewrites 91.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(-2, \frac{a \cdot c}{b}, b + b\right)}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)} - b}\\ \end{array} \]

   if -4.4000000000000002e-137 < b < 3.1999999999999999e-65

   1. Initial program 78.8%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   3. Step-by-step derivation

   4. Applied rewrites 78.8%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-*.f64 71.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   7. Applied rewrites 71.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   8. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]
   9. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

      3. lift-*.f64 70.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Applied rewrites 70.2%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   if 3.1999999999999999e-65 < b

   1. Initial program 69.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 86.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 87.0

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 87.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 80.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left(-4 \cdot a\right) \cdot c}\\ \mathbf{if}\;b \leq -7.5 \cdot 10^{-94}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{elif}\;b \leq 3.2 \cdot 10^{-65}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0 + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (* -4.0 a) c))))
   (if (<= b -7.5e-94)
     (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))
     (if (<= b 3.2e-65)
       (if (>= b 0.0) (* (/ (+ t_0 b) a) -0.5) (/ (+ c c) (- t_0 b)))
       (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b)))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -7.5e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.2e-65) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = ((t_0 + b) / a) * -0.5;
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = sqrt((((-4.0d0) * a) * c))
    if (b <= (-7.5d-94)) then
        if (b >= 0.0d0) then
            tmp_2 = sqrt((-c / a))
        else
            tmp_2 = (c + c) / ((-2.0d0) * b)
        end if
        tmp_1 = tmp_2
    else if (b <= 3.2d-65) then
        if (b >= 0.0d0) then
            tmp_3 = ((t_0 + b) / a) * (-0.5d0)
        else
            tmp_3 = (c + c) / (t_0 - b)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) + (-b / a)
    else
        tmp_1 = (2.0d0 * c) / (-b + b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((-4.0 * a) * c));
	double tmp_1;
	if (b <= -7.5e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = Math.sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 3.2e-65) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = ((t_0 + b) / a) * -0.5;
		} else {
			tmp_3 = (c + c) / (t_0 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((-4.0 * a) * c))
	tmp_1 = 0
	if b <= -7.5e-94:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = math.sqrt((-c / a))
		else:
			tmp_2 = (c + c) / (-2.0 * b)
		tmp_1 = tmp_2
	elif b <= 3.2e-65:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = ((t_0 + b) / a) * -0.5
		else:
			tmp_3 = (c + c) / (t_0 - b)
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = (c / b) + (-b / a)
	else:
		tmp_1 = (2.0 * c) / (-b + b)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(-4.0 * a) * c))
	tmp_1 = 0.0
	if (b <= -7.5e-94)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(-2.0 * b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 3.2e-65)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(t_0 + b) / a) * -0.5);
		else
			tmp_3 = Float64(Float64(c + c) / Float64(t_0 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = sqrt(((-4.0 * a) * c));
	tmp_2 = 0.0;
	if (b <= -7.5e-94)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = sqrt((-c / a));
		else
			tmp_3 = (c + c) / (-2.0 * b);
		end
		tmp_2 = tmp_3;
	elseif (b <= 3.2e-65)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = ((t_0 + b) / a) * -0.5;
		else
			tmp_4 = (c + c) / (t_0 - b);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = (c / b) + (-b / a);
	else
		tmp_2 = (2.0 * c) / (-b + b);
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -7.5e-94], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 3.2e-65], If[GreaterEqual[b, 0.0], N[(N[(N[(t$95$0 + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(t$95$0 - b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -7.5000000000000003e-94

   1. Initial program 70.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 70.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 83.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -7.5000000000000003e-94 < b < 3.1999999999999999e-65

   1. Initial program 80.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   3. Step-by-step derivation

   4. Applied rewrites 80.1%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-*.f64 73.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   7. Applied rewrites 73.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   8. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]
   9. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

      3. lift-*.f64 68.7

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Applied rewrites 68.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   if 3.1999999999999999e-65 < b

   1. Initial program 69.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 86.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 87.0

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 87.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 80.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c + c}{-2 \cdot b}\\ \mathbf{if}\;b \leq -7.5 \cdot 10^{-94}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\\ \mathbf{elif}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{b + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{-68}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot -4\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (+ c c) (* -2.0 b))))
   (if (<= b -7.5e-94)
     (if (>= b 0.0) (sqrt (/ (- c) a)) t_0)
     (if (<= b -5e-310)
       (if (>= b 0.0)
         (* (/ (+ b b) a) -0.5)
         (/ (+ c c) (- (sqrt (* (* -4.0 a) c)) b)))
       (if (<= b 7.2e-68)
         (if (>= b 0.0) (/ (- (sqrt (* (* a -4.0) c))) (+ a a)) t_0)
         (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = (c + c) / (-2.0 * b);
	double tmp_1;
	if (b <= -7.5e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = ((b + b) / a) * -0.5;
		} else {
			tmp_3 = (c + c) / (sqrt(((-4.0 * a) * c)) - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e-68) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -sqrt(((a * -4.0) * c)) / (a + a);
		} else {
			tmp_4 = t_0;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = (c + c) / ((-2.0d0) * b)
    if (b <= (-7.5d-94)) then
        if (b >= 0.0d0) then
            tmp_2 = sqrt((-c / a))
        else
            tmp_2 = t_0
        end if
        tmp_1 = tmp_2
    else if (b <= (-5d-310)) then
        if (b >= 0.0d0) then
            tmp_3 = ((b + b) / a) * (-0.5d0)
        else
            tmp_3 = (c + c) / (sqrt((((-4.0d0) * a) * c)) - b)
        end if
        tmp_1 = tmp_3
    else if (b <= 7.2d-68) then
        if (b >= 0.0d0) then
            tmp_4 = -sqrt(((a * (-4.0d0)) * c)) / (a + a)
        else
            tmp_4 = t_0
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) + (-b / a)
    else
        tmp_1 = (2.0d0 * c) / (-b + b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (c + c) / (-2.0 * b);
	double tmp_1;
	if (b <= -7.5e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = Math.sqrt((-c / a));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = ((b + b) / a) * -0.5;
		} else {
			tmp_3 = (c + c) / (Math.sqrt(((-4.0 * a) * c)) - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e-68) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -Math.sqrt(((a * -4.0) * c)) / (a + a);
		} else {
			tmp_4 = t_0;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = (c + c) / (-2.0 * b)
	tmp_1 = 0
	if b <= -7.5e-94:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = math.sqrt((-c / a))
		else:
			tmp_2 = t_0
		tmp_1 = tmp_2
	elif b <= -5e-310:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = ((b + b) / a) * -0.5
		else:
			tmp_3 = (c + c) / (math.sqrt(((-4.0 * a) * c)) - b)
		tmp_1 = tmp_3
	elif b <= 7.2e-68:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -math.sqrt(((a * -4.0) * c)) / (a + a)
		else:
			tmp_4 = t_0
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c / b) + (-b / a)
	else:
		tmp_1 = (2.0 * c) / (-b + b)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(c + c) / Float64(-2.0 * b))
	tmp_1 = 0.0
	if (b <= -7.5e-94)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = t_0;
		end
		tmp_1 = tmp_2;
	elseif (b <= -5e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(b + b) / a) * -0.5);
		else
			tmp_3 = Float64(Float64(c + c) / Float64(sqrt(Float64(Float64(-4.0 * a) * c)) - b));
		end
		tmp_1 = tmp_3;
	elseif (b <= 7.2e-68)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(-sqrt(Float64(Float64(a * -4.0) * c))) / Float64(a + a));
		else
			tmp_4 = t_0;
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = (c + c) / (-2.0 * b);
	tmp_2 = 0.0;
	if (b <= -7.5e-94)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = sqrt((-c / a));
		else
			tmp_3 = t_0;
		end
		tmp_2 = tmp_3;
	elseif (b <= -5e-310)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = ((b + b) / a) * -0.5;
		else
			tmp_4 = (c + c) / (sqrt(((-4.0 * a) * c)) - b);
		end
		tmp_2 = tmp_4;
	elseif (b <= 7.2e-68)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -sqrt(((a * -4.0) * c)) / (a + a);
		else
			tmp_5 = t_0;
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c / b) + (-b / a);
	else
		tmp_2 = (2.0 * c) / (-b + b);
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -7.5e-94], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], t$95$0], If[LessEqual[b, -5e-310], If[GreaterEqual[b, 0.0], N[(N[(N[(b + b), $MachinePrecision] / a), $MachinePrecision] * -0.5), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(N[Sqrt[N[(N[(-4.0 * a), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 7.2e-68], If[GreaterEqual[b, 0.0], N[((-N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]) / N[(a + a), $MachinePrecision]), $MachinePrecision], t$95$0], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -7.5000000000000003e-94

   1. Initial program 70.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 70.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 83.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -7.5000000000000003e-94 < b < -4.999999999999985e-310

   1. Initial program 79.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1}{2} \cdot \frac{b + \sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \frac{c}{\sqrt{{b}^{2} - 4 \cdot \left(a \cdot c\right)} - b}\\ } \end{array}} \]
   3. Step-by-step derivation

   4. Applied rewrites 79.4%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ } \end{array}} \]

   5. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{-4 \cdot \left(a \cdot c\right)} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

      3. lift-*.f64 79.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   7. Applied rewrites 79.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)} - b}\\ \end{array} \]

   8. Taylor expanded in a around inf

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{-4 \cdot \left(a \cdot c\right)} - b}\\ \end{array} \]
   9. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

      2. lower-*.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

      3. lift-*.f64 69.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   10. Applied rewrites 69.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\sqrt{\left(-4 \cdot a\right) \cdot c} + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   11. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{2 \cdot b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]
   12. Step-by-step derivation

       1. count-2-rev N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{b + b}{a} \cdot \frac{-1}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

       2. lower-+.f64 69.3

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{b + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   13. Applied rewrites 69.3%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{b + b}{a} \cdot -0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(-4 \cdot a\right) \cdot c} - b}\\ \end{array} \]

   if -4.999999999999985e-310 < b < 7.20000000000000015e-68

   1. Initial program 80.7%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 21.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 21.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 21.1%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 21.1

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 21.1%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

       1. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       2. +-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       3. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       4. metadata-eval N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

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

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       6. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       7. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       8. mul-1-neg N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{neg}\left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       9. lower-neg.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{a \cdot c} \cdot \sqrt{-4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       10. sqrt-unprod N/A

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

       11. *-commutative N/A

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

       12. associate-*r* N/A

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

       13. lower-sqrt.f64 N/A

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

       14. *-commutative N/A

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

       15. metadata-eval N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {-4}^{1}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       16. metadata-eval N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {-4}^{\left(\frac{2}{2}\right)}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       17. sqrt-pow2 N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {\left(\sqrt{-4}\right)}^{2}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       18. lower-*.f64 N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {\left(\sqrt{-4}\right)}^{2}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   15. Applied rewrites 65.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-\sqrt{\left(a \cdot -4\right) \cdot c}}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if 7.20000000000000015e-68 < b

   1. Initial program 69.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 86.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 86.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 86.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 5: 80.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c + c}{-2 \cdot b}\\ \mathbf{if}\;b \leq -2.05 \cdot 10^{-94}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\\ \mathbf{elif}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(a \cdot c\right) \cdot -4}}\\ \end{array}\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{-68}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot -4\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (+ c c) (* -2.0 b))))
   (if (<= b -2.05e-94)
     (if (>= b 0.0) (sqrt (/ (- c) a)) t_0)
     (if (<= b -5e-310)
       (if (>= b 0.0)
         (/ (- (- b) b) (+ a a))
         (/ (+ c c) (sqrt (* (* a c) -4.0))))
       (if (<= b 7.2e-68)
         (if (>= b 0.0) (/ (- (sqrt (* (* a -4.0) c))) (+ a a)) t_0)
         (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = (c + c) / (-2.0 * b);
	double tmp_1;
	if (b <= -2.05e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - b) / (a + a);
		} else {
			tmp_3 = (c + c) / sqrt(((a * c) * -4.0));
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e-68) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -sqrt(((a * -4.0) * c)) / (a + a);
		} else {
			tmp_4 = t_0;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = (c + c) / ((-2.0d0) * b)
    if (b <= (-2.05d-94)) then
        if (b >= 0.0d0) then
            tmp_2 = sqrt((-c / a))
        else
            tmp_2 = t_0
        end if
        tmp_1 = tmp_2
    else if (b <= (-5d-310)) then
        if (b >= 0.0d0) then
            tmp_3 = (-b - b) / (a + a)
        else
            tmp_3 = (c + c) / sqrt(((a * c) * (-4.0d0)))
        end if
        tmp_1 = tmp_3
    else if (b <= 7.2d-68) then
        if (b >= 0.0d0) then
            tmp_4 = -sqrt(((a * (-4.0d0)) * c)) / (a + a)
        else
            tmp_4 = t_0
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) + (-b / a)
    else
        tmp_1 = (2.0d0 * c) / (-b + b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (c + c) / (-2.0 * b);
	double tmp_1;
	if (b <= -2.05e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = Math.sqrt((-c / a));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - b) / (a + a);
		} else {
			tmp_3 = (c + c) / Math.sqrt(((a * c) * -4.0));
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e-68) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -Math.sqrt(((a * -4.0) * c)) / (a + a);
		} else {
			tmp_4 = t_0;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = (c + c) / (-2.0 * b)
	tmp_1 = 0
	if b <= -2.05e-94:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = math.sqrt((-c / a))
		else:
			tmp_2 = t_0
		tmp_1 = tmp_2
	elif b <= -5e-310:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (-b - b) / (a + a)
		else:
			tmp_3 = (c + c) / math.sqrt(((a * c) * -4.0))
		tmp_1 = tmp_3
	elif b <= 7.2e-68:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -math.sqrt(((a * -4.0) * c)) / (a + a)
		else:
			tmp_4 = t_0
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c / b) + (-b / a)
	else:
		tmp_1 = (2.0 * c) / (-b + b)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(c + c) / Float64(-2.0 * b))
	tmp_1 = 0.0
	if (b <= -2.05e-94)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = t_0;
		end
		tmp_1 = tmp_2;
	elseif (b <= -5e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(-b) - b) / Float64(a + a));
		else
			tmp_3 = Float64(Float64(c + c) / sqrt(Float64(Float64(a * c) * -4.0)));
		end
		tmp_1 = tmp_3;
	elseif (b <= 7.2e-68)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(-sqrt(Float64(Float64(a * -4.0) * c))) / Float64(a + a));
		else
			tmp_4 = t_0;
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = (c + c) / (-2.0 * b);
	tmp_2 = 0.0;
	if (b <= -2.05e-94)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = sqrt((-c / a));
		else
			tmp_3 = t_0;
		end
		tmp_2 = tmp_3;
	elseif (b <= -5e-310)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (-b - b) / (a + a);
		else
			tmp_4 = (c + c) / sqrt(((a * c) * -4.0));
		end
		tmp_2 = tmp_4;
	elseif (b <= 7.2e-68)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -sqrt(((a * -4.0) * c)) / (a + a);
		else
			tmp_5 = t_0;
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c / b) + (-b / a);
	else
		tmp_2 = (2.0 * c) / (-b + b);
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -2.05e-94], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], t$95$0], If[LessEqual[b, -5e-310], If[GreaterEqual[b, 0.0], N[(N[((-b) - b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 7.2e-68], If[GreaterEqual[b, 0.0], N[((-N[Sqrt[N[(N[(a * -4.0), $MachinePrecision] * c), $MachinePrecision]], $MachinePrecision]) / N[(a + a), $MachinePrecision]), $MachinePrecision], t$95$0], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -2.05e-94

   1. Initial program 70.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 70.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 83.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -2.05e-94 < b < -4.999999999999985e-310

   1. Initial program 79.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 79.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{a \cdot c} \cdot \sqrt{-4}}}\\ \end{array} \]
   11. Step-by-step derivation

       1. sqrt-unprod N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\color{blue}{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       4. lower-*.f64 66.5

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\color{blue}{\left(a \cdot c\right)} \cdot -4}}\\ \end{array} \]

   12. Applied rewrites 66.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

   if -4.999999999999985e-310 < b < 7.20000000000000015e-68

   1. Initial program 80.7%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 21.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 21.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 21.1%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 21.1

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 21.1%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

       1. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       2. +-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       3. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       4. metadata-eval N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

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

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       6. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       7. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       8. mul-1-neg N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{neg}\left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       9. lower-neg.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{a \cdot c} \cdot \sqrt{-4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       10. sqrt-unprod N/A

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

       11. *-commutative N/A

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

       12. associate-*r* N/A

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

       13. lower-sqrt.f64 N/A

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

       14. *-commutative N/A

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

       15. metadata-eval N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {-4}^{1}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       16. metadata-eval N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {-4}^{\left(\frac{2}{2}\right)}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       17. sqrt-pow2 N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {\left(\sqrt{-4}\right)}^{2}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       18. lower-*.f64 N/A

           \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot {\left(\sqrt{-4}\right)}^{2}\right) \cdot c}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   15. Applied rewrites 65.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-\sqrt{\left(a \cdot -4\right) \cdot c}}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if 7.20000000000000015e-68 < b

   1. Initial program 69.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 86.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 86.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 86.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 6: 80.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\left(a \cdot c\right) \cdot -4}\\ \mathbf{if}\;b \leq -2.05 \cdot 10^{-94}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{elif}\;b \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{t\_0}\\ \end{array}\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{-68}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-t\_0}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (* (* a c) -4.0))))
   (if (<= b -2.05e-94)
     (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))
     (if (<= b -5e-310)
       (if (>= b 0.0) (/ (- (- b) b) (+ a a)) (/ (+ c c) t_0))
       (if (<= b 7.2e-68)
         (if (>= b 0.0) (/ (- t_0) (+ a a)) (/ (+ c c) (+ b (- b))))
         (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b))))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((a * c) * -4.0));
	double tmp_1;
	if (b <= -2.05e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - b) / (a + a);
		} else {
			tmp_3 = (c + c) / t_0;
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e-68) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -t_0 / (a + a);
		} else {
			tmp_4 = (c + c) / (b + -b);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = sqrt(((a * c) * (-4.0d0)))
    if (b <= (-2.05d-94)) then
        if (b >= 0.0d0) then
            tmp_2 = sqrt((-c / a))
        else
            tmp_2 = (c + c) / ((-2.0d0) * b)
        end if
        tmp_1 = tmp_2
    else if (b <= (-5d-310)) then
        if (b >= 0.0d0) then
            tmp_3 = (-b - b) / (a + a)
        else
            tmp_3 = (c + c) / t_0
        end if
        tmp_1 = tmp_3
    else if (b <= 7.2d-68) then
        if (b >= 0.0d0) then
            tmp_4 = -t_0 / (a + a)
        else
            tmp_4 = (c + c) / (b + -b)
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) + (-b / a)
    else
        tmp_1 = (2.0d0 * c) / (-b + b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((a * c) * -4.0));
	double tmp_1;
	if (b <= -2.05e-94) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = Math.sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -5e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - b) / (a + a);
		} else {
			tmp_3 = (c + c) / t_0;
		}
		tmp_1 = tmp_3;
	} else if (b <= 7.2e-68) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = -t_0 / (a + a);
		} else {
			tmp_4 = (c + c) / (b + -b);
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((a * c) * -4.0))
	tmp_1 = 0
	if b <= -2.05e-94:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = math.sqrt((-c / a))
		else:
			tmp_2 = (c + c) / (-2.0 * b)
		tmp_1 = tmp_2
	elif b <= -5e-310:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (-b - b) / (a + a)
		else:
			tmp_3 = (c + c) / t_0
		tmp_1 = tmp_3
	elif b <= 7.2e-68:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = -t_0 / (a + a)
		else:
			tmp_4 = (c + c) / (b + -b)
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c / b) + (-b / a)
	else:
		tmp_1 = (2.0 * c) / (-b + b)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(a * c) * -4.0))
	tmp_1 = 0.0
	if (b <= -2.05e-94)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(-2.0 * b));
		end
		tmp_1 = tmp_2;
	elseif (b <= -5e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(-b) - b) / Float64(a + a));
		else
			tmp_3 = Float64(Float64(c + c) / t_0);
		end
		tmp_1 = tmp_3;
	elseif (b <= 7.2e-68)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(-t_0) / Float64(a + a));
		else
			tmp_4 = Float64(Float64(c + c) / Float64(b + Float64(-b)));
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = sqrt(((a * c) * -4.0));
	tmp_2 = 0.0;
	if (b <= -2.05e-94)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = sqrt((-c / a));
		else
			tmp_3 = (c + c) / (-2.0 * b);
		end
		tmp_2 = tmp_3;
	elseif (b <= -5e-310)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (-b - b) / (a + a);
		else
			tmp_4 = (c + c) / t_0;
		end
		tmp_2 = tmp_4;
	elseif (b <= 7.2e-68)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = -t_0 / (a + a);
		else
			tmp_5 = (c + c) / (b + -b);
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c / b) + (-b / a);
	else
		tmp_2 = (2.0 * c) / (-b + b);
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -2.05e-94], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, -5e-310], If[GreaterEqual[b, 0.0], N[(N[((-b) - b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / t$95$0), $MachinePrecision]], If[LessEqual[b, 7.2e-68], If[GreaterEqual[b, 0.0], N[((-t$95$0) / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(b + (-b)), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -2.05e-94

   1. Initial program 70.1%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 70.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 83.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 83.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -2.05e-94 < b < -4.999999999999985e-310

   1. Initial program 79.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 79.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{a \cdot c} \cdot \sqrt{-4}}}\\ \end{array} \]
   11. Step-by-step derivation

       1. sqrt-unprod N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\color{blue}{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       4. lower-*.f64 66.5

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\color{blue}{\left(a \cdot c\right)} \cdot -4}}\\ \end{array} \]

   12. Applied rewrites 66.5%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

   if -4.999999999999985e-310 < b < 7.20000000000000015e-68

   1. Initial program 80.7%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 21.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 21.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 21.1

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 21.1%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-1 \cdot \left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]
   11. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{neg}\left(\sqrt{a \cdot c} \cdot \sqrt{-4}\right)}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

       2. lower-neg.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{a \cdot c} \cdot \sqrt{-4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

       3. sqrt-unprod N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

       4. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

       5. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

       6. lower-*.f64 65.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-\sqrt{\left(a \cdot c\right) \cdot -4}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

   12. Applied rewrites 65.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-\sqrt{\left(a \cdot c\right) \cdot -4}}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ \end{array} \]

   if 7.20000000000000015e-68 < b

   1. Initial program 69.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 86.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 86.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 86.8

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 86.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 7: 75.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{if}\;b \leq -2.05 \cdot 10^{-94}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \leq 10^{-305}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\left(a \cdot c\right) \cdot -4}}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{-186}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))))
   (if (<= b -2.05e-94)
     t_0
     (if (<= b 1e-305)
       (if (>= b 0.0)
         (/ (- (- b) b) (+ a a))
         (/ (+ c c) (sqrt (* (* a c) -4.0))))
       (if (<= b 1.75e-186)
         t_0
         (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b))))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = sqrt((-c / a));
	} else {
		tmp = (c + c) / (-2.0 * b);
	}
	double t_0 = tmp;
	double tmp_1;
	if (b <= -2.05e-94) {
		tmp_1 = t_0;
	} else if (b <= 1e-305) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - b) / (a + a);
		} else {
			tmp_2 = (c + c) / sqrt(((a * c) * -4.0));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.75e-186) {
		tmp_1 = t_0;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    if (b >= 0.0d0) then
        tmp = sqrt((-c / a))
    else
        tmp = (c + c) / ((-2.0d0) * b)
    end if
    t_0 = tmp
    if (b <= (-2.05d-94)) then
        tmp_1 = t_0
    else if (b <= 1d-305) then
        if (b >= 0.0d0) then
            tmp_2 = (-b - b) / (a + a)
        else
            tmp_2 = (c + c) / sqrt(((a * c) * (-4.0d0)))
        end if
        tmp_1 = tmp_2
    else if (b <= 1.75d-186) then
        tmp_1 = t_0
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) + (-b / a)
    else
        tmp_1 = (2.0d0 * c) / (-b + b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (c + c) / (-2.0 * b);
	}
	double t_0 = tmp;
	double tmp_1;
	if (b <= -2.05e-94) {
		tmp_1 = t_0;
	} else if (b <= 1e-305) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-b - b) / (a + a);
		} else {
			tmp_2 = (c + c) / Math.sqrt(((a * c) * -4.0));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.75e-186) {
		tmp_1 = t_0;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (c + c) / (-2.0 * b)
	t_0 = tmp
	tmp_1 = 0
	if b <= -2.05e-94:
		tmp_1 = t_0
	elif b <= 1e-305:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (-b - b) / (a + a)
		else:
			tmp_2 = (c + c) / math.sqrt(((a * c) * -4.0))
		tmp_1 = tmp_2
	elif b <= 1.75e-186:
		tmp_1 = t_0
	elif b >= 0.0:
		tmp_1 = (c / b) + (-b / a)
	else:
		tmp_1 = (2.0 * c) / (-b + b)
	return tmp_1

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(c + c) / Float64(-2.0 * b));
	end
	t_0 = tmp
	tmp_1 = 0.0
	if (b <= -2.05e-94)
		tmp_1 = t_0;
	elseif (b <= 1e-305)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(Float64(-b) - b) / Float64(a + a));
		else
			tmp_2 = Float64(Float64(c + c) / sqrt(Float64(Float64(a * c) * -4.0)));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.75e-186)
		tmp_1 = t_0;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = sqrt((-c / a));
	else
		tmp = (c + c) / (-2.0 * b);
	end
	t_0 = tmp;
	tmp_2 = 0.0;
	if (b <= -2.05e-94)
		tmp_2 = t_0;
	elseif (b <= 1e-305)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (-b - b) / (a + a);
		else
			tmp_3 = (c + c) / sqrt(((a * c) * -4.0));
		end
		tmp_2 = tmp_3;
	elseif (b <= 1.75e-186)
		tmp_2 = t_0;
	elseif (b >= 0.0)
		tmp_2 = (c / b) + (-b / a);
	else
		tmp_2 = (2.0 * c) / (-b + b);
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]]}, If[LessEqual[b, -2.05e-94], t$95$0, If[LessEqual[b, 1e-305], If[GreaterEqual[b, 0.0], N[(N[((-b) - b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[Sqrt[N[(N[(a * c), $MachinePrecision] * -4.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.75e-186], t$95$0, If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.05e-94 or 9.99999999999999996e-306 < b < 1.74999999999999995e-186

   1. Initial program 70.6%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 60.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 72.0

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 72.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 76.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -2.05e-94 < b < 9.99999999999999996e-306

   1. Initial program 79.4%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 78.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in a around inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{a \cdot c} \cdot \sqrt{-4}}}\\ \end{array} \]
   11. Step-by-step derivation

       1. sqrt-unprod N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       2. lower-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       3. lower-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\color{blue}{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

       4. lower-*.f64 65.8

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\sqrt{\color{blue}{\left(a \cdot c\right)} \cdot -4}}\\ \end{array} \]

   12. Applied rewrites 65.8%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{\sqrt{\left(a \cdot c\right) \cdot -4}}}\\ \end{array} \]

   if 1.74999999999999995e-186 < b

   1. Initial program 70.6%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 60.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 3.4%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 71.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{if}\;b \leq -2.6 \cdot 10^{-106}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \leq 10^{-305}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.75 \cdot 10^{-186}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))))
   (if (<= b -2.6e-106)
     t_0
     (if (<= b 1e-305)
       (if (>= b 0.0) (/ (* -2.0 b) (+ a a)) (- (sqrt (* (/ c a) -1.0))))
       (if (<= b 1.75e-186)
         t_0
         (if (>= b 0.0) (+ (/ c b) (/ (- b) a)) (/ (* 2.0 c) (+ (- b) b))))))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = sqrt((-c / a));
	} else {
		tmp = (c + c) / (-2.0 * b);
	}
	double t_0 = tmp;
	double tmp_1;
	if (b <= -2.6e-106) {
		tmp_1 = t_0;
	} else if (b <= 1e-305) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * b) / (a + a);
		} else {
			tmp_2 = -sqrt(((c / a) * -1.0));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.75e-186) {
		tmp_1 = t_0;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    if (b >= 0.0d0) then
        tmp = sqrt((-c / a))
    else
        tmp = (c + c) / ((-2.0d0) * b)
    end if
    t_0 = tmp
    if (b <= (-2.6d-106)) then
        tmp_1 = t_0
    else if (b <= 1d-305) then
        if (b >= 0.0d0) then
            tmp_2 = ((-2.0d0) * b) / (a + a)
        else
            tmp_2 = -sqrt(((c / a) * (-1.0d0)))
        end if
        tmp_1 = tmp_2
    else if (b <= 1.75d-186) then
        tmp_1 = t_0
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) + (-b / a)
    else
        tmp_1 = (2.0d0 * c) / (-b + b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = Math.sqrt((-c / a));
	} else {
		tmp = (c + c) / (-2.0 * b);
	}
	double t_0 = tmp;
	double tmp_1;
	if (b <= -2.6e-106) {
		tmp_1 = t_0;
	} else if (b <= 1e-305) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (-2.0 * b) / (a + a);
		} else {
			tmp_2 = -Math.sqrt(((c / a) * -1.0));
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.75e-186) {
		tmp_1 = t_0;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) + (-b / a);
	} else {
		tmp_1 = (2.0 * c) / (-b + b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = math.sqrt((-c / a))
	else:
		tmp = (c + c) / (-2.0 * b)
	t_0 = tmp
	tmp_1 = 0
	if b <= -2.6e-106:
		tmp_1 = t_0
	elif b <= 1e-305:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (-2.0 * b) / (a + a)
		else:
			tmp_2 = -math.sqrt(((c / a) * -1.0))
		tmp_1 = tmp_2
	elif b <= 1.75e-186:
		tmp_1 = t_0
	elif b >= 0.0:
		tmp_1 = (c / b) + (-b / a)
	else:
		tmp_1 = (2.0 * c) / (-b + b)
	return tmp_1

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = sqrt(Float64(Float64(-c) / a));
	else
		tmp = Float64(Float64(c + c) / Float64(-2.0 * b));
	end
	t_0 = tmp
	tmp_1 = 0.0
	if (b <= -2.6e-106)
		tmp_1 = t_0;
	elseif (b <= 1e-305)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(-2.0 * b) / Float64(a + a));
		else
			tmp_2 = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.75e-186)
		tmp_1 = t_0;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) + Float64(Float64(-b) / a));
	else
		tmp_1 = Float64(Float64(2.0 * c) / Float64(Float64(-b) + b));
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = sqrt((-c / a));
	else
		tmp = (c + c) / (-2.0 * b);
	end
	t_0 = tmp;
	tmp_2 = 0.0;
	if (b <= -2.6e-106)
		tmp_2 = t_0;
	elseif (b <= 1e-305)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (-2.0 * b) / (a + a);
		else
			tmp_3 = -sqrt(((c / a) * -1.0));
		end
		tmp_2 = tmp_3;
	elseif (b <= 1.75e-186)
		tmp_2 = t_0;
	elseif (b >= 0.0)
		tmp_2 = (c / b) + (-b / a);
	else
		tmp_2 = (2.0 * c) / (-b + b);
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]]}, If[LessEqual[b, -2.6e-106], t$95$0, If[LessEqual[b, 1e-305], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision])], If[LessEqual[b, 1.75e-186], t$95$0, If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] + N[((-b) / a), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * c), $MachinePrecision] / N[((-b) + b), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.6000000000000001e-106 or 9.99999999999999996e-306 < b < 1.74999999999999995e-186

   1. Initial program 71.0%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 61.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.3

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.3%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 71.4

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 71.4%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 76.2%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -2.6000000000000001e-106 < b < 9.99999999999999996e-306

   1. Initial program 78.7%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 77.8%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.4%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)\\ \end{array} \]
   11. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\mathsf{neg}\left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)}\\ \end{array} \]

       2. sqrt-prod N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\color{blue}{\sqrt{\frac{c}{a} \cdot -1}}\right)\\ \end{array} \]

       3. lift-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\sqrt{\color{blue}{\frac{c}{a}} \cdot -1}\right)\\ \end{array} \]

       4. lift-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\sqrt{\color{blue}{\frac{c}{a} \cdot -1}}\right)\\ \end{array} \]

       5. lift-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\color{blue}{\sqrt{\frac{c}{a} \cdot -1}}\right)\\ \end{array} \]

       6. lift-neg.f64 34.0

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{-\sqrt{\frac{c}{a} \cdot -1}}\\ \end{array} \]

   12. Applied rewrites 34.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

   13. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]
   14. Step-by-step derivation

       1. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       2. +-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       3. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       4. metadata-eval N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

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

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       6. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       7. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       8. lift-*.f64 34.0

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

   15. Applied rewrites 34.0%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

   if 1.74999999999999995e-186 < b

   1. Initial program 71.0%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 61.1%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.3%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]

   8. Taylor expanded in c around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-1 \cdot \frac{b}{a} + \frac{c}{b}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. lower-+.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1 \cdot \frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. lower-/.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \color{blue}{-1} \cdot \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. associate-*r/ N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-1 \cdot b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. mul-1-neg N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{\mathsf{neg}\left(b\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. lift-neg.f64 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. lower-/.f64 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} + \frac{-b}{\color{blue}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. Applied rewrites 3.4%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\frac{c}{b} + \frac{-b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 69.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.6 \cdot 10^{-106}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.6e-106)
   (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b)))
   (if (>= b 0.0) (/ (* -2.0 b) (+ a a)) (- (sqrt (* (/ c a) -1.0))))))

C

double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -2.6e-106) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (a + a);
	} else {
		tmp_1 = -sqrt(((c / a) * -1.0));
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    if (b <= (-2.6d-106)) then
        if (b >= 0.0d0) then
            tmp_2 = sqrt((-c / a))
        else
            tmp_2 = (c + c) / ((-2.0d0) * b)
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = ((-2.0d0) * b) / (a + a)
    else
        tmp_1 = -sqrt(((c / a) * (-1.0d0)))
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double tmp_1;
	if (b <= -2.6e-106) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = Math.sqrt((-c / a));
		} else {
			tmp_2 = (c + c) / (-2.0 * b);
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (a + a);
	} else {
		tmp_1 = -Math.sqrt(((c / a) * -1.0));
	}
	return tmp_1;
}

Python

def code(a, b, c):
	tmp_1 = 0
	if b <= -2.6e-106:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = math.sqrt((-c / a))
		else:
			tmp_2 = (c + c) / (-2.0 * b)
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = (-2.0 * b) / (a + a)
	else:
		tmp_1 = -math.sqrt(((c / a) * -1.0))
	return tmp_1

Julia

function code(a, b, c)
	tmp_1 = 0.0
	if (b <= -2.6e-106)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = Float64(Float64(c + c) / Float64(-2.0 * b));
		end
		tmp_1 = tmp_2;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(a + a));
	else
		tmp_1 = Float64(-sqrt(Float64(Float64(c / a) * -1.0)));
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	tmp_2 = 0.0;
	if (b <= -2.6e-106)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = sqrt((-c / a));
		else
			tmp_3 = (c + c) / (-2.0 * b);
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = (-2.0 * b) / (a + a);
	else
		tmp_2 = -sqrt(((c / a) * -1.0));
	end
	tmp_4 = tmp_2;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.6e-106], If[GreaterEqual[b, 0.0], N[Sqrt[N[((-c) / a), $MachinePrecision]], $MachinePrecision], N[(N[(c + c), $MachinePrecision] / N[(-2.0 * b), $MachinePrecision]), $MachinePrecision]], If[GreaterEqual[b, 0.0], N[(N[(-2.0 * b), $MachinePrecision] / N[(a + a), $MachinePrecision]), $MachinePrecision], (-N[Sqrt[N[(N[(c / a), $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision])]]

Derivation

1. Split input into 2 regimes

2. if b < -2.6000000000000001e-106

   1. Initial program 70.6%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 70.6%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 2.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 2.5

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 2.5%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 82.7

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 82.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 82.7%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if -2.6000000000000001e-106 < b

   1. Initial program 73.9%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.7%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 55.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 55.2

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 55.2%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-1 \cdot \left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)\\ \end{array} \]
   11. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\mathsf{neg}\left(\sqrt{\frac{c}{a}} \cdot \sqrt{-1}\right)}\\ \end{array} \]

       2. sqrt-prod N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\color{blue}{\sqrt{\frac{c}{a} \cdot -1}}\right)\\ \end{array} \]

       3. lift-/.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\sqrt{\color{blue}{\frac{c}{a}} \cdot -1}\right)\\ \end{array} \]

       4. lift-*.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\sqrt{\color{blue}{\frac{c}{a} \cdot -1}}\right)\\ \end{array} \]

       5. lift-sqrt.f64 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{neg}\left(\color{blue}{\sqrt{\frac{c}{a} \cdot -1}}\right)\\ \end{array} \]

       6. lift-neg.f64 61.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{-\sqrt{\frac{c}{a} \cdot -1}}\\ \end{array} \]

   12. Applied rewrites 61.2%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

   13. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]
   14. Step-by-step derivation

       1. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       2. +-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       3. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       4. metadata-eval N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

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

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       6. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       7. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

       8. lift-*.f64 61.2

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]

   15. Applied rewrites 61.2%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;-\sqrt{\frac{c}{a} \cdot -1}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 69.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c + c}{-2 \cdot b}\\ \mathbf{if}\;b \leq 3.2 \cdot 10^{-178}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (+ c c) (* -2.0 b))))
   (if (<= b 3.2e-178)
     (if (>= b 0.0) (sqrt (/ (- c) a)) t_0)
     (if (>= b 0.0) (/ (* -2.0 b) (+ a a)) t_0))))

C

double code(double a, double b, double c) {
	double t_0 = (c + c) / (-2.0 * b);
	double tmp_1;
	if (b <= 3.2e-178) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = sqrt((-c / a));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (a + a);
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

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
    real(8) :: tmp_1
    real(8) :: tmp_2
    t_0 = (c + c) / ((-2.0d0) * b)
    if (b <= 3.2d-178) then
        if (b >= 0.0d0) then
            tmp_2 = sqrt((-c / a))
        else
            tmp_2 = t_0
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = ((-2.0d0) * b) / (a + a)
    else
        tmp_1 = t_0
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (c + c) / (-2.0 * b);
	double tmp_1;
	if (b <= 3.2e-178) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = Math.sqrt((-c / a));
		} else {
			tmp_2 = t_0;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-2.0 * b) / (a + a);
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = (c + c) / (-2.0 * b)
	tmp_1 = 0
	if b <= 3.2e-178:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = math.sqrt((-c / a))
		else:
			tmp_2 = t_0
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = (-2.0 * b) / (a + a)
	else:
		tmp_1 = t_0
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(c + c) / Float64(-2.0 * b))
	tmp_1 = 0.0
	if (b <= 3.2e-178)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = sqrt(Float64(Float64(-c) / a));
		else
			tmp_2 = t_0;
		end
		tmp_1 = tmp_2;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(-2.0 * b) / Float64(a + a));
	else
		tmp_1 = t_0;
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	t_0 = (c + c) / (-2.0 * b);
	tmp_2 = 0.0;
	if (b <= 3.2e-178)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = sqrt((-c / a));
		else
			tmp_3 = t_0;
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = (-2.0 * b) / (a + a);
	else
		tmp_2 = t_0;
	end
	tmp_4 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 3.2000000000000001e-178

   1. Initial program 72.7%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 64.2%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 3.4%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 3.4

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 3.4%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 59.9

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 59.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

   15. Applied rewrites 63.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   if 3.2000000000000001e-178 < b

   1. Initial program 72.5%

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

   2. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
   3. Step-by-step derivation

   4. Applied rewrites 77.9%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

   5. Taylor expanded in a around 0

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   6. Step-by-step derivation

   7. Applied rewrites 77.9%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
   8. Step-by-step derivation

      1. pow2 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      2. associate-*r* 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      3. fp-cancel-sub-sign-inv 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      4. metadata-eval 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      5. +-commutative 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      6. associate-*r* 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      7. pow2 77.9

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      8. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      9. pow2 N/A

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

      10. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. Applied rewrites 77.9%

      \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

   10. Taylor expanded in b around -inf

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
   11. Step-by-step derivation

       1. lower-*.f64 77.9

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

   12. Applied rewrites 77.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

   13. Taylor expanded in a around 0

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
   14. Step-by-step derivation

       1. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       2. +-commutative N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       3. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       4. metadata-eval N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

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

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       6. associate-*r* N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       7. pow2 N/A

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

       8. lift-*.f64 77.9

          \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{-2 \cdot \color{blue}{b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]

   15. Applied rewrites 77.9%

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b}}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 41.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\sqrt{\frac{-c}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (sqrt (/ (- c) a)) (/ (+ c c) (* -2.0 b))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.6%

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

2. Taylor expanded in a around 0

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]
3. Step-by-step derivation

4. Applied rewrites 70.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \color{blue}{b}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}\\ \end{array} \]

5. Taylor expanded in a around 0

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
6. Step-by-step derivation

7. Applied rewrites 35.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\color{blue}{\left(-b\right) + b}}\\ \end{array} \]
8. Step-by-step derivation

   1. pow2 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   2. associate-*r* 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   3. fp-cancel-sub-sign-inv 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   4. metadata-eval 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   5. +-commutative 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   6. associate-*r* 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   7. pow2 35.2

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   8. pow2 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lift-*.f64, \left(2 \cdot a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   9. pow2 N/A

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(count-2-rev, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

   10. pow2 N/A

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{\mathsf{Rewrite=>}\left(lower-+.f64, \left(a + a\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) + b}\\ \end{array} \]

9. Applied rewrites 35.2%

   \[\leadsto \color{blue}{\begin{array}{l} \color{blue}{\mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{b + \left(-b\right)}\\ } \end{array}} \]

10. Taylor expanded in b around -inf

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]
11. Step-by-step derivation

    1. lower-*.f64 67.6

       \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{\color{blue}{-2 \cdot b}}\\ \end{array} \]

12. Applied rewrites 67.6%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{a + a}\\ \mathbf{else}:\\ \;\;\;\;\color{blue}{\frac{c + c}{-2 \cdot b}}\\ \end{array} \]

13. Taylor expanded in a around -inf

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{c}{a}} \cdot \sqrt{-1}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
14. Step-by-step derivation

15. Applied rewrites 41.8%

    \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{\sqrt{\frac{-c}{a}}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c + c}{-2 \cdot b}\\ \end{array} \]
16. Add Preprocessing

Reproduce

herbie shell --seed 2025120 
(FPCore (a b c)
  :name "jeff quadratic root 1"
  :precision binary64
  (if (>= b 0.0) (/ (- (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)) (/ (* 2.0 c) (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))))))