Quotient of products

Average Accuracy: 82.0% → 96.6%

Time: 6.6s

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:\\ \;\;\;\;a1 \cdot \frac{\frac{a2}{b2}}{b1}\\ \mathbf{elif}\;t_0 \leq -2 \cdot 10^{-319} \lor \neg \left(t_0 \leq 2 \cdot 10^{-305}\right) \land t_0 \leq 4 \cdot 10^{+304}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{a2}{b2} \cdot \frac{a1}{b1}\\ \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))
     (* a1 (/ (/ a2 b2) b1))
     (if (or (<= t_0 -2e-319) (and (not (<= t_0 2e-305)) (<= t_0 4e+304)))
       t_0
       (* (/ a2 b2) (/ a1 b1))))))

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 = a1 * ((a2 / b2) / b1);
	} else if ((t_0 <= -2e-319) || (!(t_0 <= 2e-305) && (t_0 <= 4e+304))) {
		tmp = t_0;
	} else {
		tmp = (a2 / b2) * (a1 / b1);
	}
	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 = a1 * ((a2 / b2) / b1);
	} else if ((t_0 <= -2e-319) || (!(t_0 <= 2e-305) && (t_0 <= 4e+304))) {
		tmp = t_0;
	} else {
		tmp = (a2 / b2) * (a1 / b1);
	}
	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 = a1 * ((a2 / b2) / b1)
	elif (t_0 <= -2e-319) or (not (t_0 <= 2e-305) and (t_0 <= 4e+304)):
		tmp = t_0
	else:
		tmp = (a2 / b2) * (a1 / b1)
	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(a1 * Float64(Float64(a2 / b2) / b1));
	elseif ((t_0 <= -2e-319) || (!(t_0 <= 2e-305) && (t_0 <= 4e+304)))
		tmp = t_0;
	else
		tmp = Float64(Float64(a2 / b2) * Float64(a1 / b1));
	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 = a1 * ((a2 / b2) / b1);
	elseif ((t_0 <= -2e-319) || (~((t_0 <= 2e-305)) && (t_0 <= 4e+304)))
		tmp = t_0;
	else
		tmp = (a2 / b2) * (a1 / b1);
	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[(a1 * N[(N[(a2 / b2), $MachinePrecision] / b1), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, -2e-319], And[N[Not[LessEqual[t$95$0, 2e-305]], $MachinePrecision], LessEqual[t$95$0, 4e+304]]], t$95$0, N[(N[(a2 / b2), $MachinePrecision] * N[(a1 / b1), $MachinePrecision]), $MachinePrecision]]]]

Target

Original	82.0%
Target	82.2%
Herbie	96.6%

\[\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 0.0%

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

   2. Simplified 73.4%

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

      [Start] 0.0	\[ \frac{a1 \cdot a2}{b1 \cdot b2} \]
      associate-/r* [=>] 48.3	\[ \color{blue}{\frac{\frac{a1 \cdot a2}{b1}}{b2}} \]
      *-commutative [=>] 48.3	\[ \frac{\frac{\color{blue}{a2 \cdot a1}}{b1}}{b2} \]
      associate-/l* [=>] 73.4	\[ \frac{\color{blue}{\frac{a2}{\frac{b1}{a1}}}}{b2} \]

   3. Applied egg-rr 76.9%

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

      [Start] 73.4	\[ \frac{\frac{a2}{\frac{b1}{a1}}}{b2} \]
      associate-/l/ [=>] 72.9	\[ \color{blue}{\frac{a2}{b2 \cdot \frac{b1}{a1}}} \]
      associate-/r* [=>] 83.9	\[ \color{blue}{\frac{\frac{a2}{b2}}{\frac{b1}{a1}}} \]
      associate-/r/ [=>] 76.9	\[ \color{blue}{\frac{\frac{a2}{b2}}{b1} \cdot a1} \]

   if -inf.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < -1.99998e-319 or 1.99999999999999999e-305 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 3.9999999999999998e304

   1. Initial program 98.6%

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

   if -1.99998e-319 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 1.99999999999999999e-305 or 3.9999999999999998e304 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 64.5%

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

   2. Simplified 95.3%

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

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

3. Recombined 3 regimes into one program.

4. Final simplification 96.6%

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

Alternatives

Alternative 1
Accuracy	91.3%
Cost	1490

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

Alternative 2
Accuracy	90.9%
Cost	1489

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

Alternative 3
Accuracy	89.2%
Cost	1488

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

Alternative 4
Accuracy	88.7%
Cost	1488

\[\begin{array}{l} t_0 := a2 \cdot \frac{a1}{b1 \cdot b2}\\ t_1 := \frac{a2}{b2} \cdot \frac{a1}{b1}\\ \mathbf{if}\;b1 \cdot b2 \leq -2 \cdot 10^{+155}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;b1 \cdot b2 \leq -5 \cdot 10^{-299}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b1 \cdot b2 \leq 2 \cdot 10^{-23}:\\ \;\;\;\;\frac{a1}{b1 \cdot \frac{b2}{a2}}\\ \mathbf{elif}\;b1 \cdot b2 \leq 5 \cdot 10^{+132}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 5
Accuracy	83.9%
Cost	708

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

Alternative 6
Accuracy	82.6%
Cost	448

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

Reproduce

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

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

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