Cubic critical

Percentage Accurate: 51.6% → 84.9%

Time: 13.0s

Alternatives: 11

Speedup: 11.6×

Specification

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((3.0 * a) * c)))) / (3.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) - ((3.0d0 * a) * c)))) / (3.0d0 * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 51.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b, double c) {
	return (-b + sqrt(((b * b) - ((3.0 * a) * c)))) / (3.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) - ((3.0d0 * a) * c)))) / (3.0d0 * a)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.6 \cdot 10^{+59}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 2.2 \cdot 10^{-34}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.6e+59)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 2.2e-34)
     (/ (- (sqrt (- (* b b) (* (* 3.0 a) c))) b) (* 3.0 a))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.6e+59) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 2.2e-34) {
		tmp = (sqrt(((b * b) - ((3.0 * a) * c))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (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.6d+59)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 2.2d-34) then
        tmp = (sqrt(((b * b) - ((3.0d0 * a) * c))) - b) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.6e+59) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 2.2e-34) {
		tmp = (Math.sqrt(((b * b) - ((3.0 * a) * c))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.6e+59:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 2.2e-34:
		tmp = (math.sqrt(((b * b) - ((3.0 * a) * c))) - b) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.6e+59)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 2.2e-34)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(Float64(3.0 * a) * c))) - b) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.6e+59)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 2.2e-34)
		tmp = (sqrt(((b * b) - ((3.0 * a) * c))) - b) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.6e+59], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.2e-34], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(N[(3.0 * a), $MachinePrecision] * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.60000000000000016e59

   1. Initial program 67.5%

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

   3. Simplified 67.5%

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

   5. Taylor expanded in b around -inf 93.4%

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

      1. *-commutative 93.4%

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

   7. Simplified 93.4%

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

   if -4.60000000000000016e59 < b < 2.1999999999999999e-34

   1. Initial program 82.7%

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

   if 2.1999999999999999e-34 < b

   1. Initial program 17.3%

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

   3. Simplified 17.3%

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

   5. Taylor expanded in b around inf 87.2%

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

4. Final simplification 86.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.6 \cdot 10^{+59}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 2.2 \cdot 10^{-34}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - \left(3 \cdot a\right) \cdot c} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 84.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.6 \cdot 10^{+59}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 8.5 \cdot 10^{-35}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 3 \cdot \left(a \cdot c\right)} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.6e+59)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 8.5e-35)
     (/ (- (sqrt (- (* b b) (* 3.0 (* a c)))) b) (* 3.0 a))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.6e+59) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 8.5e-35) {
		tmp = (sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (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.6d+59)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 8.5d-35) then
        tmp = (sqrt(((b * b) - (3.0d0 * (a * c)))) - b) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.6e+59) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 8.5e-35) {
		tmp = (Math.sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.6e+59:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 8.5e-35:
		tmp = (math.sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.6e+59)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 8.5e-35)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) - Float64(3.0 * Float64(a * c)))) - b) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.6e+59)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 8.5e-35)
		tmp = (sqrt(((b * b) - (3.0 * (a * c)))) - b) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.6e+59], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 8.5e-35], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(3.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.60000000000000016e59

   1. Initial program 67.5%

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

   3. Simplified 67.5%

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

   5. Taylor expanded in b around -inf 93.4%

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

      1. *-commutative 93.4%

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

   7. Simplified 93.4%

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

   if -4.60000000000000016e59 < b < 8.5000000000000001e-35

   1. Initial program 82.7%

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

      1. sqr-neg 82.7%

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

      2. sqr-neg 82.7%

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

      3. associate-*l* 82.6%

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

   3. Simplified 82.6%

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

   if 8.5000000000000001e-35 < b

   1. Initial program 17.3%

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

   3. Simplified 17.3%

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

   5. Taylor expanded in b around inf 87.2%

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

4. Final simplification 86.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.6 \cdot 10^{+59}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 8.5 \cdot 10^{-35}:\\ \;\;\;\;\frac{\sqrt{b \cdot b - 3 \cdot \left(a \cdot c\right)} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{-78}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 1.32 \cdot 10^{-39}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -3\right)} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -4.8e-78)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 1.32e-39)
     (/ (- (sqrt (* c (* a -3.0))) b) (* 3.0 a))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -4.8e-78) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 1.32e-39) {
		tmp = (sqrt((c * (a * -3.0))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (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-78)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 1.32d-39) then
        tmp = (sqrt((c * (a * (-3.0d0)))) - b) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (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-78) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 1.32e-39) {
		tmp = (Math.sqrt((c * (a * -3.0))) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -4.8e-78:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 1.32e-39:
		tmp = (math.sqrt((c * (a * -3.0))) - b) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -4.8e-78)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 1.32e-39)
		tmp = Float64(Float64(sqrt(Float64(c * Float64(a * -3.0))) - b) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -4.8e-78)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 1.32e-39)
		tmp = (sqrt((c * (a * -3.0))) - b) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -4.8e-78], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.32e-39], N[(N[(N[Sqrt[N[(c * N[(a * -3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -4.79999999999999999e-78

   1. Initial program 75.3%

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

   3. Simplified 75.3%

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

   5. Taylor expanded in b around -inf 86.6%

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

      1. *-commutative 86.6%

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

   7. Simplified 86.6%

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

   if -4.79999999999999999e-78 < b < 1.31999999999999997e-39

   1. Initial program 79.6%

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

   3. Simplified 79.4%

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

   5. Taylor expanded in b around 0 78.3%

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

      1. associate-*r* 78.5%

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

      2. *-commutative 78.5%

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

   7. Simplified 78.5%

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

   if 1.31999999999999997e-39 < b

   1. Initial program 17.3%

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

   3. Simplified 17.3%

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

   5. Taylor expanded in b around inf 87.2%

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

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.8 \cdot 10^{-78}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 1.32 \cdot 10^{-39}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -3\right)} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2.95 \cdot 10^{-78}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 1.18 \cdot 10^{-37}:\\ \;\;\;\;\frac{\sqrt{\left(a \cdot c\right) \cdot -3} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.95e-78)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 1.18e-37)
     (/ (- (sqrt (* (* a c) -3.0)) b) (* 3.0 a))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.95e-78) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 1.18e-37) {
		tmp = (sqrt(((a * c) * -3.0)) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (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 <= (-2.95d-78)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 1.18d-37) then
        tmp = (sqrt(((a * c) * (-3.0d0))) - b) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.95e-78) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 1.18e-37) {
		tmp = (Math.sqrt(((a * c) * -3.0)) - b) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -2.95e-78:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 1.18e-37:
		tmp = (math.sqrt(((a * c) * -3.0)) - b) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.95e-78)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 1.18e-37)
		tmp = Float64(Float64(sqrt(Float64(Float64(a * c) * -3.0)) - b) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.95e-78)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 1.18e-37)
		tmp = (sqrt(((a * c) * -3.0)) - b) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -2.95e-78], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.18e-37], N[(N[(N[Sqrt[N[(N[(a * c), $MachinePrecision] * -3.0), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.9500000000000002e-78

   1. Initial program 75.3%

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

   3. Simplified 75.3%

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

   5. Taylor expanded in b around -inf 86.6%

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

      1. *-commutative 86.6%

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

   7. Simplified 86.6%

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

   if -2.9500000000000002e-78 < b < 1.17999999999999997e-37

   1. Initial program 79.6%

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

   3. Simplified 79.4%

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

   5. Taylor expanded in b around 0 78.3%

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

   if 1.17999999999999997e-37 < b

   1. Initial program 17.3%

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

   3. Simplified 17.3%

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

   5. Taylor expanded in b around inf 87.2%

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

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.95 \cdot 10^{-78}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 1.18 \cdot 10^{-37}:\\ \;\;\;\;\frac{\sqrt{\left(a \cdot c\right) \cdot -3} - b}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -5.2 \cdot 10^{-78}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-36}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -3\right)}}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -5.2e-78)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 2e-36) (/ (sqrt (* a (* c -3.0))) (* 3.0 a)) (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.2e-78) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 2e-36) {
		tmp = sqrt((a * (c * -3.0))) / (3.0 * a);
	} else {
		tmp = -0.5 * (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 <= (-5.2d-78)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 2d-36) then
        tmp = sqrt((a * (c * (-3.0d0)))) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -5.2e-78) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 2e-36) {
		tmp = Math.sqrt((a * (c * -3.0))) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -5.2e-78:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 2e-36:
		tmp = math.sqrt((a * (c * -3.0))) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -5.2e-78)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 2e-36)
		tmp = Float64(sqrt(Float64(a * Float64(c * -3.0))) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -5.2e-78)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 2e-36)
		tmp = sqrt((a * (c * -3.0))) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -5.2e-78], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2e-36], N[(N[Sqrt[N[(a * N[(c * -3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -5.2000000000000002e-78

   1. Initial program 75.3%

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

   3. Simplified 75.3%

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

   5. Taylor expanded in b around -inf 86.6%

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

      1. *-commutative 86.6%

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

   7. Simplified 86.6%

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

   if -5.2000000000000002e-78 < b < 1.9999999999999999e-36

   1. Initial program 79.6%

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

      1. add-cube-cbrt 78.8%

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

      2. pow3 78.9%

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

   4. Applied egg-rr 78.9%

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

   5. Taylor expanded in a around -inf 0.0%

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

      1. mul-1-neg 0.0%

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

      2. *-commutative 0.0%

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

      3. unpow2 0.0%

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

      4. rem-square-sqrt 77.2%

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

      5. distribute-lft-neg-in 77.2%

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

      6. metadata-eval 77.2%

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

      7. rem-cube-cbrt 77.3%

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

   7. Simplified 77.3%

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

   if 1.9999999999999999e-36 < b

   1. Initial program 17.3%

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

   3. Simplified 17.3%

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

   5. Taylor expanded in b around inf 87.2%

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

4. Final simplification 84.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -5.2 \cdot 10^{-78}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 2 \cdot 10^{-36}:\\ \;\;\;\;\frac{\sqrt{a \cdot \left(c \cdot -3\right)}}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 70.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -1.52 \cdot 10^{-117}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 6.2 \cdot 10^{-40}:\\ \;\;\;\;\sqrt{c \cdot \frac{-3}{a}} \cdot \left(--0.3333333333333333\right)\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b -1.52e-117)
   (/ (* b -2.0) (* 3.0 a))
   (if (<= b 6.2e-40)
     (* (sqrt (* c (/ -3.0 a))) (- -0.3333333333333333))
     (* -0.5 (/ c b)))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.52e-117) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 6.2e-40) {
		tmp = sqrt((c * (-3.0 / a))) * -(-0.3333333333333333);
	} else {
		tmp = -0.5 * (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.52d-117)) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else if (b <= 6.2d-40) then
        tmp = sqrt((c * ((-3.0d0) / a))) * -(-0.3333333333333333d0)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -1.52e-117) {
		tmp = (b * -2.0) / (3.0 * a);
	} else if (b <= 6.2e-40) {
		tmp = Math.sqrt((c * (-3.0 / a))) * -(-0.3333333333333333);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= -1.52e-117:
		tmp = (b * -2.0) / (3.0 * a)
	elif b <= 6.2e-40:
		tmp = math.sqrt((c * (-3.0 / a))) * -(-0.3333333333333333)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= -1.52e-117)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	elseif (b <= 6.2e-40)
		tmp = Float64(sqrt(Float64(c * Float64(-3.0 / a))) * Float64(-(-0.3333333333333333)));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -1.52e-117)
		tmp = (b * -2.0) / (3.0 * a);
	elseif (b <= 6.2e-40)
		tmp = sqrt((c * (-3.0 / a))) * -(-0.3333333333333333);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, -1.52e-117], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 6.2e-40], N[(N[Sqrt[N[(c * N[(-3.0 / a), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * (--0.3333333333333333)), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -1.52e-117

   1. Initial program 75.3%

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

   3. Simplified 75.3%

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

   5. Taylor expanded in b around -inf 83.3%

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

      1. *-commutative 83.3%

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

   7. Simplified 83.3%

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

   if -1.52e-117 < b < 6.20000000000000021e-40

   1. Initial program 79.8%

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

      1. add-cube-cbrt 79.0%

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

      2. pow3 79.2%

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

   4. Applied egg-rr 79.2%

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

   5. Taylor expanded in a around -inf 0.0%

      \[\leadsto \color{blue}{-0.3333333333333333 \cdot \left(\sqrt{\frac{c \cdot {\left(\sqrt[3]{-3}\right)}^{3}}{a}} \cdot {\left(\sqrt{-1}\right)}^{2}\right)} \]
   6. Step-by-step derivation

      1. *-commutative 0.0%

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

      2. unpow2 0.0%

         \[\leadsto -0.3333333333333333 \cdot \left(\color{blue}{\left(\sqrt{-1} \cdot \sqrt{-1}\right)} \cdot \sqrt{\frac{c \cdot {\left(\sqrt[3]{-3}\right)}^{3}}{a}}\right) \]

      3. rem-square-sqrt 32.3%

         \[\leadsto -0.3333333333333333 \cdot \left(\color{blue}{-1} \cdot \sqrt{\frac{c \cdot {\left(\sqrt[3]{-3}\right)}^{3}}{a}}\right) \]

      4. associate-/l* 32.3%

         \[\leadsto -0.3333333333333333 \cdot \left(-1 \cdot \sqrt{\color{blue}{c \cdot \frac{{\left(\sqrt[3]{-3}\right)}^{3}}{a}}}\right) \]

      5. rem-cube-cbrt 32.5%

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

   7. Simplified 32.5%

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

   if 6.20000000000000021e-40 < b

   1. Initial program 17.3%

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

   3. Simplified 17.3%

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

   5. Taylor expanded in b around inf 87.2%

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

4. Final simplification 72.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -1.52 \cdot 10^{-117}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{elif}\;b \leq 6.2 \cdot 10^{-40}:\\ \;\;\;\;\sqrt{c \cdot \frac{-3}{a}} \cdot \left(--0.3333333333333333\right)\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 68.2% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.5 \cdot 10^{-301}:\\ \;\;\;\;\frac{b \cdot -2}{3 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.5e-301) (/ (* b -2.0) (* 3.0 a)) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = (b * -2.0) / (3.0 * a);
	} else {
		tmp = -0.5 * (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 <= 6.5d-301) then
        tmp = (b * (-2.0d0)) / (3.0d0 * a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = (b * -2.0) / (3.0 * a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 6.5e-301:
		tmp = (b * -2.0) / (3.0 * a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 6.5e-301)
		tmp = Float64(Float64(b * -2.0) / Float64(3.0 * a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 6.5e-301)
		tmp = (b * -2.0) / (3.0 * a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 6.5e-301], N[(N[(b * -2.0), $MachinePrecision] / N[(3.0 * a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.49999999999999991e-301

   1. Initial program 77.8%

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

   3. Simplified 77.7%

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

   5. Taylor expanded in b around -inf 67.8%

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

      1. *-commutative 67.8%

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

   7. Simplified 67.8%

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

   if 6.49999999999999991e-301 < b

   1. Initial program 32.6%

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

   3. Simplified 32.6%

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

   5. Taylor expanded in b around inf 67.4%

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

Alternative 8: 68.2% accurate, 9.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.5 \cdot 10^{-301}:\\ \;\;\;\;\frac{-2}{\frac{3 \cdot a}{b}}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.5e-301) (/ -2.0 (/ (* 3.0 a) b)) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = -2.0 / ((3.0 * a) / b);
	} else {
		tmp = -0.5 * (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 <= 6.5d-301) then
        tmp = (-2.0d0) / ((3.0d0 * a) / b)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = -2.0 / ((3.0 * a) / b);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 6.5e-301:
		tmp = -2.0 / ((3.0 * a) / b)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 6.5e-301)
		tmp = Float64(-2.0 / Float64(Float64(3.0 * a) / b));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 6.5e-301)
		tmp = -2.0 / ((3.0 * a) / b);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 6.5e-301], N[(-2.0 / N[(N[(3.0 * a), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.49999999999999991e-301

   1. Initial program 77.8%

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

      1. sqr-neg 77.8%

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

      2. sqr-neg 77.8%

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

      3. associate-*l* 77.7%

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

   3. Simplified 77.7%

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

      1. add-cube-cbrt 77.6%

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

      2. pow3 77.6%

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

   6. Applied egg-rr 76.6%

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

   7. Taylor expanded in b around -inf 67.2%

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

   9. Applied egg-rr 67.7%

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

   if 6.49999999999999991e-301 < b

   1. Initial program 32.6%

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

   3. Simplified 32.6%

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

   5. Taylor expanded in b around inf 67.4%

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

4. Final simplification 67.5%

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

Alternative 9: 68.2% accurate, 10.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.5 \cdot 10^{-301}:\\ \;\;\;\;\left(-b\right) \cdot \frac{0.6666666666666666}{a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.5e-301) (* (- b) (/ 0.6666666666666666 a)) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = -b * (0.6666666666666666 / a);
	} else {
		tmp = -0.5 * (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 <= 6.5d-301) then
        tmp = -b * (0.6666666666666666d0 / a)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = -b * (0.6666666666666666 / a);
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 6.5e-301:
		tmp = -b * (0.6666666666666666 / a)
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 6.5e-301)
		tmp = Float64(Float64(-b) * Float64(0.6666666666666666 / a));
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 6.5e-301)
		tmp = -b * (0.6666666666666666 / a);
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 6.5e-301], N[((-b) * N[(0.6666666666666666 / a), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.49999999999999991e-301

   1. Initial program 77.8%

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

   3. Simplified 77.7%

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

   5. Taylor expanded in b around -inf 66.8%

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

   6. Taylor expanded in b around inf 67.6%

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

      1. associate-*r/ 67.6%

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

      2. associate-*l/ 67.6%

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

      3. *-commutative 67.6%

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

   8. Simplified 67.6%

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

   if 6.49999999999999991e-301 < b

   1. Initial program 32.6%

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

   3. Simplified 32.6%

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

   5. Taylor expanded in b around inf 67.4%

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

4. Final simplification 67.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 6.5 \cdot 10^{-301}:\\ \;\;\;\;\left(-b\right) \cdot \frac{0.6666666666666666}{a}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 68.2% accurate, 11.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 6.5 \cdot 10^{-301}:\\ \;\;\;\;\frac{b}{a} \cdot -0.6666666666666666\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{c}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (if (<= b 6.5e-301) (* (/ b a) -0.6666666666666666) (* -0.5 (/ c b))))

C

double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = (b / a) * -0.6666666666666666;
	} else {
		tmp = -0.5 * (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 <= 6.5d-301) then
        tmp = (b / a) * (-0.6666666666666666d0)
    else
        tmp = (-0.5d0) * (c / b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= 6.5e-301) {
		tmp = (b / a) * -0.6666666666666666;
	} else {
		tmp = -0.5 * (c / b);
	}
	return tmp;
}

Python

def code(a, b, c):
	tmp = 0
	if b <= 6.5e-301:
		tmp = (b / a) * -0.6666666666666666
	else:
		tmp = -0.5 * (c / b)
	return tmp

Julia

function code(a, b, c)
	tmp = 0.0
	if (b <= 6.5e-301)
		tmp = Float64(Float64(b / a) * -0.6666666666666666);
	else
		tmp = Float64(-0.5 * Float64(c / b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= 6.5e-301)
		tmp = (b / a) * -0.6666666666666666;
	else
		tmp = -0.5 * (c / b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := If[LessEqual[b, 6.5e-301], N[(N[(b / a), $MachinePrecision] * -0.6666666666666666), $MachinePrecision], N[(-0.5 * N[(c / b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 6.49999999999999991e-301

   1. Initial program 77.8%

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

   3. Simplified 77.7%

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

   5. Taylor expanded in b around -inf 67.6%

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

      1. *-commutative 67.6%

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

   7. Simplified 67.6%

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

   if 6.49999999999999991e-301 < b

   1. Initial program 32.6%

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

   3. Simplified 32.6%

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

   5. Taylor expanded in b around inf 67.4%

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

Alternative 11: 36.1% accurate, 23.2× speedup

Math

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

FPCore

(FPCore (a b c) :precision binary64 (* -0.5 (/ c b)))

C

double code(double a, double b, double c) {
	return -0.5 * (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 = (-0.5d0) * (c / b)
end function

Java

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

Python

def code(a, b, c):
	return -0.5 * (c / b)

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 54.7%

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

3. Simplified 54.6%

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

5. Taylor expanded in b around inf 35.5%

   \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b}} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024136 
(FPCore (a b c)
  :name "Cubic critical"
  :precision binary64
  (/ (+ (- b) (sqrt (- (* b b) (* (* 3.0 a) c)))) (* 3.0 a)))