Quotient of products

Percentage Accurate: 86.1% → 97.5%

Time: 5.1s

Alternatives: 7

Speedup: 1.0×

• 20.0% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{a1 \cdot a2}{b1 \cdot b2} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2) :precision binary64 (/ (* a1 a2) (* b1 b2)))

C

double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

Fortran

real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = (a1 * a2) / (b1 * b2)
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

Python

def code(a1, a2, b1, b2):
	return (a1 * a2) / (b1 * b2)

Julia

function code(a1, a2, b1, b2)
	return Float64(Float64(a1 * a2) / Float64(b1 * b2))
end

MATLAB

function tmp = code(a1, a2, b1, b2)
	tmp = (a1 * a2) / (b1 * b2);
end

Wolfram

code[a1_, a2_, b1_, b2_] := N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]

Initial Program: 86.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{a1 \cdot a2}{b1 \cdot b2} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2) :precision binary64 (/ (* a1 a2) (* b1 b2)))

C

double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

Fortran

real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = (a1 * a2) / (b1 * b2)
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

Python

def code(a1, a2, b1, b2):
	return (a1 * a2) / (b1 * b2)

Julia

function code(a1, a2, b1, b2)
	return Float64(Float64(a1 * a2) / Float64(b1 * b2))
end

MATLAB

function tmp = code(a1, a2, b1, b2)
	tmp = (a1 * a2) / (b1 * b2);
end

Wolfram

code[a1_, a2_, b1_, b2_] := N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]

Alternative 1: 97.5% accurate, 0.2× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ \begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ t_1 := \frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{if}\;t_0 \leq -\infty:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq -2 \cdot 10^{-322}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+297}:\\ \;\;\;\;\left(a1 \cdot a2\right) \cdot \frac{\frac{1}{b1}}{b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (/ (* a1 a2) (* b1 b2))) (t_1 (* (/ a1 b1) (/ a2 b2))))
   (if (<= t_0 (- INFINITY))
     t_1
     (if (<= t_0 -2e-322)
       t_0
       (if (<= t_0 0.0)
         t_1
         (if (<= t_0 5e+297)
           (* (* a1 a2) (/ (/ 1.0 b1) b2))
           (* (/ a2 b1) (/ a1 b2))))))))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double t_1 = (a1 / b1) * (a2 / b2);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_0 <= -2e-322) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+297) {
		tmp = (a1 * a2) * ((1.0 / b1) / b2);
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double t_1 = (a1 / b1) * (a2 / b2);
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_0 <= -2e-322) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+297) {
		tmp = (a1 * a2) * ((1.0 / b1) / b2);
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	t_0 = (a1 * a2) / (b1 * b2)
	t_1 = (a1 / b1) * (a2 / b2)
	tmp = 0
	if t_0 <= -math.inf:
		tmp = t_1
	elif t_0 <= -2e-322:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = t_1
	elif t_0 <= 5e+297:
		tmp = (a1 * a2) * ((1.0 / b1) / b2)
	else:
		tmp = (a2 / b1) * (a1 / b2)
	return tmp

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	t_0 = Float64(Float64(a1 * a2) / Float64(b1 * b2))
	t_1 = Float64(Float64(a1 / b1) * Float64(a2 / b2))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_0 <= -2e-322)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 5e+297)
		tmp = Float64(Float64(a1 * a2) * Float64(Float64(1.0 / b1) / b2));
	else
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	end
	return tmp
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp_2 = code(a1, a2, b1, b2)
	t_0 = (a1 * a2) / (b1 * b2);
	t_1 = (a1 / b1) * (a2 / b2);
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = t_1;
	elseif (t_0 <= -2e-322)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 5e+297)
		tmp = (a1 * a2) * ((1.0 / b1) / b2);
	else
		tmp = (a2 / b1) * (a1 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], t$95$1, If[LessEqual[t$95$0, -2e-322], t$95$0, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 5e+297], N[(N[(a1 * a2), $MachinePrecision] * N[(N[(1.0 / b1), $MachinePrecision] / b2), $MachinePrecision]), $MachinePrecision], N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -inf.0 or -1.97626e-322 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0

   1. Initial program 71.3%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. times-frac 92.9%

         \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   3. Simplified 92.9%

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   if -inf.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -1.97626e-322

   1. Initial program 99.5%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]

   if -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 4.9999999999999998e297

   1. Initial program 99.2%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. div-inv 99.3%

         \[\leadsto \color{blue}{\left(a1 \cdot a2\right) \cdot \frac{1}{b1 \cdot b2}} \]

      2. *-commutative 99.3%

         \[\leadsto \color{blue}{\frac{1}{b1 \cdot b2} \cdot \left(a1 \cdot a2\right)} \]

      3. associate-/r* 99.4%

         \[\leadsto \color{blue}{\frac{\frac{1}{b1}}{b2}} \cdot \left(a1 \cdot a2\right) \]

   3. Applied egg-rr 99.4%

      \[\leadsto \color{blue}{\frac{\frac{1}{b1}}{b2} \cdot \left(a1 \cdot a2\right)} \]

   if 4.9999999999999998e297 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 64.1%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. *-commutative 64.1%

         \[\leadsto \frac{\color{blue}{a2 \cdot a1}}{b1 \cdot b2} \]

      2. times-frac 99.6%

         \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

   3. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 96.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq -\infty:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq -2 \cdot 10^{-322}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 0:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 5 \cdot 10^{+297}:\\ \;\;\;\;\left(a1 \cdot a2\right) \cdot \frac{\frac{1}{b1}}{b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternative 2: 97.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ \begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ t_1 := \frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{if}\;t_0 \leq -\infty:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq -2 \cdot 10^{-322}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+297}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (/ (* a1 a2) (* b1 b2))) (t_1 (* (/ a1 b1) (/ a2 b2))))
   (if (<= t_0 (- INFINITY))
     t_1
     (if (<= t_0 -2e-322)
       t_0
       (if (<= t_0 0.0)
         t_1
         (if (<= t_0 5e+297) t_0 (* (/ a2 b1) (/ a1 b2))))))))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double t_1 = (a1 / b1) * (a2 / b2);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_0 <= -2e-322) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+297) {
		tmp = t_0;
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double t_1 = (a1 / b1) * (a2 / b2);
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_0 <= -2e-322) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+297) {
		tmp = t_0;
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	t_0 = (a1 * a2) / (b1 * b2)
	t_1 = (a1 / b1) * (a2 / b2)
	tmp = 0
	if t_0 <= -math.inf:
		tmp = t_1
	elif t_0 <= -2e-322:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = t_1
	elif t_0 <= 5e+297:
		tmp = t_0
	else:
		tmp = (a2 / b1) * (a1 / b2)
	return tmp

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	t_0 = Float64(Float64(a1 * a2) / Float64(b1 * b2))
	t_1 = Float64(Float64(a1 / b1) * Float64(a2 / b2))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_0 <= -2e-322)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 5e+297)
		tmp = t_0;
	else
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	end
	return tmp
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp_2 = code(a1, a2, b1, b2)
	t_0 = (a1 * a2) / (b1 * b2);
	t_1 = (a1 / b1) * (a2 / b2);
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = t_1;
	elseif (t_0 <= -2e-322)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 5e+297)
		tmp = t_0;
	else
		tmp = (a2 / b1) * (a1 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], t$95$1, If[LessEqual[t$95$0, -2e-322], t$95$0, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 5e+297], t$95$0, N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -inf.0 or -1.97626e-322 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0

   1. Initial program 71.3%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. times-frac 92.9%

         \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   3. Simplified 92.9%

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   if -inf.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -1.97626e-322 or -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 4.9999999999999998e297

   1. Initial program 99.4%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]

   if 4.9999999999999998e297 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 64.1%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. *-commutative 64.1%

         \[\leadsto \frac{\color{blue}{a2 \cdot a1}}{b1 \cdot b2} \]

      2. times-frac 99.6%

         \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

   3. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 96.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq -\infty:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq -2 \cdot 10^{-322}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 0:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 5 \cdot 10^{+297}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternative 3: 93.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -2 \cdot 10^{+153} \lor \neg \left(b1 \cdot b2 \leq -1 \cdot 10^{-172}\right) \land \left(b1 \cdot b2 \leq 4 \cdot 10^{-190} \lor \neg \left(b1 \cdot b2 \leq 5 \cdot 10^{+168}\right)\right):\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \end{array} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2)
 :precision binary64
 (if (or (<= (* b1 b2) -2e+153)
         (and (not (<= (* b1 b2) -1e-172))
              (or (<= (* b1 b2) 4e-190) (not (<= (* b1 b2) 5e+168)))))
   (* (/ a1 b1) (/ a2 b2))
   (* a2 (/ a1 (* b1 b2)))))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	double tmp;
	if (((b1 * b2) <= -2e+153) || (!((b1 * b2) <= -1e-172) && (((b1 * b2) <= 4e-190) || !((b1 * b2) <= 5e+168)))) {
		tmp = (a1 / b1) * (a2 / b2);
	} else {
		tmp = a2 * (a1 / (b1 * b2));
	}
	return tmp;
}

Fortran

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    real(8) :: tmp
    if (((b1 * b2) <= (-2d+153)) .or. (.not. ((b1 * b2) <= (-1d-172))) .and. ((b1 * b2) <= 4d-190) .or. (.not. ((b1 * b2) <= 5d+168))) then
        tmp = (a1 / b1) * (a2 / b2)
    else
        tmp = a2 * (a1 / (b1 * b2))
    end if
    code = tmp
end function

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	double tmp;
	if (((b1 * b2) <= -2e+153) || (!((b1 * b2) <= -1e-172) && (((b1 * b2) <= 4e-190) || !((b1 * b2) <= 5e+168)))) {
		tmp = (a1 / b1) * (a2 / b2);
	} else {
		tmp = a2 * (a1 / (b1 * b2));
	}
	return tmp;
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	tmp = 0
	if ((b1 * b2) <= -2e+153) or (not ((b1 * b2) <= -1e-172) and (((b1 * b2) <= 4e-190) or not ((b1 * b2) <= 5e+168))):
		tmp = (a1 / b1) * (a2 / b2)
	else:
		tmp = a2 * (a1 / (b1 * b2))
	return tmp

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	tmp = 0.0
	if ((Float64(b1 * b2) <= -2e+153) || (!(Float64(b1 * b2) <= -1e-172) && ((Float64(b1 * b2) <= 4e-190) || !(Float64(b1 * b2) <= 5e+168))))
		tmp = Float64(Float64(a1 / b1) * Float64(a2 / b2));
	else
		tmp = Float64(a2 * Float64(a1 / Float64(b1 * b2)));
	end
	return tmp
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp_2 = code(a1, a2, b1, b2)
	tmp = 0.0;
	if (((b1 * b2) <= -2e+153) || (~(((b1 * b2) <= -1e-172)) && (((b1 * b2) <= 4e-190) || ~(((b1 * b2) <= 5e+168)))))
		tmp = (a1 / b1) * (a2 / b2);
	else
		tmp = a2 * (a1 / (b1 * b2));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := If[Or[LessEqual[N[(b1 * b2), $MachinePrecision], -2e+153], And[N[Not[LessEqual[N[(b1 * b2), $MachinePrecision], -1e-172]], $MachinePrecision], Or[LessEqual[N[(b1 * b2), $MachinePrecision], 4e-190], N[Not[LessEqual[N[(b1 * b2), $MachinePrecision], 5e+168]], $MachinePrecision]]]], N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision], N[(a2 * N[(a1 / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b1 b2) < -2e153 or -1e-172 < (*.f64 b1 b2) < 4.0000000000000001e-190 or 4.99999999999999967e168 < (*.f64 b1 b2)

   1. Initial program 73.9%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. times-frac 92.3%

         \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   3. Simplified 92.3%

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   if -2e153 < (*.f64 b1 b2) < -1e-172 or 4.0000000000000001e-190 < (*.f64 b1 b2) < 4.99999999999999967e168

   1. Initial program 91.9%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. associate-*l/ 94.6%

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      2. *-commutative 94.6%

         \[\leadsto \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]

   3. Simplified 94.6%

      \[\leadsto \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 93.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -2 \cdot 10^{+153} \lor \neg \left(b1 \cdot b2 \leq -1 \cdot 10^{-172}\right) \land \left(b1 \cdot b2 \leq 4 \cdot 10^{-190} \lor \neg \left(b1 \cdot b2 \leq 5 \cdot 10^{+168}\right)\right):\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \end{array} \]

Alternative 4: 93.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ \begin{array}{l} t_0 := a2 \cdot \frac{a1}{b1 \cdot b2}\\ t_1 := \frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+266}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-189}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{-150}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{+168}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (* a2 (/ a1 (* b1 b2)))) (t_1 (* (/ a2 b1) (/ a1 b2))))
   (if (<= (* b1 b2) -1e+266)
     t_1
     (if (<= (* b1 b2) -2e-189)
       t_0
       (if (<= (* b1 b2) 5e-150)
         t_1
         (if (<= (* b1 b2) 5e+168) t_0 (* (/ a1 b1) (/ a2 b2))))))))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	double t_0 = a2 * (a1 / (b1 * b2));
	double t_1 = (a2 / b1) * (a1 / b2);
	double tmp;
	if ((b1 * b2) <= -1e+266) {
		tmp = t_1;
	} else if ((b1 * b2) <= -2e-189) {
		tmp = t_0;
	} else if ((b1 * b2) <= 5e-150) {
		tmp = t_1;
	} else if ((b1 * b2) <= 5e+168) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / b2);
	}
	return tmp;
}

Fortran

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = a2 * (a1 / (b1 * b2))
    t_1 = (a2 / b1) * (a1 / b2)
    if ((b1 * b2) <= (-1d+266)) then
        tmp = t_1
    else if ((b1 * b2) <= (-2d-189)) then
        tmp = t_0
    else if ((b1 * b2) <= 5d-150) then
        tmp = t_1
    else if ((b1 * b2) <= 5d+168) then
        tmp = t_0
    else
        tmp = (a1 / b1) * (a2 / b2)
    end if
    code = tmp
end function

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = a2 * (a1 / (b1 * b2));
	double t_1 = (a2 / b1) * (a1 / b2);
	double tmp;
	if ((b1 * b2) <= -1e+266) {
		tmp = t_1;
	} else if ((b1 * b2) <= -2e-189) {
		tmp = t_0;
	} else if ((b1 * b2) <= 5e-150) {
		tmp = t_1;
	} else if ((b1 * b2) <= 5e+168) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / b2);
	}
	return tmp;
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	t_0 = a2 * (a1 / (b1 * b2))
	t_1 = (a2 / b1) * (a1 / b2)
	tmp = 0
	if (b1 * b2) <= -1e+266:
		tmp = t_1
	elif (b1 * b2) <= -2e-189:
		tmp = t_0
	elif (b1 * b2) <= 5e-150:
		tmp = t_1
	elif (b1 * b2) <= 5e+168:
		tmp = t_0
	else:
		tmp = (a1 / b1) * (a2 / b2)
	return tmp

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	t_0 = Float64(a2 * Float64(a1 / Float64(b1 * b2)))
	t_1 = Float64(Float64(a2 / b1) * Float64(a1 / b2))
	tmp = 0.0
	if (Float64(b1 * b2) <= -1e+266)
		tmp = t_1;
	elseif (Float64(b1 * b2) <= -2e-189)
		tmp = t_0;
	elseif (Float64(b1 * b2) <= 5e-150)
		tmp = t_1;
	elseif (Float64(b1 * b2) <= 5e+168)
		tmp = t_0;
	else
		tmp = Float64(Float64(a1 / b1) * Float64(a2 / b2));
	end
	return tmp
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp_2 = code(a1, a2, b1, b2)
	t_0 = a2 * (a1 / (b1 * b2));
	t_1 = (a2 / b1) * (a1 / b2);
	tmp = 0.0;
	if ((b1 * b2) <= -1e+266)
		tmp = t_1;
	elseif ((b1 * b2) <= -2e-189)
		tmp = t_0;
	elseif ((b1 * b2) <= 5e-150)
		tmp = t_1;
	elseif ((b1 * b2) <= 5e+168)
		tmp = t_0;
	else
		tmp = (a1 / b1) * (a2 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(a2 * N[(a1 / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b1 * b2), $MachinePrecision], -1e+266], t$95$1, If[LessEqual[N[(b1 * b2), $MachinePrecision], -2e-189], t$95$0, If[LessEqual[N[(b1 * b2), $MachinePrecision], 5e-150], t$95$1, If[LessEqual[N[(b1 * b2), $MachinePrecision], 5e+168], t$95$0, N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 b1 b2) < -1e266 or -2.00000000000000014e-189 < (*.f64 b1 b2) < 4.9999999999999999e-150

   1. Initial program 70.2%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. *-commutative 70.2%

         \[\leadsto \frac{\color{blue}{a2 \cdot a1}}{b1 \cdot b2} \]

      2. times-frac 93.1%

         \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

   3. Applied egg-rr 93.1%

      \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

   if -1e266 < (*.f64 b1 b2) < -2.00000000000000014e-189 or 4.9999999999999999e-150 < (*.f64 b1 b2) < 4.99999999999999967e168

   1. Initial program 92.4%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. associate-*l/ 92.8%

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      2. *-commutative 92.8%

         \[\leadsto \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]

   3. Simplified 92.8%

      \[\leadsto \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]

   if 4.99999999999999967e168 < (*.f64 b1 b2)

   1. Initial program 77.4%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. times-frac 95.0%

         \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   3. Simplified 95.0%

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 93.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+266}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-189}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{-150}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{+168}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \]

Alternative 5: 93.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ \begin{array}{l} t_0 := a1 \cdot \frac{a2}{b1 \cdot b2}\\ t_1 := \frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{if}\;b1 \cdot b2 \leq -\infty:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-199}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{-222}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq 2 \cdot 10^{+149}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (* a1 (/ a2 (* b1 b2)))) (t_1 (* (/ a2 b1) (/ a1 b2))))
   (if (<= (* b1 b2) (- INFINITY))
     t_1
     (if (<= (* b1 b2) -2e-199)
       t_0
       (if (<= (* b1 b2) 5e-222)
         t_1
         (if (<= (* b1 b2) 2e+149) t_0 (* (/ a1 b1) (/ a2 b2))))))))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	double t_0 = a1 * (a2 / (b1 * b2));
	double t_1 = (a2 / b1) * (a1 / b2);
	double tmp;
	if ((b1 * b2) <= -((double) INFINITY)) {
		tmp = t_1;
	} else if ((b1 * b2) <= -2e-199) {
		tmp = t_0;
	} else if ((b1 * b2) <= 5e-222) {
		tmp = t_1;
	} else if ((b1 * b2) <= 2e+149) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / b2);
	}
	return tmp;
}

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = a1 * (a2 / (b1 * b2));
	double t_1 = (a2 / b1) * (a1 / b2);
	double tmp;
	if ((b1 * b2) <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if ((b1 * b2) <= -2e-199) {
		tmp = t_0;
	} else if ((b1 * b2) <= 5e-222) {
		tmp = t_1;
	} else if ((b1 * b2) <= 2e+149) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / b2);
	}
	return tmp;
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	t_0 = a1 * (a2 / (b1 * b2))
	t_1 = (a2 / b1) * (a1 / b2)
	tmp = 0
	if (b1 * b2) <= -math.inf:
		tmp = t_1
	elif (b1 * b2) <= -2e-199:
		tmp = t_0
	elif (b1 * b2) <= 5e-222:
		tmp = t_1
	elif (b1 * b2) <= 2e+149:
		tmp = t_0
	else:
		tmp = (a1 / b1) * (a2 / b2)
	return tmp

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	t_0 = Float64(a1 * Float64(a2 / Float64(b1 * b2)))
	t_1 = Float64(Float64(a2 / b1) * Float64(a1 / b2))
	tmp = 0.0
	if (Float64(b1 * b2) <= Float64(-Inf))
		tmp = t_1;
	elseif (Float64(b1 * b2) <= -2e-199)
		tmp = t_0;
	elseif (Float64(b1 * b2) <= 5e-222)
		tmp = t_1;
	elseif (Float64(b1 * b2) <= 2e+149)
		tmp = t_0;
	else
		tmp = Float64(Float64(a1 / b1) * Float64(a2 / b2));
	end
	return tmp
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp_2 = code(a1, a2, b1, b2)
	t_0 = a1 * (a2 / (b1 * b2));
	t_1 = (a2 / b1) * (a1 / b2);
	tmp = 0.0;
	if ((b1 * b2) <= -Inf)
		tmp = t_1;
	elseif ((b1 * b2) <= -2e-199)
		tmp = t_0;
	elseif ((b1 * b2) <= 5e-222)
		tmp = t_1;
	elseif ((b1 * b2) <= 2e+149)
		tmp = t_0;
	else
		tmp = (a1 / b1) * (a2 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(a1 * N[(a2 / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b1 * b2), $MachinePrecision], (-Infinity)], t$95$1, If[LessEqual[N[(b1 * b2), $MachinePrecision], -2e-199], t$95$0, If[LessEqual[N[(b1 * b2), $MachinePrecision], 5e-222], t$95$1, If[LessEqual[N[(b1 * b2), $MachinePrecision], 2e+149], t$95$0, N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 b1 b2) < -inf.0 or -1.99999999999999996e-199 < (*.f64 b1 b2) < 5.00000000000000008e-222

   1. Initial program 68.1%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. *-commutative 68.1%

         \[\leadsto \frac{\color{blue}{a2 \cdot a1}}{b1 \cdot b2} \]

      2. times-frac 97.0%

         \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

   3. Applied egg-rr 97.0%

      \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

   if -inf.0 < (*.f64 b1 b2) < -1.99999999999999996e-199 or 5.00000000000000008e-222 < (*.f64 b1 b2) < 2.0000000000000001e149

   1. Initial program 90.1%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. *-commutative 90.1%

         \[\leadsto \frac{\color{blue}{a2 \cdot a1}}{b1 \cdot b2} \]

      2. associate-*l/ 94.8%

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      3. *-commutative 94.8%

         \[\leadsto \frac{a2}{\color{blue}{b2 \cdot b1}} \cdot a1 \]

   3. Applied egg-rr 94.8%

      \[\leadsto \color{blue}{\frac{a2}{b2 \cdot b1} \cdot a1} \]

   if 2.0000000000000001e149 < (*.f64 b1 b2)

   1. Initial program 78.5%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. times-frac 92.9%

         \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   3. Simplified 92.9%

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 95.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -\infty:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-199}:\\ \;\;\;\;a1 \cdot \frac{a2}{b1 \cdot b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{-222}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 2 \cdot 10^{+149}:\\ \;\;\;\;a1 \cdot \frac{a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \]

Alternative 6: 86.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ \begin{array}{l} \mathbf{if}\;b2 \leq 3.05 \cdot 10^{-263}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;a1 \cdot \frac{\frac{a2}{b2}}{b1}\\ \end{array} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2)
 :precision binary64
 (if (<= b2 3.05e-263) (* a2 (/ a1 (* b1 b2))) (* a1 (/ (/ a2 b2) b1))))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	double tmp;
	if (b2 <= 3.05e-263) {
		tmp = a2 * (a1 / (b1 * b2));
	} else {
		tmp = a1 * ((a2 / b2) / b1);
	}
	return tmp;
}

Fortran

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    real(8) :: tmp
    if (b2 <= 3.05d-263) then
        tmp = a2 * (a1 / (b1 * b2))
    else
        tmp = a1 * ((a2 / b2) / b1)
    end if
    code = tmp
end function

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	double tmp;
	if (b2 <= 3.05e-263) {
		tmp = a2 * (a1 / (b1 * b2));
	} else {
		tmp = a1 * ((a2 / b2) / b1);
	}
	return tmp;
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	tmp = 0
	if b2 <= 3.05e-263:
		tmp = a2 * (a1 / (b1 * b2))
	else:
		tmp = a1 * ((a2 / b2) / b1)
	return tmp

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	tmp = 0.0
	if (b2 <= 3.05e-263)
		tmp = Float64(a2 * Float64(a1 / Float64(b1 * b2)));
	else
		tmp = Float64(a1 * Float64(Float64(a2 / b2) / b1));
	end
	return tmp
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp_2 = code(a1, a2, b1, b2)
	tmp = 0.0;
	if (b2 <= 3.05e-263)
		tmp = a2 * (a1 / (b1 * b2));
	else
		tmp = a1 * ((a2 / b2) / b1);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := If[LessEqual[b2, 3.05e-263], N[(a2 * N[(a1 / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a1 * N[(N[(a2 / b2), $MachinePrecision] / b1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b2 < 3.0499999999999999e-263

   1. Initial program 82.9%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. associate-*l/ 83.8%

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      2. *-commutative 83.8%

         \[\leadsto \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]

   3. Simplified 83.8%

      \[\leadsto \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]

   if 3.0499999999999999e-263 < b2

   1. Initial program 81.7%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. associate-*r/ 81.7%

         \[\leadsto \color{blue}{a1 \cdot \frac{a2}{b1 \cdot b2}} \]

      2. associate-/l/ 82.8%

         \[\leadsto a1 \cdot \color{blue}{\frac{\frac{a2}{b2}}{b1}} \]

   3. Simplified 82.8%

      \[\leadsto \color{blue}{a1 \cdot \frac{\frac{a2}{b2}}{b1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 83.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b2 \leq 3.05 \cdot 10^{-263}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;a1 \cdot \frac{\frac{a2}{b2}}{b1}\\ \end{array} \]

Alternative 7: 86.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [b1, b2] = \mathsf{sort}([b1, b2])\\ \\ a1 \cdot \frac{\frac{a2}{b2}}{b1} \end{array} \]

FPCore

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
(FPCore (a1 a2 b1 b2) :precision binary64 (* a1 (/ (/ a2 b2) b1)))

C

assert(b1 < b2);
double code(double a1, double a2, double b1, double b2) {
	return a1 * ((a2 / b2) / b1);
}

Fortran

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = a1 * ((a2 / b2) / b1)
end function

Java

assert b1 < b2;
public static double code(double a1, double a2, double b1, double b2) {
	return a1 * ((a2 / b2) / b1);
}

Python

[b1, b2] = sort([b1, b2])
def code(a1, a2, b1, b2):
	return a1 * ((a2 / b2) / b1)

Julia

b1, b2 = sort([b1, b2])
function code(a1, a2, b1, b2)
	return Float64(a1 * Float64(Float64(a2 / b2) / b1))
end

MATLAB

b1, b2 = num2cell(sort([b1, b2])){:}
function tmp = code(a1, a2, b1, b2)
	tmp = a1 * ((a2 / b2) / b1);
end

Wolfram

NOTE: b1 and b2 should be sorted in increasing order before calling this function.
code[a1_, a2_, b1_, b2_] := N[(a1 * N[(N[(a2 / b2), $MachinePrecision] / b1), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 82.4%

   \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
2. Step-by-step derivation

   1. associate-*r/ 85.8%

      \[\leadsto \color{blue}{a1 \cdot \frac{a2}{b1 \cdot b2}} \]

   2. associate-/l/ 86.2%

      \[\leadsto a1 \cdot \color{blue}{\frac{\frac{a2}{b2}}{b1}} \]

3. Simplified 86.2%

   \[\leadsto \color{blue}{a1 \cdot \frac{\frac{a2}{b2}}{b1}} \]

4. Final simplification 86.2%

   \[\leadsto a1 \cdot \frac{\frac{a2}{b2}}{b1} \]

Developer target: 86.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{a1}{b1} \cdot \frac{a2}{b2} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2) :precision binary64 (* (/ a1 b1) (/ a2 b2)))

C

double code(double a1, double a2, double b1, double b2) {
	return (a1 / b1) * (a2 / b2);
}

Fortran

real(8) function code(a1, a2, b1, b2)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = (a1 / b1) * (a2 / b2)
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	return (a1 / b1) * (a2 / b2);
}

Python

def code(a1, a2, b1, b2):
	return (a1 / b1) * (a2 / b2)

Julia

function code(a1, a2, b1, b2)
	return Float64(Float64(a1 / b1) * Float64(a2 / b2))
end

MATLAB

function tmp = code(a1, a2, b1, b2)
	tmp = (a1 / b1) * (a2 / b2);
end

Wolfram

code[a1_, a2_, b1_, b2_] := N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023301 
(FPCore (a1 a2 b1 b2)
  :name "Quotient of products"
  :precision binary64

  :herbie-target
  (* (/ a1 b1) (/ a2 b2))

  (/ (* a1 a2) (* b1 b2)))