Quotient of products

Average Error: 11.1 → 2.1

Time: 3.5s

Precision: binary64

Cost: 2512

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

Math

\[\frac{a1 \cdot a2}{b1 \cdot 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 -1 \cdot 10^{-300}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;t_0 \leq 0:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t_0 \leq 5 \cdot 10^{+294}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \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))) (t_1 (* (/ a1 b1) (/ a2 b2))))
   (if (<= t_0 (- INFINITY))
     t_1
     (if (<= t_0 -1e-300)
       t_0
       (if (<= t_0 0.0) t_1 (if (<= t_0 5e+294) t_0 t_1))))))

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 t_1 = (a1 / b1) * (a2 / b2);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_0 <= -1e-300) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+294) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

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 t_1 = (a1 / b1) * (a2 / b2);
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_0 <= -1e-300) {
		tmp = t_0;
	} else if (t_0 <= 0.0) {
		tmp = t_1;
	} else if (t_0 <= 5e+294) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	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)
	t_1 = (a1 / b1) * (a2 / b2)
	tmp = 0
	if t_0 <= -math.inf:
		tmp = t_1
	elif t_0 <= -1e-300:
		tmp = t_0
	elif t_0 <= 0.0:
		tmp = t_1
	elif t_0 <= 5e+294:
		tmp = t_0
	else:
		tmp = t_1
	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))
	t_1 = Float64(Float64(a1 / b1) * Float64(a2 / b2))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_0 <= -1e-300)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 5e+294)
		tmp = t_0;
	else
		tmp = t_1;
	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);
	t_1 = (a1 / b1) * (a2 / b2);
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = t_1;
	elseif (t_0 <= -1e-300)
		tmp = t_0;
	elseif (t_0 <= 0.0)
		tmp = t_1;
	elseif (t_0 <= 5e+294)
		tmp = t_0;
	else
		tmp = t_1;
	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]}, 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, -1e-300], t$95$0, If[LessEqual[t$95$0, 0.0], t$95$1, If[LessEqual[t$95$0, 5e+294], t$95$0, t$95$1]]]]]]

Target

Original	11.1
Target	11.5
Herbie	2.1

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -inf.0 or -1.00000000000000003e-300 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0 or 4.9999999999999999e294 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 25.6

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

   2. Simplified 3.8

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]
      Proof
      (*.f64 (/.f64 a1 b1) (/.f64 a2 b2)): 0 points increase in error, 0 points decrease in error
      (Rewrite<= times-frac_binary64 (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))): 66 points increase in error, 62 points decrease in error

   if -inf.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -1.00000000000000003e-300 or -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 4.9999999999999999e294

   1. Initial program 0.8

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

4. Final simplification 2.1

   \[\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 -1 \cdot 10^{-300}:\\ \;\;\;\;\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^{+294}:\\ \;\;\;\;\frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1} \cdot \frac{a2}{b2}\\ \end{array} \]

Alternatives

Alternative 1
Error	6.1
Cost	1488

\[\begin{array}{l} t_0 := a2 \cdot \frac{a1}{b1 \cdot b2}\\ t_1 := \frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+164}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-153}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 10^{-300}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq 10^{+115}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 2
Error	5.8
Cost	1488

\[\begin{array}{l} t_0 := a2 \cdot \frac{a1}{b1 \cdot b2}\\ t_1 := \frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+164}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-153}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 10^{-300}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq 2 \cdot 10^{+234}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \end{array} \]

Alternative 3
Error	6.3
Cost	1488

\[\begin{array}{l} t_0 := a2 \cdot \frac{a1}{b1 \cdot b2}\\ t_1 := \frac{a1}{b1} \cdot \frac{a2}{b2}\\ \mathbf{if}\;b1 \cdot b2 \leq -1 \cdot 10^{+164}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -2 \cdot 10^{-153}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 10^{-300}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{+153}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a1}{b1 \cdot \frac{b2}{a2}}\\ \end{array} \]

Alternative 4
Error	11.6
Cost	580

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

Alternative 5
Error	11.2
Cost	448

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

Reproduce

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

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

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