Complex division, imag part

Percentage Accurate: 62.2% → 85.7%

Time: 8.7s

Alternatives: 9

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 62.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.7% accurate, 0.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \leq 4 \cdot 10^{+289}:\\ \;\;\;\;\frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \frac{\mathsf{fma}\left(b, c, a \cdot \left(-d\right)\right)}{\mathsf{hypot}\left(c, d\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{b \cdot \frac{c}{d} - a}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= (/ (- (* b c) (* a d)) (+ (* c c) (* d d))) 4e+289)
   (* (/ 1.0 (hypot c d)) (/ (fma b c (* a (- d))) (hypot c d)))
   (/ (- (* b (/ c d)) a) d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((((b * c) - (a * d)) / ((c * c) + (d * d))) <= 4e+289) {
		tmp = (1.0 / hypot(c, d)) * (fma(b, c, (a * -d)) / hypot(c, d));
	} else {
		tmp = ((b * (c / d)) - a) / d;
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(Float64(c * c) + Float64(d * d))) <= 4e+289)
		tmp = Float64(Float64(1.0 / hypot(c, d)) * Float64(fma(b, c, Float64(a * Float64(-d))) / hypot(c, d)));
	else
		tmp = Float64(Float64(Float64(b * Float64(c / d)) - a) / d);
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 4e+289], N[(N[(1.0 / N[Sqrt[c ^ 2 + d ^ 2], $MachinePrecision]), $MachinePrecision] * N[(N[(b * c + N[(a * (-d)), $MachinePrecision]), $MachinePrecision] / N[Sqrt[c ^ 2 + d ^ 2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * N[(c / d), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (*.f64 b c) (*.f64 a d)) (+.f64 (*.f64 c c) (*.f64 d d))) < 4.0000000000000002e289

   1. Initial program 79.0%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. *-un-lft-identity 79.0%

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

      2. add-sqr-sqrt 79.0%

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

      3. times-frac 78.9%

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

      4. hypot-define 78.9%

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

      5. fma-neg 78.9%

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

      6. distribute-rgt-neg-in 78.9%

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

      7. hypot-define 96.5%

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

   4. Applied egg-rr 96.5%

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

   if 4.0000000000000002e289 < (/.f64 (-.f64 (*.f64 b c) (*.f64 a d)) (+.f64 (*.f64 c c) (*.f64 d d)))

   1. Initial program 12.7%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 44.1%

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

      1. +-commutative 44.1%

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

      2. mul-1-neg 44.1%

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

      3. unsub-neg 44.1%

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

      4. unpow2 44.1%

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

      5. associate-/r* 50.4%

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

      6. div-sub 54.9%

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

      7. associate-/l* 65.0%

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

   5. Simplified 65.0%

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

4. Final simplification 88.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \leq 4 \cdot 10^{+289}:\\ \;\;\;\;\frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \frac{\mathsf{fma}\left(b, c, a \cdot \left(-d\right)\right)}{\mathsf{hypot}\left(c, d\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{b \cdot \frac{c}{d} - a}{d}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{c \cdot \frac{b}{d} - a}{d}\\ \mathbf{if}\;d \leq -1.08 \cdot 10^{+102}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d \leq -1.65 \cdot 10^{-139}:\\ \;\;\;\;\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{elif}\;d \leq 5.3 \cdot 10^{+19}:\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (- (* c (/ b d)) a) d)))
   (if (<= d -1.08e+102)
     t_0
     (if (<= d -1.65e-139)
       (/ (- (* b c) (* a d)) (+ (* c c) (* d d)))
       (if (<= d 5.3e+19) (/ (- b (/ (* a d) c)) c) t_0)))))

C

double code(double a, double b, double c, double d) {
	double t_0 = ((c * (b / d)) - a) / d;
	double tmp;
	if (d <= -1.08e+102) {
		tmp = t_0;
	} else if (d <= -1.65e-139) {
		tmp = ((b * c) - (a * d)) / ((c * c) + (d * d));
	} else if (d <= 5.3e+19) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((c * (b / d)) - a) / d
    if (d <= (-1.08d+102)) then
        tmp = t_0
    else if (d <= (-1.65d-139)) then
        tmp = ((b * c) - (a * d)) / ((c * c) + (d * d))
    else if (d <= 5.3d+19) then
        tmp = (b - ((a * d) / c)) / c
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double t_0 = ((c * (b / d)) - a) / d;
	double tmp;
	if (d <= -1.08e+102) {
		tmp = t_0;
	} else if (d <= -1.65e-139) {
		tmp = ((b * c) - (a * d)) / ((c * c) + (d * d));
	} else if (d <= 5.3e+19) {
		tmp = (b - ((a * d) / c)) / c;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	t_0 = ((c * (b / d)) - a) / d
	tmp = 0
	if d <= -1.08e+102:
		tmp = t_0
	elif d <= -1.65e-139:
		tmp = ((b * c) - (a * d)) / ((c * c) + (d * d))
	elif d <= 5.3e+19:
		tmp = (b - ((a * d) / c)) / c
	else:
		tmp = t_0
	return tmp

Julia

function code(a, b, c, d)
	t_0 = Float64(Float64(Float64(c * Float64(b / d)) - a) / d)
	tmp = 0.0
	if (d <= -1.08e+102)
		tmp = t_0;
	elseif (d <= -1.65e-139)
		tmp = Float64(Float64(Float64(b * c) - Float64(a * d)) / Float64(Float64(c * c) + Float64(d * d)));
	elseif (d <= 5.3e+19)
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / c);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	t_0 = ((c * (b / d)) - a) / d;
	tmp = 0.0;
	if (d <= -1.08e+102)
		tmp = t_0;
	elseif (d <= -1.65e-139)
		tmp = ((b * c) - (a * d)) / ((c * c) + (d * d));
	elseif (d <= 5.3e+19)
		tmp = (b - ((a * d) / c)) / c;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(N[(c * N[(b / d), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision]}, If[LessEqual[d, -1.08e+102], t$95$0, If[LessEqual[d, -1.65e-139], N[(N[(N[(b * c), $MachinePrecision] - N[(a * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[d, 5.3e+19], N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if d < -1.08000000000000002e102 or 5.3e19 < d

   1. Initial program 43.5%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 78.2%

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

      1. +-commutative 78.2%

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

      2. mul-1-neg 78.2%

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

      3. unsub-neg 78.2%

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

      4. unpow2 78.2%

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

      5. associate-/r* 83.3%

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

      6. div-sub 83.3%

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

      7. associate-/l* 88.0%

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

   5. Simplified 88.0%

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

   6. Taylor expanded in b around 0 83.3%

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

      1. associate-*l/ 88.0%

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

      2. *-commutative 88.0%

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

   8. Simplified 88.0%

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

   if -1.08000000000000002e102 < d < -1.65e-139

   1. Initial program 92.0%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   if -1.65e-139 < d < 5.3e19

   1. Initial program 65.2%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf 85.0%

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

      1. remove-double-neg 85.0%

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

      2. mul-1-neg 85.0%

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

      3. neg-mul-1 85.0%

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

      4. distribute-lft-in 85.0%

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

      5. distribute-lft-in 85.0%

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

      6. neg-mul-1 85.0%

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

      7. mul-1-neg 85.0%

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

      8. remove-double-neg 85.0%

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

      9. associate-*r/ 85.0%

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

      10. mul-1-neg 85.0%

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

      11. distribute-rgt-neg-out 85.0%

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

   5. Simplified 85.0%

      \[\leadsto \color{blue}{\frac{b + \frac{a \cdot \left(-d\right)}{c}}{c}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 87.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d \leq -1.08 \cdot 10^{+102}:\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \mathbf{elif}\;d \leq -1.65 \cdot 10^{-139}:\\ \;\;\;\;\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{elif}\;d \leq 5.3 \cdot 10^{+19}:\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 73.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -4.9 \cdot 10^{+35} \lor \neg \left(d \leq 3.4 \cdot 10^{+72}\right):\\ \;\;\;\;\frac{a}{-d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= d -4.9e+35) (not (<= d 3.4e+72)))
   (/ a (- d))
   (/ (- b (* a (/ d c))) c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -4.9e+35) || !(d <= 3.4e+72)) {
		tmp = a / -d;
	} else {
		tmp = (b - (a * (d / c))) / c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if ((d <= (-4.9d+35)) .or. (.not. (d <= 3.4d+72))) then
        tmp = a / -d
    else
        tmp = (b - (a * (d / c))) / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -4.9e+35) || !(d <= 3.4e+72)) {
		tmp = a / -d;
	} else {
		tmp = (b - (a * (d / c))) / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (d <= -4.9e+35) or not (d <= 3.4e+72):
		tmp = a / -d
	else:
		tmp = (b - (a * (d / c))) / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((d <= -4.9e+35) || !(d <= 3.4e+72))
		tmp = Float64(a / Float64(-d));
	else
		tmp = Float64(Float64(b - Float64(a * Float64(d / c))) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((d <= -4.9e+35) || ~((d <= 3.4e+72)))
		tmp = a / -d;
	else
		tmp = (b - (a * (d / c))) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[d, -4.9e+35], N[Not[LessEqual[d, 3.4e+72]], $MachinePrecision]], N[(a / (-d)), $MachinePrecision], N[(N[(b - N[(a * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d < -4.90000000000000025e35 or 3.3999999999999998e72 < d

   1. Initial program 48.4%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 72.7%

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

      1. associate-*r/ 72.7%

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

      2. neg-mul-1 72.7%

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

   5. Simplified 72.7%

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

   if -4.90000000000000025e35 < d < 3.3999999999999998e72

   1. Initial program 72.1%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf 72.8%

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

      1. remove-double-neg 72.8%

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

      2. mul-1-neg 72.8%

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

      3. neg-mul-1 72.8%

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

      4. distribute-lft-in 72.8%

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

      5. distribute-lft-in 72.8%

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

      6. mul-1-neg 72.8%

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

      7. unsub-neg 72.8%

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

      8. neg-mul-1 72.8%

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

      9. mul-1-neg 72.8%

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

      10. remove-double-neg 72.8%

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

      11. associate-/l* 73.5%

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

   5. Simplified 73.5%

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

4. Final simplification 73.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d \leq -4.9 \cdot 10^{+35} \lor \neg \left(d \leq 3.4 \cdot 10^{+72}\right):\\ \;\;\;\;\frac{a}{-d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 78.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -120 \lor \neg \left(d \leq 4.4 \cdot 10^{+18}\right):\\ \;\;\;\;\frac{b \cdot \frac{c}{d} - a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= d -120.0) (not (<= d 4.4e+18)))
   (/ (- (* b (/ c d)) a) d)
   (/ (- b (* a (/ d c))) c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -120.0) || !(d <= 4.4e+18)) {
		tmp = ((b * (c / d)) - a) / d;
	} else {
		tmp = (b - (a * (d / c))) / c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if ((d <= (-120.0d0)) .or. (.not. (d <= 4.4d+18))) then
        tmp = ((b * (c / d)) - a) / d
    else
        tmp = (b - (a * (d / c))) / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -120.0) || !(d <= 4.4e+18)) {
		tmp = ((b * (c / d)) - a) / d;
	} else {
		tmp = (b - (a * (d / c))) / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (d <= -120.0) or not (d <= 4.4e+18):
		tmp = ((b * (c / d)) - a) / d
	else:
		tmp = (b - (a * (d / c))) / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((d <= -120.0) || !(d <= 4.4e+18))
		tmp = Float64(Float64(Float64(b * Float64(c / d)) - a) / d);
	else
		tmp = Float64(Float64(b - Float64(a * Float64(d / c))) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((d <= -120.0) || ~((d <= 4.4e+18)))
		tmp = ((b * (c / d)) - a) / d;
	else
		tmp = (b - (a * (d / c))) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[d, -120.0], N[Not[LessEqual[d, 4.4e+18]], $MachinePrecision]], N[(N[(N[(b * N[(c / d), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], N[(N[(b - N[(a * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d < -120 or 4.4e18 < d

   1. Initial program 54.2%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 75.6%

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

      1. +-commutative 75.6%

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

      2. mul-1-neg 75.6%

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

      3. unsub-neg 75.6%

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

      4. unpow2 75.6%

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

      5. associate-/r* 79.6%

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

      6. div-sub 79.6%

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

      7. associate-/l* 83.3%

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

   5. Simplified 83.3%

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

   if -120 < d < 4.4e18

   1. Initial program 69.8%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf 80.7%

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

      1. remove-double-neg 80.7%

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

      2. mul-1-neg 80.7%

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

      3. neg-mul-1 80.7%

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

      4. distribute-lft-in 80.7%

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

      5. distribute-lft-in 80.7%

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

      6. mul-1-neg 80.7%

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

      7. unsub-neg 80.7%

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

      8. neg-mul-1 80.7%

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

      9. mul-1-neg 80.7%

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

      10. remove-double-neg 80.7%

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

      11. associate-/l* 79.9%

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

   5. Simplified 79.9%

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

4. Final simplification 81.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d \leq -120 \lor \neg \left(d \leq 4.4 \cdot 10^{+18}\right):\\ \;\;\;\;\frac{b \cdot \frac{c}{d} - a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 78.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -0.062 \lor \neg \left(d \leq 2.2 \cdot 10^{+19}\right):\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= d -0.062) (not (<= d 2.2e+19)))
   (/ (- (* c (/ b d)) a) d)
   (/ (- b (* a (/ d c))) c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -0.062) || !(d <= 2.2e+19)) {
		tmp = ((c * (b / d)) - a) / d;
	} else {
		tmp = (b - (a * (d / c))) / c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if ((d <= (-0.062d0)) .or. (.not. (d <= 2.2d+19))) then
        tmp = ((c * (b / d)) - a) / d
    else
        tmp = (b - (a * (d / c))) / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -0.062) || !(d <= 2.2e+19)) {
		tmp = ((c * (b / d)) - a) / d;
	} else {
		tmp = (b - (a * (d / c))) / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (d <= -0.062) or not (d <= 2.2e+19):
		tmp = ((c * (b / d)) - a) / d
	else:
		tmp = (b - (a * (d / c))) / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((d <= -0.062) || !(d <= 2.2e+19))
		tmp = Float64(Float64(Float64(c * Float64(b / d)) - a) / d);
	else
		tmp = Float64(Float64(b - Float64(a * Float64(d / c))) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((d <= -0.062) || ~((d <= 2.2e+19)))
		tmp = ((c * (b / d)) - a) / d;
	else
		tmp = (b - (a * (d / c))) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[d, -0.062], N[Not[LessEqual[d, 2.2e+19]], $MachinePrecision]], N[(N[(N[(c * N[(b / d), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], N[(N[(b - N[(a * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d < -0.062 or 2.2e19 < d

   1. Initial program 54.2%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 75.6%

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

      1. +-commutative 75.6%

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

      2. mul-1-neg 75.6%

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

      3. unsub-neg 75.6%

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

      4. unpow2 75.6%

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

      5. associate-/r* 79.6%

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

      6. div-sub 79.6%

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

      7. associate-/l* 83.3%

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

   5. Simplified 83.3%

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

   6. Taylor expanded in b around 0 79.6%

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

      1. associate-*l/ 83.3%

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

      2. *-commutative 83.3%

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

   8. Simplified 83.3%

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

   if -0.062 < d < 2.2e19

   1. Initial program 69.8%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf 80.7%

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

      1. remove-double-neg 80.7%

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

      2. mul-1-neg 80.7%

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

      3. neg-mul-1 80.7%

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

      4. distribute-lft-in 80.7%

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

      5. distribute-lft-in 80.7%

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

      6. mul-1-neg 80.7%

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

      7. unsub-neg 80.7%

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

      8. neg-mul-1 80.7%

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

      9. mul-1-neg 80.7%

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

      10. remove-double-neg 80.7%

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

      11. associate-/l* 79.9%

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

   5. Simplified 79.9%

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

4. Final simplification 81.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d \leq -0.062 \lor \neg \left(d \leq 2.2 \cdot 10^{+19}\right):\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 78.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -28 \lor \neg \left(d \leq 7.8 \cdot 10^{+18}\right):\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= d -28.0) (not (<= d 7.8e+18)))
   (/ (- (* c (/ b d)) a) d)
   (/ (- b (/ (* a d) c)) c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -28.0) || !(d <= 7.8e+18)) {
		tmp = ((c * (b / d)) - a) / d;
	} else {
		tmp = (b - ((a * d) / c)) / c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if ((d <= (-28.0d0)) .or. (.not. (d <= 7.8d+18))) then
        tmp = ((c * (b / d)) - a) / d
    else
        tmp = (b - ((a * d) / c)) / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -28.0) || !(d <= 7.8e+18)) {
		tmp = ((c * (b / d)) - a) / d;
	} else {
		tmp = (b - ((a * d) / c)) / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (d <= -28.0) or not (d <= 7.8e+18):
		tmp = ((c * (b / d)) - a) / d
	else:
		tmp = (b - ((a * d) / c)) / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((d <= -28.0) || !(d <= 7.8e+18))
		tmp = Float64(Float64(Float64(c * Float64(b / d)) - a) / d);
	else
		tmp = Float64(Float64(b - Float64(Float64(a * d) / c)) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((d <= -28.0) || ~((d <= 7.8e+18)))
		tmp = ((c * (b / d)) - a) / d;
	else
		tmp = (b - ((a * d) / c)) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[d, -28.0], N[Not[LessEqual[d, 7.8e+18]], $MachinePrecision]], N[(N[(N[(c * N[(b / d), $MachinePrecision]), $MachinePrecision] - a), $MachinePrecision] / d), $MachinePrecision], N[(N[(b - N[(N[(a * d), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d < -28 or 7.8e18 < d

   1. Initial program 54.2%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 75.6%

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

      1. +-commutative 75.6%

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

      2. mul-1-neg 75.6%

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

      3. unsub-neg 75.6%

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

      4. unpow2 75.6%

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

      5. associate-/r* 79.6%

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

      6. div-sub 79.6%

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

      7. associate-/l* 83.3%

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

   5. Simplified 83.3%

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

   6. Taylor expanded in b around 0 79.6%

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

      1. associate-*l/ 83.3%

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

      2. *-commutative 83.3%

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

   8. Simplified 83.3%

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

   if -28 < d < 7.8e18

   1. Initial program 69.8%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf 80.7%

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

      1. remove-double-neg 80.7%

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

      2. mul-1-neg 80.7%

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

      3. neg-mul-1 80.7%

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

      4. distribute-lft-in 80.7%

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

      5. distribute-lft-in 80.7%

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

      6. neg-mul-1 80.7%

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

      7. mul-1-neg 80.7%

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

      8. remove-double-neg 80.7%

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

      9. associate-*r/ 80.7%

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

      10. mul-1-neg 80.7%

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

      11. distribute-rgt-neg-out 80.7%

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

   5. Simplified 80.7%

      \[\leadsto \color{blue}{\frac{b + \frac{a \cdot \left(-d\right)}{c}}{c}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d \leq -28 \lor \neg \left(d \leq 7.8 \cdot 10^{+18}\right):\\ \;\;\;\;\frac{c \cdot \frac{b}{d} - a}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b - \frac{a \cdot d}{c}}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 63.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -1.92 \lor \neg \left(d \leq 9.5 \cdot 10^{+72}\right):\\ \;\;\;\;\frac{a}{-d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= d -1.92) (not (<= d 9.5e+72))) (/ a (- d)) (/ b c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -1.92) || !(d <= 9.5e+72)) {
		tmp = a / -d;
	} else {
		tmp = b / c;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if ((d <= (-1.92d0)) .or. (.not. (d <= 9.5d+72))) then
        tmp = a / -d
    else
        tmp = b / c
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -1.92) || !(d <= 9.5e+72)) {
		tmp = a / -d;
	} else {
		tmp = b / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (d <= -1.92) or not (d <= 9.5e+72):
		tmp = a / -d
	else:
		tmp = b / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((d <= -1.92) || !(d <= 9.5e+72))
		tmp = Float64(a / Float64(-d));
	else
		tmp = Float64(b / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((d <= -1.92) || ~((d <= 9.5e+72)))
		tmp = a / -d;
	else
		tmp = b / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[d, -1.92], N[Not[LessEqual[d, 9.5e+72]], $MachinePrecision]], N[(a / (-d)), $MachinePrecision], N[(b / c), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if d < -1.9199999999999999 or 9.50000000000000054e72 < d

   1. Initial program 52.9%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around 0 69.7%

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

      1. associate-*r/ 69.7%

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

      2. neg-mul-1 69.7%

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

   5. Simplified 69.7%

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

   if -1.9199999999999999 < d < 9.50000000000000054e72

   1. Initial program 69.8%

      \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing

   3. Taylor expanded in c around inf 57.9%

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

4. Final simplification 63.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;d \leq -1.92 \lor \neg \left(d \leq 9.5 \cdot 10^{+72}\right):\\ \;\;\;\;\frac{a}{-d}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{c}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 9.5% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 61.6%

   \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. *-un-lft-identity 61.6%

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

   2. add-sqr-sqrt 61.6%

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

   3. times-frac 61.6%

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

   4. hypot-define 61.6%

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

   5. fma-neg 61.6%

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

   6. distribute-rgt-neg-in 61.6%

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

   7. hypot-define 76.6%

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

4. Applied egg-rr 76.6%

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

5. Taylor expanded in c around -inf 26.0%

   \[\leadsto \frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \color{blue}{\left(-1 \cdot b + \frac{a \cdot d}{c}\right)} \]
6. Step-by-step derivation

   1. +-commutative 26.0%

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

   2. neg-mul-1 26.0%

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

   3. unsub-neg 26.0%

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

   4. associate-/l* 26.4%

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

7. Simplified 26.4%

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

8. Taylor expanded in c around 0 10.7%

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

9. Final simplification 10.7%

   \[\leadsto \frac{a}{c} \]
10. Add Preprocessing

Alternative 9: 43.0% accurate, 5.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 61.6%

   \[\frac{b \cdot c - a \cdot d}{c \cdot c + d \cdot d} \]
2. Add Preprocessing

3. Taylor expanded in c around inf 38.0%

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

4. Final simplification 38.0%

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

Developer target: 99.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left|d\right| < \left|c\right|:\\ \;\;\;\;\frac{b - a \cdot \frac{d}{c}}{c + d \cdot \frac{d}{c}}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(-a\right) + b \cdot \frac{c}{d}}{d + c \cdot \frac{c}{d}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (< (fabs d) (fabs c))
   (/ (- b (* a (/ d c))) (+ c (* d (/ d c))))
   (/ (+ (- a) (* b (/ c d))) (+ d (* c (/ c d))))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (fabs(d) < fabs(c)) {
		tmp = (b - (a * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (-a + (b * (c / d))) / (d + (c * (c / d)));
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c, d)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: d
    real(8) :: tmp
    if (abs(d) < abs(c)) then
        tmp = (b - (a * (d / c))) / (c + (d * (d / c)))
    else
        tmp = (-a + (b * (c / d))) / (d + (c * (c / d)))
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if (Math.abs(d) < Math.abs(c)) {
		tmp = (b - (a * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (-a + (b * (c / d))) / (d + (c * (c / d)));
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if math.fabs(d) < math.fabs(c):
		tmp = (b - (a * (d / c))) / (c + (d * (d / c)))
	else:
		tmp = (-a + (b * (c / d))) / (d + (c * (c / d)))
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (abs(d) < abs(c))
		tmp = Float64(Float64(b - Float64(a * Float64(d / c))) / Float64(c + Float64(d * Float64(d / c))));
	else
		tmp = Float64(Float64(Float64(-a) + Float64(b * Float64(c / d))) / Float64(d + Float64(c * Float64(c / d))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (abs(d) < abs(c))
		tmp = (b - (a * (d / c))) / (c + (d * (d / c)));
	else
		tmp = (-a + (b * (c / d))) / (d + (c * (c / d)));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Less[N[Abs[d], $MachinePrecision], N[Abs[c], $MachinePrecision]], N[(N[(b - N[(a * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c + N[(d * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[((-a) + N[(b * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d + N[(c * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2024078 
(FPCore (a b c d)
  :name "Complex division, imag part"
  :precision binary64

  :alt
  (if (< (fabs d) (fabs c)) (/ (- b (* a (/ d c))) (+ c (* d (/ d c)))) (/ (+ (- a) (* b (/ c d))) (+ d (* c (/ c d)))))

  (/ (- (* b c) (* a d)) (+ (* c c) (* d d))))