Math FPCore C Java Python Julia MATLAB Wolfram TeX \[x + \frac{\left(y - z\right) \cdot t}{a - z}
\]
↓
\[\begin{array}{l}
t_1 := \frac{\left(y - z\right) \cdot t}{a - z}\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 5 \cdot 10^{+306}\right):\\
\;\;\;\;x + \frac{y - z}{\frac{a - z}{t}}\\
\mathbf{else}:\\
\;\;\;\;t_1 + x\\
\end{array}
\]
(FPCore (x y z t a) :precision binary64 (+ x (/ (* (- y z) t) (- a z)))) ↓
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (/ (* (- y z) t) (- a z))))
(if (or (<= t_1 (- INFINITY)) (not (<= t_1 5e+306)))
(+ x (/ (- y z) (/ (- a z) t)))
(+ t_1 x)))) double code(double x, double y, double z, double t, double a) {
return x + (((y - z) * t) / (a - z));
}
↓
double code(double x, double y, double z, double t, double a) {
double t_1 = ((y - z) * t) / (a - z);
double tmp;
if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 5e+306)) {
tmp = x + ((y - z) / ((a - z) / t));
} else {
tmp = t_1 + x;
}
return tmp;
}
public static double code(double x, double y, double z, double t, double a) {
return x + (((y - z) * t) / (a - z));
}
↓
public static double code(double x, double y, double z, double t, double a) {
double t_1 = ((y - z) * t) / (a - z);
double tmp;
if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 5e+306)) {
tmp = x + ((y - z) / ((a - z) / t));
} else {
tmp = t_1 + x;
}
return tmp;
}
def code(x, y, z, t, a):
return x + (((y - z) * t) / (a - z))
↓
def code(x, y, z, t, a):
t_1 = ((y - z) * t) / (a - z)
tmp = 0
if (t_1 <= -math.inf) or not (t_1 <= 5e+306):
tmp = x + ((y - z) / ((a - z) / t))
else:
tmp = t_1 + x
return tmp
function code(x, y, z, t, a)
return Float64(x + Float64(Float64(Float64(y - z) * t) / Float64(a - z)))
end
↓
function code(x, y, z, t, a)
t_1 = Float64(Float64(Float64(y - z) * t) / Float64(a - z))
tmp = 0.0
if ((t_1 <= Float64(-Inf)) || !(t_1 <= 5e+306))
tmp = Float64(x + Float64(Float64(y - z) / Float64(Float64(a - z) / t)));
else
tmp = Float64(t_1 + x);
end
return tmp
end
function tmp = code(x, y, z, t, a)
tmp = x + (((y - z) * t) / (a - z));
end
↓
function tmp_2 = code(x, y, z, t, a)
t_1 = ((y - z) * t) / (a - z);
tmp = 0.0;
if ((t_1 <= -Inf) || ~((t_1 <= 5e+306)))
tmp = x + ((y - z) / ((a - z) / t));
else
tmp = t_1 + x;
end
tmp_2 = tmp;
end
code[x_, y_, z_, t_, a_] := N[(x + N[(N[(N[(y - z), $MachinePrecision] * t), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(y - z), $MachinePrecision] * t), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 5e+306]], $MachinePrecision]], N[(x + N[(N[(y - z), $MachinePrecision] / N[(N[(a - z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 + x), $MachinePrecision]]]
x + \frac{\left(y - z\right) \cdot t}{a - z}
↓
\begin{array}{l}
t_1 := \frac{\left(y - z\right) \cdot t}{a - z}\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 5 \cdot 10^{+306}\right):\\
\;\;\;\;x + \frac{y - z}{\frac{a - z}{t}}\\
\mathbf{else}:\\
\;\;\;\;t_1 + x\\
\end{array}
Alternatives Alternative 1 Accuracy 99.1% Cost 1993
\[\begin{array}{l}
t_1 := \frac{\left(y - z\right) \cdot t}{a - z}\\
\mathbf{if}\;t_1 \leq -1 \cdot 10^{+218} \lor \neg \left(t_1 \leq 10^{+260}\right):\\
\;\;\;\;x - t \cdot \frac{z - y}{a - z}\\
\mathbf{else}:\\
\;\;\;\;t_1 + x\\
\end{array}
\]
Alternative 2 Accuracy 79.4% Cost 841
\[\begin{array}{l}
\mathbf{if}\;z \leq -4.8 \cdot 10^{-27} \lor \neg \left(z \leq 3 \cdot 10^{+32}\right):\\
\;\;\;\;t + x\\
\mathbf{else}:\\
\;\;\;\;x + \frac{y - z}{\frac{a}{t}}\\
\end{array}
\]
Alternative 3 Accuracy 81.6% Cost 841
\[\begin{array}{l}
\mathbf{if}\;z \leq -5 \cdot 10^{-27} \lor \neg \left(z \leq 8 \cdot 10^{+32}\right):\\
\;\;\;\;x + \frac{t}{z} \cdot \left(z - y\right)\\
\mathbf{else}:\\
\;\;\;\;x + \frac{y - z}{\frac{a}{t}}\\
\end{array}
\]
Alternative 4 Accuracy 84.2% Cost 841
\[\begin{array}{l}
\mathbf{if}\;z \leq -2 \cdot 10^{-149} \lor \neg \left(z \leq 9.5 \cdot 10^{-111}\right):\\
\;\;\;\;x - t \cdot \frac{z}{a - z}\\
\mathbf{else}:\\
\;\;\;\;x + \frac{y - z}{\frac{a}{t}}\\
\end{array}
\]
Alternative 5 Accuracy 77.7% Cost 713
\[\begin{array}{l}
\mathbf{if}\;z \leq -2.1 \cdot 10^{-26} \lor \neg \left(z \leq 9 \cdot 10^{+31}\right):\\
\;\;\;\;t + x\\
\mathbf{else}:\\
\;\;\;\;x + t \cdot \frac{y}{a}\\
\end{array}
\]
Alternative 6 Accuracy 77.7% Cost 713
\[\begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{-28} \lor \neg \left(z \leq 1.42 \cdot 10^{+32}\right):\\
\;\;\;\;t + x\\
\mathbf{else}:\\
\;\;\;\;x + \frac{y}{\frac{a}{t}}\\
\end{array}
\]
Alternative 7 Accuracy 97.9% Cost 704
\[x - t \cdot \frac{z - y}{a - z}
\]
Alternative 8 Accuracy 68.2% Cost 456
\[\begin{array}{l}
\mathbf{if}\;a \leq -7.5 \cdot 10^{+64}:\\
\;\;\;\;x\\
\mathbf{elif}\;a \leq 1.22 \cdot 10^{+162}:\\
\;\;\;\;t + x\\
\mathbf{else}:\\
\;\;\;\;x\\
\end{array}
\]
Alternative 9 Accuracy 54.7% Cost 64
\[x
\]