Quotient of products

Average Error: 11.3 → 4.1

Time: 4.5s

Precision: binary64

Cost: 2512

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 -2 \cdot 10^{+302}:\\ \;\;\;\;\frac{a2 \cdot \frac{a1}{b2}}{b1}\\ \mathbf{elif}\;t_0 \leq -5 \cdot 10^{-260}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;\frac{a1}{b1 \cdot \frac{b2}{a2}}\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+213}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{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 -2e+302)
     (/ (* a2 (/ a1 b2)) b1)
     (if (<= t_0 -5e-260)
       t_0
       (if (<= t_0 0.0)
         (/ a1 (* b1 (/ b2 a2)))
         (if (<= t_0 5e+213) t_0 (* (/ a1 b1) (/ a2 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 <= -2e+302) {
		tmp = (a2 * (a1 / b2)) / b1;
	} else if (t_0 <= -5e-260) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = a1 / (b1 * (b2 / a2));
	} else if (t_0 <= 5e+213) {
		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
    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 <= (-2d+302)) then
        tmp = (a2 * (a1 / b2)) / b1
    else if (t_0 <= (-5d-260)) then
        tmp = t_0
    else if (t_0 <= 0.0d0) then
        tmp = a1 / (b1 * (b2 / a2))
    else if (t_0 <= 5d+213) 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) {
	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 <= -2e+302) {
		tmp = (a2 * (a1 / b2)) / b1;
	} else if (t_0 <= -5e-260) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = a1 / (b1 * (b2 / a2));
	} else if (t_0 <= 5e+213) {
		tmp = t_0;
	} else {
		tmp = (a1 / b1) * (a2 / 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 <= -2e+302:
		tmp = (a2 * (a1 / b2)) / b1
	elif t_0 <= -5e-260:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = a1 / (b1 * (b2 / a2))
	elif t_0 <= 5e+213:
		tmp = t_0
	else:
		tmp = (a1 / b1) * (a2 / 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 <= -2e+302)
		tmp = Float64(Float64(a2 * Float64(a1 / b2)) / b1);
	elseif (t_0 <= -5e-260)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = Float64(a1 / Float64(b1 * Float64(b2 / a2)));
	elseif (t_0 <= 5e+213)
		tmp = t_0;
	else
		tmp = Float64(Float64(a1 / b1) * Float64(a2 / 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 <= -2e+302)
		tmp = (a2 * (a1 / b2)) / b1;
	elseif (t_0 <= -5e-260)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = a1 / (b1 * (b2 / a2));
	elseif (t_0 <= 5e+213)
		tmp = t_0;
	else
		tmp = (a1 / b1) * (a2 / 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, -2e+302], N[(N[(a2 * N[(a1 / b2), $MachinePrecision]), $MachinePrecision] / b1), $MachinePrecision], If[LessEqual[t$95$0, -5e-260], t$95$0, If[LessEqual[t$95$0, 0.0], N[(a1 / N[(b1 * N[(b2 / a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+213], t$95$0, N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]]]]]]

Target

Original	11.3
Target	11.0
Herbie	4.1

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -2.0000000000000002e302

   1. Initial program 61.2

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

   2. Simplified 27.3

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

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

   3. Applied egg-rr 20.6

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

   if -2.0000000000000002e302 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -5.0000000000000003e-260 or -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 4.9999999999999998e213

   1. Initial program 0.7

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

   if -5.0000000000000003e-260 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0

   1. Initial program 12.5

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

   2. Simplified 3.1

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

      [Start] 12.5	\[ \frac{a1 \cdot a2}{b1 \cdot b2} \]
      times-frac [=>] 3.1	\[ \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   3. Applied egg-rr 5.1

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

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

   1. Initial program 43.6

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

   2. Simplified 12.3

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

      [Start] 43.6	\[ \frac{a1 \cdot a2}{b1 \cdot b2} \]
      times-frac [=>] 12.3	\[ \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

3. Recombined 4 regimes into one program.

4. Final simplification 4.1

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

Alternatives

Alternative 1
Error	3.7
Cost	2512

\[\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 -5 \cdot 10^{-260}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;\frac{a1}{b1 \cdot \frac{b2}{a2}}\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+213}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 2
Error	6.5
Cost	1229

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

Alternative 3
Error	7.2
Cost	1229

\[\begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -2 \cdot 10^{+162}:\\ \;\;\;\;\frac{a1}{b1 \cdot \frac{b2}{a2}}\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-234} \lor \neg \left(b1 \cdot b2 \leq 5 \cdot 10^{-157}\right):\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \]

Alternative 4
Error	7.2
Cost	1228

\[\begin{array}{l} \mathbf{if}\;b1 \cdot b2 \leq -2 \cdot 10^{+162}:\\ \;\;\;\;\frac{a1}{b1 \cdot \frac{b2}{a2}}\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-234}:\\ \;\;\;\;a2 \cdot \frac{a1}{b1 \cdot b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{-252}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{\frac{b1 \cdot b2}{a2}}\\ \end{array} \]

Alternative 5
Error	10.9
Cost	448

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

Reproduce

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

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

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