jeff quadratic root 1

Percentage Accurate: 72.5% → 91.3%

Time: 23.7s

Alternatives: 7

Speedup: 1.0×

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

real(8) function code(a, b, c)
    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.5% 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

real(8) function code(a, b, c)
    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: 91.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(-b\right) - b}{2 \cdot a}\\ t_1 := \sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)}\\ \mathbf{if}\;b \leq -1 \cdot 10^{+154}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(\frac{2 \cdot a}{\frac{b}{c}} - b\right) - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.06 \cdot 10^{+149}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_1}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{t\_1 - b}\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (- (- b) b) (* 2.0 a)))
        (t_1 (sqrt (- (* b b) (* c (* a 4.0))))))
   (if (<= b -1e+154)
     (if (>= b 0.0) t_0 (/ (* 2.0 c) (- (- (/ (* 2.0 a) (/ b c)) b) b)))
     (if (<= b 1.06e+149)
       (if (>= b 0.0) (/ (- (- b) t_1) (* 2.0 a)) (/ (* 2.0 c) (- t_1 b)))
       (if (>= b 0.0) t_0 (/ b a))))))

C

double code(double a, double b, double c) {
	double t_0 = (-b - b) / (2.0 * a);
	double t_1 = sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if (b <= -1e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.06e+149) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - t_1) / (2.0 * a);
		} else {
			tmp_3 = (2.0 * c) / (t_1 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = b / a;
	}
	return tmp_1;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    t_0 = (-b - b) / (2.0d0 * a)
    t_1 = sqrt(((b * b) - (c * (a * 4.0d0))))
    if (b <= (-1d+154)) then
        if (b >= 0.0d0) then
            tmp_2 = t_0
        else
            tmp_2 = (2.0d0 * c) / ((((2.0d0 * a) / (b / c)) - b) - b)
        end if
        tmp_1 = tmp_2
    else if (b <= 1.06d+149) then
        if (b >= 0.0d0) then
            tmp_3 = (-b - t_1) / (2.0d0 * a)
        else
            tmp_3 = (2.0d0 * c) / (t_1 - b)
        end if
        tmp_1 = tmp_3
    else if (b >= 0.0d0) then
        tmp_1 = t_0
    else
        tmp_1 = b / a
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = (-b - b) / (2.0 * a);
	double t_1 = Math.sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if (b <= -1e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0;
		} else {
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.06e+149) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - t_1) / (2.0 * a);
		} else {
			tmp_3 = (2.0 * c) / (t_1 - b);
		}
		tmp_1 = tmp_3;
	} else if (b >= 0.0) {
		tmp_1 = t_0;
	} else {
		tmp_1 = b / a;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = (-b - b) / (2.0 * a)
	t_1 = math.sqrt(((b * b) - (c * (a * 4.0))))
	tmp_1 = 0
	if b <= -1e+154:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_0
		else:
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b)
		tmp_1 = tmp_2
	elif b <= 1.06e+149:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (-b - t_1) / (2.0 * a)
		else:
			tmp_3 = (2.0 * c) / (t_1 - b)
		tmp_1 = tmp_3
	elif b >= 0.0:
		tmp_1 = t_0
	else:
		tmp_1 = b / a
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(Float64(-b) - b) / Float64(2.0 * a))
	t_1 = sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0))))
	tmp_1 = 0.0
	if (b <= -1e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_0;
		else
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(Float64(Float64(2.0 * a) / Float64(b / c)) - b) - b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.06e+149)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(-b) - t_1) / Float64(2.0 * a));
		else
			tmp_3 = Float64(Float64(2.0 * c) / Float64(t_1 - b));
		end
		tmp_1 = tmp_3;
	elseif (b >= 0.0)
		tmp_1 = t_0;
	else
		tmp_1 = Float64(b / a);
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	t_0 = (-b - b) / (2.0 * a);
	t_1 = sqrt(((b * b) - (c * (a * 4.0))));
	tmp_2 = 0.0;
	if (b <= -1e+154)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_0;
		else
			tmp_3 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		end
		tmp_2 = tmp_3;
	elseif (b <= 1.06e+149)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (-b - t_1) / (2.0 * a);
		else
			tmp_4 = (2.0 * c) / (t_1 - b);
		end
		tmp_2 = tmp_4;
	elseif (b >= 0.0)
		tmp_2 = t_0;
	else
		tmp_2 = b / a;
	end
	tmp_5 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.00000000000000004e154

   1. Initial program 37.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. Add Preprocessing

   3. Taylor expanded in b around inf 37.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} \]

   4. Taylor expanded in b around -inf 91.8%

      \[\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) + \left(-1 \cdot b + 2 \cdot \frac{a \cdot c}{b}\right)}}\\ \end{array} \]
   5. Step-by-step derivation

      1. +-commutative 91.8%

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

      2. mul-1-neg 91.8%

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

      3. unsub-neg 91.8%

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

      4. associate-/l* 98.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) + \left(2 \cdot \frac{a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      5. associate-*r/ 98.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)} + \left(\frac{2 \cdot a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      6. *-commutative 98.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(-\color{blue}{b}\right) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}\\ \end{array} \]

   6. Simplified 98.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) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}}\\ \end{array} \]

   if -1.00000000000000004e154 < b < 1.05999999999999993e149

   1. Initial program 85.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. Add Preprocessing

   if 1.05999999999999993e149 < b

   1. Initial program 42.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. Add Preprocessing

   3. Taylor expanded in b around inf 100.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} \]

   4. Taylor expanded in b around -inf 100.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) + \left(-1 \cdot b + 2 \cdot \frac{a \cdot c}{b}\right)}}\\ \end{array} \]

   5. Taylor expanded in c around inf 100.0%

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

4. Final simplification 90.0%

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

Alternative 2: 80.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-b\right) - b\\ t_1 := \frac{2 \cdot c}{t\_0}\\ t_2 := \frac{t\_0}{2 \cdot a}\\ t_3 := \sqrt{c \cdot \left(a \cdot -4\right)}\\ \mathbf{if}\;b \leq -8.5 \cdot 10^{-104}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(\frac{2 \cdot a}{\frac{b}{c}} - b\right) - b}\\ \end{array}\\ \mathbf{elif}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{t\_3 - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.95 \cdot 10^{-153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - t\_3}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (- (- b) b))
        (t_1 (/ (* 2.0 c) t_0))
        (t_2 (/ t_0 (* 2.0 a)))
        (t_3 (sqrt (* c (* a -4.0)))))
   (if (<= b -8.5e-104)
     (if (>= b 0.0) t_2 (/ (* 2.0 c) (- (- (/ (* 2.0 a) (/ b c)) b) b)))
     (if (<= b -1e-310)
       (if (>= b 0.0) t_2 (/ (* 2.0 c) (- t_3 b)))
       (if (<= b 1.95e-153)
         (if (>= b 0.0) (/ (- (- b) t_3) (* 2.0 a)) t_1)
         (if (>= b 0.0) (- (/ c b) (/ b a)) t_1))))))

C

double code(double a, double b, double c) {
	double t_0 = -b - b;
	double t_1 = (2.0 * c) / t_0;
	double t_2 = t_0 / (2.0 * a);
	double t_3 = sqrt((c * (a * -4.0)));
	double tmp_1;
	if (b <= -8.5e-104) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_2;
		} else {
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -1e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_2;
		} else {
			tmp_3 = (2.0 * c) / (t_3 - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 1.95e-153) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (-b - t_3) / (2.0 * a);
		} else {
			tmp_4 = t_1;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) - (b / a);
	} else {
		tmp_1 = t_1;
	}
	return tmp_1;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = -b - b
    t_1 = (2.0d0 * c) / t_0
    t_2 = t_0 / (2.0d0 * a)
    t_3 = sqrt((c * (a * (-4.0d0))))
    if (b <= (-8.5d-104)) then
        if (b >= 0.0d0) then
            tmp_2 = t_2
        else
            tmp_2 = (2.0d0 * c) / ((((2.0d0 * a) / (b / c)) - b) - b)
        end if
        tmp_1 = tmp_2
    else if (b <= (-1d-310)) then
        if (b >= 0.0d0) then
            tmp_3 = t_2
        else
            tmp_3 = (2.0d0 * c) / (t_3 - b)
        end if
        tmp_1 = tmp_3
    else if (b <= 1.95d-153) then
        if (b >= 0.0d0) then
            tmp_4 = (-b - t_3) / (2.0d0 * a)
        else
            tmp_4 = t_1
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) - (b / a)
    else
        tmp_1 = t_1
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = -b - b;
	double t_1 = (2.0 * c) / t_0;
	double t_2 = t_0 / (2.0 * a);
	double t_3 = Math.sqrt((c * (a * -4.0)));
	double tmp_1;
	if (b <= -8.5e-104) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_2;
		} else {
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -1e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = t_2;
		} else {
			tmp_3 = (2.0 * c) / (t_3 - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 1.95e-153) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (-b - t_3) / (2.0 * a);
		} else {
			tmp_4 = t_1;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) - (b / a);
	} else {
		tmp_1 = t_1;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = -b - b
	t_1 = (2.0 * c) / t_0
	t_2 = t_0 / (2.0 * a)
	t_3 = math.sqrt((c * (a * -4.0)))
	tmp_1 = 0
	if b <= -8.5e-104:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_2
		else:
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b)
		tmp_1 = tmp_2
	elif b <= -1e-310:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = t_2
		else:
			tmp_3 = (2.0 * c) / (t_3 - b)
		tmp_1 = tmp_3
	elif b <= 1.95e-153:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = (-b - t_3) / (2.0 * a)
		else:
			tmp_4 = t_1
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c / b) - (b / a)
	else:
		tmp_1 = t_1
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(-b) - b)
	t_1 = Float64(Float64(2.0 * c) / t_0)
	t_2 = Float64(t_0 / Float64(2.0 * a))
	t_3 = sqrt(Float64(c * Float64(a * -4.0)))
	tmp_1 = 0.0
	if (b <= -8.5e-104)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = t_2;
		else
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(Float64(Float64(2.0 * a) / Float64(b / c)) - b) - b));
		end
		tmp_1 = tmp_2;
	elseif (b <= -1e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = t_2;
		else
			tmp_3 = Float64(Float64(2.0 * c) / Float64(t_3 - b));
		end
		tmp_1 = tmp_3;
	elseif (b <= 1.95e-153)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(Float64(-b) - t_3) / Float64(2.0 * a));
		else
			tmp_4 = t_1;
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) - Float64(b / a));
	else
		tmp_1 = t_1;
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = -b - b;
	t_1 = (2.0 * c) / t_0;
	t_2 = t_0 / (2.0 * a);
	t_3 = sqrt((c * (a * -4.0)));
	tmp_2 = 0.0;
	if (b <= -8.5e-104)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_2;
		else
			tmp_3 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		end
		tmp_2 = tmp_3;
	elseif (b <= -1e-310)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = t_2;
		else
			tmp_4 = (2.0 * c) / (t_3 - b);
		end
		tmp_2 = tmp_4;
	elseif (b <= 1.95e-153)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = (-b - t_3) / (2.0 * a);
		else
			tmp_5 = t_1;
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c / b) - (b / a);
	else
		tmp_2 = t_1;
	end
	tmp_6 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[((-b) - b), $MachinePrecision]}, Block[{t$95$1 = N[(N[(2.0 * c), $MachinePrecision] / t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(c * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b, -8.5e-104], If[GreaterEqual[b, 0.0], t$95$2, N[(N[(2.0 * c), $MachinePrecision] / N[(N[(N[(N[(2.0 * a), $MachinePrecision] / N[(b / c), $MachinePrecision]), $MachinePrecision] - b), $MachinePrecision] - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, -1e-310], If[GreaterEqual[b, 0.0], t$95$2, N[(N[(2.0 * c), $MachinePrecision] / N[(t$95$3 - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.95e-153], If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$3), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], t$95$1], If[GreaterEqual[b, 0.0], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -8.50000000000000007e-104

   1. Initial program 68.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. Add Preprocessing

   3. Taylor expanded in b around inf 68.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} \]

   4. Taylor expanded in b around -inf 80.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) + \left(-1 \cdot b + 2 \cdot \frac{a \cdot c}{b}\right)}}\\ \end{array} \]
   5. Step-by-step derivation

      1. +-commutative 80.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) + \left(2 \cdot \frac{a \cdot c}{b} + -1 \cdot b\right)}}\\ \end{array} \]

      2. mul-1-neg 80.6%

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

      3. unsub-neg 80.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) + \left(2 \cdot \frac{a \cdot c}{b} - b\right)}}\\ \end{array} \]

      4. associate-/l* 83.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) + \left(2 \cdot \frac{a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      5. associate-*r/ 83.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)} + \left(\frac{2 \cdot a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      6. *-commutative 83.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(-\color{blue}{b}\right) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}\\ \end{array} \]

   6. Simplified 83.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) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}}\\ \end{array} \]

   if -8.50000000000000007e-104 < b < -9.999999999999969e-311

   1. Initial program 85.3%

      \[\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. Add Preprocessing

   3. Taylor expanded in b around inf 85.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} \]

   4. Taylor expanded in b around 0 80.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)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   5. Step-by-step derivation

      1. associate-*r* 80.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)} + \sqrt{\left(-4 \cdot a\right) \cdot c}}\\ \end{array} \]

   6. Simplified 80.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)} + \sqrt{\left(-4 \cdot a\right) \cdot c}}\\ \end{array} \]

   if -9.999999999999969e-311 < b < 1.9500000000000001e-153

   1. Initial program 60.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. Add Preprocessing

   3. Taylor expanded in b around -inf 60.4%

      \[\leadsto \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}{\color{blue}{\left(-b\right) + -1 \cdot b}}\\ \end{array} \]

   4. Taylor expanded in b around 0 60.4%

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

      1. associate-*r* 9.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)} + \sqrt{\left(-4 \cdot a\right) \cdot c}}\\ \end{array} \]

   6. Simplified 60.4%

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

   if 1.9500000000000001e-153 < b

   1. Initial program 66.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. Add Preprocessing

   3. Taylor expanded in b around -inf 66.4%

      \[\leadsto \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}{\color{blue}{\left(-b\right) + -1 \cdot b}}\\ \end{array} \]

   4. Taylor expanded in b around inf 81.1%

      \[\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) + -1 \cdot b}\\ \end{array} \]
   5. Step-by-step derivation

      1. +-commutative 81.1%

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

      2. mul-1-neg 81.1%

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

      3. unsub-neg 81.1%

         \[\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) + -1 \cdot b}\\ \end{array} \]

   6. Simplified 81.1%

      \[\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) + -1 \cdot b}\\ \end{array} \]
3. Recombined 4 regimes into one program.

4. Final simplification 80.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -8.5 \cdot 10^{-104}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(\frac{2 \cdot a}{\frac{b}{c}} - b\right) - b}\\ \end{array}\\ \mathbf{elif}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{c \cdot \left(a \cdot -4\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.95 \cdot 10^{-153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{c \cdot \left(a \cdot -4\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - 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} \]
5. Add Preprocessing

Alternative 3: 85.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-b\right) - b\\ t_1 := \frac{2 \cdot c}{t\_0}\\ \mathbf{if}\;b \leq -1.1 \cdot 10^{+154}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{t\_0}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(\frac{2 \cdot a}{\frac{b}{c}} - b\right) - b}\\ \end{array}\\ \mathbf{elif}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.95 \cdot 10^{-153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{c \cdot \left(a \cdot -4\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array}\\ \mathbf{elif}\;b \geq 0:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (- (- b) b)) (t_1 (/ (* 2.0 c) t_0)))
   (if (<= b -1.1e+154)
     (if (>= b 0.0)
       (/ t_0 (* 2.0 a))
       (/ (* 2.0 c) (- (- (/ (* 2.0 a) (/ b c)) b) b)))
     (if (<= b -1e-310)
       (if (>= b 0.0)
         (/ c b)
         (/ (* 2.0 c) (- (sqrt (- (* b b) (* c (* a 4.0)))) b)))
       (if (<= b 1.95e-153)
         (if (>= b 0.0) (/ (- (- b) (sqrt (* c (* a -4.0)))) (* 2.0 a)) t_1)
         (if (>= b 0.0) (- (/ c b) (/ b a)) t_1))))))

C

double code(double a, double b, double c) {
	double t_0 = -b - b;
	double t_1 = (2.0 * c) / t_0;
	double tmp_1;
	if (b <= -1.1e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0 / (2.0 * a);
		} else {
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -1e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = c / b;
		} else {
			tmp_3 = (2.0 * c) / (sqrt(((b * b) - (c * (a * 4.0)))) - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 1.95e-153) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (-b - sqrt((c * (a * -4.0)))) / (2.0 * a);
		} else {
			tmp_4 = t_1;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) - (b / a);
	} else {
		tmp_1 = t_1;
	}
	return tmp_1;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    real(8) :: tmp_3
    real(8) :: tmp_4
    t_0 = -b - b
    t_1 = (2.0d0 * c) / t_0
    if (b <= (-1.1d+154)) then
        if (b >= 0.0d0) then
            tmp_2 = t_0 / (2.0d0 * a)
        else
            tmp_2 = (2.0d0 * c) / ((((2.0d0 * a) / (b / c)) - b) - b)
        end if
        tmp_1 = tmp_2
    else if (b <= (-1d-310)) then
        if (b >= 0.0d0) then
            tmp_3 = c / b
        else
            tmp_3 = (2.0d0 * c) / (sqrt(((b * b) - (c * (a * 4.0d0)))) - b)
        end if
        tmp_1 = tmp_3
    else if (b <= 1.95d-153) then
        if (b >= 0.0d0) then
            tmp_4 = (-b - sqrt((c * (a * (-4.0d0))))) / (2.0d0 * a)
        else
            tmp_4 = t_1
        end if
        tmp_1 = tmp_4
    else if (b >= 0.0d0) then
        tmp_1 = (c / b) - (b / a)
    else
        tmp_1 = t_1
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = -b - b;
	double t_1 = (2.0 * c) / t_0;
	double tmp_1;
	if (b <= -1.1e+154) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = t_0 / (2.0 * a);
		} else {
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= -1e-310) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = c / b;
		} else {
			tmp_3 = (2.0 * c) / (Math.sqrt(((b * b) - (c * (a * 4.0)))) - b);
		}
		tmp_1 = tmp_3;
	} else if (b <= 1.95e-153) {
		double tmp_4;
		if (b >= 0.0) {
			tmp_4 = (-b - Math.sqrt((c * (a * -4.0)))) / (2.0 * a);
		} else {
			tmp_4 = t_1;
		}
		tmp_1 = tmp_4;
	} else if (b >= 0.0) {
		tmp_1 = (c / b) - (b / a);
	} else {
		tmp_1 = t_1;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = -b - b
	t_1 = (2.0 * c) / t_0
	tmp_1 = 0
	if b <= -1.1e+154:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = t_0 / (2.0 * a)
		else:
			tmp_2 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b)
		tmp_1 = tmp_2
	elif b <= -1e-310:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = c / b
		else:
			tmp_3 = (2.0 * c) / (math.sqrt(((b * b) - (c * (a * 4.0)))) - b)
		tmp_1 = tmp_3
	elif b <= 1.95e-153:
		tmp_4 = 0
		if b >= 0.0:
			tmp_4 = (-b - math.sqrt((c * (a * -4.0)))) / (2.0 * a)
		else:
			tmp_4 = t_1
		tmp_1 = tmp_4
	elif b >= 0.0:
		tmp_1 = (c / b) - (b / a)
	else:
		tmp_1 = t_1
	return tmp_1

Julia

function code(a, b, c)
	t_0 = Float64(Float64(-b) - b)
	t_1 = Float64(Float64(2.0 * c) / t_0)
	tmp_1 = 0.0
	if (b <= -1.1e+154)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(t_0 / Float64(2.0 * a));
		else
			tmp_2 = Float64(Float64(2.0 * c) / Float64(Float64(Float64(Float64(2.0 * a) / Float64(b / c)) - b) - b));
		end
		tmp_1 = tmp_2;
	elseif (b <= -1e-310)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(c / b);
		else
			tmp_3 = Float64(Float64(2.0 * c) / Float64(sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0)))) - b));
		end
		tmp_1 = tmp_3;
	elseif (b <= 1.95e-153)
		tmp_4 = 0.0
		if (b >= 0.0)
			tmp_4 = Float64(Float64(Float64(-b) - sqrt(Float64(c * Float64(a * -4.0)))) / Float64(2.0 * a));
		else
			tmp_4 = t_1;
		end
		tmp_1 = tmp_4;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(c / b) - Float64(b / a));
	else
		tmp_1 = t_1;
	end
	return tmp_1
end

MATLAB

function tmp_6 = code(a, b, c)
	t_0 = -b - b;
	t_1 = (2.0 * c) / t_0;
	tmp_2 = 0.0;
	if (b <= -1.1e+154)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = t_0 / (2.0 * a);
		else
			tmp_3 = (2.0 * c) / ((((2.0 * a) / (b / c)) - b) - b);
		end
		tmp_2 = tmp_3;
	elseif (b <= -1e-310)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = c / b;
		else
			tmp_4 = (2.0 * c) / (sqrt(((b * b) - (c * (a * 4.0)))) - b);
		end
		tmp_2 = tmp_4;
	elseif (b <= 1.95e-153)
		tmp_5 = 0.0;
		if (b >= 0.0)
			tmp_5 = (-b - sqrt((c * (a * -4.0)))) / (2.0 * a);
		else
			tmp_5 = t_1;
		end
		tmp_2 = tmp_5;
	elseif (b >= 0.0)
		tmp_2 = (c / b) - (b / a);
	else
		tmp_2 = t_1;
	end
	tmp_6 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if b < -1.1000000000000001e154

   1. Initial program 37.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. Add Preprocessing

   3. Taylor expanded in b around inf 37.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} \]

   4. Taylor expanded in b around -inf 91.8%

      \[\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) + \left(-1 \cdot b + 2 \cdot \frac{a \cdot c}{b}\right)}}\\ \end{array} \]
   5. Step-by-step derivation

      1. +-commutative 91.8%

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

      2. mul-1-neg 91.8%

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

      3. unsub-neg 91.8%

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

      4. associate-/l* 98.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) + \left(2 \cdot \frac{a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      5. associate-*r/ 98.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)} + \left(\frac{2 \cdot a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      6. *-commutative 98.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(-\color{blue}{b}\right) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}\\ \end{array} \]

   6. Simplified 98.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) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}}\\ \end{array} \]

   if -1.1000000000000001e154 < b < -9.999999999999969e-311

   1. Initial program 90.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. Add Preprocessing

   3. Taylor expanded in b around inf 90.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{-2 \cdot b + 2 \cdot \frac{a \cdot c}{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} \]
   4. Step-by-step derivation

      1. *-commutative 90.5%

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{b \cdot -2} + 2 \cdot \frac{a \cdot c}{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} \]

      2. fma-def 90.5%

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{\mathsf{fma}\left(b, -2, 2 \cdot \frac{a \cdot c}{b}\right)}}{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. associate-/l* 90.5%

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(b, -2, 2 \cdot \color{blue}{\frac{a}{\frac{b}{c}}}\right)}{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} \]

      4. associate-*r/ 90.5%

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(b, -2, \color{blue}{\frac{2 \cdot a}{\frac{b}{c}}}\right)}{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. *-commutative 90.5%

         \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\mathsf{fma}\left(b, -2, \frac{\color{blue}{a \cdot 2}}{\frac{b}{c}}\right)}{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. Simplified 90.5%

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{\mathsf{fma}\left(b, -2, \frac{a \cdot 2}{\frac{b}{c}}\right)}}{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} \]

   6. Taylor expanded in b around 0 90.5%

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

   if -9.999999999999969e-311 < b < 1.9500000000000001e-153

   1. Initial program 60.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. Add Preprocessing

   3. Taylor expanded in b around -inf 60.4%

      \[\leadsto \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}{\color{blue}{\left(-b\right) + -1 \cdot b}}\\ \end{array} \]

   4. Taylor expanded in b around 0 60.4%

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

      1. associate-*r* 9.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)} + \sqrt{\left(-4 \cdot a\right) \cdot c}}\\ \end{array} \]

   6. Simplified 60.4%

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

   if 1.9500000000000001e-153 < b

   1. Initial program 66.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. Add Preprocessing

   3. Taylor expanded in b around -inf 66.4%

      \[\leadsto \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}{\color{blue}{\left(-b\right) + -1 \cdot b}}\\ \end{array} \]

   4. Taylor expanded in b around inf 81.1%

      \[\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) + -1 \cdot b}\\ \end{array} \]
   5. Step-by-step derivation

      1. +-commutative 81.1%

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

      2. mul-1-neg 81.1%

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

      3. unsub-neg 81.1%

         \[\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) + -1 \cdot b}\\ \end{array} \]

   6. Simplified 81.1%

      \[\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) + -1 \cdot b}\\ \end{array} \]
3. Recombined 4 regimes into one program.

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.1 \cdot 10^{+154}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - b}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(\frac{2 \cdot a}{\frac{b}{c}} - b\right) - b}\\ \end{array}\\ \mathbf{elif}\;b \leq -1 \cdot 10^{-310}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{c}{b}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\sqrt{b \cdot b - c \cdot \left(a \cdot 4\right)} - b}\\ \end{array}\\ \mathbf{elif}\;b \leq 1.95 \cdot 10^{-153}:\\ \;\;\;\;\begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\left(-b\right) - \sqrt{c \cdot \left(a \cdot -4\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{2 \cdot c}{\left(-b\right) - 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} \]
5. Add Preprocessing

Alternative 4: 74.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (/ (- (- b) b) (* 2.0 a))))
   (if (<= b -8.5e-104)
     (if (>= b 0.0) t_0 (/ (* 2.0 c) (- (- (/ (* 2.0 a) (/ b c)) b) b)))
     (if (>= b 0.0) t_0 (/ (* 2.0 c) (- (sqrt (* c (* a -4.0))) b))))))

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    real(8) :: tmp_1
    real(8) :: tmp_2
    t_0 = (-b - b) / (2.0d0 * a)
    if (b <= (-8.5d-104)) then
        if (b >= 0.0d0) then
            tmp_2 = t_0
        else
            tmp_2 = (2.0d0 * c) / ((((2.0d0 * a) / (b / c)) - b) - b)
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = t_0
    else
        tmp_1 = (2.0d0 * c) / (sqrt((c * (a * (-4.0d0)))) - b)
    end if
    code = tmp_1
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -8.50000000000000007e-104

   1. Initial program 68.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. Add Preprocessing

   3. Taylor expanded in b around inf 68.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} \]

   4. Taylor expanded in b around -inf 80.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) + \left(-1 \cdot b + 2 \cdot \frac{a \cdot c}{b}\right)}}\\ \end{array} \]
   5. Step-by-step derivation

      1. +-commutative 80.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) + \left(2 \cdot \frac{a \cdot c}{b} + -1 \cdot b\right)}}\\ \end{array} \]

      2. mul-1-neg 80.6%

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

      3. unsub-neg 80.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) + \left(2 \cdot \frac{a \cdot c}{b} - b\right)}}\\ \end{array} \]

      4. associate-/l* 83.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) + \left(2 \cdot \frac{a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      5. associate-*r/ 83.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)} + \left(\frac{2 \cdot a}{\frac{b}{c}} - b\right)}\\ \end{array} \]

      6. *-commutative 83.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(-\color{blue}{b}\right) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}\\ \end{array} \]

   6. Simplified 83.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) + \left(\frac{a \cdot 2}{\frac{b}{c}} - b\right)}}\\ \end{array} \]

   if -8.50000000000000007e-104 < b

   1. Initial program 69.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. Add Preprocessing

   3. Taylor expanded in b around inf 71.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} \]

   4. Taylor expanded in b around 0 70.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)} + \sqrt{-4 \cdot \left(a \cdot c\right)}}\\ \end{array} \]
   5. Step-by-step derivation

      1. associate-*r* 70.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)} + \sqrt{\left(-4 \cdot a\right) \cdot c}}\\ \end{array} \]

   6. Simplified 70.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)} + \sqrt{\left(-4 \cdot a\right) \cdot c}}\\ \end{array} \]
3. Recombined 2 regimes into one program.

4. Final simplification 75.9%

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

Alternative 5: 36.3% accurate, 9.3× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (/ (- (- b) b) (* 2.0 a)) (/ b a)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - b) / (2.0 * a);
	} else {
		tmp = b / a;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b >= 0.0d0) then
        tmp = (-b - b) / (2.0d0 * a)
    else
        tmp = b / a
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - b) / (2.0 * a);
	} else {
		tmp = b / a;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = (-b - b) / (2.0 * a)
	else:
		tmp = b / a
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - b) / Float64(2.0 * a));
	else
		tmp = Float64(b / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - b) / (2.0 * a);
	else
		tmp = b / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[(N[((-b) - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[(b / a), $MachinePrecision]]

Derivation

1. Initial program 69.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. Add Preprocessing

3. Taylor expanded in b around inf 70.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} \]

4. Taylor expanded in b around -inf 66.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) + \left(-1 \cdot b + 2 \cdot \frac{a \cdot c}{b}\right)}}\\ \end{array} \]

5. Taylor expanded in c around inf 33.5%

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

6. Final simplification 33.5%

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

Alternative 6: 68.1% accurate, 9.3× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (>= b 0.0) (/ (- (- b) b) (* 2.0 a)) (/ (- c) b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b >= 0.0d0) then
        tmp = (-b - b) / (2.0d0 * a)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = (-b - b) / (2.0 * a);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = (-b - b) / (2.0 * a)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(Float64(-b) - b) / Float64(2.0 * a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (-b - b) / (2.0 * a);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], N[(N[((-b) - b), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]

Derivation

1. Initial program 69.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. Add Preprocessing

3. Taylor expanded in b around inf 70.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} \]

4. Taylor expanded in b around -inf 67.4%

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

   1. associate-*r/ 67.4%

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

   2. neg-mul-1 67.4%

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

6. Simplified 67.4%

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

7. Final simplification 67.4%

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

Alternative 7: 68.3% accurate, 9.3× speedup

Math

\[\begin{array}{l} \\ \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} \end{array} \]

FPCore

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b >= 0.0d0) then
        tmp = (c / b) - (b / a)
    else
        tmp = (2.0d0 * c) / (-b - 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 = (c / b) - (b / a);
	} else {
		tmp = (2.0 * c) / (-b - b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = (c / b) - (b / a)
	else:
		tmp = (2.0 * c) / (-b - b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	else
		tmp = Float64(Float64(2.0 * c) / Float64(Float64(-b) - b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = (c / b) - (b / a);
	else
		tmp = (2.0 * c) / (-b - b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := 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. Initial program 69.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. Add Preprocessing

3. Taylor expanded in b around -inf 66.2%

   \[\leadsto \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}{\color{blue}{\left(-b\right) + -1 \cdot b}}\\ \end{array} \]

4. Taylor expanded in b around inf 67.6%

   \[\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) + -1 \cdot b}\\ \end{array} \]
5. Step-by-step derivation

   1. +-commutative 67.6%

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

   2. mul-1-neg 67.6%

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

   3. unsub-neg 67.6%

      \[\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) + -1 \cdot b}\\ \end{array} \]

6. Simplified 67.6%

   \[\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) + -1 \cdot b}\\ \end{array} \]

7. Final simplification 67.6%

   \[\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} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024031 
(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)))))))