Quotient of products

Average Error: 17.53% → 5.49%

Time: 4.8s

Precision: binary64

Cost: 2513

Math

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

↓

\[\begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{if}\;t_0 \leq -1 \cdot 10^{+220}:\\ \;\;\;\;\frac{a1 \cdot \frac{a2}{b2}}{b1}\\ \mathbf{elif}\;t_0 \leq -5 \cdot 10^{-287} \lor \neg \left(t_0 \leq 10^{-268}\right) \land t_0 \leq 2 \cdot 10^{+294}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

FPCore

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

↓

(FPCore (a1 a2 b1 b2)
 :precision binary64
 (let* ((t_0 (/ (* a1 a2) (* b1 b2))))
   (if (<= t_0 -1e+220)
     (/ (* a1 (/ a2 b2)) b1)
     (if (or (<= t_0 -5e-287) (and (not (<= t_0 1e-268)) (<= t_0 2e+294)))
       t_0
       (* (/ a2 b1) (/ a1 b2))))))

C

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

↓

double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double tmp;
	if (t_0 <= -1e+220) {
		tmp = (a1 * (a2 / b2)) / b1;
	} else if ((t_0 <= -5e-287) || (!(t_0 <= 1e-268) && (t_0 <= 2e+294))) {
		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
    code = (a1 * a2) / (b1 * b2)
end 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) :: tmp
    t_0 = (a1 * a2) / (b1 * b2)
    if (t_0 <= (-1d+220)) then
        tmp = (a1 * (a2 / b2)) / b1
    else if ((t_0 <= (-5d-287)) .or. (.not. (t_0 <= 1d-268)) .and. (t_0 <= 2d+294)) 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) {
	return (a1 * a2) / (b1 * b2);
}

↓

public static double code(double a1, double a2, double b1, double b2) {
	double t_0 = (a1 * a2) / (b1 * b2);
	double tmp;
	if (t_0 <= -1e+220) {
		tmp = (a1 * (a2 / b2)) / b1;
	} else if ((t_0 <= -5e-287) || (!(t_0 <= 1e-268) && (t_0 <= 2e+294))) {
		tmp = t_0;
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	return tmp;
}

Python

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

↓

def code(a1, a2, b1, b2):
	t_0 = (a1 * a2) / (b1 * b2)
	tmp = 0
	if t_0 <= -1e+220:
		tmp = (a1 * (a2 / b2)) / b1
	elif (t_0 <= -5e-287) or (not (t_0 <= 1e-268) and (t_0 <= 2e+294)):
		tmp = t_0
	else:
		tmp = (a2 / b1) * (a1 / b2)
	return tmp

Julia

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

↓

function code(a1, a2, b1, b2)
	t_0 = Float64(Float64(a1 * a2) / Float64(b1 * b2))
	tmp = 0.0
	if (t_0 <= -1e+220)
		tmp = Float64(Float64(a1 * Float64(a2 / b2)) / b1);
	elseif ((t_0 <= -5e-287) || (!(t_0 <= 1e-268) && (t_0 <= 2e+294)))
		tmp = t_0;
	else
		tmp = Float64(Float64(a2 / b1) * Float64(a1 / b2));
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(a1, a2, b1, b2)
	t_0 = (a1 * a2) / (b1 * b2);
	tmp = 0.0;
	if (t_0 <= -1e+220)
		tmp = (a1 * (a2 / b2)) / b1;
	elseif ((t_0 <= -5e-287) || (~((t_0 <= 1e-268)) && (t_0 <= 2e+294)))
		tmp = t_0;
	else
		tmp = (a2 / b1) * (a1 / b2);
	end
	tmp_2 = tmp;
end

Wolfram

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

↓

code[a1_, a2_, b1_, b2_] := Block[{t$95$0 = N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e+220], N[(N[(a1 * N[(a2 / b2), $MachinePrecision]), $MachinePrecision] / b1), $MachinePrecision], If[Or[LessEqual[t$95$0, -5e-287], And[N[Not[LessEqual[t$95$0, 1e-268]], $MachinePrecision], LessEqual[t$95$0, 2e+294]]], t$95$0, N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]]]]

Target

Original	17.53%
Target	17.24%
Herbie	5.49%

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -1e220

   1. Initial program 55.3

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

   2. Simplified 37.28

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

      [Start] 55.3	\[ \frac{a1 \cdot a2}{b1 \cdot b2} \]
      associate-*l/ [<=] 37.28	\[ \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]
      *-commutative [=>] 37.28	\[ \color{blue}{a2 \cdot \frac{a1}{b1 \cdot b2}} \]

   3. Applied egg-rr 31.65

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

   if -1e220 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -5.00000000000000025e-287 or 9.99999999999999958e-269 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 2.00000000000000013e294

   1. Initial program 1.17

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

   if -5.00000000000000025e-287 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 9.99999999999999958e-269 or 2.00000000000000013e294 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 32.34

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

   2. Applied egg-rr 6.86

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

4. Final simplification 5.49

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq -1 \cdot 10^{+220}:\\ \;\;\;\;\frac{a1 \cdot \frac{a2}{b2}}{b1}\\ \mathbf{elif}\;\frac{a1 \cdot a2}{b1 \cdot b2} \leq -5 \cdot 10^{-287} \lor \neg \left(\frac{a1 \cdot a2}{b1 \cdot b2} \leq 10^{-268}\right) \land \frac{a1 \cdot a2}{b1 \cdot b2} \leq 2 \cdot 10^{+294}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternatives

Alternative 1
Error	5.38%
Cost	2513

\[\begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{if}\;t_0 \leq -1 \cdot 10^{+220}:\\ \;\;\;\;\frac{a2}{b2} \cdot \frac{a1}{b1}\\ \mathbf{elif}\;t_0 \leq -5 \cdot 10^{-287} \lor \neg \left(t_0 \leq 10^{-268}\right) \land t_0 \leq 2 \cdot 10^{+294}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternative 2
Error	8.31%
Cost	1490

\[\begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -\infty \lor \neg \left(b1 \cdot b2 \leq -2 \cdot 10^{-252} \lor \neg \left(b1 \cdot b2 \leq 10^{-308}\right) \land b1 \cdot b2 \leq 2 \cdot 10^{+173}\right):\\ \;\;\;\;\frac{a2}{b2} \cdot \frac{a1}{b1}\\ \mathbf{else}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \end{array} \]

Alternative 3
Error	8.37%
Cost	1489

\[\begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -2 \cdot 10^{+218}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-252} \lor \neg \left(b1 \cdot b2 \leq 10^{-308}\right) \land b1 \cdot b2 \leq 2 \cdot 10^{+173}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b2} \cdot \frac{a1}{b1}\\ \end{array} \]

Alternative 4
Error	17.27%
Cost	448

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

Reproduce

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

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

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