\[ \begin{array}{c}[z, t] = \mathsf{sort}([z, t])\\ \end{array} \]
Math FPCore C Julia Wolfram TeX \[\frac{x}{y - z \cdot t}
\]
↓
\[\begin{array}{l}
\mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+162}:\\
\;\;\;\;\frac{x}{t} \cdot \frac{-1}{z}\\
\mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{+277}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(-z, t, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\frac{x}{t}}{z}\\
\end{array}
\]
(FPCore (x y z t) :precision binary64 (/ x (- y (* z t)))) ↓
(FPCore (x y z t)
:precision binary64
(if (<= (* z t) -1e+162)
(* (/ x t) (/ -1.0 z))
(if (<= (* z t) 2e+277) (/ x (fma (- z) t y)) (/ (- (/ x t)) z)))) double code(double x, double y, double z, double t) {
return x / (y - (z * t));
}
↓
double code(double x, double y, double z, double t) {
double tmp;
if ((z * t) <= -1e+162) {
tmp = (x / t) * (-1.0 / z);
} else if ((z * t) <= 2e+277) {
tmp = x / fma(-z, t, y);
} else {
tmp = -(x / t) / z;
}
return tmp;
}
function code(x, y, z, t)
return Float64(x / Float64(y - Float64(z * t)))
end
↓
function code(x, y, z, t)
tmp = 0.0
if (Float64(z * t) <= -1e+162)
tmp = Float64(Float64(x / t) * Float64(-1.0 / z));
elseif (Float64(z * t) <= 2e+277)
tmp = Float64(x / fma(Float64(-z), t, y));
else
tmp = Float64(Float64(-Float64(x / t)) / z);
end
return tmp
end
code[x_, y_, z_, t_] := N[(x / N[(y - N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_, t_] := If[LessEqual[N[(z * t), $MachinePrecision], -1e+162], N[(N[(x / t), $MachinePrecision] * N[(-1.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(z * t), $MachinePrecision], 2e+277], N[(x / N[((-z) * t + y), $MachinePrecision]), $MachinePrecision], N[((-N[(x / t), $MachinePrecision]) / z), $MachinePrecision]]]
\frac{x}{y - z \cdot t}
↓
\begin{array}{l}
\mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+162}:\\
\;\;\;\;\frac{x}{t} \cdot \frac{-1}{z}\\
\mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{+277}:\\
\;\;\;\;\frac{x}{\mathsf{fma}\left(-z, t, y\right)}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\frac{x}{t}}{z}\\
\end{array}
Alternatives Alternative 1 Accuracy 95.4% Cost 968
\[\begin{array}{l}
\mathbf{if}\;z \cdot t \leq -4 \cdot 10^{+302}:\\
\;\;\;\;\frac{-1}{t} \cdot \frac{x}{z}\\
\mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{+277}:\\
\;\;\;\;\frac{x}{y - z \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{-x}{t}}{z}\\
\end{array}
\]
Alternative 2 Accuracy 94.6% Cost 968
\[\begin{array}{l}
\mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+162}:\\
\;\;\;\;\frac{x}{t} \cdot \frac{-1}{z}\\
\mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{+277}:\\
\;\;\;\;\frac{x}{y - z \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{-\frac{x}{t}}{z}\\
\end{array}
\]
Alternative 3 Accuracy 67.4% Cost 913
\[\begin{array}{l}
\mathbf{if}\;y \leq -3.8 \cdot 10^{+73}:\\
\;\;\;\;\frac{1}{\frac{y}{x}}\\
\mathbf{elif}\;y \leq -1800000 \lor \neg \left(y \leq -1 \cdot 10^{-37}\right) \land y \leq 82000000:\\
\;\;\;\;\frac{-\frac{x}{t}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y}\\
\end{array}
\]
Alternative 4 Accuracy 68.8% Cost 913
\[\begin{array}{l}
\mathbf{if}\;y \leq -4.6 \cdot 10^{+73}:\\
\;\;\;\;\frac{1}{\frac{y}{x}}\\
\mathbf{elif}\;y \leq -3.2 \lor \neg \left(y \leq -1.1 \cdot 10^{-23}\right) \land y \leq 85000000:\\
\;\;\;\;\frac{-x}{z \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y}\\
\end{array}
\]
Alternative 5 Accuracy 69.0% Cost 912
\[\begin{array}{l}
\mathbf{if}\;y \leq -4.3 \cdot 10^{+73}:\\
\;\;\;\;\frac{1}{\frac{y}{x}}\\
\mathbf{elif}\;y \leq -950:\\
\;\;\;\;-\frac{\frac{x}{z}}{t}\\
\mathbf{elif}\;y \leq -1.1 \cdot 10^{-23}:\\
\;\;\;\;\frac{x}{y}\\
\mathbf{elif}\;y \leq 26500000:\\
\;\;\;\;\frac{-x}{z \cdot t}\\
\mathbf{else}:\\
\;\;\;\;\frac{x}{y}\\
\end{array}
\]
Alternative 6 Accuracy 52.3% Cost 452
\[\begin{array}{l}
\mathbf{if}\;t \leq 4.8 \cdot 10^{+225}:\\
\;\;\;\;\frac{1}{\frac{y}{x}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{x}{z}}{t}\\
\end{array}
\]
Alternative 7 Accuracy 49.6% Cost 320
\[\frac{1}{\frac{y}{x}}
\]
Alternative 8 Accuracy 50.0% Cost 192
\[\frac{x}{y}
\]