
(FPCore (x y z t a b) :precision binary64 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
def code(x, y, z, t, a, b): return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b) :precision binary64 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
real(8) function code(x, y, z, t, a, b)
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
code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
def code(x, y, z, t, a, b): return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b
\end{array}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= (* (* y 9.0) z) 1e-42) (+ (- (* x 2.0) (* (* 9.0 (* y z)) t)) (* b (* a 27.0))) (* y (- (+ (* 2.0 (/ x y)) (* 27.0 (/ (* a b) y))) (* 9.0 (* z t))))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (((y * 9.0) * z) <= 1e-42) {
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0));
} else {
tmp = y * (((2.0 * (x / y)) + (27.0 * ((a * b) / y))) - (9.0 * (z * t)));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (((y * 9.0d0) * z) <= 1d-42) then
tmp = ((x * 2.0d0) - ((9.0d0 * (y * z)) * t)) + (b * (a * 27.0d0))
else
tmp = y * (((2.0d0 * (x / y)) + (27.0d0 * ((a * b) / y))) - (9.0d0 * (z * t)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (((y * 9.0) * z) <= 1e-42) {
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0));
} else {
tmp = y * (((2.0 * (x / y)) + (27.0 * ((a * b) / y))) - (9.0 * (z * t)));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if ((y * 9.0) * z) <= 1e-42: tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0)) else: tmp = y * (((2.0 * (x / y)) + (27.0 * ((a * b) / y))) - (9.0 * (z * t))) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (Float64(Float64(y * 9.0) * z) <= 1e-42) tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(9.0 * Float64(y * z)) * t)) + Float64(b * Float64(a * 27.0))); else tmp = Float64(y * Float64(Float64(Float64(2.0 * Float64(x / y)) + Float64(27.0 * Float64(Float64(a * b) / y))) - Float64(9.0 * Float64(z * t)))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (((y * 9.0) * z) <= 1e-42)
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0));
else
tmp = y * (((2.0 * (x / y)) + (27.0 * ((a * b) / y))) - (9.0 * (z * t)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision], 1e-42], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(9.0 * N[(y * z), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(N[(N[(2.0 * N[(x / y), $MachinePrecision]), $MachinePrecision] + N[(27.0 * N[(N[(a * b), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(y \cdot 9\right) \cdot z \leq 10^{-42}:\\
\;\;\;\;\left(x \cdot 2 - \left(9 \cdot \left(y \cdot z\right)\right) \cdot t\right) + b \cdot \left(a \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(\left(2 \cdot \frac{x}{y} + 27 \cdot \frac{a \cdot b}{y}\right) - 9 \cdot \left(z \cdot t\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 1.00000000000000004e-42Initial program 95.2%
Taylor expanded in y around 0 95.2%
if 1.00000000000000004e-42 < (*.f64 (*.f64 y #s(literal 9 binary64)) z) Initial program 87.6%
associate-+l-87.6%
*-commutative87.6%
*-commutative87.6%
associate-*l*87.6%
associate-+l-87.6%
associate-*l*87.6%
*-commutative87.6%
*-commutative87.6%
associate-*l*88.8%
associate-*l*90.2%
Simplified90.2%
Taylor expanded in y around inf 86.2%
Final simplification92.8%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (* a 27.0))))
(if (<= (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) t_1) 1e+308)
(+ (- (* x 2.0) (* (* 9.0 (* y z)) t)) t_1)
(* y (- (* 27.0 (/ (* a b) y)) (* 9.0 (* z t)))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double tmp;
if ((((x * 2.0) - (((y * 9.0) * z) * t)) + t_1) <= 1e+308) {
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + t_1;
} else {
tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t)));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = b * (a * 27.0d0)
if ((((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + t_1) <= 1d+308) then
tmp = ((x * 2.0d0) - ((9.0d0 * (y * z)) * t)) + t_1
else
tmp = y * ((27.0d0 * ((a * b) / y)) - (9.0d0 * (z * t)))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double tmp;
if ((((x * 2.0) - (((y * 9.0) * z) * t)) + t_1) <= 1e+308) {
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + t_1;
} else {
tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t)));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = b * (a * 27.0) tmp = 0 if (((x * 2.0) - (((y * 9.0) * z) * t)) + t_1) <= 1e+308: tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + t_1 else: tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t))) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a * 27.0)) tmp = 0.0 if (Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + t_1) <= 1e+308) tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(9.0 * Float64(y * z)) * t)) + t_1); else tmp = Float64(y * Float64(Float64(27.0 * Float64(Float64(a * b) / y)) - Float64(9.0 * Float64(z * t)))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = b * (a * 27.0);
tmp = 0.0;
if ((((x * 2.0) - (((y * 9.0) * z) * t)) + t_1) <= 1e+308)
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + t_1;
else
tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], 1e+308], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(9.0 * N[(y * z), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(y * N[(N[(27.0 * N[(N[(a * b), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := b \cdot \left(a \cdot 27\right)\\
\mathbf{if}\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + t\_1 \leq 10^{+308}:\\
\;\;\;\;\left(x \cdot 2 - \left(9 \cdot \left(y \cdot z\right)\right) \cdot t\right) + t\_1\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(27 \cdot \frac{a \cdot b}{y} - 9 \cdot \left(z \cdot t\right)\right)\\
\end{array}
\end{array}
if (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) < 1e308Initial program 97.5%
Taylor expanded in y around 0 97.5%
if 1e308 < (+.f64 (-.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t)) (*.f64 (*.f64 a #s(literal 27 binary64)) b)) Initial program 73.7%
associate-+l-73.7%
*-commutative73.7%
*-commutative73.7%
associate-*l*73.7%
associate-+l-73.7%
associate-*l*73.7%
*-commutative73.7%
*-commutative73.7%
associate-*l*89.3%
associate-*l*93.5%
Simplified93.5%
Taylor expanded in y around inf 95.6%
Taylor expanded in x around 0 91.7%
Final simplification96.4%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= (* (* y 9.0) z) 2e+168) (+ (- (* x 2.0) (* (* 9.0 (* y z)) t)) (* b (* a 27.0))) (* y (+ (* 27.0 (* a (/ b y))) (- (/ 2.0 (/ y x)) (* z (* 9.0 t)))))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (((y * 9.0) * z) <= 2e+168) {
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0));
} else {
tmp = y * ((27.0 * (a * (b / y))) + ((2.0 / (y / x)) - (z * (9.0 * t))));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (((y * 9.0d0) * z) <= 2d+168) then
tmp = ((x * 2.0d0) - ((9.0d0 * (y * z)) * t)) + (b * (a * 27.0d0))
else
tmp = y * ((27.0d0 * (a * (b / y))) + ((2.0d0 / (y / x)) - (z * (9.0d0 * t))))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (((y * 9.0) * z) <= 2e+168) {
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0));
} else {
tmp = y * ((27.0 * (a * (b / y))) + ((2.0 / (y / x)) - (z * (9.0 * t))));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if ((y * 9.0) * z) <= 2e+168: tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0)) else: tmp = y * ((27.0 * (a * (b / y))) + ((2.0 / (y / x)) - (z * (9.0 * t)))) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (Float64(Float64(y * 9.0) * z) <= 2e+168) tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(9.0 * Float64(y * z)) * t)) + Float64(b * Float64(a * 27.0))); else tmp = Float64(y * Float64(Float64(27.0 * Float64(a * Float64(b / y))) + Float64(Float64(2.0 / Float64(y / x)) - Float64(z * Float64(9.0 * t))))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (((y * 9.0) * z) <= 2e+168)
tmp = ((x * 2.0) - ((9.0 * (y * z)) * t)) + (b * (a * 27.0));
else
tmp = y * ((27.0 * (a * (b / y))) + ((2.0 / (y / x)) - (z * (9.0 * t))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision], 2e+168], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(9.0 * N[(y * z), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(N[(27.0 * N[(a * N[(b / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(2.0 / N[(y / x), $MachinePrecision]), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(y \cdot 9\right) \cdot z \leq 2 \cdot 10^{+168}:\\
\;\;\;\;\left(x \cdot 2 - \left(9 \cdot \left(y \cdot z\right)\right) \cdot t\right) + b \cdot \left(a \cdot 27\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(27 \cdot \left(a \cdot \frac{b}{y}\right) + \left(\frac{2}{\frac{y}{x}} - z \cdot \left(9 \cdot t\right)\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 1.9999999999999999e168Initial program 96.0%
Taylor expanded in y around 0 96.0%
if 1.9999999999999999e168 < (*.f64 (*.f64 y #s(literal 9 binary64)) z) Initial program 73.9%
associate-+l-73.9%
*-commutative73.9%
*-commutative73.9%
associate-*l*73.9%
associate-+l-73.9%
associate-*l*73.9%
*-commutative73.9%
*-commutative73.9%
associate-*l*91.0%
associate-*l*94.1%
Simplified94.1%
Taylor expanded in y around inf 97.0%
+-commutative97.0%
associate--l+97.0%
associate-/l*96.9%
clear-num96.9%
un-div-inv96.9%
associate-*r*96.9%
Applied egg-rr96.9%
Final simplification96.1%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (+ (* x 2.0) (* 27.0 (* a b)))) (t_2 (* y (* (* z t) -9.0))))
(if (<= z -1.15e+31)
t_2
(if (<= z 8.2e-106)
t_1
(if (<= z 2.16e-16)
t_2
(if (<= z 4.4e+98) t_1 (* (* (* y z) t) -9.0)))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (x * 2.0) + (27.0 * (a * b));
double t_2 = y * ((z * t) * -9.0);
double tmp;
if (z <= -1.15e+31) {
tmp = t_2;
} else if (z <= 8.2e-106) {
tmp = t_1;
} else if (z <= 2.16e-16) {
tmp = t_2;
} else if (z <= 4.4e+98) {
tmp = t_1;
} else {
tmp = ((y * z) * t) * -9.0;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (x * 2.0d0) + (27.0d0 * (a * b))
t_2 = y * ((z * t) * (-9.0d0))
if (z <= (-1.15d+31)) then
tmp = t_2
else if (z <= 8.2d-106) then
tmp = t_1
else if (z <= 2.16d-16) then
tmp = t_2
else if (z <= 4.4d+98) then
tmp = t_1
else
tmp = ((y * z) * t) * (-9.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (x * 2.0) + (27.0 * (a * b));
double t_2 = y * ((z * t) * -9.0);
double tmp;
if (z <= -1.15e+31) {
tmp = t_2;
} else if (z <= 8.2e-106) {
tmp = t_1;
} else if (z <= 2.16e-16) {
tmp = t_2;
} else if (z <= 4.4e+98) {
tmp = t_1;
} else {
tmp = ((y * z) * t) * -9.0;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (x * 2.0) + (27.0 * (a * b)) t_2 = y * ((z * t) * -9.0) tmp = 0 if z <= -1.15e+31: tmp = t_2 elif z <= 8.2e-106: tmp = t_1 elif z <= 2.16e-16: tmp = t_2 elif z <= 4.4e+98: tmp = t_1 else: tmp = ((y * z) * t) * -9.0 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b))) t_2 = Float64(y * Float64(Float64(z * t) * -9.0)) tmp = 0.0 if (z <= -1.15e+31) tmp = t_2; elseif (z <= 8.2e-106) tmp = t_1; elseif (z <= 2.16e-16) tmp = t_2; elseif (z <= 4.4e+98) tmp = t_1; else tmp = Float64(Float64(Float64(y * z) * t) * -9.0); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (x * 2.0) + (27.0 * (a * b));
t_2 = y * ((z * t) * -9.0);
tmp = 0.0;
if (z <= -1.15e+31)
tmp = t_2;
elseif (z <= 8.2e-106)
tmp = t_1;
elseif (z <= 2.16e-16)
tmp = t_2;
elseif (z <= 4.4e+98)
tmp = t_1;
else
tmp = ((y * z) * t) * -9.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(N[(z * t), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.15e+31], t$95$2, If[LessEqual[z, 8.2e-106], t$95$1, If[LessEqual[z, 2.16e-16], t$95$2, If[LessEqual[z, 4.4e+98], t$95$1, N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\
t_2 := y \cdot \left(\left(z \cdot t\right) \cdot -9\right)\\
\mathbf{if}\;z \leq -1.15 \cdot 10^{+31}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 8.2 \cdot 10^{-106}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.16 \cdot 10^{-16}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 4.4 \cdot 10^{+98}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(y \cdot z\right) \cdot t\right) \cdot -9\\
\end{array}
\end{array}
if z < -1.15e31 or 8.1999999999999998e-106 < z < 2.1600000000000001e-16Initial program 92.3%
associate-+l-92.3%
*-commutative92.3%
*-commutative92.3%
associate-*l*92.3%
associate-+l-92.3%
associate-*l*92.3%
*-commutative92.3%
*-commutative92.3%
associate-*l*88.6%
associate-*l*88.6%
Simplified88.6%
Taylor expanded in y around inf 78.8%
Taylor expanded in y around inf 48.4%
if -1.15e31 < z < 8.1999999999999998e-106 or 2.1600000000000001e-16 < z < 4.40000000000000017e98Initial program 97.1%
+-commutative97.1%
associate-+r-97.1%
*-commutative97.1%
cancel-sign-sub-inv97.1%
associate-*r*94.4%
distribute-lft-neg-in94.4%
*-commutative94.4%
cancel-sign-sub-inv94.4%
associate-+r-94.4%
associate-*l*95.1%
fma-define95.1%
cancel-sign-sub-inv95.1%
fma-define95.1%
*-commutative95.1%
distribute-rgt-neg-in95.1%
distribute-lft-neg-out95.1%
associate-*r*97.8%
associate-*l*97.8%
Simplified97.8%
Taylor expanded in t around 0 83.1%
if 4.40000000000000017e98 < z Initial program 80.3%
+-commutative80.3%
associate-+r-80.3%
*-commutative80.3%
cancel-sign-sub-inv80.3%
associate-*r*97.3%
distribute-lft-neg-in97.3%
*-commutative97.3%
cancel-sign-sub-inv97.3%
associate-+r-97.3%
associate-*l*99.9%
fma-define99.9%
cancel-sign-sub-inv99.9%
fma-define99.9%
*-commutative99.9%
distribute-rgt-neg-in99.9%
distribute-lft-neg-out99.9%
associate-*r*82.8%
associate-*l*82.9%
Simplified82.9%
Taylor expanded in t around inf 47.7%
Final simplification67.4%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (* a 27.0))))
(if (<= z -4.8e-23)
(* y (* (* z t) -9.0))
(if (<= z 6.8e-193)
t_1
(if (<= z 7.5e-135)
(* x 2.0)
(if (<= z 2.6e-106) t_1 (* (* (* y z) t) -9.0)))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double tmp;
if (z <= -4.8e-23) {
tmp = y * ((z * t) * -9.0);
} else if (z <= 6.8e-193) {
tmp = t_1;
} else if (z <= 7.5e-135) {
tmp = x * 2.0;
} else if (z <= 2.6e-106) {
tmp = t_1;
} else {
tmp = ((y * z) * t) * -9.0;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = b * (a * 27.0d0)
if (z <= (-4.8d-23)) then
tmp = y * ((z * t) * (-9.0d0))
else if (z <= 6.8d-193) then
tmp = t_1
else if (z <= 7.5d-135) then
tmp = x * 2.0d0
else if (z <= 2.6d-106) then
tmp = t_1
else
tmp = ((y * z) * t) * (-9.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double tmp;
if (z <= -4.8e-23) {
tmp = y * ((z * t) * -9.0);
} else if (z <= 6.8e-193) {
tmp = t_1;
} else if (z <= 7.5e-135) {
tmp = x * 2.0;
} else if (z <= 2.6e-106) {
tmp = t_1;
} else {
tmp = ((y * z) * t) * -9.0;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = b * (a * 27.0) tmp = 0 if z <= -4.8e-23: tmp = y * ((z * t) * -9.0) elif z <= 6.8e-193: tmp = t_1 elif z <= 7.5e-135: tmp = x * 2.0 elif z <= 2.6e-106: tmp = t_1 else: tmp = ((y * z) * t) * -9.0 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a * 27.0)) tmp = 0.0 if (z <= -4.8e-23) tmp = Float64(y * Float64(Float64(z * t) * -9.0)); elseif (z <= 6.8e-193) tmp = t_1; elseif (z <= 7.5e-135) tmp = Float64(x * 2.0); elseif (z <= 2.6e-106) tmp = t_1; else tmp = Float64(Float64(Float64(y * z) * t) * -9.0); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = b * (a * 27.0);
tmp = 0.0;
if (z <= -4.8e-23)
tmp = y * ((z * t) * -9.0);
elseif (z <= 6.8e-193)
tmp = t_1;
elseif (z <= 7.5e-135)
tmp = x * 2.0;
elseif (z <= 2.6e-106)
tmp = t_1;
else
tmp = ((y * z) * t) * -9.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.8e-23], N[(y * N[(N[(z * t), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.8e-193], t$95$1, If[LessEqual[z, 7.5e-135], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 2.6e-106], t$95$1, N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := b \cdot \left(a \cdot 27\right)\\
\mathbf{if}\;z \leq -4.8 \cdot 10^{-23}:\\
\;\;\;\;y \cdot \left(\left(z \cdot t\right) \cdot -9\right)\\
\mathbf{elif}\;z \leq 6.8 \cdot 10^{-193}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 7.5 \cdot 10^{-135}:\\
\;\;\;\;x \cdot 2\\
\mathbf{elif}\;z \leq 2.6 \cdot 10^{-106}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(y \cdot z\right) \cdot t\right) \cdot -9\\
\end{array}
\end{array}
if z < -4.79999999999999993e-23Initial program 91.9%
associate-+l-91.9%
*-commutative91.9%
*-commutative91.9%
associate-*l*91.9%
associate-+l-91.9%
associate-*l*91.9%
*-commutative91.9%
*-commutative91.9%
associate-*l*87.9%
associate-*l*87.9%
Simplified87.9%
Taylor expanded in y around inf 77.5%
Taylor expanded in y around inf 52.2%
if -4.79999999999999993e-23 < z < 6.8000000000000004e-193 or 7.5e-135 < z < 2.6000000000000001e-106Initial program 96.3%
+-commutative96.3%
associate-+r-96.3%
*-commutative96.3%
cancel-sign-sub-inv96.3%
associate-*r*90.5%
distribute-lft-neg-in90.5%
*-commutative90.5%
cancel-sign-sub-inv90.5%
associate-+r-90.5%
associate-*l*91.6%
fma-define91.6%
cancel-sign-sub-inv91.6%
fma-define91.6%
*-commutative91.6%
distribute-rgt-neg-in91.6%
distribute-lft-neg-out91.6%
associate-*r*97.4%
associate-*l*97.4%
Simplified97.4%
Taylor expanded in t around 0 89.2%
Taylor expanded in x around 0 56.1%
associate-*r*55.1%
*-commutative55.1%
Simplified55.1%
if 6.8000000000000004e-193 < z < 7.5e-135Initial program 99.7%
+-commutative99.7%
associate-+r-99.7%
*-commutative99.7%
cancel-sign-sub-inv99.7%
associate-*r*99.6%
distribute-lft-neg-in99.6%
*-commutative99.6%
cancel-sign-sub-inv99.6%
associate-+r-99.6%
associate-*l*99.8%
fma-define99.8%
cancel-sign-sub-inv99.8%
fma-define99.8%
*-commutative99.8%
distribute-rgt-neg-in99.8%
distribute-lft-neg-out99.8%
associate-*r*99.9%
associate-*l*99.9%
Simplified99.9%
Taylor expanded in t around 0 94.2%
Taylor expanded in x around inf 62.9%
if 2.6000000000000001e-106 < z Initial program 89.9%
+-commutative89.9%
associate-+r-89.9%
*-commutative89.9%
cancel-sign-sub-inv89.9%
associate-*r*97.6%
distribute-lft-neg-in97.6%
*-commutative97.6%
cancel-sign-sub-inv97.6%
associate-+r-97.6%
associate-*l*98.8%
fma-define98.8%
cancel-sign-sub-inv98.8%
fma-define98.8%
*-commutative98.8%
distribute-rgt-neg-in98.8%
distribute-lft-neg-out98.8%
associate-*r*91.0%
associate-*l*91.1%
Simplified91.1%
Taylor expanded in t around inf 39.3%
Final simplification49.5%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (* a 27.0))))
(if (<= z -1e-20)
(* -9.0 (* y (* z t)))
(if (<= z 9e-192)
t_1
(if (<= z 1.45e-135)
(* x 2.0)
(if (<= z 6.6e-107) t_1 (* (* (* y z) t) -9.0)))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double tmp;
if (z <= -1e-20) {
tmp = -9.0 * (y * (z * t));
} else if (z <= 9e-192) {
tmp = t_1;
} else if (z <= 1.45e-135) {
tmp = x * 2.0;
} else if (z <= 6.6e-107) {
tmp = t_1;
} else {
tmp = ((y * z) * t) * -9.0;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: tmp
t_1 = b * (a * 27.0d0)
if (z <= (-1d-20)) then
tmp = (-9.0d0) * (y * (z * t))
else if (z <= 9d-192) then
tmp = t_1
else if (z <= 1.45d-135) then
tmp = x * 2.0d0
else if (z <= 6.6d-107) then
tmp = t_1
else
tmp = ((y * z) * t) * (-9.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double tmp;
if (z <= -1e-20) {
tmp = -9.0 * (y * (z * t));
} else if (z <= 9e-192) {
tmp = t_1;
} else if (z <= 1.45e-135) {
tmp = x * 2.0;
} else if (z <= 6.6e-107) {
tmp = t_1;
} else {
tmp = ((y * z) * t) * -9.0;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = b * (a * 27.0) tmp = 0 if z <= -1e-20: tmp = -9.0 * (y * (z * t)) elif z <= 9e-192: tmp = t_1 elif z <= 1.45e-135: tmp = x * 2.0 elif z <= 6.6e-107: tmp = t_1 else: tmp = ((y * z) * t) * -9.0 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a * 27.0)) tmp = 0.0 if (z <= -1e-20) tmp = Float64(-9.0 * Float64(y * Float64(z * t))); elseif (z <= 9e-192) tmp = t_1; elseif (z <= 1.45e-135) tmp = Float64(x * 2.0); elseif (z <= 6.6e-107) tmp = t_1; else tmp = Float64(Float64(Float64(y * z) * t) * -9.0); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = b * (a * 27.0);
tmp = 0.0;
if (z <= -1e-20)
tmp = -9.0 * (y * (z * t));
elseif (z <= 9e-192)
tmp = t_1;
elseif (z <= 1.45e-135)
tmp = x * 2.0;
elseif (z <= 6.6e-107)
tmp = t_1;
else
tmp = ((y * z) * t) * -9.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1e-20], N[(-9.0 * N[(y * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9e-192], t$95$1, If[LessEqual[z, 1.45e-135], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 6.6e-107], t$95$1, N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := b \cdot \left(a \cdot 27\right)\\
\mathbf{if}\;z \leq -1 \cdot 10^{-20}:\\
\;\;\;\;-9 \cdot \left(y \cdot \left(z \cdot t\right)\right)\\
\mathbf{elif}\;z \leq 9 \cdot 10^{-192}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.45 \cdot 10^{-135}:\\
\;\;\;\;x \cdot 2\\
\mathbf{elif}\;z \leq 6.6 \cdot 10^{-107}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(y \cdot z\right) \cdot t\right) \cdot -9\\
\end{array}
\end{array}
if z < -9.99999999999999945e-21Initial program 91.9%
+-commutative91.9%
associate-+r-91.9%
*-commutative91.9%
cancel-sign-sub-inv91.9%
associate-*r*98.3%
distribute-lft-neg-in98.3%
*-commutative98.3%
cancel-sign-sub-inv98.3%
associate-+r-98.3%
associate-*l*98.4%
fma-define98.4%
cancel-sign-sub-inv98.4%
fma-define98.4%
*-commutative98.4%
distribute-rgt-neg-in98.4%
distribute-lft-neg-out98.4%
associate-*r*92.0%
associate-*l*91.9%
Simplified91.9%
Taylor expanded in t around inf 56.1%
*-commutative56.1%
associate-*r*56.1%
associate-*l*56.1%
Simplified56.1%
Taylor expanded in t around 0 56.1%
*-commutative56.1%
associate-*l*52.2%
*-commutative52.2%
Simplified52.2%
if -9.99999999999999945e-21 < z < 9.00000000000000048e-192 or 1.4500000000000001e-135 < z < 6.60000000000000007e-107Initial program 96.3%
+-commutative96.3%
associate-+r-96.3%
*-commutative96.3%
cancel-sign-sub-inv96.3%
associate-*r*90.5%
distribute-lft-neg-in90.5%
*-commutative90.5%
cancel-sign-sub-inv90.5%
associate-+r-90.5%
associate-*l*91.6%
fma-define91.6%
cancel-sign-sub-inv91.6%
fma-define91.6%
*-commutative91.6%
distribute-rgt-neg-in91.6%
distribute-lft-neg-out91.6%
associate-*r*97.4%
associate-*l*97.4%
Simplified97.4%
Taylor expanded in t around 0 89.2%
Taylor expanded in x around 0 56.1%
associate-*r*55.1%
*-commutative55.1%
Simplified55.1%
if 9.00000000000000048e-192 < z < 1.4500000000000001e-135Initial program 99.7%
+-commutative99.7%
associate-+r-99.7%
*-commutative99.7%
cancel-sign-sub-inv99.7%
associate-*r*99.6%
distribute-lft-neg-in99.6%
*-commutative99.6%
cancel-sign-sub-inv99.6%
associate-+r-99.6%
associate-*l*99.8%
fma-define99.8%
cancel-sign-sub-inv99.8%
fma-define99.8%
*-commutative99.8%
distribute-rgt-neg-in99.8%
distribute-lft-neg-out99.8%
associate-*r*99.9%
associate-*l*99.9%
Simplified99.9%
Taylor expanded in t around 0 94.2%
Taylor expanded in x around inf 62.9%
if 6.60000000000000007e-107 < z Initial program 89.9%
+-commutative89.9%
associate-+r-89.9%
*-commutative89.9%
cancel-sign-sub-inv89.9%
associate-*r*97.6%
distribute-lft-neg-in97.6%
*-commutative97.6%
cancel-sign-sub-inv97.6%
associate-+r-97.6%
associate-*l*98.8%
fma-define98.8%
cancel-sign-sub-inv98.8%
fma-define98.8%
*-commutative98.8%
distribute-rgt-neg-in98.8%
distribute-lft-neg-out98.8%
associate-*r*91.0%
associate-*l*91.1%
Simplified91.1%
Taylor expanded in t around inf 39.3%
Final simplification49.4%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* b (* a 27.0))) (t_2 (* (* (* y z) t) -9.0)))
(if (<= z -1.05e-22)
t_2
(if (<= z 3.4e-197)
t_1
(if (<= z 1.8e-135) (* x 2.0) (if (<= z 1.3e-106) t_1 t_2))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double t_2 = ((y * z) * t) * -9.0;
double tmp;
if (z <= -1.05e-22) {
tmp = t_2;
} else if (z <= 3.4e-197) {
tmp = t_1;
} else if (z <= 1.8e-135) {
tmp = x * 2.0;
} else if (z <= 1.3e-106) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = b * (a * 27.0d0)
t_2 = ((y * z) * t) * (-9.0d0)
if (z <= (-1.05d-22)) then
tmp = t_2
else if (z <= 3.4d-197) then
tmp = t_1
else if (z <= 1.8d-135) then
tmp = x * 2.0d0
else if (z <= 1.3d-106) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = b * (a * 27.0);
double t_2 = ((y * z) * t) * -9.0;
double tmp;
if (z <= -1.05e-22) {
tmp = t_2;
} else if (z <= 3.4e-197) {
tmp = t_1;
} else if (z <= 1.8e-135) {
tmp = x * 2.0;
} else if (z <= 1.3e-106) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = b * (a * 27.0) t_2 = ((y * z) * t) * -9.0 tmp = 0 if z <= -1.05e-22: tmp = t_2 elif z <= 3.4e-197: tmp = t_1 elif z <= 1.8e-135: tmp = x * 2.0 elif z <= 1.3e-106: tmp = t_1 else: tmp = t_2 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(b * Float64(a * 27.0)) t_2 = Float64(Float64(Float64(y * z) * t) * -9.0) tmp = 0.0 if (z <= -1.05e-22) tmp = t_2; elseif (z <= 3.4e-197) tmp = t_1; elseif (z <= 1.8e-135) tmp = Float64(x * 2.0); elseif (z <= 1.3e-106) tmp = t_1; else tmp = t_2; end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = b * (a * 27.0);
t_2 = ((y * z) * t) * -9.0;
tmp = 0.0;
if (z <= -1.05e-22)
tmp = t_2;
elseif (z <= 3.4e-197)
tmp = t_1;
elseif (z <= 1.8e-135)
tmp = x * 2.0;
elseif (z <= 1.3e-106)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]}, If[LessEqual[z, -1.05e-22], t$95$2, If[LessEqual[z, 3.4e-197], t$95$1, If[LessEqual[z, 1.8e-135], N[(x * 2.0), $MachinePrecision], If[LessEqual[z, 1.3e-106], t$95$1, t$95$2]]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := b \cdot \left(a \cdot 27\right)\\
t_2 := \left(\left(y \cdot z\right) \cdot t\right) \cdot -9\\
\mathbf{if}\;z \leq -1.05 \cdot 10^{-22}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;z \leq 3.4 \cdot 10^{-197}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 1.8 \cdot 10^{-135}:\\
\;\;\;\;x \cdot 2\\
\mathbf{elif}\;z \leq 1.3 \cdot 10^{-106}:\\
\;\;\;\;t\_1\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if z < -1.05000000000000004e-22 or 1.3e-106 < z Initial program 90.8%
+-commutative90.8%
associate-+r-90.8%
*-commutative90.8%
cancel-sign-sub-inv90.8%
associate-*r*97.9%
distribute-lft-neg-in97.9%
*-commutative97.9%
cancel-sign-sub-inv97.9%
associate-+r-97.9%
associate-*l*98.6%
fma-define98.6%
cancel-sign-sub-inv98.6%
fma-define98.6%
*-commutative98.6%
distribute-rgt-neg-in98.6%
distribute-lft-neg-out98.6%
associate-*r*91.5%
associate-*l*91.5%
Simplified91.5%
Taylor expanded in t around inf 46.9%
if -1.05000000000000004e-22 < z < 3.3999999999999998e-197 or 1.79999999999999989e-135 < z < 1.3e-106Initial program 96.2%
+-commutative96.2%
associate-+r-96.2%
*-commutative96.2%
cancel-sign-sub-inv96.2%
associate-*r*90.4%
distribute-lft-neg-in90.4%
*-commutative90.4%
cancel-sign-sub-inv90.4%
associate-+r-90.4%
associate-*l*91.5%
fma-define91.5%
cancel-sign-sub-inv91.5%
fma-define91.5%
*-commutative91.5%
distribute-rgt-neg-in91.5%
distribute-lft-neg-out91.5%
associate-*r*97.4%
associate-*l*97.4%
Simplified97.4%
Taylor expanded in t around 0 89.0%
Taylor expanded in x around 0 56.8%
associate-*r*55.7%
*-commutative55.7%
Simplified55.7%
if 3.3999999999999998e-197 < z < 1.79999999999999989e-135Initial program 99.7%
+-commutative99.7%
associate-+r-99.7%
*-commutative99.7%
cancel-sign-sub-inv99.7%
associate-*r*99.6%
distribute-lft-neg-in99.6%
*-commutative99.6%
cancel-sign-sub-inv99.6%
associate-+r-99.6%
associate-*l*99.8%
fma-define99.8%
cancel-sign-sub-inv99.8%
fma-define99.8%
*-commutative99.8%
distribute-rgt-neg-in99.8%
distribute-lft-neg-out99.8%
associate-*r*99.9%
associate-*l*99.9%
Simplified99.9%
Taylor expanded in t around 0 94.5%
Taylor expanded in x around inf 65.1%
Final simplification50.9%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (or (<= z -9.6e-45) (not (<= z 6.9e-106))) (- (* x 2.0) (* 9.0 (* (* y z) t))) (+ (* x 2.0) (* 27.0 (* a b)))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((z <= -9.6e-45) || !(z <= 6.9e-106)) {
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
} else {
tmp = (x * 2.0) + (27.0 * (a * b));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if ((z <= (-9.6d-45)) .or. (.not. (z <= 6.9d-106))) then
tmp = (x * 2.0d0) - (9.0d0 * ((y * z) * t))
else
tmp = (x * 2.0d0) + (27.0d0 * (a * b))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((z <= -9.6e-45) || !(z <= 6.9e-106)) {
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
} else {
tmp = (x * 2.0) + (27.0 * (a * b));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if (z <= -9.6e-45) or not (z <= 6.9e-106): tmp = (x * 2.0) - (9.0 * ((y * z) * t)) else: tmp = (x * 2.0) + (27.0 * (a * b)) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if ((z <= -9.6e-45) || !(z <= 6.9e-106)) tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(Float64(y * z) * t))); else tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if ((z <= -9.6e-45) || ~((z <= 6.9e-106)))
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
else
tmp = (x * 2.0) + (27.0 * (a * b));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[z, -9.6e-45], N[Not[LessEqual[z, 6.9e-106]], $MachinePrecision]], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -9.6 \cdot 10^{-45} \lor \neg \left(z \leq 6.9 \cdot 10^{-106}\right):\\
\;\;\;\;x \cdot 2 - 9 \cdot \left(\left(y \cdot z\right) \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\
\end{array}
\end{array}
if z < -9.5999999999999996e-45 or 6.9000000000000003e-106 < z Initial program 90.9%
associate-+l-90.9%
*-commutative90.9%
*-commutative90.9%
associate-*l*91.0%
associate-+l-91.0%
associate-*l*90.9%
*-commutative90.9%
*-commutative90.9%
associate-*l*90.8%
associate-*l*91.4%
Simplified91.4%
Taylor expanded in a around 0 67.4%
if -9.5999999999999996e-45 < z < 6.9000000000000003e-106Initial program 96.8%
+-commutative96.8%
associate-+r-96.8%
*-commutative96.8%
cancel-sign-sub-inv96.8%
associate-*r*91.8%
distribute-lft-neg-in91.8%
*-commutative91.8%
cancel-sign-sub-inv91.8%
associate-+r-91.8%
associate-*l*92.8%
fma-define92.8%
cancel-sign-sub-inv92.8%
fma-define92.8%
*-commutative92.8%
distribute-rgt-neg-in92.8%
distribute-lft-neg-out92.8%
associate-*r*97.8%
associate-*l*97.8%
Simplified97.8%
Taylor expanded in t around 0 89.8%
Final simplification75.8%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(if (<= z -3.45e-125)
(* y (- (* 27.0 (/ (* a b) y)) (* 9.0 (* z t))))
(if (<= z 6.9e-106)
(+ (* x 2.0) (* 27.0 (* a b)))
(- (* x 2.0) (* 9.0 (* (* y z) t))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -3.45e-125) {
tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t)));
} else if (z <= 6.9e-106) {
tmp = (x * 2.0) + (27.0 * (a * b));
} else {
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (z <= (-3.45d-125)) then
tmp = y * ((27.0d0 * ((a * b) / y)) - (9.0d0 * (z * t)))
else if (z <= 6.9d-106) then
tmp = (x * 2.0d0) + (27.0d0 * (a * b))
else
tmp = (x * 2.0d0) - (9.0d0 * ((y * z) * t))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -3.45e-125) {
tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t)));
} else if (z <= 6.9e-106) {
tmp = (x * 2.0) + (27.0 * (a * b));
} else {
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if z <= -3.45e-125: tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t))) elif z <= 6.9e-106: tmp = (x * 2.0) + (27.0 * (a * b)) else: tmp = (x * 2.0) - (9.0 * ((y * z) * t)) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= -3.45e-125) tmp = Float64(y * Float64(Float64(27.0 * Float64(Float64(a * b) / y)) - Float64(9.0 * Float64(z * t)))); elseif (z <= 6.9e-106) tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b))); else tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(Float64(y * z) * t))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (z <= -3.45e-125)
tmp = y * ((27.0 * ((a * b) / y)) - (9.0 * (z * t)));
elseif (z <= 6.9e-106)
tmp = (x * 2.0) + (27.0 * (a * b));
else
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -3.45e-125], N[(y * N[(N[(27.0 * N[(N[(a * b), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.9e-106], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.45 \cdot 10^{-125}:\\
\;\;\;\;y \cdot \left(27 \cdot \frac{a \cdot b}{y} - 9 \cdot \left(z \cdot t\right)\right)\\
\mathbf{elif}\;z \leq 6.9 \cdot 10^{-106}:\\
\;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot 2 - 9 \cdot \left(\left(y \cdot z\right) \cdot t\right)\\
\end{array}
\end{array}
if z < -3.44999999999999986e-125Initial program 91.9%
associate-+l-91.9%
*-commutative91.9%
*-commutative91.9%
associate-*l*91.9%
associate-+l-91.9%
associate-*l*91.9%
*-commutative91.9%
*-commutative91.9%
associate-*l*88.6%
associate-*l*88.6%
Simplified88.6%
Taylor expanded in y around inf 79.8%
Taylor expanded in x around 0 65.1%
if -3.44999999999999986e-125 < z < 6.9000000000000003e-106Initial program 97.6%
+-commutative97.6%
associate-+r-97.6%
*-commutative97.6%
cancel-sign-sub-inv97.6%
associate-*r*93.1%
distribute-lft-neg-in93.1%
*-commutative93.1%
cancel-sign-sub-inv93.1%
associate-+r-93.1%
associate-*l*94.3%
fma-define94.3%
cancel-sign-sub-inv94.3%
fma-define94.3%
*-commutative94.3%
distribute-rgt-neg-in94.3%
distribute-lft-neg-out94.3%
associate-*r*98.7%
associate-*l*98.7%
Simplified98.7%
Taylor expanded in t around 0 90.7%
if 6.9000000000000003e-106 < z Initial program 89.9%
associate-+l-89.9%
*-commutative89.9%
*-commutative89.9%
associate-*l*90.0%
associate-+l-90.0%
associate-*l*89.9%
*-commutative89.9%
*-commutative89.9%
associate-*l*93.0%
associate-*l*94.1%
Simplified94.1%
Taylor expanded in a around 0 61.8%
Final simplification72.5%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(if (<= z -8e-45)
(* z (- (* 2.0 (/ x z)) (* y (* 9.0 t))))
(if (<= z 2.85e-106)
(+ (* x 2.0) (* 27.0 (* a b)))
(- (* x 2.0) (* 9.0 (* (* y z) t))))))assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -8e-45) {
tmp = z * ((2.0 * (x / z)) - (y * (9.0 * t)));
} else if (z <= 2.85e-106) {
tmp = (x * 2.0) + (27.0 * (a * b));
} else {
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (z <= (-8d-45)) then
tmp = z * ((2.0d0 * (x / z)) - (y * (9.0d0 * t)))
else if (z <= 2.85d-106) then
tmp = (x * 2.0d0) + (27.0d0 * (a * b))
else
tmp = (x * 2.0d0) - (9.0d0 * ((y * z) * t))
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -8e-45) {
tmp = z * ((2.0 * (x / z)) - (y * (9.0 * t)));
} else if (z <= 2.85e-106) {
tmp = (x * 2.0) + (27.0 * (a * b));
} else {
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if z <= -8e-45: tmp = z * ((2.0 * (x / z)) - (y * (9.0 * t))) elif z <= 2.85e-106: tmp = (x * 2.0) + (27.0 * (a * b)) else: tmp = (x * 2.0) - (9.0 * ((y * z) * t)) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= -8e-45) tmp = Float64(z * Float64(Float64(2.0 * Float64(x / z)) - Float64(y * Float64(9.0 * t)))); elseif (z <= 2.85e-106) tmp = Float64(Float64(x * 2.0) + Float64(27.0 * Float64(a * b))); else tmp = Float64(Float64(x * 2.0) - Float64(9.0 * Float64(Float64(y * z) * t))); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (z <= -8e-45)
tmp = z * ((2.0 * (x / z)) - (y * (9.0 * t)));
elseif (z <= 2.85e-106)
tmp = (x * 2.0) + (27.0 * (a * b));
else
tmp = (x * 2.0) - (9.0 * ((y * z) * t));
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -8e-45], N[(z * N[(N[(2.0 * N[(x / z), $MachinePrecision]), $MachinePrecision] - N[(y * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.85e-106], N[(N[(x * 2.0), $MachinePrecision] + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8 \cdot 10^{-45}:\\
\;\;\;\;z \cdot \left(2 \cdot \frac{x}{z} - y \cdot \left(9 \cdot t\right)\right)\\
\mathbf{elif}\;z \leq 2.85 \cdot 10^{-106}:\\
\;\;\;\;x \cdot 2 + 27 \cdot \left(a \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot 2 - 9 \cdot \left(\left(y \cdot z\right) \cdot t\right)\\
\end{array}
\end{array}
if z < -7.99999999999999987e-45Initial program 92.1%
associate-+l-92.1%
*-commutative92.1%
*-commutative92.1%
associate-*l*92.1%
associate-+l-92.1%
associate-*l*92.1%
*-commutative92.1%
*-commutative92.1%
associate-*l*88.2%
associate-*l*88.3%
Simplified88.3%
Taylor expanded in a around 0 73.9%
Taylor expanded in z around inf 78.9%
associate-*r*78.9%
*-commutative78.9%
Simplified78.9%
if -7.99999999999999987e-45 < z < 2.8500000000000002e-106Initial program 96.8%
+-commutative96.8%
associate-+r-96.8%
*-commutative96.8%
cancel-sign-sub-inv96.8%
associate-*r*91.8%
distribute-lft-neg-in91.8%
*-commutative91.8%
cancel-sign-sub-inv91.8%
associate-+r-91.8%
associate-*l*92.8%
fma-define92.8%
cancel-sign-sub-inv92.8%
fma-define92.8%
*-commutative92.8%
distribute-rgt-neg-in92.8%
distribute-lft-neg-out92.8%
associate-*r*97.8%
associate-*l*97.8%
Simplified97.8%
Taylor expanded in t around 0 89.8%
if 2.8500000000000002e-106 < z Initial program 89.9%
associate-+l-89.9%
*-commutative89.9%
*-commutative89.9%
associate-*l*90.0%
associate-+l-90.0%
associate-*l*89.9%
*-commutative89.9%
*-commutative89.9%
associate-*l*93.0%
associate-*l*94.1%
Simplified94.1%
Taylor expanded in a around 0 61.8%
Final simplification77.2%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (or (<= b -4.5e-41) (not (<= b 6.2e+79))) (* 27.0 (* a b)) (* x 2.0)))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((b <= -4.5e-41) || !(b <= 6.2e+79)) {
tmp = 27.0 * (a * b);
} else {
tmp = x * 2.0;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if ((b <= (-4.5d-41)) .or. (.not. (b <= 6.2d+79))) then
tmp = 27.0d0 * (a * b)
else
tmp = x * 2.0d0
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((b <= -4.5e-41) || !(b <= 6.2e+79)) {
tmp = 27.0 * (a * b);
} else {
tmp = x * 2.0;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if (b <= -4.5e-41) or not (b <= 6.2e+79): tmp = 27.0 * (a * b) else: tmp = x * 2.0 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if ((b <= -4.5e-41) || !(b <= 6.2e+79)) tmp = Float64(27.0 * Float64(a * b)); else tmp = Float64(x * 2.0); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if ((b <= -4.5e-41) || ~((b <= 6.2e+79)))
tmp = 27.0 * (a * b);
else
tmp = x * 2.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -4.5e-41], N[Not[LessEqual[b, 6.2e+79]], $MachinePrecision]], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], N[(x * 2.0), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -4.5 \cdot 10^{-41} \lor \neg \left(b \leq 6.2 \cdot 10^{+79}\right):\\
\;\;\;\;27 \cdot \left(a \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;x \cdot 2\\
\end{array}
\end{array}
if b < -4.5e-41 or 6.1999999999999998e79 < b Initial program 93.6%
+-commutative93.6%
associate-+r-93.6%
*-commutative93.6%
cancel-sign-sub-inv93.6%
associate-*r*94.9%
distribute-lft-neg-in94.9%
*-commutative94.9%
cancel-sign-sub-inv94.9%
associate-+r-94.9%
associate-*l*95.8%
fma-define95.8%
cancel-sign-sub-inv95.8%
fma-define95.8%
*-commutative95.8%
distribute-rgt-neg-in95.8%
distribute-lft-neg-out95.8%
associate-*r*94.4%
associate-*l*94.4%
Simplified94.4%
Taylor expanded in a around inf 59.2%
if -4.5e-41 < b < 6.1999999999999998e79Initial program 92.7%
+-commutative92.7%
associate-+r-92.7%
*-commutative92.7%
cancel-sign-sub-inv92.7%
associate-*r*96.3%
distribute-lft-neg-in96.3%
*-commutative96.3%
cancel-sign-sub-inv96.3%
associate-+r-96.3%
associate-*l*97.0%
fma-define97.0%
cancel-sign-sub-inv97.0%
fma-define97.0%
*-commutative97.0%
distribute-rgt-neg-in97.0%
distribute-lft-neg-out97.0%
associate-*r*93.4%
associate-*l*93.5%
Simplified93.5%
Taylor expanded in t around 0 59.8%
Taylor expanded in x around inf 41.8%
Final simplification50.0%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= b -5.4e-39) (* 27.0 (* a b)) (if (<= b 7e+79) (* x 2.0) (* b (* a 27.0)))))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (b <= -5.4e-39) {
tmp = 27.0 * (a * b);
} else if (b <= 7e+79) {
tmp = x * 2.0;
} else {
tmp = b * (a * 27.0);
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (b <= (-5.4d-39)) then
tmp = 27.0d0 * (a * b)
else if (b <= 7d+79) then
tmp = x * 2.0d0
else
tmp = b * (a * 27.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (b <= -5.4e-39) {
tmp = 27.0 * (a * b);
} else if (b <= 7e+79) {
tmp = x * 2.0;
} else {
tmp = b * (a * 27.0);
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): tmp = 0 if b <= -5.4e-39: tmp = 27.0 * (a * b) elif b <= 7e+79: tmp = x * 2.0 else: tmp = b * (a * 27.0) return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (b <= -5.4e-39) tmp = Float64(27.0 * Float64(a * b)); elseif (b <= 7e+79) tmp = Float64(x * 2.0); else tmp = Float64(b * Float64(a * 27.0)); end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if (b <= -5.4e-39)
tmp = 27.0 * (a * b);
elseif (b <= 7e+79)
tmp = x * 2.0;
else
tmp = b * (a * 27.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[b, -5.4e-39], N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 7e+79], N[(x * 2.0), $MachinePrecision], N[(b * N[(a * 27.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -5.4 \cdot 10^{-39}:\\
\;\;\;\;27 \cdot \left(a \cdot b\right)\\
\mathbf{elif}\;b \leq 7 \cdot 10^{+79}:\\
\;\;\;\;x \cdot 2\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(a \cdot 27\right)\\
\end{array}
\end{array}
if b < -5.4000000000000001e-39Initial program 91.6%
+-commutative91.6%
associate-+r-91.6%
*-commutative91.6%
cancel-sign-sub-inv91.6%
associate-*r*92.7%
distribute-lft-neg-in92.7%
*-commutative92.7%
cancel-sign-sub-inv92.7%
associate-+r-92.7%
associate-*l*94.2%
fma-define94.2%
cancel-sign-sub-inv94.2%
fma-define94.2%
*-commutative94.2%
distribute-rgt-neg-in94.2%
distribute-lft-neg-out94.2%
associate-*r*93.1%
associate-*l*93.1%
Simplified93.1%
Taylor expanded in a around inf 52.5%
if -5.4000000000000001e-39 < b < 6.99999999999999961e79Initial program 92.7%
+-commutative92.7%
associate-+r-92.7%
*-commutative92.7%
cancel-sign-sub-inv92.7%
associate-*r*96.3%
distribute-lft-neg-in96.3%
*-commutative96.3%
cancel-sign-sub-inv96.3%
associate-+r-96.3%
associate-*l*97.0%
fma-define97.0%
cancel-sign-sub-inv97.0%
fma-define97.0%
*-commutative97.0%
distribute-rgt-neg-in97.0%
distribute-lft-neg-out97.0%
associate-*r*93.4%
associate-*l*93.5%
Simplified93.5%
Taylor expanded in t around 0 59.8%
Taylor expanded in x around inf 41.8%
if 6.99999999999999961e79 < b Initial program 96.2%
+-commutative96.2%
associate-+r-96.2%
*-commutative96.2%
cancel-sign-sub-inv96.2%
associate-*r*97.9%
distribute-lft-neg-in97.9%
*-commutative97.9%
cancel-sign-sub-inv97.9%
associate-+r-97.9%
associate-*l*97.9%
fma-define97.9%
cancel-sign-sub-inv97.9%
fma-define97.9%
*-commutative97.9%
distribute-rgt-neg-in97.9%
distribute-lft-neg-out97.9%
associate-*r*96.2%
associate-*l*96.2%
Simplified96.2%
Taylor expanded in t around 0 77.6%
Taylor expanded in x around 0 68.2%
associate-*r*68.3%
*-commutative68.3%
Simplified68.3%
Final simplification50.0%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* x 2.0))
assert(x < y && y < z && z < t && t < a && a < b);
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
return x * 2.0;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
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
code = x * 2.0d0
end function
assert x < y && y < z && z < t && t < a && a < b;
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
return x * 2.0;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) [x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): return x * 2.0
x, y, z, t, a, b = sort([x, y, z, t, a, b]) x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) return Float64(x * 2.0) end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
tmp = x * 2.0;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(x * 2.0), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\\\
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
x \cdot 2
\end{array}
Initial program 93.1%
+-commutative93.1%
associate-+r-93.1%
*-commutative93.1%
cancel-sign-sub-inv93.1%
associate-*r*95.7%
distribute-lft-neg-in95.7%
*-commutative95.7%
cancel-sign-sub-inv95.7%
associate-+r-95.7%
associate-*l*96.4%
fma-define96.4%
cancel-sign-sub-inv96.4%
fma-define96.4%
*-commutative96.4%
distribute-rgt-neg-in96.4%
distribute-lft-neg-out96.4%
associate-*r*93.9%
associate-*l*93.9%
Simplified93.9%
Taylor expanded in t around 0 66.9%
Taylor expanded in x around inf 30.7%
Final simplification30.7%
(FPCore (x y z t a b) :precision binary64 (if (< y 7.590524218811189e-161) (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* a (* 27.0 b))) (+ (- (* x 2.0) (* 9.0 (* y (* t z)))) (* (* a 27.0) b))))
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y < 7.590524218811189e-161) {
tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
} else {
tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
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) :: tmp
if (y < 7.590524218811189d-161) then
tmp = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + (a * (27.0d0 * b))
else
tmp = ((x * 2.0d0) - (9.0d0 * (y * (t * z)))) + ((a * 27.0d0) * b)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y < 7.590524218811189e-161) {
tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b));
} else {
tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b);
}
return tmp;
}
def code(x, y, z, t, a, b): tmp = 0 if y < 7.590524218811189e-161: tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b)) else: tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b) return tmp
function code(x, y, z, t, a, b) tmp = 0.0 if (y < 7.590524218811189e-161) tmp = Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(a * Float64(27.0 * b))); else tmp = Float64(Float64(Float64(x * 2.0) - Float64(9.0 * Float64(y * Float64(t * z)))) + Float64(Float64(a * 27.0) * b)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) tmp = 0.0; if (y < 7.590524218811189e-161) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + (a * (27.0 * b)); else tmp = ((x * 2.0) - (9.0 * (y * (t * z)))) + ((a * 27.0) * b); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := If[Less[y, 7.590524218811189e-161], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * 2.0), $MachinePrecision] - N[(9.0 * N[(y * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y < 7.590524218811189 \cdot 10^{-161}:\\
\;\;\;\;\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + a \cdot \left(27 \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot 2 - 9 \cdot \left(y \cdot \left(t \cdot z\right)\right)\right) + \left(a \cdot 27\right) \cdot b\\
\end{array}
\end{array}
herbie shell --seed 2024191
(FPCore (x y z t a b)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, A"
:precision binary64
:alt
(! :herbie-platform default (if (< y 7590524218811189/100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (- (* x 2) (* (* (* y 9) z) t)) (* a (* 27 b))) (+ (- (* x 2) (* 9 (* y (* t z)))) (* (* a 27) b))))
(+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))