
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (/ (+ b (- (* x (* 9.0 y)) (* (* z 4.0) (* a t)))) (* z c))))
(if (<= t_1 -5e-194)
t_2
(if (<= t_1 0.0)
(/ (+ (* -4.0 (/ (* a (* z t)) c)) (+ (* 9.0 (/ (* x y) c)) (/ b c))) z)
(if (<= t_1 INFINITY) t_2 (* a (/ (* t -4.0) c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
double tmp;
if (t_1 <= -5e-194) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c))) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
double tmp;
if (t_1 <= -5e-194) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c))) / z;
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_2;
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c) tmp = 0 if t_1 <= -5e-194: tmp = t_2 elif t_1 <= 0.0: tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c))) / z elif t_1 <= math.inf: tmp = t_2 else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -5e-194) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(Float64(Float64(-4.0 * Float64(Float64(a * Float64(z * t)) / c)) + Float64(Float64(9.0 * Float64(Float64(x * y) / c)) + Float64(b / c))) / z); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
tmp = 0.0;
if (t_1 <= -5e-194)
tmp = t_2;
elseif (t_1 <= 0.0)
tmp = ((-4.0 * ((a * (z * t)) / c)) + ((9.0 * ((x * y) / c)) + (b / c))) / z;
elseif (t_1 <= Inf)
tmp = t_2;
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b + N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-194], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(-4.0 * N[(N[(a * N[(z * t), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{-194}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{-4 \cdot \frac{a \cdot \left(z \cdot t\right)}{c} + \left(9 \cdot \frac{x \cdot y}{c} + \frac{b}{c}\right)}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -5.0000000000000002e-194 or 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 84.6%
associate-+l-84.6%
*-commutative84.6%
associate-*r*86.0%
*-commutative86.0%
associate-+l-86.0%
associate-*l*86.0%
associate-*l*87.7%
*-commutative87.7%
Simplified87.7%
if -5.0000000000000002e-194 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 0.0Initial program 30.5%
associate-+l-30.5%
*-commutative30.5%
associate-*r*30.5%
*-commutative30.5%
associate-+l-30.5%
Simplified30.5%
Taylor expanded in z around 0 99.8%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-+l-0.0%
*-commutative0.0%
associate-*r*1.0%
*-commutative1.0%
associate-+l-1.0%
Simplified14.0%
Taylor expanded in t around inf 63.3%
*-commutative63.3%
associate-/l*75.4%
associate-*r*75.4%
*-commutative75.4%
*-commutative75.4%
associate-*l/75.4%
Simplified75.4%
Final simplification87.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -1.75e+147)
(- (* 9.0 (/ (* x y) (* z c))) (* 4.0 (/ (* a t) c)))
(if (<= z 3.95e+121)
(/ (+ (fma x (* 9.0 y) (* t (* a (* z -4.0)))) b) (* z c))
(*
x
(-
(+ (* 9.0 (/ y (* z c))) (/ b (* c (* z x))))
(* 4.0 (/ (* a t) (* x c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -1.75e+147) {
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * ((a * t) / c));
} else if (z <= 3.95e+121) {
tmp = (fma(x, (9.0 * y), (t * (a * (z * -4.0)))) + b) / (z * c);
} else {
tmp = x * (((9.0 * (y / (z * c))) + (b / (c * (z * x)))) - (4.0 * ((a * t) / (x * c))));
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -1.75e+147) tmp = Float64(Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))) - Float64(4.0 * Float64(Float64(a * t) / c))); elseif (z <= 3.95e+121) tmp = Float64(Float64(fma(x, Float64(9.0 * y), Float64(t * Float64(a * Float64(z * -4.0)))) + b) / Float64(z * c)); else tmp = Float64(x * Float64(Float64(Float64(9.0 * Float64(y / Float64(z * c))) + Float64(b / Float64(c * Float64(z * x)))) - Float64(4.0 * Float64(Float64(a * t) / Float64(x * c))))); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -1.75e+147], N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.95e+121], N[(N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(N[(9.0 * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / N[(x * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.75 \cdot 10^{+147}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c} - 4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 3.95 \cdot 10^{+121}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right) + b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\left(9 \cdot \frac{y}{z \cdot c} + \frac{b}{c \cdot \left(z \cdot x\right)}\right) - 4 \cdot \frac{a \cdot t}{x \cdot c}\right)\\
\end{array}
\end{array}
if z < -1.74999999999999987e147Initial program 45.4%
associate-+l-45.4%
*-commutative45.4%
associate-*r*51.7%
*-commutative51.7%
associate-+l-51.7%
associate-*l*51.8%
associate-*l*57.9%
*-commutative57.9%
Simplified57.9%
Taylor expanded in b around inf 72.5%
Taylor expanded in b around 0 84.5%
if -1.74999999999999987e147 < z < 3.95e121Initial program 87.3%
associate-+l-87.3%
*-commutative87.3%
associate-*r*89.0%
*-commutative89.0%
associate-+l-89.0%
Simplified89.5%
if 3.95e121 < z Initial program 48.4%
associate-+l-48.4%
*-commutative48.4%
associate-*r*43.5%
*-commutative43.5%
associate-+l-43.5%
associate-*l*43.5%
associate-*l*53.3%
*-commutative53.3%
Simplified53.3%
Taylor expanded in x around inf 82.3%
Final simplification87.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c)))
(t_2 (/ (+ b (- (* x (* 9.0 y)) (* (* z 4.0) (* a t)))) (* z c))))
(if (<= t_1 -1e-261)
t_2
(if (<= t_1 0.0)
(/ (+ (* 9.0 (/ (* x y) c)) (/ b c)) z)
(if (<= t_1 INFINITY) t_2 (* a (/ (* t -4.0) c)))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
double tmp;
if (t_1 <= -1e-261) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = ((9.0 * ((x * y) / c)) + (b / c)) / z;
} else if (t_1 <= ((double) INFINITY)) {
tmp = t_2;
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
double t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
double tmp;
if (t_1 <= -1e-261) {
tmp = t_2;
} else if (t_1 <= 0.0) {
tmp = ((9.0 * ((x * y) / c)) + (b / c)) / z;
} else if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_2;
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c) tmp = 0 if t_1 <= -1e-261: tmp = t_2 elif t_1 <= 0.0: tmp = ((9.0 * ((x * y) / c)) + (b / c)) / z elif t_1 <= math.inf: tmp = t_2 else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)) t_2 = Float64(Float64(b + Float64(Float64(x * Float64(9.0 * y)) - Float64(Float64(z * 4.0) * Float64(a * t)))) / Float64(z * c)) tmp = 0.0 if (t_1 <= -1e-261) tmp = t_2; elseif (t_1 <= 0.0) tmp = Float64(Float64(Float64(9.0 * Float64(Float64(x * y) / c)) + Float64(b / c)) / z); elseif (t_1 <= Inf) tmp = t_2; else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
t_2 = (b + ((x * (9.0 * y)) - ((z * 4.0) * (a * t)))) / (z * c);
tmp = 0.0;
if (t_1 <= -1e-261)
tmp = t_2;
elseif (t_1 <= 0.0)
tmp = ((9.0 * ((x * y) / c)) + (b / c)) / z;
elseif (t_1 <= Inf)
tmp = t_2;
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b + N[(N[(x * N[(9.0 * y), $MachinePrecision]), $MachinePrecision] - N[(N[(z * 4.0), $MachinePrecision] * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-261], t$95$2, If[LessEqual[t$95$1, 0.0], N[(N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(b / c), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$2, N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
t_2 := \frac{b + \left(x \cdot \left(9 \cdot y\right) - \left(z \cdot 4\right) \cdot \left(a \cdot t\right)\right)}{z \cdot c}\\
\mathbf{if}\;t\_1 \leq -1 \cdot 10^{-261}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 0:\\
\;\;\;\;\frac{9 \cdot \frac{x \cdot y}{c} + \frac{b}{c}}{z}\\
\mathbf{elif}\;t\_1 \leq \infty:\\
\;\;\;\;t\_2\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < -9.99999999999999984e-262 or 0.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < +inf.0Initial program 84.6%
associate-+l-84.6%
*-commutative84.6%
associate-*r*86.0%
*-commutative86.0%
associate-+l-86.0%
associate-*l*86.0%
associate-*l*87.7%
*-commutative87.7%
Simplified87.7%
if -9.99999999999999984e-262 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) < 0.0Initial program 25.5%
associate-+l-25.5%
*-commutative25.5%
associate-*r*25.5%
*-commutative25.5%
associate-+l-25.5%
Simplified25.5%
Taylor expanded in z around 0 99.8%
Taylor expanded in a around 0 86.5%
if +inf.0 < (/.f64 (+.f64 (-.f64 (*.f64 (*.f64 x #s(literal 9 binary64)) y) (*.f64 (*.f64 (*.f64 z #s(literal 4 binary64)) t) a)) b) (*.f64 z c)) Initial program 0.0%
associate-+l-0.0%
*-commutative0.0%
associate-*r*1.0%
*-commutative1.0%
associate-+l-1.0%
Simplified14.0%
Taylor expanded in t around inf 63.3%
*-commutative63.3%
associate-/l*75.4%
associate-*r*75.4%
*-commutative75.4%
*-commutative75.4%
associate-*l/75.4%
Simplified75.4%
Final simplification86.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -2.35e+148)
(- (* 9.0 (/ (* x y) (* z c))) (* 4.0 (/ (* a t) c)))
(if (<= z 1.35e+101)
(/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))
(*
x
(-
(+ (* 9.0 (/ y (* z c))) (/ b (* c (* z x))))
(* 4.0 (/ (* a t) (* x c))))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.35e+148) {
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * ((a * t) / c));
} else if (z <= 1.35e+101) {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = x * (((9.0 * (y / (z * c))) + (b / (c * (z * x)))) - (4.0 * ((a * t) / (x * c))));
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-2.35d+148)) then
tmp = (9.0d0 * ((x * y) / (z * c))) - (4.0d0 * ((a * t) / c))
else if (z <= 1.35d+101) then
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
else
tmp = x * (((9.0d0 * (y / (z * c))) + (b / (c * (z * x)))) - (4.0d0 * ((a * t) / (x * c))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -2.35e+148) {
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * ((a * t) / c));
} else if (z <= 1.35e+101) {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
} else {
tmp = x * (((9.0 * (y / (z * c))) + (b / (c * (z * x)))) - (4.0 * ((a * t) / (x * c))));
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -2.35e+148: tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * ((a * t) / c)) elif z <= 1.35e+101: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) else: tmp = x * (((9.0 * (y / (z * c))) + (b / (c * (z * x)))) - (4.0 * ((a * t) / (x * c)))) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -2.35e+148) tmp = Float64(Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))) - Float64(4.0 * Float64(Float64(a * t) / c))); elseif (z <= 1.35e+101) tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); else tmp = Float64(x * Float64(Float64(Float64(9.0 * Float64(y / Float64(z * c))) + Float64(b / Float64(c * Float64(z * x)))) - Float64(4.0 * Float64(Float64(a * t) / Float64(x * c))))); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -2.35e+148)
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * ((a * t) / c));
elseif (z <= 1.35e+101)
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
else
tmp = x * (((9.0 * (y / (z * c))) + (b / (c * (z * x)))) - (4.0 * ((a * t) / (x * c))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -2.35e+148], N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.35e+101], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(x * N[(N[(N[(9.0 * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b / N[(c * N[(z * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * N[(N[(a * t), $MachinePrecision] / N[(x * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.35 \cdot 10^{+148}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c} - 4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;z \leq 1.35 \cdot 10^{+101}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(\left(9 \cdot \frac{y}{z \cdot c} + \frac{b}{c \cdot \left(z \cdot x\right)}\right) - 4 \cdot \frac{a \cdot t}{x \cdot c}\right)\\
\end{array}
\end{array}
if z < -2.3499999999999999e148Initial program 44.9%
associate-+l-44.9%
*-commutative44.9%
associate-*r*48.5%
*-commutative48.5%
associate-+l-48.5%
associate-*l*48.5%
associate-*l*55.1%
*-commutative55.1%
Simplified55.1%
Taylor expanded in b around inf 73.8%
Taylor expanded in b around 0 83.5%
if -2.3499999999999999e148 < z < 1.35000000000000003e101Initial program 88.6%
if 1.35000000000000003e101 < z Initial program 46.5%
associate-+l-46.5%
*-commutative46.5%
associate-*r*46.5%
*-commutative46.5%
associate-+l-46.5%
associate-*l*46.5%
associate-*l*55.1%
*-commutative55.1%
Simplified55.1%
Taylor expanded in x around inf 78.2%
Final simplification86.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (* a t) c)))
(if (<= z -1.05e+143)
(- (* 9.0 (/ (* x y) (* z c))) (* 4.0 t_1))
(if (<= z 1.5e-172)
(/ (/ (+ b (* 9.0 (* x y))) c) z)
(if (<= z 3.5e+230)
(/ (+ b (* z (* t (* a -4.0)))) (* z c))
(* t_1 -4.0))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (a * t) / c;
double tmp;
if (z <= -1.05e+143) {
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * t_1);
} else if (z <= 1.5e-172) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else if (z <= 3.5e+230) {
tmp = (b + (z * (t * (a * -4.0)))) / (z * c);
} else {
tmp = t_1 * -4.0;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (a * t) / c
if (z <= (-1.05d+143)) then
tmp = (9.0d0 * ((x * y) / (z * c))) - (4.0d0 * t_1)
else if (z <= 1.5d-172) then
tmp = ((b + (9.0d0 * (x * y))) / c) / z
else if (z <= 3.5d+230) then
tmp = (b + (z * (t * (a * (-4.0d0))))) / (z * c)
else
tmp = t_1 * (-4.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (a * t) / c;
double tmp;
if (z <= -1.05e+143) {
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * t_1);
} else if (z <= 1.5e-172) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else if (z <= 3.5e+230) {
tmp = (b + (z * (t * (a * -4.0)))) / (z * c);
} else {
tmp = t_1 * -4.0;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (a * t) / c tmp = 0 if z <= -1.05e+143: tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * t_1) elif z <= 1.5e-172: tmp = ((b + (9.0 * (x * y))) / c) / z elif z <= 3.5e+230: tmp = (b + (z * (t * (a * -4.0)))) / (z * c) else: tmp = t_1 * -4.0 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(a * t) / c) tmp = 0.0 if (z <= -1.05e+143) tmp = Float64(Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))) - Float64(4.0 * t_1)); elseif (z <= 1.5e-172) tmp = Float64(Float64(Float64(b + Float64(9.0 * Float64(x * y))) / c) / z); elseif (z <= 3.5e+230) tmp = Float64(Float64(b + Float64(z * Float64(t * Float64(a * -4.0)))) / Float64(z * c)); else tmp = Float64(t_1 * -4.0); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (a * t) / c;
tmp = 0.0;
if (z <= -1.05e+143)
tmp = (9.0 * ((x * y) / (z * c))) - (4.0 * t_1);
elseif (z <= 1.5e-172)
tmp = ((b + (9.0 * (x * y))) / c) / z;
elseif (z <= 3.5e+230)
tmp = (b + (z * (t * (a * -4.0)))) / (z * c);
else
tmp = t_1 * -4.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -1.05e+143], N[(N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(4.0 * t$95$1), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.5e-172], N[(N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 3.5e+230], N[(N[(b + N[(z * N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * -4.0), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{a \cdot t}{c}\\
\mathbf{if}\;z \leq -1.05 \cdot 10^{+143}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c} - 4 \cdot t\_1\\
\mathbf{elif}\;z \leq 1.5 \cdot 10^{-172}:\\
\;\;\;\;\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{elif}\;z \leq 3.5 \cdot 10^{+230}:\\
\;\;\;\;\frac{b + z \cdot \left(t \cdot \left(a \cdot -4\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1 \cdot -4\\
\end{array}
\end{array}
if z < -1.04999999999999994e143Initial program 47.1%
associate-+l-47.1%
*-commutative47.1%
associate-*r*53.2%
*-commutative53.2%
associate-+l-53.2%
associate-*l*53.2%
associate-*l*59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in b around inf 73.4%
Taylor expanded in b around 0 85.0%
if -1.04999999999999994e143 < z < 1.49999999999999992e-172Initial program 87.6%
associate-+l-87.6%
*-commutative87.6%
associate-*r*87.9%
*-commutative87.9%
associate-+l-87.9%
Simplified87.8%
Taylor expanded in z around 0 85.2%
Taylor expanded in a around 0 75.8%
Taylor expanded in c around 0 79.0%
if 1.49999999999999992e-172 < z < 3.5e230Initial program 76.0%
associate-+l-76.0%
*-commutative76.0%
associate-*r*77.2%
*-commutative77.2%
associate-+l-77.2%
associate-*l*77.2%
associate-*l*80.5%
*-commutative80.5%
Simplified80.5%
Taylor expanded in t around inf 76.0%
Taylor expanded in t around inf 70.4%
associate-*r*70.4%
*-commutative70.4%
associate-*r*72.5%
associate-*r*72.5%
metadata-eval72.5%
distribute-lft-neg-in72.5%
associate-*r*72.5%
*-commutative72.5%
distribute-rgt-neg-in72.5%
distribute-lft-neg-in72.5%
metadata-eval72.5%
associate-*r*74.8%
*-commutative74.8%
Simplified74.8%
if 3.5e230 < z Initial program 36.1%
associate-+l-36.1%
*-commutative36.1%
associate-*r*35.9%
*-commutative35.9%
associate-+l-35.9%
Simplified44.7%
Taylor expanded in t around inf 80.1%
Final simplification78.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* (/ (* a t) c) -4.0)))
(if (<= z -2.4e+143)
t_1
(if (<= z 8.5e-172)
(/ (/ (+ b (* 9.0 (* x y))) c) z)
(if (<= z 3.7e+230) (/ (+ b (* z (* t (* a -4.0)))) (* z c)) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((a * t) / c) * -4.0;
double tmp;
if (z <= -2.4e+143) {
tmp = t_1;
} else if (z <= 8.5e-172) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else if (z <= 3.7e+230) {
tmp = (b + (z * (t * (a * -4.0)))) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = ((a * t) / c) * (-4.0d0)
if (z <= (-2.4d+143)) then
tmp = t_1
else if (z <= 8.5d-172) then
tmp = ((b + (9.0d0 * (x * y))) / c) / z
else if (z <= 3.7d+230) then
tmp = (b + (z * (t * (a * (-4.0d0))))) / (z * c)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((a * t) / c) * -4.0;
double tmp;
if (z <= -2.4e+143) {
tmp = t_1;
} else if (z <= 8.5e-172) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else if (z <= 3.7e+230) {
tmp = (b + (z * (t * (a * -4.0)))) / (z * c);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = ((a * t) / c) * -4.0 tmp = 0 if z <= -2.4e+143: tmp = t_1 elif z <= 8.5e-172: tmp = ((b + (9.0 * (x * y))) / c) / z elif z <= 3.7e+230: tmp = (b + (z * (t * (a * -4.0)))) / (z * c) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(a * t) / c) * -4.0) tmp = 0.0 if (z <= -2.4e+143) tmp = t_1; elseif (z <= 8.5e-172) tmp = Float64(Float64(Float64(b + Float64(9.0 * Float64(x * y))) / c) / z); elseif (z <= 3.7e+230) tmp = Float64(Float64(b + Float64(z * Float64(t * Float64(a * -4.0)))) / Float64(z * c)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((a * t) / c) * -4.0;
tmp = 0.0;
if (z <= -2.4e+143)
tmp = t_1;
elseif (z <= 8.5e-172)
tmp = ((b + (9.0 * (x * y))) / c) / z;
elseif (z <= 3.7e+230)
tmp = (b + (z * (t * (a * -4.0)))) / (z * c);
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision]}, If[LessEqual[z, -2.4e+143], t$95$1, If[LessEqual[z, 8.5e-172], N[(N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 3.7e+230], N[(N[(b + N[(z * N[(t * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{a \cdot t}{c} \cdot -4\\
\mathbf{if}\;z \leq -2.4 \cdot 10^{+143}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 8.5 \cdot 10^{-172}:\\
\;\;\;\;\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{elif}\;z \leq 3.7 \cdot 10^{+230}:\\
\;\;\;\;\frac{b + z \cdot \left(t \cdot \left(a \cdot -4\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -2.3999999999999998e143 or 3.69999999999999992e230 < z Initial program 44.1%
associate-+l-44.1%
*-commutative44.1%
associate-*r*48.6%
*-commutative48.6%
associate-+l-48.6%
Simplified50.9%
Taylor expanded in t around inf 73.1%
if -2.3999999999999998e143 < z < 8.49999999999999963e-172Initial program 87.6%
associate-+l-87.6%
*-commutative87.6%
associate-*r*87.9%
*-commutative87.9%
associate-+l-87.9%
Simplified87.8%
Taylor expanded in z around 0 85.2%
Taylor expanded in a around 0 75.8%
Taylor expanded in c around 0 79.0%
if 8.49999999999999963e-172 < z < 3.69999999999999992e230Initial program 76.0%
associate-+l-76.0%
*-commutative76.0%
associate-*r*77.2%
*-commutative77.2%
associate-+l-77.2%
associate-*l*77.2%
associate-*l*80.5%
*-commutative80.5%
Simplified80.5%
Taylor expanded in t around inf 76.0%
Taylor expanded in t around inf 70.4%
associate-*r*70.4%
*-commutative70.4%
associate-*r*72.5%
associate-*r*72.5%
metadata-eval72.5%
distribute-lft-neg-in72.5%
associate-*r*72.5%
*-commutative72.5%
distribute-rgt-neg-in72.5%
distribute-lft-neg-in72.5%
metadata-eval72.5%
associate-*r*74.8%
*-commutative74.8%
Simplified74.8%
Final simplification76.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -7.2e+143)
(* (/ (* a t) c) -4.0)
(if (<= z 8.4e-172)
(/ (/ (+ b (* 9.0 (* x y))) c) z)
(if (<= z 4.1e+121)
(/ (+ b (* t (* z (* a -4.0)))) (* z c))
(* a (/ (* t -4.0) c))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -7.2e+143) {
tmp = ((a * t) / c) * -4.0;
} else if (z <= 8.4e-172) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else if (z <= 4.1e+121) {
tmp = (b + (t * (z * (a * -4.0)))) / (z * c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-7.2d+143)) then
tmp = ((a * t) / c) * (-4.0d0)
else if (z <= 8.4d-172) then
tmp = ((b + (9.0d0 * (x * y))) / c) / z
else if (z <= 4.1d+121) then
tmp = (b + (t * (z * (a * (-4.0d0))))) / (z * c)
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -7.2e+143) {
tmp = ((a * t) / c) * -4.0;
} else if (z <= 8.4e-172) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else if (z <= 4.1e+121) {
tmp = (b + (t * (z * (a * -4.0)))) / (z * c);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -7.2e+143: tmp = ((a * t) / c) * -4.0 elif z <= 8.4e-172: tmp = ((b + (9.0 * (x * y))) / c) / z elif z <= 4.1e+121: tmp = (b + (t * (z * (a * -4.0)))) / (z * c) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -7.2e+143) tmp = Float64(Float64(Float64(a * t) / c) * -4.0); elseif (z <= 8.4e-172) tmp = Float64(Float64(Float64(b + Float64(9.0 * Float64(x * y))) / c) / z); elseif (z <= 4.1e+121) tmp = Float64(Float64(b + Float64(t * Float64(z * Float64(a * -4.0)))) / Float64(z * c)); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -7.2e+143)
tmp = ((a * t) / c) * -4.0;
elseif (z <= 8.4e-172)
tmp = ((b + (9.0 * (x * y))) / c) / z;
elseif (z <= 4.1e+121)
tmp = (b + (t * (z * (a * -4.0)))) / (z * c);
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -7.2e+143], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 8.4e-172], N[(N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 4.1e+121], N[(N[(b + N[(t * N[(z * N[(a * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -7.2 \cdot 10^{+143}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\mathbf{elif}\;z \leq 8.4 \cdot 10^{-172}:\\
\;\;\;\;\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{elif}\;z \leq 4.1 \cdot 10^{+121}:\\
\;\;\;\;\frac{b + t \cdot \left(z \cdot \left(a \cdot -4\right)\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if z < -7.1999999999999998e143Initial program 47.1%
associate-+l-47.1%
*-commutative47.1%
associate-*r*53.2%
*-commutative53.2%
associate-+l-53.2%
Simplified53.2%
Taylor expanded in t around inf 70.6%
if -7.1999999999999998e143 < z < 8.3999999999999998e-172Initial program 87.6%
associate-+l-87.6%
*-commutative87.6%
associate-*r*87.9%
*-commutative87.9%
associate-+l-87.9%
Simplified87.8%
Taylor expanded in z around 0 85.2%
Taylor expanded in a around 0 75.8%
Taylor expanded in c around 0 79.0%
if 8.3999999999999998e-172 < z < 4.1e121Initial program 86.4%
associate-+l-86.4%
*-commutative86.4%
associate-*r*91.3%
*-commutative91.3%
associate-+l-91.3%
associate-*l*91.3%
associate-*l*91.3%
*-commutative91.3%
Simplified91.3%
Taylor expanded in t around inf 89.6%
Taylor expanded in x around 0 86.3%
associate-*r*86.3%
*-commutative86.3%
Simplified86.3%
if 4.1e121 < z Initial program 48.4%
associate-+l-48.4%
*-commutative48.4%
associate-*r*43.5%
*-commutative43.5%
associate-+l-43.5%
Simplified46.2%
Taylor expanded in t around inf 54.4%
*-commutative54.4%
associate-/l*56.8%
associate-*r*56.8%
*-commutative56.8%
*-commutative56.8%
associate-*l/56.8%
Simplified56.8%
Final simplification76.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= b -6.2e+96)
(/ (/ b c) z)
(if (<= b 4.6e-283)
(* (/ (* a t) c) -4.0)
(if (<= b 1e+92) (* 9.0 (* x (/ (/ y c) z))) (* (/ b c) (/ 1.0 z))))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -6.2e+96) {
tmp = (b / c) / z;
} else if (b <= 4.6e-283) {
tmp = ((a * t) / c) * -4.0;
} else if (b <= 1e+92) {
tmp = 9.0 * (x * ((y / c) / z));
} else {
tmp = (b / c) * (1.0 / z);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (b <= (-6.2d+96)) then
tmp = (b / c) / z
else if (b <= 4.6d-283) then
tmp = ((a * t) / c) * (-4.0d0)
else if (b <= 1d+92) then
tmp = 9.0d0 * (x * ((y / c) / z))
else
tmp = (b / c) * (1.0d0 / z)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (b <= -6.2e+96) {
tmp = (b / c) / z;
} else if (b <= 4.6e-283) {
tmp = ((a * t) / c) * -4.0;
} else if (b <= 1e+92) {
tmp = 9.0 * (x * ((y / c) / z));
} else {
tmp = (b / c) * (1.0 / z);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if b <= -6.2e+96: tmp = (b / c) / z elif b <= 4.6e-283: tmp = ((a * t) / c) * -4.0 elif b <= 1e+92: tmp = 9.0 * (x * ((y / c) / z)) else: tmp = (b / c) * (1.0 / z) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (b <= -6.2e+96) tmp = Float64(Float64(b / c) / z); elseif (b <= 4.6e-283) tmp = Float64(Float64(Float64(a * t) / c) * -4.0); elseif (b <= 1e+92) tmp = Float64(9.0 * Float64(x * Float64(Float64(y / c) / z))); else tmp = Float64(Float64(b / c) * Float64(1.0 / z)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (b <= -6.2e+96)
tmp = (b / c) / z;
elseif (b <= 4.6e-283)
tmp = ((a * t) / c) * -4.0;
elseif (b <= 1e+92)
tmp = 9.0 * (x * ((y / c) / z));
else
tmp = (b / c) * (1.0 / z);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[b, -6.2e+96], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[b, 4.6e-283], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[b, 1e+92], N[(9.0 * N[(x * N[(N[(y / c), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -6.2 \cdot 10^{+96}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;b \leq 4.6 \cdot 10^{-283}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\mathbf{elif}\;b \leq 10^{+92}:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{\frac{y}{c}}{z}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{c} \cdot \frac{1}{z}\\
\end{array}
\end{array}
if b < -6.1999999999999996e96Initial program 88.3%
associate-+l-88.3%
*-commutative88.3%
associate-*r*84.3%
*-commutative84.3%
associate-+l-84.3%
associate-*l*84.3%
associate-*l*90.2%
*-commutative90.2%
Simplified90.2%
Taylor expanded in b around inf 81.9%
times-frac79.9%
Applied egg-rr79.9%
Taylor expanded in b around inf 70.8%
associate-/r*72.0%
Simplified72.0%
if -6.1999999999999996e96 < b < 4.5999999999999998e-283Initial program 69.9%
associate-+l-69.9%
*-commutative69.9%
associate-*r*73.7%
*-commutative73.7%
associate-+l-73.7%
Simplified74.9%
Taylor expanded in t around inf 53.6%
if 4.5999999999999998e-283 < b < 1e92Initial program 74.7%
associate-+l-74.7%
*-commutative74.7%
associate-*r*77.7%
*-commutative77.7%
associate-+l-77.7%
associate-*l*77.7%
associate-*l*77.7%
*-commutative77.7%
Simplified77.7%
Taylor expanded in b around inf 53.7%
Taylor expanded in x around inf 44.0%
associate-/l*41.9%
associate-/r*45.4%
Simplified45.4%
if 1e92 < b Initial program 76.2%
associate-+l-76.2%
*-commutative76.2%
associate-*r*76.2%
*-commutative76.2%
associate-+l-76.2%
Simplified76.2%
Taylor expanded in b around inf 54.7%
*-commutative54.7%
Simplified54.7%
clear-num54.7%
inv-pow54.7%
Applied egg-rr54.7%
unpow-154.7%
associate-/l*60.6%
Simplified60.6%
inv-pow60.6%
*-commutative60.6%
unpow-prod-down60.9%
inv-pow60.9%
clear-num60.9%
inv-pow60.9%
Applied egg-rr60.9%
Final simplification56.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (/ t -0.25) (/ c a))))
(if (<= a -3.9e-128)
t_1
(if (<= a 4.8e-40)
(* (/ b c) (/ 1.0 z))
(if (<= a 112000.0) (* 9.0 (* x (/ y (* z c)))) t_1)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (t / -0.25) / (c / a);
double tmp;
if (a <= -3.9e-128) {
tmp = t_1;
} else if (a <= 4.8e-40) {
tmp = (b / c) * (1.0 / z);
} else if (a <= 112000.0) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = t_1;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (t / (-0.25d0)) / (c / a)
if (a <= (-3.9d-128)) then
tmp = t_1
else if (a <= 4.8d-40) then
tmp = (b / c) * (1.0d0 / z)
else if (a <= 112000.0d0) then
tmp = 9.0d0 * (x * (y / (z * c)))
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = (t / -0.25) / (c / a);
double tmp;
if (a <= -3.9e-128) {
tmp = t_1;
} else if (a <= 4.8e-40) {
tmp = (b / c) * (1.0 / z);
} else if (a <= 112000.0) {
tmp = 9.0 * (x * (y / (z * c)));
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): t_1 = (t / -0.25) / (c / a) tmp = 0 if a <= -3.9e-128: tmp = t_1 elif a <= 4.8e-40: tmp = (b / c) * (1.0 / z) elif a <= 112000.0: tmp = 9.0 * (x * (y / (z * c))) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(t / -0.25) / Float64(c / a)) tmp = 0.0 if (a <= -3.9e-128) tmp = t_1; elseif (a <= 4.8e-40) tmp = Float64(Float64(b / c) * Float64(1.0 / z)); elseif (a <= 112000.0) tmp = Float64(9.0 * Float64(x * Float64(y / Float64(z * c)))); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = (t / -0.25) / (c / a);
tmp = 0.0;
if (a <= -3.9e-128)
tmp = t_1;
elseif (a <= 4.8e-40)
tmp = (b / c) * (1.0 / z);
elseif (a <= 112000.0)
tmp = 9.0 * (x * (y / (z * c)));
else
tmp = t_1;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(t / -0.25), $MachinePrecision] / N[(c / a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -3.9e-128], t$95$1, If[LessEqual[a, 4.8e-40], N[(N[(b / c), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 112000.0], N[(9.0 * N[(x * N[(y / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\frac{t}{-0.25}}{\frac{c}{a}}\\
\mathbf{if}\;a \leq -3.9 \cdot 10^{-128}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;a \leq 4.8 \cdot 10^{-40}:\\
\;\;\;\;\frac{b}{c} \cdot \frac{1}{z}\\
\mathbf{elif}\;a \leq 112000:\\
\;\;\;\;9 \cdot \left(x \cdot \frac{y}{z \cdot c}\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if a < -3.89999999999999997e-128 or 112000 < a Initial program 79.1%
associate-+l-79.1%
*-commutative79.1%
associate-*r*75.4%
*-commutative75.4%
associate-+l-75.4%
associate-*l*75.4%
associate-*l*78.1%
*-commutative78.1%
Simplified78.1%
Taylor expanded in b around inf 66.8%
Taylor expanded in z around inf 50.8%
associate-*r/50.8%
associate-*r*50.8%
associate-*l/54.7%
*-commutative54.7%
Simplified54.7%
*-commutative54.7%
clear-num54.7%
un-div-inv54.1%
*-un-lft-identity54.1%
*-commutative54.1%
times-frac54.1%
metadata-eval54.1%
Applied egg-rr54.1%
associate-/r*54.1%
Simplified54.1%
if -3.89999999999999997e-128 < a < 4.79999999999999982e-40Initial program 70.6%
associate-+l-70.6%
*-commutative70.6%
associate-*r*79.6%
*-commutative79.6%
associate-+l-79.6%
Simplified79.6%
Taylor expanded in b around inf 43.1%
*-commutative43.1%
Simplified43.1%
clear-num43.1%
inv-pow43.1%
Applied egg-rr43.1%
unpow-143.1%
associate-/l*48.8%
Simplified48.8%
inv-pow48.8%
*-commutative48.8%
unpow-prod-down48.8%
inv-pow48.8%
clear-num48.8%
inv-pow48.8%
Applied egg-rr48.8%
if 4.79999999999999982e-40 < a < 112000Initial program 84.2%
associate-+l-84.2%
*-commutative84.2%
associate-*r*84.2%
*-commutative84.2%
associate-+l-84.2%
Simplified84.2%
Taylor expanded in x around inf 51.1%
associate-/l*51.3%
*-commutative51.3%
Simplified51.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -4.5e+144)
(* (/ (* a t) c) -4.0)
(if (<= z 6.6e+100)
(/ (/ (+ b (* 9.0 (* x y))) c) z)
(/ (/ t -0.25) (/ c a)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -4.5e+144) {
tmp = ((a * t) / c) * -4.0;
} else if (z <= 6.6e+100) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else {
tmp = (t / -0.25) / (c / a);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-4.5d+144)) then
tmp = ((a * t) / c) * (-4.0d0)
else if (z <= 6.6d+100) then
tmp = ((b + (9.0d0 * (x * y))) / c) / z
else
tmp = (t / (-0.25d0)) / (c / a)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -4.5e+144) {
tmp = ((a * t) / c) * -4.0;
} else if (z <= 6.6e+100) {
tmp = ((b + (9.0 * (x * y))) / c) / z;
} else {
tmp = (t / -0.25) / (c / a);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -4.5e+144: tmp = ((a * t) / c) * -4.0 elif z <= 6.6e+100: tmp = ((b + (9.0 * (x * y))) / c) / z else: tmp = (t / -0.25) / (c / a) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -4.5e+144) tmp = Float64(Float64(Float64(a * t) / c) * -4.0); elseif (z <= 6.6e+100) tmp = Float64(Float64(Float64(b + Float64(9.0 * Float64(x * y))) / c) / z); else tmp = Float64(Float64(t / -0.25) / Float64(c / a)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -4.5e+144)
tmp = ((a * t) / c) * -4.0;
elseif (z <= 6.6e+100)
tmp = ((b + (9.0 * (x * y))) / c) / z;
else
tmp = (t / -0.25) / (c / a);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -4.5e+144], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 6.6e+100], N[(N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], N[(N[(t / -0.25), $MachinePrecision] / N[(c / a), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.5 \cdot 10^{+144}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\mathbf{elif}\;z \leq 6.6 \cdot 10^{+100}:\\
\;\;\;\;\frac{\frac{b + 9 \cdot \left(x \cdot y\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t}{-0.25}}{\frac{c}{a}}\\
\end{array}
\end{array}
if z < -4.49999999999999967e144Initial program 47.1%
associate-+l-47.1%
*-commutative47.1%
associate-*r*53.2%
*-commutative53.2%
associate-+l-53.2%
Simplified53.2%
Taylor expanded in t around inf 70.6%
if -4.49999999999999967e144 < z < 6.6000000000000002e100Initial program 89.0%
associate-+l-89.0%
*-commutative89.0%
associate-*r*89.7%
*-commutative89.7%
associate-+l-89.7%
Simplified89.7%
Taylor expanded in z around 0 86.7%
Taylor expanded in a around 0 71.9%
Taylor expanded in c around 0 74.8%
if 6.6000000000000002e100 < z Initial program 46.5%
associate-+l-46.5%
*-commutative46.5%
associate-*r*46.5%
*-commutative46.5%
associate-+l-46.5%
associate-*l*46.5%
associate-*l*55.1%
*-commutative55.1%
Simplified55.1%
Taylor expanded in b around inf 53.7%
Taylor expanded in z around inf 56.1%
associate-*r/56.1%
associate-*r*56.1%
associate-*l/56.2%
*-commutative56.2%
Simplified56.2%
*-commutative56.2%
clear-num56.2%
un-div-inv56.3%
*-un-lft-identity56.3%
*-commutative56.3%
times-frac56.3%
metadata-eval56.3%
Applied egg-rr56.3%
associate-/r*56.3%
Simplified56.3%
Final simplification71.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= z -8.8e+142)
(* (/ (* a t) c) -4.0)
(if (<= z 2.3e+100)
(/ (+ b (* 9.0 (* x y))) (* z c))
(/ (/ t -0.25) (/ c a)))))assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8.8e+142) {
tmp = ((a * t) / c) * -4.0;
} else if (z <= 2.3e+100) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else {
tmp = (t / -0.25) / (c / a);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= (-8.8d+142)) then
tmp = ((a * t) / c) * (-4.0d0)
else if (z <= 2.3d+100) then
tmp = (b + (9.0d0 * (x * y))) / (z * c)
else
tmp = (t / (-0.25d0)) / (c / a)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= -8.8e+142) {
tmp = ((a * t) / c) * -4.0;
} else if (z <= 2.3e+100) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else {
tmp = (t / -0.25) / (c / a);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= -8.8e+142: tmp = ((a * t) / c) * -4.0 elif z <= 2.3e+100: tmp = (b + (9.0 * (x * y))) / (z * c) else: tmp = (t / -0.25) / (c / a) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= -8.8e+142) tmp = Float64(Float64(Float64(a * t) / c) * -4.0); elseif (z <= 2.3e+100) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); else tmp = Float64(Float64(t / -0.25) / Float64(c / a)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= -8.8e+142)
tmp = ((a * t) / c) * -4.0;
elseif (z <= 2.3e+100)
tmp = (b + (9.0 * (x * y))) / (z * c);
else
tmp = (t / -0.25) / (c / a);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, -8.8e+142], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 2.3e+100], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(t / -0.25), $MachinePrecision] / N[(c / a), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8.8 \cdot 10^{+142}:\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\mathbf{elif}\;z \leq 2.3 \cdot 10^{+100}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{t}{-0.25}}{\frac{c}{a}}\\
\end{array}
\end{array}
if z < -8.79999999999999947e142Initial program 47.1%
associate-+l-47.1%
*-commutative47.1%
associate-*r*53.2%
*-commutative53.2%
associate-+l-53.2%
Simplified53.2%
Taylor expanded in t around inf 70.6%
if -8.79999999999999947e142 < z < 2.2999999999999999e100Initial program 89.0%
associate-+l-89.0%
*-commutative89.0%
associate-*r*89.7%
*-commutative89.7%
associate-+l-89.7%
Simplified89.7%
Taylor expanded in t around 0 73.2%
+-commutative73.2%
*-commutative73.2%
Simplified73.2%
if 2.2999999999999999e100 < z Initial program 46.5%
associate-+l-46.5%
*-commutative46.5%
associate-*r*46.5%
*-commutative46.5%
associate-+l-46.5%
associate-*l*46.5%
associate-*l*55.1%
*-commutative55.1%
Simplified55.1%
Taylor expanded in b around inf 53.7%
Taylor expanded in z around inf 56.1%
associate-*r/56.1%
associate-*r*56.1%
associate-*l/56.2%
*-commutative56.2%
Simplified56.2%
*-commutative56.2%
clear-num56.2%
un-div-inv56.3%
*-un-lft-identity56.3%
*-commutative56.3%
times-frac56.3%
metadata-eval56.3%
Applied egg-rr56.3%
associate-/r*56.3%
Simplified56.3%
Final simplification69.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -3.3e+73) (not (<= t 1.1e-40))) (* a (/ (* t -4.0) c)) (/ (/ b c) z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -3.3e+73) || !(t <= 1.1e-40)) {
tmp = a * ((t * -4.0) / c);
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((t <= (-3.3d+73)) .or. (.not. (t <= 1.1d-40))) then
tmp = a * ((t * (-4.0d0)) / c)
else
tmp = (b / c) / z
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -3.3e+73) || !(t <= 1.1e-40)) {
tmp = a * ((t * -4.0) / c);
} else {
tmp = (b / c) / z;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -3.3e+73) or not (t <= 1.1e-40): tmp = a * ((t * -4.0) / c) else: tmp = (b / c) / z return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -3.3e+73) || !(t <= 1.1e-40)) tmp = Float64(a * Float64(Float64(t * -4.0) / c)); else tmp = Float64(Float64(b / c) / z); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -3.3e+73) || ~((t <= 1.1e-40)))
tmp = a * ((t * -4.0) / c);
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -3.3e+73], N[Not[LessEqual[t, 1.1e-40]], $MachinePrecision]], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -3.3 \cdot 10^{+73} \lor \neg \left(t \leq 1.1 \cdot 10^{-40}\right):\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if t < -3.3000000000000003e73 or 1.10000000000000004e-40 < t Initial program 68.8%
associate-+l-68.8%
*-commutative68.8%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
Simplified78.2%
Taylor expanded in t around inf 53.0%
*-commutative53.0%
associate-/l*57.3%
associate-*r*57.3%
*-commutative57.3%
*-commutative57.3%
associate-*l/57.3%
Simplified57.3%
if -3.3000000000000003e73 < t < 1.10000000000000004e-40Initial program 82.0%
associate-+l-82.0%
*-commutative82.0%
associate-*r*77.5%
*-commutative77.5%
associate-+l-77.5%
associate-*l*77.5%
associate-*l*82.2%
*-commutative82.2%
Simplified82.2%
Taylor expanded in b around inf 69.9%
times-frac66.0%
Applied egg-rr66.0%
Taylor expanded in b around inf 45.4%
associate-/r*46.4%
Simplified46.4%
Final simplification51.2%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -2.55e+73) (not (<= t 5.8e-39))) (* (/ (* a t) c) -4.0) (/ (/ b c) z)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.55e+73) || !(t <= 5.8e-39)) {
tmp = ((a * t) / c) * -4.0;
} else {
tmp = (b / c) / z;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((t <= (-2.55d+73)) .or. (.not. (t <= 5.8d-39))) then
tmp = ((a * t) / c) * (-4.0d0)
else
tmp = (b / c) / z
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.55e+73) || !(t <= 5.8e-39)) {
tmp = ((a * t) / c) * -4.0;
} else {
tmp = (b / c) / z;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -2.55e+73) or not (t <= 5.8e-39): tmp = ((a * t) / c) * -4.0 else: tmp = (b / c) / z return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -2.55e+73) || !(t <= 5.8e-39)) tmp = Float64(Float64(Float64(a * t) / c) * -4.0); else tmp = Float64(Float64(b / c) / z); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -2.55e+73) || ~((t <= 5.8e-39)))
tmp = ((a * t) / c) * -4.0;
else
tmp = (b / c) / z;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -2.55e+73], N[Not[LessEqual[t, 5.8e-39]], $MachinePrecision]], N[(N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.55 \cdot 10^{+73} \lor \neg \left(t \leq 5.8 \cdot 10^{-39}\right):\\
\;\;\;\;\frac{a \cdot t}{c} \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\end{array}
\end{array}
if t < -2.55000000000000012e73 or 5.79999999999999975e-39 < t Initial program 68.8%
associate-+l-68.8%
*-commutative68.8%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
Simplified78.2%
Taylor expanded in t around inf 53.0%
if -2.55000000000000012e73 < t < 5.79999999999999975e-39Initial program 82.0%
associate-+l-82.0%
*-commutative82.0%
associate-*r*77.5%
*-commutative77.5%
associate-+l-77.5%
associate-*l*77.5%
associate-*l*82.2%
*-commutative82.2%
Simplified82.2%
Taylor expanded in b around inf 69.9%
times-frac66.0%
Applied egg-rr66.0%
Taylor expanded in b around inf 45.4%
associate-/r*46.4%
Simplified46.4%
Final simplification49.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= a -4.3e-128) (/ (/ t -0.25) (/ c a)) (if (<= a 2.9e+85) (* (/ b c) (/ 1.0 z)) (* a (/ (* t -4.0) c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4.3e-128) {
tmp = (t / -0.25) / (c / a);
} else if (a <= 2.9e+85) {
tmp = (b / c) * (1.0 / z);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-4.3d-128)) then
tmp = (t / (-0.25d0)) / (c / a)
else if (a <= 2.9d+85) then
tmp = (b / c) * (1.0d0 / z)
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4.3e-128) {
tmp = (t / -0.25) / (c / a);
} else if (a <= 2.9e+85) {
tmp = (b / c) * (1.0 / z);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -4.3e-128: tmp = (t / -0.25) / (c / a) elif a <= 2.9e+85: tmp = (b / c) * (1.0 / z) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -4.3e-128) tmp = Float64(Float64(t / -0.25) / Float64(c / a)); elseif (a <= 2.9e+85) tmp = Float64(Float64(b / c) * Float64(1.0 / z)); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -4.3e-128)
tmp = (t / -0.25) / (c / a);
elseif (a <= 2.9e+85)
tmp = (b / c) * (1.0 / z);
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -4.3e-128], N[(N[(t / -0.25), $MachinePrecision] / N[(c / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2.9e+85], N[(N[(b / c), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.3 \cdot 10^{-128}:\\
\;\;\;\;\frac{\frac{t}{-0.25}}{\frac{c}{a}}\\
\mathbf{elif}\;a \leq 2.9 \cdot 10^{+85}:\\
\;\;\;\;\frac{b}{c} \cdot \frac{1}{z}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if a < -4.29999999999999994e-128Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
associate-*l*77.9%
associate-*l*78.0%
*-commutative78.0%
Simplified78.0%
Taylor expanded in b around inf 63.8%
Taylor expanded in z around inf 47.0%
associate-*r/47.0%
associate-*r*47.0%
associate-*l/50.1%
*-commutative50.1%
Simplified50.1%
*-commutative50.1%
clear-num50.0%
un-div-inv49.1%
*-un-lft-identity49.1%
*-commutative49.1%
times-frac49.1%
metadata-eval49.1%
Applied egg-rr49.1%
associate-/r*49.1%
Simplified49.1%
if -4.29999999999999994e-128 < a < 2.89999999999999997e85Initial program 72.7%
associate-+l-72.7%
*-commutative72.7%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified79.1%
Taylor expanded in b around inf 42.0%
*-commutative42.0%
Simplified42.0%
clear-num42.0%
inv-pow42.0%
Applied egg-rr42.0%
unpow-142.0%
associate-/l*47.3%
Simplified47.3%
inv-pow47.3%
*-commutative47.3%
unpow-prod-down47.3%
inv-pow47.3%
clear-num47.3%
inv-pow47.3%
Applied egg-rr47.3%
if 2.89999999999999997e85 < a Initial program 80.8%
associate-+l-80.8%
*-commutative80.8%
associate-*r*71.2%
*-commutative71.2%
associate-+l-71.2%
Simplified71.2%
Taylor expanded in t around inf 59.2%
*-commutative59.2%
associate-/l*66.4%
associate-*r*66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l/66.4%
Simplified66.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= a -4e-128) (* t (* -4.0 (/ a c))) (if (<= a 1.8e+86) (* (/ b c) (/ 1.0 z)) (* a (/ (* t -4.0) c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4e-128) {
tmp = t * (-4.0 * (a / c));
} else if (a <= 1.8e+86) {
tmp = (b / c) * (1.0 / z);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-4d-128)) then
tmp = t * ((-4.0d0) * (a / c))
else if (a <= 1.8d+86) then
tmp = (b / c) * (1.0d0 / z)
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4e-128) {
tmp = t * (-4.0 * (a / c));
} else if (a <= 1.8e+86) {
tmp = (b / c) * (1.0 / z);
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -4e-128: tmp = t * (-4.0 * (a / c)) elif a <= 1.8e+86: tmp = (b / c) * (1.0 / z) else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -4e-128) tmp = Float64(t * Float64(-4.0 * Float64(a / c))); elseif (a <= 1.8e+86) tmp = Float64(Float64(b / c) * Float64(1.0 / z)); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -4e-128)
tmp = t * (-4.0 * (a / c));
elseif (a <= 1.8e+86)
tmp = (b / c) * (1.0 / z);
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -4e-128], N[(t * N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.8e+86], N[(N[(b / c), $MachinePrecision] * N[(1.0 / z), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4 \cdot 10^{-128}:\\
\;\;\;\;t \cdot \left(-4 \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;a \leq 1.8 \cdot 10^{+86}:\\
\;\;\;\;\frac{b}{c} \cdot \frac{1}{z}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if a < -4.00000000000000022e-128Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
associate-*l*77.9%
associate-*l*78.0%
*-commutative78.0%
Simplified78.0%
Taylor expanded in b around inf 63.8%
Taylor expanded in z around inf 47.0%
associate-*r/47.0%
associate-*r*47.0%
associate-*l/50.1%
*-commutative50.1%
Simplified50.1%
Taylor expanded in a around 0 50.1%
if -4.00000000000000022e-128 < a < 1.80000000000000003e86Initial program 72.7%
associate-+l-72.7%
*-commutative72.7%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified79.1%
Taylor expanded in b around inf 42.0%
*-commutative42.0%
Simplified42.0%
clear-num42.0%
inv-pow42.0%
Applied egg-rr42.0%
unpow-142.0%
associate-/l*47.3%
Simplified47.3%
inv-pow47.3%
*-commutative47.3%
unpow-prod-down47.3%
inv-pow47.3%
clear-num47.3%
inv-pow47.3%
Applied egg-rr47.3%
if 1.80000000000000003e86 < a Initial program 80.8%
associate-+l-80.8%
*-commutative80.8%
associate-*r*71.2%
*-commutative71.2%
associate-+l-71.2%
Simplified71.2%
Taylor expanded in t around inf 59.2%
*-commutative59.2%
associate-/l*66.4%
associate-*r*66.4%
*-commutative66.4%
*-commutative66.4%
associate-*l/66.4%
Simplified66.4%
Final simplification51.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= a -4.3e-128) (* t (* -4.0 (/ a c))) (if (<= a 9.5e+90) (/ (/ b c) z) (* a (/ (* t -4.0) c)))))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4.3e-128) {
tmp = t * (-4.0 * (a / c));
} else if (a <= 9.5e+90) {
tmp = (b / c) / z;
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-4.3d-128)) then
tmp = t * ((-4.0d0) * (a / c))
else if (a <= 9.5d+90) then
tmp = (b / c) / z
else
tmp = a * ((t * (-4.0d0)) / c)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -4.3e-128) {
tmp = t * (-4.0 * (a / c));
} else if (a <= 9.5e+90) {
tmp = (b / c) / z;
} else {
tmp = a * ((t * -4.0) / c);
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -4.3e-128: tmp = t * (-4.0 * (a / c)) elif a <= 9.5e+90: tmp = (b / c) / z else: tmp = a * ((t * -4.0) / c) return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -4.3e-128) tmp = Float64(t * Float64(-4.0 * Float64(a / c))); elseif (a <= 9.5e+90) tmp = Float64(Float64(b / c) / z); else tmp = Float64(a * Float64(Float64(t * -4.0) / c)); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -4.3e-128)
tmp = t * (-4.0 * (a / c));
elseif (a <= 9.5e+90)
tmp = (b / c) / z;
else
tmp = a * ((t * -4.0) / c);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -4.3e-128], N[(t * N[(-4.0 * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 9.5e+90], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], N[(a * N[(N[(t * -4.0), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -4.3 \cdot 10^{-128}:\\
\;\;\;\;t \cdot \left(-4 \cdot \frac{a}{c}\right)\\
\mathbf{elif}\;a \leq 9.5 \cdot 10^{+90}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;a \cdot \frac{t \cdot -4}{c}\\
\end{array}
\end{array}
if a < -4.29999999999999994e-128Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*77.9%
*-commutative77.9%
associate-+l-77.9%
associate-*l*77.9%
associate-*l*78.0%
*-commutative78.0%
Simplified78.0%
Taylor expanded in b around inf 63.8%
Taylor expanded in z around inf 47.0%
associate-*r/47.0%
associate-*r*47.0%
associate-*l/50.1%
*-commutative50.1%
Simplified50.1%
Taylor expanded in a around 0 50.1%
if -4.29999999999999994e-128 < a < 9.4999999999999994e90Initial program 72.9%
associate-+l-72.9%
*-commutative72.9%
associate-*r*79.2%
*-commutative79.2%
associate-+l-79.2%
associate-*l*79.2%
associate-*l*80.0%
*-commutative80.0%
Simplified80.0%
Taylor expanded in b around inf 64.5%
times-frac61.7%
Applied egg-rr61.7%
Taylor expanded in b around inf 42.5%
associate-/r*47.7%
Simplified47.7%
if 9.4999999999999994e90 < a Initial program 80.3%
associate-+l-80.3%
*-commutative80.3%
associate-*r*70.4%
*-commutative70.4%
associate-+l-70.4%
Simplified70.4%
Taylor expanded in t around inf 58.2%
*-commutative58.2%
associate-/l*65.5%
associate-*r*65.5%
*-commutative65.5%
*-commutative65.5%
associate-*l/65.5%
Simplified65.5%
Final simplification51.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ (/ b c) z))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return (b / c) / z;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = (b / c) / z
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return (b / c) / z;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return (b / c) / z
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(Float64(b / c) / z) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = (b / c) / z;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{\frac{b}{c}}{z}
\end{array}
Initial program 76.1%
associate-+l-76.1%
*-commutative76.1%
associate-*r*77.4%
*-commutative77.4%
associate-+l-77.4%
associate-*l*77.4%
associate-*l*78.9%
*-commutative78.9%
Simplified78.9%
Taylor expanded in b around inf 65.4%
times-frac64.1%
Applied egg-rr64.1%
Taylor expanded in b around inf 36.9%
associate-/r*38.6%
Simplified38.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(x < y && y < z && z < t && t < a && a < b && b < c);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, c]) def code(x, y, z, t, a, b, c): return b / (z * c)
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, c]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 76.1%
associate-+l-76.1%
*-commutative76.1%
associate-*r*77.4%
*-commutative77.4%
associate-+l-77.4%
Simplified78.2%
Taylor expanded in b around inf 36.9%
*-commutative36.9%
Simplified36.9%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t\_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t\_4}{z \cdot c}\\
t_6 := \frac{\left(t\_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t\_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 0:\\
\;\;\;\;\frac{\frac{t\_4}{z}}{c}\\
\mathbf{elif}\;t\_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t\_6\\
\mathbf{elif}\;t\_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t\_1\right) - t\_2\\
\mathbf{elif}\;t\_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t\_1\right) - t\_2\\
\end{array}
\end{array}
herbie shell --seed 2024191
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:alt
(! :herbie-platform default (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) -220031348160821/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 0) (/ (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 365902434742109/31250000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 28768236795461370000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (+ (* (* 9 (/ y c)) (/ x z)) (/ b (* c z))) (* 4 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9) y) (* (* (* z 4) t) a)) b) (* z c)) 138385150424563190000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (+ (- (* (* x 9) y) (* (* z 4) (* t a))) b) (* z c)) (- (+ (* 9 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4 (/ (* a t) c)))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))