quadp (p42, positive)

Percentage Accurate: 51.9% → 84.6%

Time: 13.9s

Alternatives: 7

Speedup: 12.9×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Initial Program: 51.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

Java

public static double code(double a, double b, double c) {
	return (-b + Math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
}

Python

def code(a, b, c):
	return (-b + math.sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a)

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

MATLAB

function tmp = code(a, b, c)
	tmp = (-b + sqrt(((b * b) - (4.0 * (a * c))))) / (2.0 * a);
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

Alternative 1: 84.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e+135)
   (/ b (- a))
   (if (<= b 1.05e-152)
     (/ (- (sqrt (- (* b b) (* 4.0 (* a c)))) b) (* a 2.0))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e+135) {
		tmp = b / -a;
	} else if (b <= 1.05e-152) {
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} 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 <= (-4.8d+135)) then
        tmp = b / -a
    else if (b <= 1.05d-152) then
        tmp = (sqrt(((b * b) - (4.0d0 * (a * c)))) - b) / (a * 2.0d0)
    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 <= -4.8e+135) {
		tmp = b / -a;
	} else if (b <= 1.05e-152) {
		tmp = (Math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.8e+135:
		tmp = b / -a
	elif b <= 1.05e-152:
		tmp = (math.sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e+135)
		tmp = Float64(b / Float64(-a));
	elseif (b <= 1.05e-152)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.8e+135)
		tmp = b / -a;
	elseif (b <= 1.05e-152)
		tmp = (sqrt(((b * b) - (4.0 * (a * c)))) - b) / (a * 2.0);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e+135], N[(b / (-a)), $MachinePrecision], If[LessEqual[b, 1.05e-152], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.79999999999999995e135

   1. Initial program 53.0%

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

      1. *-commutative 53.0%

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

   3. Simplified 53.0%

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

   5. Taylor expanded in b around -inf 98.3%

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

      1. associate-*r/ 98.3%

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

      2. mul-1-neg 98.3%

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

   7. Simplified 98.3%

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

   if -4.79999999999999995e135 < b < 1.04999999999999999e-152

   1. Initial program 86.7%

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

   if 1.04999999999999999e-152 < b

   1. Initial program 22.2%

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

      1. *-commutative 22.2%

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

   3. Simplified 22.2%

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

   5. Taylor expanded in b around inf 83.5%

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

      1. associate-*r/ 83.5%

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

      2. neg-mul-1 83.5%

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

   7. Simplified 83.5%

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

4. Final simplification 87.8%

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

Alternative 2: 78.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -10000:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.05 \cdot 10^{-152}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{-b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -10000.0)
   (- (/ c b) (/ b a))
   (if (<= b 1.05e-152)
     (/ (- (sqrt (* a (* c -4.0))) b) (* a 2.0))
     (/ c (- b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -10000.0) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.05e-152) {
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} 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 <= (-10000.0d0)) then
        tmp = (c / b) - (b / a)
    else if (b <= 1.05d-152) then
        tmp = (sqrt((a * (c * (-4.0d0)))) - b) / (a * 2.0d0)
    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 <= -10000.0) {
		tmp = (c / b) - (b / a);
	} else if (b <= 1.05e-152) {
		tmp = (Math.sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -10000.0:
		tmp = (c / b) - (b / a)
	elif b <= 1.05e-152:
		tmp = (math.sqrt((a * (c * -4.0))) - b) / (a * 2.0)
	else:
		tmp = c / -b
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -10000.0)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 1.05e-152)
		tmp = Float64(Float64(sqrt(Float64(a * Float64(c * -4.0))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(c / Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -10000.0)
		tmp = (c / b) - (b / a);
	elseif (b <= 1.05e-152)
		tmp = (sqrt((a * (c * -4.0))) - b) / (a * 2.0);
	else
		tmp = c / -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -10000.0], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.05e-152], N[(N[(N[Sqrt[N[(a * N[(c * -4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(c / (-b)), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1e4

   1. Initial program 68.8%

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

      1. *-commutative 68.8%

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

   3. Simplified 68.8%

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

   5. Taylor expanded in b around -inf 94.5%

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

      1. +-commutative 94.5%

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

      2. mul-1-neg 94.5%

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

      3. unsub-neg 94.5%

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

   7. Simplified 94.5%

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

   if -1e4 < b < 1.04999999999999999e-152

   1. Initial program 81.1%

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

      1. *-commutative 81.1%

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

   3. Simplified 81.1%

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

   5. Taylor expanded in b around 0 68.8%

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

      1. *-commutative 68.8%

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

      2. associate-*r* 68.8%

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

   7. Simplified 68.8%

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

   if 1.04999999999999999e-152 < b

   1. Initial program 22.2%

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

      1. *-commutative 22.2%

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

   3. Simplified 22.2%

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

   5. Taylor expanded in b around inf 83.5%

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

      1. associate-*r/ 83.5%

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

      2. neg-mul-1 83.5%

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

   7. Simplified 83.5%

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

4. Final simplification 83.3%

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

Alternative 3: 68.0% accurate, 9.7× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5e-310) {
		tmp = (c / b) - (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 <= (-5d-310)) then
        tmp = (c / b) - (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 <= -5e-310) {
		tmp = (c / b) - (b / a);
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < -4.999999999999985e-310

   1. Initial program 74.1%

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

      1. *-commutative 74.1%

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

   3. Simplified 74.1%

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

   5. Taylor expanded in b around -inf 71.6%

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

      1. +-commutative 71.6%

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

      2. mul-1-neg 71.6%

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

      3. unsub-neg 71.6%

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

   7. Simplified 71.6%

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

   if -4.999999999999985e-310 < b

   1. Initial program 30.6%

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

      1. *-commutative 30.6%

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

   3. Simplified 30.6%

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

   5. Taylor expanded in b around inf 71.8%

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

      1. associate-*r/ 71.8%

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

      2. neg-mul-1 71.8%

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

   7. Simplified 71.8%

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

4. Final simplification 71.7%

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

Alternative 4: 43.2% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (if (<= b 1.25e+33) (/ b (- a)) (/ c b)))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 1.25e+33) {
		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 <= 1.25d+33) then
        tmp = b / -a
    else
        tmp = c / b
    end if
    code = tmp
end function

Java

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

Python

def code(a, b, c):
	tmp = 0
	if b <= 1.25e+33:
		tmp = b / -a
	else:
		tmp = c / b
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 1.24999999999999993e33

   1. Initial program 68.1%

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

      1. *-commutative 68.1%

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

   3. Simplified 68.1%

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

   5. Taylor expanded in b around -inf 52.1%

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

      1. associate-*r/ 52.1%

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

      2. mul-1-neg 52.1%

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

   7. Simplified 52.1%

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

   if 1.24999999999999993e33 < b

   1. Initial program 16.1%

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

      1. *-commutative 16.1%

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

   3. Simplified 16.1%

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

   5. Taylor expanded in b around inf 75.1%

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

      1. frac-2neg 75.1%

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

      2. div-inv 75.2%

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

      3. *-commutative 75.2%

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

      4. distribute-rgt-neg-in 75.2%

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

      5. add-sqr-sqrt 0.0%

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

      6. sqrt-unprod 33.6%

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

      7. sqr-neg 33.6%

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

      8. sqrt-prod 33.3%

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

      9. add-sqr-sqrt 33.3%

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

   7. Applied egg-rr 33.3%

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

      1. *-commutative 33.3%

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

   9. Simplified 33.3%

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

   10. Taylor expanded in b around 0 33.1%

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

4. Final simplification 46.4%

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

Alternative 5: 67.9% accurate, 12.9× speedup

Math

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

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 3.9e-308) (/ b (- a)) (/ c (- b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 3.9e-308) {
		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 <= 3.9d-308) 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 <= 3.9e-308) {
		tmp = b / -a;
	} else {
		tmp = c / -b;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 3.8999999999999999e-308

   1. Initial program 74.1%

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

      1. *-commutative 74.1%

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

   3. Simplified 74.1%

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

   5. Taylor expanded in b around -inf 71.1%

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

      1. associate-*r/ 71.1%

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

      2. mul-1-neg 71.1%

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

   7. Simplified 71.1%

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

   if 3.8999999999999999e-308 < b

   1. Initial program 30.6%

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

      1. *-commutative 30.6%

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

   3. Simplified 30.6%

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

   5. Taylor expanded in b around inf 71.8%

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

      1. associate-*r/ 71.8%

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

      2. neg-mul-1 71.8%

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

   7. Simplified 71.8%

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

4. Final simplification 71.4%

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

Alternative 6: 2.5% accurate, 38.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = b / a
end function

Java

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

Python

def code(a, b, c):
	return b / a

Julia

function code(a, b, c)
	return Float64(b / a)
end

MATLAB

function tmp = code(a, b, c)
	tmp = b / a;
end

Wolfram

code[a_, b_, c_] := N[(b / a), $MachinePrecision]

Derivation

1. Initial program 52.5%

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

   1. *-commutative 52.5%

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

3. Simplified 52.5%

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

   1. frac-2neg 52.5%

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

   2. div-inv 52.4%

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

6. Applied egg-rr 52.4%

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

   1. fma-define 52.4%

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

   2. +-commutative 52.4%

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

   3. unpow2 52.4%

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

   4. rem-square-sqrt 43.3%

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

   5. hypot-define 51.8%

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

   6. *-commutative 51.8%

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

   7. *-commutative 51.8%

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

   8. *-commutative 51.8%

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

   9. associate-/r* 51.8%

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

   10. metadata-eval 51.8%

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

8. Simplified 51.8%

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

10. Applied egg-rr 23.5%

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

11. Taylor expanded in b around inf 2.5%

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

12. Final simplification 2.5%

    \[\leadsto \frac{b}{a} \]
13. Add Preprocessing

Alternative 7: 10.8% accurate, 38.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = c / b
end function

Java

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

Python

def code(a, b, c):
	return c / b

Julia

function code(a, b, c)
	return Float64(c / b)
end

MATLAB

function tmp = code(a, b, c)
	tmp = c / b;
end

Wolfram

code[a_, b_, c_] := N[(c / b), $MachinePrecision]

Derivation

1. Initial program 52.5%

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

   1. *-commutative 52.5%

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

3. Simplified 52.5%

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

5. Taylor expanded in b around inf 28.8%

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

   1. frac-2neg 28.8%

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

   2. div-inv 28.8%

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

   3. *-commutative 28.8%

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

   4. distribute-rgt-neg-in 28.8%

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

   5. add-sqr-sqrt 1.1%

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

   6. sqrt-unprod 11.3%

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

   7. sqr-neg 11.3%

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

   8. sqrt-prod 10.4%

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

   9. add-sqr-sqrt 12.2%

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

7. Applied egg-rr 12.2%

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

   1. *-commutative 12.2%

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

9. Simplified 12.2%

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

10. Taylor expanded in b around 0 12.3%

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

11. Final simplification 12.3%

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

Developer target: 99.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left|\frac{b}{2}\right|\\ t_1 := \sqrt{\left|a\right|} \cdot \sqrt{\left|c\right|}\\ t_2 := \begin{array}{l} \mathbf{if}\;\mathsf{copysign}\left(a, c\right) = a:\\ \;\;\;\;\sqrt{t\_0 - t\_1} \cdot \sqrt{t\_0 + t\_1}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{hypot}\left(\frac{b}{2}, t\_1\right)\\ \end{array}\\ \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{t\_2 - \frac{b}{2}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{\frac{b}{2} + t\_2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (let* ((t_0 (fabs (/ b 2.0)))
        (t_1 (* (sqrt (fabs a)) (sqrt (fabs c))))
        (t_2
         (if (== (copysign a c) a)
           (* (sqrt (- t_0 t_1)) (sqrt (+ t_0 t_1)))
           (hypot (/ b 2.0) t_1))))
   (if (< b 0.0) (/ (- t_2 (/ b 2.0)) a) (/ (- c) (+ (/ b 2.0) t_2)))))

C

double code(double a, double b, double c) {
	double t_0 = fabs((b / 2.0));
	double t_1 = sqrt(fabs(a)) * sqrt(fabs(c));
	double tmp;
	if (copysign(a, c) == a) {
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	} else {
		tmp = hypot((b / 2.0), t_1);
	}
	double t_2 = tmp;
	double tmp_1;
	if (b < 0.0) {
		tmp_1 = (t_2 - (b / 2.0)) / a;
	} else {
		tmp_1 = -c / ((b / 2.0) + t_2);
	}
	return tmp_1;
}

Java

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

Python

def code(a, b, c):
	t_0 = math.fabs((b / 2.0))
	t_1 = math.sqrt(math.fabs(a)) * math.sqrt(math.fabs(c))
	tmp = 0
	if math.copysign(a, c) == a:
		tmp = math.sqrt((t_0 - t_1)) * math.sqrt((t_0 + t_1))
	else:
		tmp = math.hypot((b / 2.0), t_1)
	t_2 = tmp
	tmp_1 = 0
	if b < 0.0:
		tmp_1 = (t_2 - (b / 2.0)) / a
	else:
		tmp_1 = -c / ((b / 2.0) + t_2)
	return tmp_1

Julia

function code(a, b, c)
	t_0 = abs(Float64(b / 2.0))
	t_1 = Float64(sqrt(abs(a)) * sqrt(abs(c)))
	tmp = 0.0
	if (copysign(a, c) == a)
		tmp = Float64(sqrt(Float64(t_0 - t_1)) * sqrt(Float64(t_0 + t_1)));
	else
		tmp = hypot(Float64(b / 2.0), t_1);
	end
	t_2 = tmp
	tmp_1 = 0.0
	if (b < 0.0)
		tmp_1 = Float64(Float64(t_2 - Float64(b / 2.0)) / a);
	else
		tmp_1 = Float64(Float64(-c) / Float64(Float64(b / 2.0) + t_2));
	end
	return tmp_1
end

MATLAB

function tmp_3 = code(a, b, c)
	t_0 = abs((b / 2.0));
	t_1 = sqrt(abs(a)) * sqrt(abs(c));
	tmp = 0.0;
	if ((sign(c) * abs(a)) == a)
		tmp = sqrt((t_0 - t_1)) * sqrt((t_0 + t_1));
	else
		tmp = hypot((b / 2.0), t_1);
	end
	t_2 = tmp;
	tmp_2 = 0.0;
	if (b < 0.0)
		tmp_2 = (t_2 - (b / 2.0)) / a;
	else
		tmp_2 = -c / ((b / 2.0) + t_2);
	end
	tmp_3 = tmp_2;
end

Wolfram

code[a_, b_, c_] := Block[{t$95$0 = N[Abs[N[(b / 2.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Sqrt[N[Abs[a], $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[Abs[c], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = If[Equal[N[With[{TMP1 = Abs[a], TMP2 = Sign[c]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], a], N[(N[Sqrt[N[(t$95$0 - t$95$1), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(t$95$0 + t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[Sqrt[N[(b / 2.0), $MachinePrecision] ^ 2 + t$95$1 ^ 2], $MachinePrecision]]}, If[Less[b, 0.0], N[(N[(t$95$2 - N[(b / 2.0), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[((-c) / N[(N[(b / 2.0), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]]]]]

Reproduce

herbie shell --seed 2024039 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64
  :herbie-expected 10

  :herbie-target
  (if (< b 0.0) (/ (- (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot (/ b 2.0) (* (sqrt (fabs a)) (sqrt (fabs c))))) (/ b 2.0)) a) (/ (- c) (+ (/ b 2.0) (if (== (copysign a c) a) (* (sqrt (- (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c))))) (sqrt (+ (fabs (/ b 2.0)) (* (sqrt (fabs a)) (sqrt (fabs c)))))) (hypot (/ b 2.0) (* (sqrt (fabs a)) (sqrt (fabs c))))))))

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