Complex division, real part

Percentage Accurate: 62.4% → 85.5%

Time: 10.0s

Alternatives: 9

Speedup: 1.1×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 62.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 85.5% accurate, 0.0× speedup

Math

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

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))) INFINITY)
   (* (/ 1.0 (hypot c d)) (/ (fma a c (* b d)) (hypot c d)))
   (/ (+ b (/ 1.0 (/ (/ d c) a))) d)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (*.f64 a c) (*.f64 b d)) (+.f64 (*.f64 c c) (*.f64 d d))) < +inf.0

   1. Initial program 80.1%

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

      1. fma-define 80.1%

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

      2. fma-define 80.1%

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

   3. Simplified 80.1%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, c, b \cdot d\right)}{\mathsf{fma}\left(c, c, d \cdot d\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-un-lft-identity 80.1%

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

      2. fma-define 80.1%

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

      3. add-sqr-sqrt 80.1%

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

      4. times-frac 80.0%

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

      5. fma-define 80.0%

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

      6. hypot-define 80.0%

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

      7. fma-define 80.0%

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

      8. fma-define 80.0%

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

      9. hypot-define 96.5%

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

   6. Applied egg-rr 96.5%

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

   if +inf.0 < (/.f64 (+.f64 (*.f64 a c) (*.f64 b d)) (+.f64 (*.f64 c c) (*.f64 d d)))

   1. Initial program 0.0%

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

      1. fma-define 0.0%

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

      2. fma-define 0.0%

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

   3. Simplified 0.0%

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

   5. Taylor expanded in d around inf 46.2%

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

      1. clear-num 46.2%

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

      2. inv-pow 46.2%

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

      3. *-commutative 46.2%

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

   7. Applied egg-rr 46.2%

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

      1. unpow-1 46.2%

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

      2. associate-/r* 55.0%

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

   9. Simplified 55.0%

      \[\leadsto \frac{b + \color{blue}{\frac{1}{\frac{\frac{d}{c}}{a}}}}{d} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 79.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -1.6 \cdot 10^{+97}:\\ \;\;\;\;\frac{b + a \cdot \frac{c}{d}}{d}\\ \mathbf{elif}\;d \leq 3.2 \cdot 10^{-165}:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c}\\ \mathbf{elif}\;d \leq 1.35 \cdot 10^{+92}:\\ \;\;\;\;\frac{\mathsf{fma}\left(a, c, b \cdot d\right)}{\mathsf{fma}\left(c, c, d \cdot d\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \mathsf{fma}\left(a, \frac{c}{d}, b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= d -1.6e+97)
   (/ (+ b (* a (/ c d))) d)
   (if (<= d 3.2e-165)
     (/ (+ a (* b (/ d c))) c)
     (if (<= d 1.35e+92)
       (/ (fma a c (* b d)) (fma c c (* d d)))
       (* (/ 1.0 (hypot c d)) (fma a (/ c d) b))))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (d <= -1.6e+97) {
		tmp = (b + (a * (c / d))) / d;
	} else if (d <= 3.2e-165) {
		tmp = (a + (b * (d / c))) / c;
	} else if (d <= 1.35e+92) {
		tmp = fma(a, c, (b * d)) / fma(c, c, (d * d));
	} else {
		tmp = (1.0 / hypot(c, d)) * fma(a, (c / d), b);
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (d <= -1.6e+97)
		tmp = Float64(Float64(b + Float64(a * Float64(c / d))) / d);
	elseif (d <= 3.2e-165)
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / c);
	elseif (d <= 1.35e+92)
		tmp = Float64(fma(a, c, Float64(b * d)) / fma(c, c, Float64(d * d)));
	else
		tmp = Float64(Float64(1.0 / hypot(c, d)) * fma(a, Float64(c / d), b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[d, -1.6e+97], N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[d, 3.2e-165], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[d, 1.35e+92], N[(N[(a * c + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(c * c + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sqrt[c ^ 2 + d ^ 2], $MachinePrecision]), $MachinePrecision] * N[(a * N[(c / d), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if d < -1.60000000000000008e97

   1. Initial program 36.3%

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

      1. fma-define 36.3%

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

      2. fma-define 36.3%

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

   3. Simplified 36.3%

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

   5. Taylor expanded in d around inf 87.9%

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

      1. associate-/l* 92.1%

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

   7. Simplified 92.1%

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

   if -1.60000000000000008e97 < d < 3.20000000000000013e-165

   1. Initial program 75.6%

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

      1. fma-define 75.6%

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

      2. fma-define 75.6%

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

   3. Simplified 75.6%

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

   5. Taylor expanded in c around inf 83.3%

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

      1. *-commutative 83.3%

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

   7. Simplified 83.3%

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

   8. Taylor expanded in d around 0 83.3%

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

      1. associate-*r/ 84.2%

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

   10. Simplified 84.2%

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

   if 3.20000000000000013e-165 < d < 1.35e92

   1. Initial program 88.7%

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

      1. fma-define 88.7%

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

      2. fma-define 88.7%

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

   3. Simplified 88.7%

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

   if 1.35e92 < d

   1. Initial program 39.8%

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

      1. fma-define 39.8%

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

      2. fma-define 39.8%

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

   3. Simplified 39.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, c, b \cdot d\right)}{\mathsf{fma}\left(c, c, d \cdot d\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-un-lft-identity 39.8%

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

      2. fma-define 39.8%

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

      3. add-sqr-sqrt 39.8%

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

      4. times-frac 39.7%

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

      5. fma-define 39.7%

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

      6. hypot-define 39.7%

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

      7. fma-define 39.7%

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

      8. fma-define 39.7%

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

      9. hypot-define 64.8%

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

   6. Applied egg-rr 64.8%

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

   7. Taylor expanded in c around 0 76.8%

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

      1. associate-*r/ 80.0%

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

      2. +-commutative 80.0%

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

      3. fma-undefine 80.0%

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

   9. Simplified 80.0%

      \[\leadsto \frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \color{blue}{\mathsf{fma}\left(a, \frac{c}{d}, b\right)} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 3: 79.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;d \leq -6.2 \cdot 10^{+97}:\\ \;\;\;\;\frac{b + a \cdot \frac{c}{d}}{d}\\ \mathbf{elif}\;d \leq 3.2 \cdot 10^{-165}:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c}\\ \mathbf{elif}\;d \leq 1.2 \cdot 10^{+92}:\\ \;\;\;\;\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \mathsf{fma}\left(a, \frac{c}{d}, b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= d -6.2e+97)
   (/ (+ b (* a (/ c d))) d)
   (if (<= d 3.2e-165)
     (/ (+ a (* b (/ d c))) c)
     (if (<= d 1.2e+92)
       (/ (+ (* a c) (* b d)) (+ (* c c) (* d d)))
       (* (/ 1.0 (hypot c d)) (fma a (/ c d) b))))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (d <= -6.2e+97) {
		tmp = (b + (a * (c / d))) / d;
	} else if (d <= 3.2e-165) {
		tmp = (a + (b * (d / c))) / c;
	} else if (d <= 1.2e+92) {
		tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
	} else {
		tmp = (1.0 / hypot(c, d)) * fma(a, (c / d), b);
	}
	return tmp;
}

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (d <= -6.2e+97)
		tmp = Float64(Float64(b + Float64(a * Float64(c / d))) / d);
	elseif (d <= 3.2e-165)
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / c);
	elseif (d <= 1.2e+92)
		tmp = Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)));
	else
		tmp = Float64(Float64(1.0 / hypot(c, d)) * fma(a, Float64(c / d), b));
	end
	return tmp
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[d, -6.2e+97], N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], If[LessEqual[d, 3.2e-165], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[d, 1.2e+92], N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 / N[Sqrt[c ^ 2 + d ^ 2], $MachinePrecision]), $MachinePrecision] * N[(a * N[(c / d), $MachinePrecision] + b), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if d < -6.19999999999999962e97

   1. Initial program 36.3%

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

      1. fma-define 36.3%

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

      2. fma-define 36.3%

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

   3. Simplified 36.3%

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

   5. Taylor expanded in d around inf 87.9%

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

      1. associate-/l* 92.1%

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

   7. Simplified 92.1%

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

   if -6.19999999999999962e97 < d < 3.20000000000000013e-165

   1. Initial program 75.6%

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

      1. fma-define 75.6%

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

      2. fma-define 75.6%

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

   3. Simplified 75.6%

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

   5. Taylor expanded in c around inf 83.3%

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

      1. *-commutative 83.3%

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

   7. Simplified 83.3%

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

   8. Taylor expanded in d around 0 83.3%

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

      1. associate-*r/ 84.2%

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

   10. Simplified 84.2%

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

   if 3.20000000000000013e-165 < d < 1.20000000000000002e92

   1. Initial program 88.7%

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

   if 1.20000000000000002e92 < d

   1. Initial program 39.8%

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

      1. fma-define 39.8%

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

      2. fma-define 39.8%

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

   3. Simplified 39.8%

      \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(a, c, b \cdot d\right)}{\mathsf{fma}\left(c, c, d \cdot d\right)}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. *-un-lft-identity 39.8%

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

      2. fma-define 39.8%

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

      3. add-sqr-sqrt 39.8%

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

      4. times-frac 39.7%

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

      5. fma-define 39.7%

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

      6. hypot-define 39.7%

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

      7. fma-define 39.7%

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

      8. fma-define 39.7%

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

      9. hypot-define 64.8%

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

   6. Applied egg-rr 64.8%

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

   7. Taylor expanded in c around 0 76.8%

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

      1. associate-*r/ 80.0%

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

      2. +-commutative 80.0%

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

      3. fma-undefine 80.0%

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

   9. Simplified 80.0%

      \[\leadsto \frac{1}{\mathsf{hypot}\left(c, d\right)} \cdot \color{blue}{\mathsf{fma}\left(a, \frac{c}{d}, b\right)} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 4: 79.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{b + a \cdot \frac{c}{d}}{d}\\ \mathbf{if}\;d \leq -1.6 \cdot 10^{+97}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;d \leq 3.2 \cdot 10^{-165}:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c}\\ \mathbf{elif}\;d \leq 5.3 \cdot 10^{+91}:\\ \;\;\;\;\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (let* ((t_0 (/ (+ b (* a (/ c d))) d)))
   (if (<= d -1.6e+97)
     t_0
     (if (<= d 3.2e-165)
       (/ (+ a (* b (/ d c))) c)
       (if (<= d 5.3e+91) (/ (+ (* a c) (* b d)) (+ (* c c) (* d d))) t_0)))))

C

double code(double a, double b, double c, double d) {
	double t_0 = (b + (a * (c / d))) / d;
	double tmp;
	if (d <= -1.6e+97) {
		tmp = t_0;
	} else if (d <= 3.2e-165) {
		tmp = (a + (b * (d / c))) / c;
	} else if (d <= 5.3e+91) {
		tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
	} 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 = (b + (a * (c / d))) / d
    if (d <= (-1.6d+97)) then
        tmp = t_0
    else if (d <= 3.2d-165) then
        tmp = (a + (b * (d / c))) / c
    else if (d <= 5.3d+91) then
        tmp = ((a * c) + (b * d)) / ((c * c) + (d * d))
    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 = (b + (a * (c / d))) / d;
	double tmp;
	if (d <= -1.6e+97) {
		tmp = t_0;
	} else if (d <= 3.2e-165) {
		tmp = (a + (b * (d / c))) / c;
	} else if (d <= 5.3e+91) {
		tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	t_0 = (b + (a * (c / d))) / d
	tmp = 0
	if d <= -1.6e+97:
		tmp = t_0
	elif d <= 3.2e-165:
		tmp = (a + (b * (d / c))) / c
	elif d <= 5.3e+91:
		tmp = ((a * c) + (b * d)) / ((c * c) + (d * d))
	else:
		tmp = t_0
	return tmp

Julia

function code(a, b, c, d)
	t_0 = Float64(Float64(b + Float64(a * Float64(c / d))) / d)
	tmp = 0.0
	if (d <= -1.6e+97)
		tmp = t_0;
	elseif (d <= 3.2e-165)
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / c);
	elseif (d <= 5.3e+91)
		tmp = Float64(Float64(Float64(a * c) + Float64(b * d)) / Float64(Float64(c * c) + Float64(d * d)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	t_0 = (b + (a * (c / d))) / d;
	tmp = 0.0;
	if (d <= -1.6e+97)
		tmp = t_0;
	elseif (d <= 3.2e-165)
		tmp = (a + (b * (d / c))) / c;
	elseif (d <= 5.3e+91)
		tmp = ((a * c) + (b * d)) / ((c * c) + (d * d));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := Block[{t$95$0 = N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision]}, If[LessEqual[d, -1.6e+97], t$95$0, If[LessEqual[d, 3.2e-165], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[d, 5.3e+91], N[(N[(N[(a * c), $MachinePrecision] + N[(b * d), $MachinePrecision]), $MachinePrecision] / N[(N[(c * c), $MachinePrecision] + N[(d * d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if d < -1.60000000000000008e97 or 5.29999999999999997e91 < d

   1. Initial program 38.2%

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

      1. fma-define 38.2%

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

      2. fma-define 38.2%

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

   3. Simplified 38.2%

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

   5. Taylor expanded in d around inf 80.7%

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

      1. associate-/l* 84.3%

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

   7. Simplified 84.3%

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

   if -1.60000000000000008e97 < d < 3.20000000000000013e-165

   1. Initial program 75.6%

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

      1. fma-define 75.6%

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

      2. fma-define 75.6%

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

   3. Simplified 75.6%

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

   5. Taylor expanded in c around inf 83.3%

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

      1. *-commutative 83.3%

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

   7. Simplified 83.3%

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

   8. Taylor expanded in d around 0 83.3%

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

      1. associate-*r/ 84.2%

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

   10. Simplified 84.2%

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

   if 3.20000000000000013e-165 < d < 5.29999999999999997e91

   1. Initial program 88.7%

      \[\frac{a \cdot c + b \cdot d}{c \cdot c + d \cdot d} \]
   2. Add Preprocessing
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 72.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= d -2.3e+97) (not (<= d 4.9e-9)))
   (/ b d)
   (/ (+ a (* b (/ d c))) c)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((d <= -2.3e+97) || !(d <= 4.9e-9)) {
		tmp = b / d;
	} else {
		tmp = (a + (b * (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 <= (-2.3d+97)) .or. (.not. (d <= 4.9d-9))) then
        tmp = b / d
    else
        tmp = (a + (b * (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 <= -2.3e+97) || !(d <= 4.9e-9)) {
		tmp = b / d;
	} else {
		tmp = (a + (b * (d / c))) / c;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if d < -2.30000000000000006e97 or 4.90000000000000004e-9 < d

   1. Initial program 47.1%

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

      1. fma-define 47.2%

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

      2. fma-define 47.2%

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

   3. Simplified 47.2%

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

   5. Taylor expanded in c around 0 69.8%

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

   if -2.30000000000000006e97 < d < 4.90000000000000004e-9

   1. Initial program 78.9%

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

      1. fma-define 78.9%

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

      2. fma-define 78.9%

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

   3. Simplified 78.9%

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

   5. Taylor expanded in c around inf 79.3%

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

      1. *-commutative 79.3%

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

   7. Simplified 79.3%

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

   8. Taylor expanded in d around 0 79.3%

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

      1. associate-*r/ 80.0%

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

   10. Simplified 80.0%

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

4. Final simplification 75.6%

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

Alternative 6: 78.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -1.2 \cdot 10^{-23}:\\ \;\;\;\;\frac{a + \frac{b}{\frac{c}{d}}}{c}\\ \mathbf{elif}\;c \leq 2.05 \cdot 10^{-7}:\\ \;\;\;\;\frac{b + \frac{a \cdot c}{d}}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -1.2e-23)
   (/ (+ a (/ b (/ c d))) c)
   (if (<= c 2.05e-7) (/ (+ b (/ (* a c) d)) d) (/ (+ a (* b (/ d c))) c))))

C

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

Python

def code(a, b, c, d):
	tmp = 0
	if c <= -1.2e-23:
		tmp = (a + (b / (c / d))) / c
	elif c <= 2.05e-7:
		tmp = (b + ((a * c) / d)) / d
	else:
		tmp = (a + (b * (d / c))) / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -1.2e-23)
		tmp = Float64(Float64(a + Float64(b / Float64(c / d))) / c);
	elseif (c <= 2.05e-7)
		tmp = Float64(Float64(b + Float64(Float64(a * c) / d)) / d);
	else
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (c <= -1.2e-23)
		tmp = (a + (b / (c / d))) / c;
	elseif (c <= 2.05e-7)
		tmp = (b + ((a * c) / d)) / d;
	else
		tmp = (a + (b * (d / c))) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -1.2e-23], N[(N[(a + N[(b / N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[c, 2.05e-7], N[(N[(b + N[(N[(a * c), $MachinePrecision] / d), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if c < -1.19999999999999998e-23

   1. Initial program 62.0%

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

      1. fma-define 62.0%

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

      2. fma-define 62.0%

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

   3. Simplified 62.0%

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

   5. Taylor expanded in c around inf 71.4%

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

      1. *-commutative 71.4%

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

   7. Simplified 71.4%

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

   8. Taylor expanded in d around 0 71.4%

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

      1. associate-*r/ 71.6%

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

   10. Simplified 71.6%

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

       1. clear-num 71.7%

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

       2. un-div-inv 71.7%

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

   12. Applied egg-rr 71.7%

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

   if -1.19999999999999998e-23 < c < 2.05e-7

   1. Initial program 75.7%

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

      1. fma-define 75.7%

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

      2. fma-define 75.7%

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

   3. Simplified 75.7%

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

   5. Taylor expanded in d around inf 85.0%

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

   if 2.05e-7 < c

   1. Initial program 47.6%

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

      1. fma-define 47.6%

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

      2. fma-define 47.6%

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

   3. Simplified 47.6%

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

   5. Taylor expanded in c around inf 79.4%

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

      1. *-commutative 79.4%

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

   7. Simplified 79.4%

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

   8. Taylor expanded in d around 0 79.4%

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

      1. associate-*r/ 82.6%

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

   10. Simplified 82.6%

       \[\leadsto \frac{a + \color{blue}{b \cdot \frac{d}{c}}}{c} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 78.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -3.5 \cdot 10^{-23}:\\ \;\;\;\;\frac{a + \frac{b}{\frac{c}{d}}}{c}\\ \mathbf{elif}\;c \leq 1.15 \cdot 10^{-8}:\\ \;\;\;\;\frac{b + a \cdot \frac{c}{d}}{d}\\ \mathbf{else}:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (<= c -3.5e-23)
   (/ (+ a (/ b (/ c d))) c)
   (if (<= c 1.15e-8) (/ (+ b (* a (/ c d))) d) (/ (+ a (* b (/ d c))) c))))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if (c <= -3.5e-23) {
		tmp = (a + (b / (c / d))) / c;
	} else if (c <= 1.15e-8) {
		tmp = (b + (a * (c / d))) / d;
	} else {
		tmp = (a + (b * (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 (c <= (-3.5d-23)) then
        tmp = (a + (b / (c / d))) / c
    else if (c <= 1.15d-8) then
        tmp = (b + (a * (c / d))) / d
    else
        tmp = (a + (b * (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 (c <= -3.5e-23) {
		tmp = (a + (b / (c / d))) / c;
	} else if (c <= 1.15e-8) {
		tmp = (b + (a * (c / d))) / d;
	} else {
		tmp = (a + (b * (d / c))) / c;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if c <= -3.5e-23:
		tmp = (a + (b / (c / d))) / c
	elif c <= 1.15e-8:
		tmp = (b + (a * (c / d))) / d
	else:
		tmp = (a + (b * (d / c))) / c
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if (c <= -3.5e-23)
		tmp = Float64(Float64(a + Float64(b / Float64(c / d))) / c);
	elseif (c <= 1.15e-8)
		tmp = Float64(Float64(b + Float64(a * Float64(c / d))) / d);
	else
		tmp = Float64(Float64(a + Float64(b * Float64(d / c))) / c);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if (c <= -3.5e-23)
		tmp = (a + (b / (c / d))) / c;
	elseif (c <= 1.15e-8)
		tmp = (b + (a * (c / d))) / d;
	else
		tmp = (a + (b * (d / c))) / c;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[LessEqual[c, -3.5e-23], N[(N[(a + N[(b / N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[c, 1.15e-8], N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / d), $MachinePrecision], N[(N[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if c < -3.49999999999999993e-23

   1. Initial program 62.0%

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

      1. fma-define 62.0%

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

      2. fma-define 62.0%

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

   3. Simplified 62.0%

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

   5. Taylor expanded in c around inf 71.4%

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

      1. *-commutative 71.4%

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

   7. Simplified 71.4%

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

   8. Taylor expanded in d around 0 71.4%

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

      1. associate-*r/ 71.6%

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

   10. Simplified 71.6%

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

       1. clear-num 71.7%

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

       2. un-div-inv 71.7%

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

   12. Applied egg-rr 71.7%

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

   if -3.49999999999999993e-23 < c < 1.15e-8

   1. Initial program 75.7%

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

      1. fma-define 75.7%

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

      2. fma-define 75.7%

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

   3. Simplified 75.7%

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

   5. Taylor expanded in d around inf 85.0%

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

      1. associate-/l* 83.9%

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

   7. Simplified 83.9%

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

   if 1.15e-8 < c

   1. Initial program 47.6%

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

      1. fma-define 47.6%

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

      2. fma-define 47.6%

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

   3. Simplified 47.6%

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

   5. Taylor expanded in c around inf 79.4%

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

      1. *-commutative 79.4%

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

   7. Simplified 79.4%

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

   8. Taylor expanded in d around 0 79.4%

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

      1. associate-*r/ 82.6%

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

   10. Simplified 82.6%

       \[\leadsto \frac{a + \color{blue}{b \cdot \frac{d}{c}}}{c} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 64.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq -2.8 \cdot 10^{-33} \lor \neg \left(c \leq 1.16 \cdot 10^{-8}\right):\\ \;\;\;\;\frac{a}{c}\\ \mathbf{else}:\\ \;\;\;\;\frac{b}{d}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b c d)
 :precision binary64
 (if (or (<= c -2.8e-33) (not (<= c 1.16e-8))) (/ a c) (/ b d)))

C

double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -2.8e-33) || !(c <= 1.16e-8)) {
		tmp = a / c;
	} else {
		tmp = b / 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 ((c <= (-2.8d-33)) .or. (.not. (c <= 1.16d-8))) then
        tmp = a / c
    else
        tmp = b / d
    end if
    code = tmp
end function

Java

public static double code(double a, double b, double c, double d) {
	double tmp;
	if ((c <= -2.8e-33) || !(c <= 1.16e-8)) {
		tmp = a / c;
	} else {
		tmp = b / d;
	}
	return tmp;
}

Python

def code(a, b, c, d):
	tmp = 0
	if (c <= -2.8e-33) or not (c <= 1.16e-8):
		tmp = a / c
	else:
		tmp = b / d
	return tmp

Julia

function code(a, b, c, d)
	tmp = 0.0
	if ((c <= -2.8e-33) || !(c <= 1.16e-8))
		tmp = Float64(a / c);
	else
		tmp = Float64(b / d);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, c, d)
	tmp = 0.0;
	if ((c <= -2.8e-33) || ~((c <= 1.16e-8)))
		tmp = a / c;
	else
		tmp = b / d;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_, d_] := If[Or[LessEqual[c, -2.8e-33], N[Not[LessEqual[c, 1.16e-8]], $MachinePrecision]], N[(a / c), $MachinePrecision], N[(b / d), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < -2.8e-33 or 1.15999999999999996e-8 < c

   1. Initial program 54.3%

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

      1. fma-define 54.3%

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

      2. fma-define 54.3%

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

   3. Simplified 54.3%

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

   5. Taylor expanded in c around inf 68.0%

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

   if -2.8e-33 < c < 1.15999999999999996e-8

   1. Initial program 76.1%

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

      1. fma-define 76.1%

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

      2. fma-define 76.1%

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

   3. Simplified 76.1%

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

   5. Taylor expanded in c around 0 71.7%

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

4. Final simplification 69.9%

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

Alternative 9: 42.3% 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 65.4%

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

   1. fma-define 65.4%

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

   2. fma-define 65.4%

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

3. Simplified 65.4%

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

5. Taylor expanded in c around inf 42.2%

   \[\leadsto \color{blue}{\frac{a}{c}} \]
6. Add Preprocessing

Developer Target 1: 99.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left|d\right| < \left|c\right|:\\ \;\;\;\;\frac{a + b \cdot \frac{d}{c}}{c + d \cdot \frac{d}{c}}\\ \mathbf{else}:\\ \;\;\;\;\frac{b + a \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))
   (/ (+ a (* b (/ d c))) (+ c (* d (/ d c))))
   (/ (+ b (* a (/ 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 = (a + (b * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (b + (a * (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 = (a + (b * (d / c))) / (c + (d * (d / c)))
    else
        tmp = (b + (a * (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 = (a + (b * (d / c))) / (c + (d * (d / c)));
	} else {
		tmp = (b + (a * (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 = (a + (b * (d / c))) / (c + (d * (d / c)))
	else:
		tmp = (b + (a * (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(a + Float64(b * Float64(d / c))) / Float64(c + Float64(d * Float64(d / c))));
	else
		tmp = Float64(Float64(b + Float64(a * 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 = (a + (b * (d / c))) / (c + (d * (d / c)));
	else
		tmp = (b + (a * (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[(a + N[(b * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(c + N[(d * N[(d / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(a * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(d + N[(c * N[(c / d), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< (fabs d) (fabs c)) (/ (+ a (* b (/ d c))) (+ c (* d (/ d c)))) (/ (+ b (* a (/ c d))) (+ d (* c (/ c d))))))

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