Quotient of products

Percentage Accurate: 86.1% → 95.3%

Time: 4.2s

Alternatives: 5

Speedup: 1.0×

• 20.1% 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: 95.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{if}\;t_0 \leq -5 \cdot 10^{-321}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+303}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a1}{b1}}{\frac{b2}{a2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (/ (* a1 a2) (* b1 b2))))
   (if (<= t_0 -5e-321)
     t_0
     (if (<= t_0 0.0)
       (* (/ a2 b1) (/ a1 b2))
       (if (<= t_0 5e+303) t_0 (/ (/ a1 b1) (/ b2 a2)))))))

C

double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double tmp;
	if (t_0 <= -5e-321) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (a2 / b1) * (a1 / b2);
	} else if (t_0 <= 5e+303) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) / (b2 / a2);
	}
	return tmp;
}

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
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (a1 * a2) / (b1 * b2)
    if (t_0 <= (-5d-321)) then
        tmp = t_0
    else if (t_0 <= 0.0d0) then
        tmp = (a2 / b1) * (a1 / b2)
    else if (t_0 <= 5d+303) then
        tmp = t_0
    else
        tmp = (a1 / b1) / (b2 / a2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double tmp;
	if (t_0 <= -5e-321) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (a2 / b1) * (a1 / b2);
	} else if (t_0 <= 5e+303) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) / (b2 / a2);
	}
	return tmp;
}

Python

def code(a1, a2, b1, b2):
	t_0 = (a1 * a2) / (b1 * b2)
	tmp = 0
	if t_0 <= -5e-321:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = (a2 / b1) * (a1 / b2)
	elif t_0 <= 5e+303:
		tmp = t_0
	else:
		tmp = (a1 / b1) / (b2 / a2)
	return tmp

Julia

function code(a1, a2, b1, b2)
	t_0 = Float64(Float64(a1 * a2) / Float64(b1 * b2))
	tmp = 0.0
	if (t_0 <= -5e-321)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	elseif (t_0 <= 5e+303)
		tmp = t_0;
	else
		tmp = Float64(Float64(a1 / b1) / Float64(b2 / a2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, b1, b2)
	t_0 = (a1 * a2) / (b1 * b2);
	tmp = 0.0;
	if (t_0 <= -5e-321)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = (a2 / b1) * (a1 / b2);
	elseif (t_0 <= 5e+303)
		tmp = t_0;
	else
		tmp = (a1 / b1) / (b2 / a2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-321], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+303], t$95$0, N[(N[(a1 / b1), $MachinePrecision] / N[(b2 / a2), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -4.99994e-321 or -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 4.9999999999999997e303

   1. Initial program 96.3%

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

   if -4.99994e-321 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0

   1. Initial program 82.2%

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

      1. *-commutative 82.2%

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

      2. times-frac 98.9%

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

   3. Applied egg-rr 98.9%

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

   if 4.9999999999999997e303 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 59.9%

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

      1. times-frac 95.6%

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

      2. *-commutative 95.6%

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

   3. Simplified 95.6%

      \[\leadsto \color{blue}{\frac{a2}{b2} \cdot \frac{a1}{b1}} \]
   4. Step-by-step derivation

      1. *-commutative 95.6%

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

      2. clear-num 95.6%

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

      3. un-div-inv 95.7%

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

   5. Applied egg-rr 95.7%

      \[\leadsto \color{blue}{\frac{\frac{a1}{b1}}{\frac{b2}{a2}}} \]
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 -5 \cdot 10^{-321}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 0:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 5 \cdot 10^{+303}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a1}{b1}}{\frac{b2}{a2}}\\ \end{array} \]

Alternative 2: 95.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{if}\;t_0 \leq -5 \cdot 10^{-321}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+288}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (/ (* a1 a2) (* b1 b2))))
   (if (<= t_0 -5e-321)
     t_0
     (if (<= t_0 0.0)
       (* (/ a2 b1) (/ a1 b2))
       (if (<= t_0 5e+288) t_0 (* (/ a1 b1) (/ a2 b2)))))))

C

double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double tmp;
	if (t_0 <= -5e-321) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (a2 / b1) * (a1 / b2);
	} else if (t_0 <= 5e+288) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / b2);
	}
	return tmp;
}

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
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (a1 * a2) / (b1 * b2)
    if (t_0 <= (-5d-321)) then
        tmp = t_0
    else if (t_0 <= 0.0d0) then
        tmp = (a2 / b1) * (a1 / b2)
    else if (t_0 <= 5d+288) then
        tmp = t_0
    else
        tmp = (a1 / b1) * (a2 / b2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double tmp;
	if (t_0 <= -5e-321) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = (a2 / b1) * (a1 / b2);
	} else if (t_0 <= 5e+288) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / b2);
	}
	return tmp;
}

Python

def code(a1, a2, b1, b2):
	t_0 = (a1 * a2) / (b1 * b2)
	tmp = 0
	if t_0 <= -5e-321:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = (a2 / b1) * (a1 / b2)
	elif t_0 <= 5e+288:
		tmp = t_0
	else:
		tmp = (a1 / b1) * (a2 / b2)
	return tmp

Julia

function code(a1, a2, b1, b2)
	t_0 = Float64(Float64(a1 * a2) / Float64(b1 * b2))
	tmp = 0.0
	if (t_0 <= -5e-321)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	elseif (t_0 <= 5e+288)
		tmp = t_0;
	else
		tmp = Float64(Float64(a1 / b1) * Float64(a2 / b2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, b1, b2)
	t_0 = (a1 * a2) / (b1 * b2);
	tmp = 0.0;
	if (t_0 <= -5e-321)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = (a2 / b1) * (a1 / b2);
	elseif (t_0 <= 5e+288)
		tmp = t_0;
	else
		tmp = (a1 / b1) * (a2 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-321], t$95$0, If[LessEqual[t$95$0, 0.0], N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+288], t$95$0, N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -4.99994e-321 or -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 5.0000000000000003e288

   1. Initial program 96.2%

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

   if -4.99994e-321 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0

   1. Initial program 82.2%

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

      1. *-commutative 82.2%

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

      2. times-frac 98.9%

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

   3. Applied egg-rr 98.9%

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

   if 5.0000000000000003e288 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 61.7%

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

      1. times-frac 95.8%

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

      2. *-commutative 95.8%

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

   3. Simplified 95.8%

      \[\leadsto \color{blue}{\frac{a2}{b2} \cdot \frac{a1}{b1}} \]
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 -5 \cdot 10^{-321}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 0:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq 5 \cdot 10^{+288}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \]

Alternative 3: 94.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := a1 \cdot \frac{a2}{b1 \cdot b2}\\ t_1 := \frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+181}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -4 \cdot 10^{-267}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 2 \cdot 10^{-252}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq 4 \cdot 10^{+185}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (* a1 (/ a2 (* b1 b2)))) (t_1 (* (/ a1 b1) (/ a2 b2))))
   (if (<= (* b1 b2) -1e+181)
     t_1
     (if (<= (* b1 b2) -4e-267)
       t_0
       (if (<= (* b1 b2) 2e-252)
         t_1
         (if (<= (* b1 b2) 4e+185) t_0 (* (/ a2 b1) (/ a1 b2))))))))

C

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 ((b1 * b2) <= -1e+181) {
		tmp = t_1;
	} else if ((b1 * b2) <= -4e-267) {
		tmp = t_0;
	} else if ((b1 * b2) <= 2e-252) {
		tmp = t_1;
	} else if ((b1 * b2) <= 4e+185) {
		tmp = t_0;
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

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
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = a1 * (a2 / (b1 * b2))
    t_1 = (a1 / b1) * (a2 / b2)
    if ((b1 * b2) <= (-1d+181)) then
        tmp = t_1
    else if ((b1 * b2) <= (-4d-267)) then
        tmp = t_0
    else if ((b1 * b2) <= 2d-252) then
        tmp = t_1
    else if ((b1 * b2) <= 4d+185) then
        tmp = t_0
    else
        tmp = (a2 / b1) * (a1 / b2)
    end if
    code = tmp
end function

Java

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 ((b1 * b2) <= -1e+181) {
		tmp = t_1;
	} else if ((b1 * b2) <= -4e-267) {
		tmp = t_0;
	} else if ((b1 * b2) <= 2e-252) {
		tmp = t_1;
	} else if ((b1 * b2) <= 4e+185) {
		tmp = t_0;
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Python

def code(a1, a2, b1, b2):
	t_0 = a1 * (a2 / (b1 * b2))
	t_1 = (a1 / b1) * (a2 / b2)
	tmp = 0
	if (b1 * b2) <= -1e+181:
		tmp = t_1
	elif (b1 * b2) <= -4e-267:
		tmp = t_0
	elif (b1 * b2) <= 2e-252:
		tmp = t_1
	elif (b1 * b2) <= 4e+185:
		tmp = t_0
	else:
		tmp = (a2 / b1) * (a1 / b2)
	return tmp

Julia

function code(a1, a2, b1, b2)
	t_0 = Float64(a1 * Float64(a2 / Float64(b1 * b2)))
	t_1 = Float64(Float64(a1 / b1) * Float64(a2 / b2))
	tmp = 0.0
	if (Float64(b1 * b2) <= -1e+181)
		tmp = t_1;
	elseif (Float64(b1 * b2) <= -4e-267)
		tmp = t_0;
	elseif (Float64(b1 * b2) <= 2e-252)
		tmp = t_1;
	elseif (Float64(b1 * b2) <= 4e+185)
		tmp = t_0;
	else
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, b1, b2)
	t_0 = a1 * (a2 / (b1 * b2));
	t_1 = (a1 / b1) * (a2 / b2);
	tmp = 0.0;
	if ((b1 * b2) <= -1e+181)
		tmp = t_1;
	elseif ((b1 * b2) <= -4e-267)
		tmp = t_0;
	elseif ((b1 * b2) <= 2e-252)
		tmp = t_1;
	elseif ((b1 * b2) <= 4e+185)
		tmp = t_0;
	else
		tmp = (a2 / b1) * (a1 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

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[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(b1 * b2), $MachinePrecision], -1e+181], t$95$1, If[LessEqual[N[(b1 * b2), $MachinePrecision], -4e-267], t$95$0, If[LessEqual[N[(b1 * b2), $MachinePrecision], 2e-252], t$95$1, If[LessEqual[N[(b1 * b2), $MachinePrecision], 4e+185], t$95$0, N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 b1 b2) < -9.9999999999999992e180 or -3.9999999999999999e-267 < (*.f64 b1 b2) < 1.99999999999999989e-252

   1. Initial program 75.6%

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

      1. times-frac 97.7%

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

      2. *-commutative 97.7%

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

   3. Simplified 97.7%

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

   if -9.9999999999999992e180 < (*.f64 b1 b2) < -3.9999999999999999e-267 or 1.99999999999999989e-252 < (*.f64 b1 b2) < 3.9999999999999999e185

   1. Initial program 96.1%

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

      1. times-frac 79.1%

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

      2. *-commutative 79.1%

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

   3. Simplified 79.1%

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

   4. Taylor expanded in a2 around 0 96.1%

      \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]
   5. Step-by-step derivation

      1. *-commutative 96.1%

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

      2. associate-*r/ 93.7%

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

      3. *-commutative 93.7%

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

   6. Simplified 93.7%

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

   if 3.9999999999999999e185 < (*.f64 b1 b2)

   1. Initial program 77.6%

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

      1. *-commutative 77.6%

         \[\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}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 95.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+181}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq -4 \cdot 10^{-267}:\\ \;\;\;\;a1 \cdot \frac{a2}{b1 \cdot b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 2 \cdot 10^{-252}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 4 \cdot 10^{+185}:\\ \;\;\;\;a1 \cdot \frac{a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternative 4: 92.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -5 \cdot 10^{-288} \lor \neg \left(b1 \cdot b2 \leq 5 \cdot 10^{-249}\right) \land b1 \cdot b2 \leq 4 \cdot 10^{+185}:\\ \;\;\;\;a1 \cdot \frac{a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2)
 :precision binary64
 (if (or (<= (* b1 b2) -5e-288)
         (and (not (<= (* b1 b2) 5e-249)) (<= (* b1 b2) 4e+185)))
   (* a1 (/ a2 (* b1 b2)))
   (* (/ a2 b1) (/ a1 b2))))

C

double code(double a1, double a2, double b1, double b2) {
	double tmp;
	if (((b1 * b2) <= -5e-288) || (!((b1 * b2) <= 5e-249) && ((b1 * b2) <= 4e+185))) {
		tmp = a1 * (a2 / (b1 * b2));
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

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
    real(8) :: tmp
    if (((b1 * b2) <= (-5d-288)) .or. (.not. ((b1 * b2) <= 5d-249)) .and. ((b1 * b2) <= 4d+185)) then
        tmp = a1 * (a2 / (b1 * b2))
    else
        tmp = (a2 / b1) * (a1 / b2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	double tmp;
	if (((b1 * b2) <= -5e-288) || (!((b1 * b2) <= 5e-249) && ((b1 * b2) <= 4e+185))) {
		tmp = a1 * (a2 / (b1 * b2));
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Python

def code(a1, a2, b1, b2):
	tmp = 0
	if ((b1 * b2) <= -5e-288) or (not ((b1 * b2) <= 5e-249) and ((b1 * b2) <= 4e+185)):
		tmp = a1 * (a2 / (b1 * b2))
	else:
		tmp = (a2 / b1) * (a1 / b2)
	return tmp

Julia

function code(a1, a2, b1, b2)
	tmp = 0.0
	if ((Float64(b1 * b2) <= -5e-288) || (!(Float64(b1 * b2) <= 5e-249) && (Float64(b1 * b2) <= 4e+185)))
		tmp = Float64(a1 * Float64(a2 / Float64(b1 * b2)));
	else
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, b1, b2)
	tmp = 0.0;
	if (((b1 * b2) <= -5e-288) || (~(((b1 * b2) <= 5e-249)) && ((b1 * b2) <= 4e+185)))
		tmp = a1 * (a2 / (b1 * b2));
	else
		tmp = (a2 / b1) * (a1 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, b1_, b2_] := If[Or[LessEqual[N[(b1 * b2), $MachinePrecision], -5e-288], And[N[Not[LessEqual[N[(b1 * b2), $MachinePrecision], 5e-249]], $MachinePrecision], LessEqual[N[(b1 * b2), $MachinePrecision], 4e+185]]], N[(a1 * N[(a2 / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b1 b2) < -5.00000000000000011e-288 or 4.9999999999999999e-249 < (*.f64 b1 b2) < 3.9999999999999999e185

   1. Initial program 92.6%

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

      1. times-frac 83.4%

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

      2. *-commutative 83.4%

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

   3. Simplified 83.4%

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

   4. Taylor expanded in a2 around 0 92.6%

      \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]
   5. Step-by-step derivation

      1. *-commutative 92.6%

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

      2. associate-*r/ 91.2%

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

      3. *-commutative 91.2%

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

   6. Simplified 91.2%

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

   if -5.00000000000000011e-288 < (*.f64 b1 b2) < 4.9999999999999999e-249 or 3.9999999999999999e185 < (*.f64 b1 b2)

   1. Initial program 74.8%

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

      1. *-commutative 74.8%

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

      2. times-frac 96.4%

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

   3. Applied egg-rr 96.4%

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

4. Final simplification 92.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -5 \cdot 10^{-288} \lor \neg \left(b1 \cdot b2 \leq 5 \cdot 10^{-249}\right) \land b1 \cdot b2 \leq 4 \cdot 10^{+185}:\\ \;\;\;\;a1 \cdot \frac{a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternative 5: 87.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ a1 \cdot \frac{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(a1 * Float64(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[(a1 * N[(a2 / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 86.7%

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

   1. times-frac 87.0%

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

   2. *-commutative 87.0%

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

3. Simplified 87.0%

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

4. Taylor expanded in a2 around 0 86.7%

   \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]
5. Step-by-step derivation

   1. *-commutative 86.7%

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

   2. associate-*r/ 85.3%

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

   3. *-commutative 85.3%

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

6. Simplified 85.3%

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

7. Final simplification 85.3%

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

Developer target: 86.3% 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 2023274 
(FPCore (a1 a2 b1 b2)
  :name "Quotient of products"
  :precision binary64

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

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