jeff quadratic root 1

Percentage Accurate: 70.8% → 89.8%

Time: 16.1s

Alternatives: 5

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: 70.8% 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: 89.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b b) (* c (* a 4.0))))))
   (if (or (<= b -4.6e+88) (not (<= b 1.32e+54)))
     (if (>= b 0.0) (- (/ b a)) (/ (- c) b))
     (if (>= b 0.0) (/ (- (- b) t_0) (* a 2.0)) (/ (* c 2.0) (- t_0 b))))))

C

double code(double a, double b, double c) {
	double t_0 = sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if ((b <= -4.6e+88) || !(b <= 1.32e+54)) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -(b / a);
		} else {
			tmp_2 = -c / b;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-b - t_0) / (a * 2.0);
	} else {
		tmp_1 = (c * 2.0) / (t_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 = sqrt(((b * b) - (c * (a * 4.0d0))))
    if ((b <= (-4.6d+88)) .or. (.not. (b <= 1.32d+54))) then
        if (b >= 0.0d0) then
            tmp_2 = -(b / a)
        else
            tmp_2 = -c / b
        end if
        tmp_1 = tmp_2
    else if (b >= 0.0d0) then
        tmp_1 = (-b - t_0) / (a * 2.0d0)
    else
        tmp_1 = (c * 2.0d0) / (t_0 - b)
    end if
    code = tmp_1
end function

Java

public static double code(double a, double b, double c) {
	double t_0 = Math.sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if ((b <= -4.6e+88) || !(b <= 1.32e+54)) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = -(b / a);
		} else {
			tmp_2 = -c / b;
		}
		tmp_1 = tmp_2;
	} else if (b >= 0.0) {
		tmp_1 = (-b - t_0) / (a * 2.0);
	} else {
		tmp_1 = (c * 2.0) / (t_0 - b);
	}
	return tmp_1;
}

Python

def code(a, b, c):
	t_0 = math.sqrt(((b * b) - (c * (a * 4.0))))
	tmp_1 = 0
	if (b <= -4.6e+88) or not (b <= 1.32e+54):
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = -(b / a)
		else:
			tmp_2 = -c / b
		tmp_1 = tmp_2
	elif b >= 0.0:
		tmp_1 = (-b - t_0) / (a * 2.0)
	else:
		tmp_1 = (c * 2.0) / (t_0 - b)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0))))
	tmp_1 = 0.0
	if ((b <= -4.6e+88) || !(b <= 1.32e+54))
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(-Float64(b / a));
		else
			tmp_2 = Float64(Float64(-c) / b);
		end
		tmp_1 = tmp_2;
	elseif (b >= 0.0)
		tmp_1 = Float64(Float64(Float64(-b) - t_0) / Float64(a * 2.0));
	else
		tmp_1 = Float64(Float64(c * 2.0) / Float64(t_0 - b));
	end
	return tmp_1
end

MATLAB

function tmp_4 = code(a, b, c)
	t_0 = sqrt(((b * b) - (c * (a * 4.0))));
	tmp_2 = 0.0;
	if ((b <= -4.6e+88) || ~((b <= 1.32e+54)))
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = -(b / a);
		else
			tmp_3 = -c / b;
		end
		tmp_2 = tmp_3;
	elseif (b >= 0.0)
		tmp_2 = (-b - t_0) / (a * 2.0);
	else
		tmp_2 = (c * 2.0) / (t_0 - b);
	end
	tmp_4 = tmp_2;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.6000000000000003e88 or 1.3200000000000001e54 < b

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

   3. Taylor expanded in b around -inf 74.5%

      \[\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}:\\ \;\;\;\;-1 \cdot \frac{c}{b}\\ \end{array} \]
   4. Step-by-step derivation

      1. associate-*r/ 74.5%

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

      2. mul-1-neg 74.5%

         \[\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{-c}{b}\\ \end{array} \]

   5. Simplified 74.5%

      \[\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{-c}{b}\\ \end{array} \]

   6. Taylor expanded in b around inf 97.3%

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

      1. mul-1-neg 97.3%

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

   8. Simplified 97.3%

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

   if -4.6000000000000003e88 < b < 1.3200000000000001e54

   1. Initial program 84.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. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 90.9%

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

Alternative 2: 89.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (if (>= b 0.0) (- (/ b a)) (/ (- c) b)))
        (t_1 (sqrt (- (* b b) (* c (* a 4.0))))))
   (if (<= b -4e+88)
     t_0
     (if (<= b -5.5e-299)
       (if (>= b 0.0) (/ (* b -2.0) (* a 2.0)) (/ (* c 2.0) (- t_1 b)))
       (if (<= b 1.18e+58)
         (if (>= b 0.0)
           (/ (- (- b) t_1) (* a 2.0))
           (/ (* 2.0 (+ (sqrt (* a (/ c -4.0))) (/ b 4.0))) (- a)))
         t_0)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b >= 0.0) {
		tmp = -(b / a);
	} else {
		tmp = -c / b;
	}
	double t_0 = tmp;
	double t_1 = sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if (b <= -4e+88) {
		tmp_1 = t_0;
	} else if (b <= -5.5e-299) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (b * -2.0) / (a * 2.0);
		} else {
			tmp_2 = (c * 2.0) / (t_1 - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.18e+58) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - t_1) / (a * 2.0);
		} else {
			tmp_3 = (2.0 * (sqrt((a * (c / -4.0))) + (b / 4.0))) / -a;
		}
		tmp_1 = tmp_3;
	} else {
		tmp_1 = t_0;
	}
	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
    if (b >= 0.0d0) then
        tmp = -(b / a)
    else
        tmp = -c / b
    end if
    t_0 = tmp
    t_1 = sqrt(((b * b) - (c * (a * 4.0d0))))
    if (b <= (-4d+88)) then
        tmp_1 = t_0
    else if (b <= (-5.5d-299)) then
        if (b >= 0.0d0) then
            tmp_2 = (b * (-2.0d0)) / (a * 2.0d0)
        else
            tmp_2 = (c * 2.0d0) / (t_1 - b)
        end if
        tmp_1 = tmp_2
    else if (b <= 1.18d+58) then
        if (b >= 0.0d0) then
            tmp_3 = (-b - t_1) / (a * 2.0d0)
        else
            tmp_3 = (2.0d0 * (sqrt((a * (c / (-4.0d0)))) + (b / 4.0d0))) / -a
        end if
        tmp_1 = tmp_3
    else
        tmp_1 = t_0
    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 = -(b / a);
	} else {
		tmp = -c / b;
	}
	double t_0 = tmp;
	double t_1 = Math.sqrt(((b * b) - (c * (a * 4.0))));
	double tmp_1;
	if (b <= -4e+88) {
		tmp_1 = t_0;
	} else if (b <= -5.5e-299) {
		double tmp_2;
		if (b >= 0.0) {
			tmp_2 = (b * -2.0) / (a * 2.0);
		} else {
			tmp_2 = (c * 2.0) / (t_1 - b);
		}
		tmp_1 = tmp_2;
	} else if (b <= 1.18e+58) {
		double tmp_3;
		if (b >= 0.0) {
			tmp_3 = (-b - t_1) / (a * 2.0);
		} else {
			tmp_3 = (2.0 * (Math.sqrt((a * (c / -4.0))) + (b / 4.0))) / -a;
		}
		tmp_1 = tmp_3;
	} else {
		tmp_1 = t_0;
	}
	return tmp_1;
}

Python

def code(a, b, c):
	tmp = 0
	if b >= 0.0:
		tmp = -(b / a)
	else:
		tmp = -c / b
	t_0 = tmp
	t_1 = math.sqrt(((b * b) - (c * (a * 4.0))))
	tmp_1 = 0
	if b <= -4e+88:
		tmp_1 = t_0
	elif b <= -5.5e-299:
		tmp_2 = 0
		if b >= 0.0:
			tmp_2 = (b * -2.0) / (a * 2.0)
		else:
			tmp_2 = (c * 2.0) / (t_1 - b)
		tmp_1 = tmp_2
	elif b <= 1.18e+58:
		tmp_3 = 0
		if b >= 0.0:
			tmp_3 = (-b - t_1) / (a * 2.0)
		else:
			tmp_3 = (2.0 * (math.sqrt((a * (c / -4.0))) + (b / 4.0))) / -a
		tmp_1 = tmp_3
	else:
		tmp_1 = t_0
	return tmp_1

Julia

function code(a, b, c)
	tmp = 0.0
	if (b >= 0.0)
		tmp = Float64(-Float64(b / a));
	else
		tmp = Float64(Float64(-c) / b);
	end
	t_0 = tmp
	t_1 = sqrt(Float64(Float64(b * b) - Float64(c * Float64(a * 4.0))))
	tmp_1 = 0.0
	if (b <= -4e+88)
		tmp_1 = t_0;
	elseif (b <= -5.5e-299)
		tmp_2 = 0.0
		if (b >= 0.0)
			tmp_2 = Float64(Float64(b * -2.0) / Float64(a * 2.0));
		else
			tmp_2 = Float64(Float64(c * 2.0) / Float64(t_1 - b));
		end
		tmp_1 = tmp_2;
	elseif (b <= 1.18e+58)
		tmp_3 = 0.0
		if (b >= 0.0)
			tmp_3 = Float64(Float64(Float64(-b) - t_1) / Float64(a * 2.0));
		else
			tmp_3 = Float64(Float64(2.0 * Float64(sqrt(Float64(a * Float64(c / -4.0))) + Float64(b / 4.0))) / Float64(-a));
		end
		tmp_1 = tmp_3;
	else
		tmp_1 = t_0;
	end
	return tmp_1
end

MATLAB

function tmp_5 = code(a, b, c)
	tmp = 0.0;
	if (b >= 0.0)
		tmp = -(b / a);
	else
		tmp = -c / b;
	end
	t_0 = tmp;
	t_1 = sqrt(((b * b) - (c * (a * 4.0))));
	tmp_2 = 0.0;
	if (b <= -4e+88)
		tmp_2 = t_0;
	elseif (b <= -5.5e-299)
		tmp_3 = 0.0;
		if (b >= 0.0)
			tmp_3 = (b * -2.0) / (a * 2.0);
		else
			tmp_3 = (c * 2.0) / (t_1 - b);
		end
		tmp_2 = tmp_3;
	elseif (b <= 1.18e+58)
		tmp_4 = 0.0;
		if (b >= 0.0)
			tmp_4 = (-b - t_1) / (a * 2.0);
		else
			tmp_4 = (2.0 * (sqrt((a * (c / -4.0))) + (b / 4.0))) / -a;
		end
		tmp_2 = tmp_4;
	else
		tmp_2 = t_0;
	end
	tmp_5 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = If[GreaterEqual[b, 0.0], (-N[(b / a), $MachinePrecision]), N[((-c) / b), $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, -4e+88], t$95$0, If[LessEqual[b, -5.5e-299], If[GreaterEqual[b, 0.0], N[(N[(b * -2.0), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(c * 2.0), $MachinePrecision] / N[(t$95$1 - b), $MachinePrecision]), $MachinePrecision]], If[LessEqual[b, 1.18e+58], If[GreaterEqual[b, 0.0], N[(N[((-b) - t$95$1), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[(N[Sqrt[N[(a * N[(c / -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(b / 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-a)), $MachinePrecision]], t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.99999999999999984e88 or 1.18000000000000003e58 < b

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

   3. Taylor expanded in b around -inf 74.5%

      \[\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}:\\ \;\;\;\;-1 \cdot \frac{c}{b}\\ \end{array} \]
   4. Step-by-step derivation

      1. associate-*r/ 74.5%

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

      2. mul-1-neg 74.5%

         \[\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{-c}{b}\\ \end{array} \]

   5. Simplified 74.5%

      \[\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{-c}{b}\\ \end{array} \]

   6. Taylor expanded in b around inf 97.3%

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

      1. mul-1-neg 97.3%

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

   8. Simplified 97.3%

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

   if -3.99999999999999984e88 < b < -5.5e-299

   1. Initial program 81.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 81.4%

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

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

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

   if -5.5e-299 < b < 1.18000000000000003e58

   1. Initial program 88.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. Add Preprocessing
   3. Step-by-step derivation

      1. add-cube-cbrt 88.7%

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

      2. pow3 88.7%

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

      3. *-commutative 88.7%

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

      4. associate-*l* 88.7%

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

   4. Applied egg-rr 88.7%

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

   5. Taylor expanded in a around -inf 85.5%

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

      1. mul-1-neg 85.5%

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

      2. distribute-lft-out 85.5%

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

      3. rem-cube-cbrt 85.5%

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

      4. associate-/l* 85.5%

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

      5. rem-cube-cbrt 85.5%

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

      6. unpow2 85.5%

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

      7. rem-square-sqrt 88.8%

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

      8. metadata-eval 88.8%

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

   7. Simplified 88.8%

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

4. Final simplification 90.9%

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

Alternative 3: 78.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.55e+81)
   (if (>= b 0.0) (- (/ b a)) (/ (- c) b))
   (if (>= b 0.0)
     (/ (* b -2.0) (* a 2.0))
     (/ (* c 2.0) (- (sqrt (- (* b b) (* c (* a 4.0)))) b)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -1.55e81

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

   3. Taylor expanded in b around -inf 94.3%

      \[\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}:\\ \;\;\;\;-1 \cdot \frac{c}{b}\\ \end{array} \]
   4. Step-by-step derivation

      1. associate-*r/ 94.3%

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

      2. mul-1-neg 94.3%

         \[\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{-c}{b}\\ \end{array} \]

   5. Simplified 94.3%

      \[\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{-c}{b}\\ \end{array} \]

   6. Taylor expanded in b around inf 94.3%

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

      1. mul-1-neg 94.3%

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

   8. Simplified 94.3%

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

   if -1.55e81 < b

   1. Initial program 75.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 77.4%

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

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

      \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\frac{\color{blue}{b \cdot -2}}{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. Recombined 2 regimes into one program.

4. Final simplification 81.3%

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

Alternative 4: 73.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -8.2e-60)
   (if (>= b 0.0) (- (/ b a)) (/ (- c) b))
   (if (>= b 0.0)
     (fma -1.0 (/ b a) (/ c b))
     (/ (* 2.0 (+ (sqrt (* a (/ c -4.0))) (/ b 4.0))) (- a)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -8.20000000000000025e-60

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

   3. Taylor expanded in b around -inf 87.5%

      \[\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}:\\ \;\;\;\;-1 \cdot \frac{c}{b}\\ \end{array} \]
   4. Step-by-step derivation

      1. associate-*r/ 87.5%

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

      2. mul-1-neg 87.5%

         \[\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{-c}{b}\\ \end{array} \]

   5. Simplified 87.5%

      \[\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{-c}{b}\\ \end{array} \]

   6. Taylor expanded in b around inf 87.5%

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

      1. mul-1-neg 87.5%

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

   8. Simplified 87.5%

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

   if -8.20000000000000025e-60 < b

   1. Initial program 72.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. Step-by-step derivation

      1. add-cube-cbrt 72.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}{\left(-b\right) + \sqrt{b \cdot b - \left(\sqrt[3]{\left(4 \cdot a\right) \cdot c} \cdot \sqrt[3]{\left(4 \cdot a\right) \cdot c}\right) \cdot \sqrt[3]{\left(4 \cdot a\right) \cdot c}}}\\ \end{array} \]

      2. pow3 72.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}{\left(-b\right) + \sqrt{b \cdot b - {\left(\sqrt[3]{\left(4 \cdot a\right) \cdot c}\right)}^{3}}}\\ \end{array} \]

      3. *-commutative 72.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}{\left(-b\right) + \sqrt{b \cdot b - {\left(\sqrt[3]{\left(a \cdot 4\right) \cdot c}\right)}^{3}}}\\ \end{array} \]

      4. associate-*l* 72.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}{\left(-b\right) + \sqrt{b \cdot b - {\left(\sqrt[3]{a \cdot \left(4 \cdot c\right)}\right)}^{3}}}\\ \end{array} \]

   4. Applied egg-rr 72.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}{\left(-b\right) + \sqrt{b \cdot b - {\left(\sqrt[3]{a \cdot \left(4 \cdot c\right)}\right)}^{3}}}\\ \end{array} \]

   5. Taylor expanded in a around -inf 53.8%

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

      1. mul-1-neg 53.8%

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

      2. distribute-lft-out 53.8%

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

      3. rem-cube-cbrt 53.8%

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

      4. associate-/l* 53.8%

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

      5. rem-cube-cbrt 53.8%

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

      6. unpow2 53.8%

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

      7. rem-square-sqrt 70.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 \left(\sqrt{a \cdot \frac{c}{-4}} + \frac{b}{-4 \cdot -1}\right)}{a}\\ \end{array} \]

      8. metadata-eval 70.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 \left(\sqrt{a \cdot \frac{c}{-4}} + \frac{b}{4}\right)}{a}\\ \end{array} \]

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

   8. Taylor expanded in c around 0 73.3%

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

      1. fma-define 73.3%

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

   10. Simplified 73.3%

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

4. Final simplification 78.3%

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

Alternative 5: 67.9% accurate, 13.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;-\frac{b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[a_, b_, c_] := If[GreaterEqual[b, 0.0], (-N[(b / a), $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 68.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}:\\ \;\;\;\;-1 \cdot \frac{c}{b}\\ \end{array} \]
4. Step-by-step derivation

   1. associate-*r/ 68.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{-1 \cdot c}{b}\\ \end{array} \]

   2. mul-1-neg 68.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{-c}{b}\\ \end{array} \]

5. Simplified 68.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{-c}{b}\\ \end{array} \]

6. Taylor expanded in b around inf 70.3%

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

   1. mul-1-neg 70.3%

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

8. Simplified 70.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \geq 0:\\ \;\;\;\;\color{blue}{-\frac{b}{a}}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]
9. Add Preprocessing

Reproduce

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