Quotient of products

Average Error: 11.9 → 2.5

Time: 4.5s

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 -\infty:\\ \;\;\;\;\frac{\frac{a2}{\frac{b1}{a1}}}{b2}\\ \mathbf{elif}\;t_0 \leq -2 \cdot 10^{-305} \lor \neg \left(t_0 \leq 0\right) \land t_0 \leq 5 \cdot 10^{+291}:\\ \;\;\;\;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 (- INFINITY))
     (/ (/ a2 (/ b1 a1)) b2)
     (if (or (<= t_0 -2e-305) (and (not (<= t_0 0.0)) (<= t_0 5e+291)))
       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 <= -((double) INFINITY)) {
		tmp = (a2 / (b1 / a1)) / b2;
	} else if ((t_0 <= -2e-305) || (!(t_0 <= 0.0) && (t_0 <= 5e+291))) {
		tmp = t_0;
	} else {
		tmp = (a2 / b1) * (a1 / b2);
	}
	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 tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = (a2 / (b1 / a1)) / b2;
	} else if ((t_0 <= -2e-305) || (!(t_0 <= 0.0) && (t_0 <= 5e+291))) {
		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 <= -math.inf:
		tmp = (a2 / (b1 / a1)) / b2
	elif (t_0 <= -2e-305) or (not (t_0 <= 0.0) and (t_0 <= 5e+291)):
		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 <= Float64(-Inf))
		tmp = Float64(Float64(a2 / Float64(b1 / a1)) / b2);
	elseif ((t_0 <= -2e-305) || (!(t_0 <= 0.0) && (t_0 <= 5e+291)))
		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 <= -Inf)
		tmp = (a2 / (b1 / a1)) / b2;
	elseif ((t_0 <= -2e-305) || (~((t_0 <= 0.0)) && (t_0 <= 5e+291)))
		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, (-Infinity)], N[(N[(a2 / N[(b1 / a1), $MachinePrecision]), $MachinePrecision] / b2), $MachinePrecision], If[Or[LessEqual[t$95$0, -2e-305], And[N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision], LessEqual[t$95$0, 5e+291]]], t$95$0, N[(N[(a2 / b1), $MachinePrecision] * N[(a1 / b2), $MachinePrecision]), $MachinePrecision]]]]

Target

Original	11.9
Target	11.2
Herbie	2.5

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -inf.0

   1. Initial program 64.0

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

   2. Simplified 18.4

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

      [Start] 64.0	\[ \frac{a1 \cdot a2}{b1 \cdot b2} \]
      associate-/r* [=>] 33.3	\[ \color{blue}{\frac{\frac{a1 \cdot a2}{b1}}{b2}} \]
      *-commutative [=>] 33.3	\[ \frac{\frac{\color{blue}{a2 \cdot a1}}{b1}}{b2} \]
      associate-/l* [=>] 18.4	\[ \frac{\color{blue}{\frac{a2}{\frac{b1}{a1}}}}{b2} \]

   if -inf.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -1.99999999999999999e-305 or -0.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 5.0000000000000001e291

   1. Initial program 0.8

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

   if -1.99999999999999999e-305 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -0.0 or 5.0000000000000001e291 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 22.9

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

   2. Applied egg-rr 3.5

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

4. Final simplification 2.5

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

Alternatives

Alternative 1
Error	2.6
Cost	2514

\[\begin{array}{l} t_0 := \frac{a1 \cdot a2}{b1 \cdot b2}\\ \mathbf{if}\;t_0 \leq -5 \cdot 10^{+258} \lor \neg \left(t_0 \leq -2 \cdot 10^{-305} \lor \neg \left(t_0 \leq 0\right) \land t_0 \leq 5 \cdot 10^{+291}\right):\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 2
Error	5.5
Cost	1490

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

Alternative 3
Error	5.5
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 -4 \cdot 10^{+161}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -1 \cdot 10^{-299}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 4 \cdot 10^{-216}:\\ \;\;\;\;\frac{a2}{b1} \cdot \frac{a1}{b2}\\ \mathbf{elif}\;b1 \cdot b2 \leq 10^{+179}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 4
Error	11.8
Cost	448

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

Reproduce

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

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

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