
(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 14 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.
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 (/ (fma (* -4.0 t) a (fma (* (/ x z) y) 9.0 (/ b z))) c)))
(if (<= z -3.9e-113)
t_1
(if (<= z 3e-10)
(/ (fma (* x 9.0) y (fma (* (* -4.0 z) a) t b)) (* c z))
t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = fma((-4.0 * t), a, fma(((x / z) * y), 9.0, (b / z))) / c;
double tmp;
if (z <= -3.9e-113) {
tmp = t_1;
} else if (z <= 3e-10) {
tmp = fma((x * 9.0), y, fma(((-4.0 * z) * a), t, b)) / (c * z);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) t_1 = Float64(fma(Float64(-4.0 * t), a, fma(Float64(Float64(x / z) * y), 9.0, Float64(b / z))) / c) tmp = 0.0 if (z <= -3.9e-113) tmp = t_1; elseif (z <= 3e-10) tmp = Float64(fma(Float64(x * 9.0), y, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(c * z)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(-4.0 * t), $MachinePrecision] * a + N[(N[(N[(x / z), $MachinePrecision] * y), $MachinePrecision] * 9.0 + N[(b / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -3.9e-113], t$95$1, If[LessEqual[z, 3e-10], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(-4 \cdot t, a, \mathsf{fma}\left(\frac{x}{z} \cdot y, 9, \frac{b}{z}\right)\right)}{c}\\
\mathbf{if}\;z \leq -3.9 \cdot 10^{-113}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 3 \cdot 10^{-10}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -3.8999999999999999e-113 or 3e-10 < z Initial program 65.6%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites64.3%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
Applied rewrites91.0%
Applied rewrites91.7%
if -3.8999999999999999e-113 < z < 3e-10Initial program 96.1%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites95.2%
Final simplification93.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 -6.5e+80)
(/ (fma (* t a) -4.0 (* (/ (* x y) z) 9.0)) c)
(if (<= z 2.35e+103)
(/ (/ (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)) c) z)
(/ (fma (* t a) -4.0 (/ b z)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -6.5e+80) {
tmp = fma((t * a), -4.0, (((x * y) / z) * 9.0)) / c;
} else if (z <= 2.35e+103) {
tmp = (fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b)) / c) / z;
} else {
tmp = fma((t * a), -4.0, (b / z)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -6.5e+80) tmp = Float64(fma(Float64(t * a), -4.0, Float64(Float64(Float64(x * y) / z) * 9.0)) / c); elseif (z <= 2.35e+103) tmp = Float64(Float64(fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b)) / c) / z); else tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -6.5e+80], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.35e+103], N[(N[(N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -6.5 \cdot 10^{+80}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{x \cdot y}{z} \cdot 9\right)}{c}\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{+103}:\\
\;\;\;\;\frac{\frac{\mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)}{c}}{z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\end{array}
\end{array}
if z < -6.4999999999999998e80Initial program 54.3%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites52.5%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6483.8
Applied rewrites83.8%
Taylor expanded in b around 0
Applied rewrites76.8%
if -6.4999999999999998e80 < z < 2.35000000000000016e103Initial program 92.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites93.1%
if 2.35000000000000016e103 < z Initial program 51.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites51.0%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.4
Applied rewrites87.4%
Taylor expanded in b around inf
Applied rewrites81.3%
Final simplification87.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.6e+104)
(fma (* -4.0 a) (/ t c) (* (/ y (* c z)) (* x 9.0)))
(if (<= z 2.35e+103)
(* (/ 1.0 (* c z)) (fma (* (* -4.0 z) a) t (fma (* x y) 9.0 b)))
(/ (fma (* t a) -4.0 (/ b z)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < 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.6e+104) {
tmp = fma((-4.0 * a), (t / c), ((y / (c * z)) * (x * 9.0)));
} else if (z <= 2.35e+103) {
tmp = (1.0 / (c * z)) * fma(((-4.0 * z) * a), t, fma((x * y), 9.0, b));
} else {
tmp = fma((t * a), -4.0, (b / z)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -1.6e+104) tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(Float64(y / Float64(c * z)) * Float64(x * 9.0))); elseif (z <= 2.35e+103) tmp = Float64(Float64(1.0 / Float64(c * z)) * fma(Float64(Float64(-4.0 * z) * a), t, fma(Float64(x * y), 9.0, b))); else tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.6e+104], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.35e+103], N[(N[(1.0 / N[(c * z), $MachinePrecision]), $MachinePrecision] * N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.6 \cdot 10^{+104}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{y}{c \cdot z} \cdot \left(x \cdot 9\right)\right)\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{+103}:\\
\;\;\;\;\frac{1}{c \cdot z} \cdot \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, \mathsf{fma}\left(x \cdot y, 9, b\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\end{array}
\end{array}
if z < -1.6e104Initial program 52.6%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites52.6%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f64N/A
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6472.6
Applied rewrites72.6%
if -1.6e104 < z < 2.35000000000000016e103Initial program 91.3%
lift-/.f64N/A
div-invN/A
lower-*.f64N/A
Applied rewrites90.6%
if 2.35000000000000016e103 < z Initial program 51.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites51.0%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.4
Applied rewrites87.4%
Taylor expanded in b around inf
Applied rewrites81.3%
Final simplification85.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.6e+104)
(fma (* -4.0 a) (/ t c) (* (/ y (* c z)) (* x 9.0)))
(if (<= z 2.35e+103)
(/ (fma (* x 9.0) y (fma (* (* -4.0 z) a) t b)) (* c z))
(/ (fma (* t a) -4.0 (/ b z)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < 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.6e+104) {
tmp = fma((-4.0 * a), (t / c), ((y / (c * z)) * (x * 9.0)));
} else if (z <= 2.35e+103) {
tmp = fma((x * 9.0), y, fma(((-4.0 * z) * a), t, b)) / (c * z);
} else {
tmp = fma((t * a), -4.0, (b / z)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -1.6e+104) tmp = fma(Float64(-4.0 * a), Float64(t / c), Float64(Float64(y / Float64(c * z)) * Float64(x * 9.0))); elseif (z <= 2.35e+103) tmp = Float64(fma(Float64(x * 9.0), y, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(c * z)); else tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.6e+104], N[(N[(-4.0 * a), $MachinePrecision] * N[(t / c), $MachinePrecision] + N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.35e+103], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.6 \cdot 10^{+104}:\\
\;\;\;\;\mathsf{fma}\left(-4 \cdot a, \frac{t}{c}, \frac{y}{c \cdot z} \cdot \left(x \cdot 9\right)\right)\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{+103}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\end{array}
\end{array}
if z < -1.6e104Initial program 52.6%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites52.6%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
associate-/l*N/A
associate-*r*N/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
lower-*.f64N/A
lower-/.f64N/A
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6472.6
Applied rewrites72.6%
if -1.6e104 < z < 2.35000000000000016e103Initial program 91.3%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites90.2%
if 2.35000000000000016e103 < z Initial program 51.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites51.0%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.4
Applied rewrites87.4%
Taylor expanded in b around inf
Applied rewrites81.3%
Final simplification85.4%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 -3.4e+76)
(/ (fma (* t a) -4.0 (* (/ (* x y) z) 9.0)) c)
(if (<= z 2.35e+103)
(/ (fma (* x 9.0) y (fma (* (* -4.0 z) a) t b)) (* c z))
(/ (fma (* t a) -4.0 (/ b z)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -3.4e+76) {
tmp = fma((t * a), -4.0, (((x * y) / z) * 9.0)) / c;
} else if (z <= 2.35e+103) {
tmp = fma((x * 9.0), y, fma(((-4.0 * z) * a), t, b)) / (c * z);
} else {
tmp = fma((t * a), -4.0, (b / z)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -3.4e+76) tmp = Float64(fma(Float64(t * a), -4.0, Float64(Float64(Float64(x * y) / z) * 9.0)) / c); elseif (z <= 2.35e+103) tmp = Float64(fma(Float64(x * 9.0), y, fma(Float64(Float64(-4.0 * z) * a), t, b)) / Float64(c * z)); else tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -3.4e+76], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 2.35e+103], N[(N[(N[(x * 9.0), $MachinePrecision] * y + N[(N[(N[(-4.0 * z), $MachinePrecision] * a), $MachinePrecision] * t + b), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.4 \cdot 10^{+76}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{x \cdot y}{z} \cdot 9\right)}{c}\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{+103}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot 9, y, \mathsf{fma}\left(\left(-4 \cdot z\right) \cdot a, t, b\right)\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\end{array}
\end{array}
if z < -3.3999999999999997e76Initial program 55.2%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites53.4%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6484.0
Applied rewrites84.0%
Taylor expanded in b around 0
Applied rewrites77.2%
if -3.3999999999999997e76 < z < 2.35000000000000016e103Initial program 92.1%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
sub-negN/A
lift-*.f64N/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
neg-sub0N/A
associate-+l-N/A
neg-sub0N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
distribute-lft-neg-inN/A
*-commutativeN/A
associate-*r*N/A
lower-fma.f64N/A
Applied rewrites90.9%
if 2.35000000000000016e103 < z Initial program 51.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites51.0%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.4
Applied rewrites87.4%
Taylor expanded in b around inf
Applied rewrites81.3%
Final simplification86.5%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 -4500000000.0)
(/ (fma (* t a) -4.0 (* (/ (* x y) z) 9.0)) c)
(if (<= z 6.2e+24)
(/ (fma (* x y) 9.0 b) (* c z))
(/ (fma (* t a) -4.0 (/ b z)) c))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -4500000000.0) {
tmp = fma((t * a), -4.0, (((x * y) / z) * 9.0)) / c;
} else if (z <= 6.2e+24) {
tmp = fma((x * y), 9.0, b) / (c * z);
} else {
tmp = fma((t * a), -4.0, (b / z)) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -4500000000.0) tmp = Float64(fma(Float64(t * a), -4.0, Float64(Float64(Float64(x * y) / z) * 9.0)) / c); elseif (z <= 6.2e+24) tmp = Float64(fma(Float64(x * y), 9.0, b) / Float64(c * z)); else tmp = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -4500000000.0], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision] * 9.0), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[z, 6.2e+24], N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4500000000:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{x \cdot y}{z} \cdot 9\right)}{c}\\
\mathbf{elif}\;z \leq 6.2 \cdot 10^{+24}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\end{array}
\end{array}
if z < -4.5e9Initial program 61.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites60.1%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6488.0
Applied rewrites88.0%
Taylor expanded in b around 0
Applied rewrites75.2%
if -4.5e9 < z < 6.20000000000000022e24Initial program 93.3%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6483.6
Applied rewrites83.6%
if 6.20000000000000022e24 < z Initial program 61.0%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites61.0%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6489.9
Applied rewrites89.9%
Taylor expanded in b around inf
Applied rewrites79.3%
Final simplification80.3%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 -3.3e+59)
(* (/ (* t a) c) -4.0)
(if (<= z -4.6e-275)
(/ (/ b c) z)
(if (<= z 1.2e-170)
(/ (* (* x 9.0) y) (* c z))
(if (<= z 0.0075) (/ b (* c z)) (/ (* (* -4.0 t) a) c))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -3.3e+59) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= -4.6e-275) {
tmp = (b / c) / z;
} else if (z <= 1.2e-170) {
tmp = ((x * 9.0) * y) / (c * z);
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-3.3d+59)) then
tmp = ((t * a) / c) * (-4.0d0)
else if (z <= (-4.6d-275)) then
tmp = (b / c) / z
else if (z <= 1.2d-170) then
tmp = ((x * 9.0d0) * y) / (c * z)
else if (z <= 0.0075d0) then
tmp = b / (c * z)
else
tmp = (((-4.0d0) * t) * a) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -3.3e+59) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= -4.6e-275) {
tmp = (b / c) / z;
} else if (z <= 1.2e-170) {
tmp = ((x * 9.0) * y) / (c * z);
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, 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): tmp = 0 if z <= -3.3e+59: tmp = ((t * a) / c) * -4.0 elif z <= -4.6e-275: tmp = (b / c) / z elif z <= 1.2e-170: tmp = ((x * 9.0) * y) / (c * z) elif z <= 0.0075: tmp = b / (c * z) else: tmp = ((-4.0 * t) * a) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -3.3e+59) tmp = Float64(Float64(Float64(t * a) / c) * -4.0); elseif (z <= -4.6e-275) tmp = Float64(Float64(b / c) / z); elseif (z <= 1.2e-170) tmp = Float64(Float64(Float64(x * 9.0) * y) / Float64(c * z)); elseif (z <= 0.0075) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(Float64(-4.0 * t) * a) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 <= -3.3e+59)
tmp = ((t * a) / c) * -4.0;
elseif (z <= -4.6e-275)
tmp = (b / c) / z;
elseif (z <= 1.2e-170)
tmp = ((x * 9.0) * y) / (c * z);
elseif (z <= 0.0075)
tmp = b / (c * z);
else
tmp = ((-4.0 * t) * a) / 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. 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, -3.3e+59], N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, -4.6e-275], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 1.2e-170], N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 0.0075], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * t), $MachinePrecision] * a), $MachinePrecision] / c), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.3 \cdot 10^{+59}:\\
\;\;\;\;\frac{t \cdot a}{c} \cdot -4\\
\mathbf{elif}\;z \leq -4.6 \cdot 10^{-275}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;z \leq 1.2 \cdot 10^{-170}:\\
\;\;\;\;\frac{\left(x \cdot 9\right) \cdot y}{c \cdot z}\\
\mathbf{elif}\;z \leq 0.0075:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-4 \cdot t\right) \cdot a}{c}\\
\end{array}
\end{array}
if z < -3.2999999999999999e59Initial program 57.3%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.0
Applied rewrites64.0%
if -3.2999999999999999e59 < z < -4.59999999999999979e-275Initial program 88.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites96.9%
Taylor expanded in b around inf
lower-/.f6455.4
Applied rewrites55.4%
if -4.59999999999999979e-275 < z < 1.2e-170Initial program 99.7%
Taylor expanded in y around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6464.3
Applied rewrites64.3%
Applied rewrites64.3%
if 1.2e-170 < z < 0.0074999999999999997Initial program 94.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6455.1
Applied rewrites55.1%
if 0.0074999999999999997 < z Initial program 62.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites62.4%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
Taylor expanded in a around inf
Applied rewrites54.9%
Applied rewrites54.9%
Final simplification58.6%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 -3.3e+59)
(* (/ (* t a) c) -4.0)
(if (<= z -4.6e-275)
(/ (/ b c) z)
(if (<= z 1.2e-170)
(* (* (/ y (* c z)) 9.0) x)
(if (<= z 0.0075) (/ b (* c z)) (/ (* (* -4.0 t) a) c))))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -3.3e+59) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= -4.6e-275) {
tmp = (b / c) / z;
} else if (z <= 1.2e-170) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 <= (-3.3d+59)) then
tmp = ((t * a) / c) * (-4.0d0)
else if (z <= (-4.6d-275)) then
tmp = (b / c) / z
else if (z <= 1.2d-170) then
tmp = ((y / (c * z)) * 9.0d0) * x
else if (z <= 0.0075d0) then
tmp = b / (c * z)
else
tmp = (((-4.0d0) * t) * a) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 <= -3.3e+59) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= -4.6e-275) {
tmp = (b / c) / z;
} else if (z <= 1.2e-170) {
tmp = ((y / (c * z)) * 9.0) * x;
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, 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): tmp = 0 if z <= -3.3e+59: tmp = ((t * a) / c) * -4.0 elif z <= -4.6e-275: tmp = (b / c) / z elif z <= 1.2e-170: tmp = ((y / (c * z)) * 9.0) * x elif z <= 0.0075: tmp = b / (c * z) else: tmp = ((-4.0 * t) * a) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -3.3e+59) tmp = Float64(Float64(Float64(t * a) / c) * -4.0); elseif (z <= -4.6e-275) tmp = Float64(Float64(b / c) / z); elseif (z <= 1.2e-170) tmp = Float64(Float64(Float64(y / Float64(c * z)) * 9.0) * x); elseif (z <= 0.0075) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(Float64(-4.0 * t) * a) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 <= -3.3e+59)
tmp = ((t * a) / c) * -4.0;
elseif (z <= -4.6e-275)
tmp = (b / c) / z;
elseif (z <= 1.2e-170)
tmp = ((y / (c * z)) * 9.0) * x;
elseif (z <= 0.0075)
tmp = b / (c * z);
else
tmp = ((-4.0 * t) * a) / 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. 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, -3.3e+59], N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, -4.6e-275], N[(N[(b / c), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 1.2e-170], N[(N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[z, 0.0075], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * t), $MachinePrecision] * a), $MachinePrecision] / c), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3.3 \cdot 10^{+59}:\\
\;\;\;\;\frac{t \cdot a}{c} \cdot -4\\
\mathbf{elif}\;z \leq -4.6 \cdot 10^{-275}:\\
\;\;\;\;\frac{\frac{b}{c}}{z}\\
\mathbf{elif}\;z \leq 1.2 \cdot 10^{-170}:\\
\;\;\;\;\left(\frac{y}{c \cdot z} \cdot 9\right) \cdot x\\
\mathbf{elif}\;z \leq 0.0075:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-4 \cdot t\right) \cdot a}{c}\\
\end{array}
\end{array}
if z < -3.2999999999999999e59Initial program 57.3%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.0
Applied rewrites64.0%
if -3.2999999999999999e59 < z < -4.59999999999999979e-275Initial program 88.3%
lift-/.f64N/A
lift-*.f64N/A
associate-/l/N/A
lower-/.f64N/A
Applied rewrites96.9%
Taylor expanded in b around inf
lower-/.f6455.4
Applied rewrites55.4%
if -4.59999999999999979e-275 < z < 1.2e-170Initial program 99.7%
Taylor expanded in y around inf
associate-*r/N/A
*-commutativeN/A
associate-*r*N/A
associate-*l/N/A
associate-*r/N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f6459.5
Applied rewrites59.5%
if 1.2e-170 < z < 0.0074999999999999997Initial program 94.3%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6455.1
Applied rewrites55.1%
if 0.0074999999999999997 < z Initial program 62.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites62.4%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
Taylor expanded in a around inf
Applied rewrites54.9%
Applied rewrites54.9%
Final simplification57.9%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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 (/ (fma (* t a) -4.0 (/ b z)) c)))
(if (<= z -8.2e-71)
t_1
(if (<= z 6.2e+24) (/ (fma (* x y) 9.0 b) (* c z)) t_1))))assert(x < y && y < z && z < t && t < a && a < b && b < 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 = fma((t * a), -4.0, (b / z)) / c;
double tmp;
if (z <= -8.2e-71) {
tmp = t_1;
} else if (z <= 6.2e+24) {
tmp = fma((x * y), 9.0, b) / (c * z);
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) t_1 = Float64(fma(Float64(t * a), -4.0, Float64(b / z)) / c) tmp = 0.0 if (z <= -8.2e-71) tmp = t_1; elseif (z <= 6.2e+24) tmp = Float64(fma(Float64(x * y), 9.0, b) / Float64(c * z)); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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[(t * a), $MachinePrecision] * -4.0 + N[(b / z), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -8.2e-71], t$95$1, If[LessEqual[z, 6.2e+24], N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\mathsf{fma}\left(t \cdot a, -4, \frac{b}{z}\right)}{c}\\
\mathbf{if}\;z \leq -8.2 \cdot 10^{-71}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 6.2 \cdot 10^{+24}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -8.19999999999999987e-71 or 6.20000000000000022e24 < z Initial program 64.9%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites64.1%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6489.8
Applied rewrites89.8%
Taylor expanded in b around inf
Applied rewrites74.6%
if -8.19999999999999987e-71 < z < 6.20000000000000022e24Initial program 92.6%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6484.4
Applied rewrites84.4%
Final simplification79.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.8e+80) (* (/ (* t a) c) -4.0) (if (<= z 9e+156) (/ (fma (* x y) 9.0 b) (* c z)) (/ (* (* -4.0 t) a) c))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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.8e+80) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= 9e+156) {
tmp = fma((x * y), 9.0, b) / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -1.8e+80) tmp = Float64(Float64(Float64(t * a) / c) * -4.0); elseif (z <= 9e+156) tmp = Float64(fma(Float64(x * y), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(Float64(-4.0 * t) * a) / c); end return tmp end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.8e+80], N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 9e+156], N[(N[(N[(x * y), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * t), $MachinePrecision] * a), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.8 \cdot 10^{+80}:\\
\;\;\;\;\frac{t \cdot a}{c} \cdot -4\\
\mathbf{elif}\;z \leq 9 \cdot 10^{+156}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x \cdot y, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-4 \cdot t\right) \cdot a}{c}\\
\end{array}
\end{array}
if z < -1.79999999999999997e80Initial program 54.3%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6465.4
Applied rewrites65.4%
if -1.79999999999999997e80 < z < 9.00000000000000061e156Initial program 89.4%
Taylor expanded in a around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6477.2
Applied rewrites77.2%
if 9.00000000000000061e156 < z Initial program 50.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites50.4%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6481.9
Applied rewrites81.9%
Taylor expanded in a around inf
Applied rewrites70.8%
Applied rewrites70.8%
Final simplification74.0%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.2e+75) (* (/ (* t a) c) -4.0) (if (<= z 0.0075) (* (/ 1.0 (* c z)) b) (/ (* (* -4.0 t) a) c))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -4.2e+75) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= 0.0075) {
tmp = (1.0 / (c * z)) * b;
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.2d+75)) then
tmp = ((t * a) / c) * (-4.0d0)
else if (z <= 0.0075d0) then
tmp = (1.0d0 / (c * z)) * b
else
tmp = (((-4.0d0) * t) * a) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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.2e+75) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= 0.0075) {
tmp = (1.0 / (c * z)) * b;
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, 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): tmp = 0 if z <= -4.2e+75: tmp = ((t * a) / c) * -4.0 elif z <= 0.0075: tmp = (1.0 / (c * z)) * b else: tmp = ((-4.0 * t) * a) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -4.2e+75) tmp = Float64(Float64(Float64(t * a) / c) * -4.0); elseif (z <= 0.0075) tmp = Float64(Float64(1.0 / Float64(c * z)) * b); else tmp = Float64(Float64(Float64(-4.0 * t) * a) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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.2e+75)
tmp = ((t * a) / c) * -4.0;
elseif (z <= 0.0075)
tmp = (1.0 / (c * z)) * b;
else
tmp = ((-4.0 * t) * a) / 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. 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.2e+75], N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 0.0075], N[(N[(1.0 / N[(c * z), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], N[(N[(N[(-4.0 * t), $MachinePrecision] * a), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.2 \cdot 10^{+75}:\\
\;\;\;\;\frac{t \cdot a}{c} \cdot -4\\
\mathbf{elif}\;z \leq 0.0075:\\
\;\;\;\;\frac{1}{c \cdot z} \cdot b\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-4 \cdot t\right) \cdot a}{c}\\
\end{array}
\end{array}
if z < -4.19999999999999997e75Initial program 55.2%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.3
Applied rewrites64.3%
if -4.19999999999999997e75 < z < 0.0074999999999999997Initial program 92.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6451.1
Applied rewrites51.1%
Applied rewrites51.7%
if 0.0074999999999999997 < z Initial program 62.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites62.4%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
Taylor expanded in a around inf
Applied rewrites54.9%
Applied rewrites54.9%
Final simplification55.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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.2e+75) (* (/ (* t a) c) -4.0) (if (<= z 0.0075) (/ b (* c z)) (/ (* (* -4.0 t) a) c))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 <= -4.2e+75) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function.
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.2d+75)) then
tmp = ((t * a) / c) * (-4.0d0)
else if (z <= 0.0075d0) then
tmp = b / (c * z)
else
tmp = (((-4.0d0) * t) * a) / c
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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.2e+75) {
tmp = ((t * a) / c) * -4.0;
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = ((-4.0 * t) * a) / c;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, 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): tmp = 0 if z <= -4.2e+75: tmp = ((t * a) / c) * -4.0 elif z <= 0.0075: tmp = b / (c * z) else: tmp = ((-4.0 * t) * a) / c return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) tmp = 0.0 if (z <= -4.2e+75) tmp = Float64(Float64(Float64(t * a) / c) * -4.0); elseif (z <= 0.0075) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(Float64(-4.0 * t) * a) / c); end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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.2e+75)
tmp = ((t * a) / c) * -4.0;
elseif (z <= 0.0075)
tmp = b / (c * z);
else
tmp = ((-4.0 * t) * a) / 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. 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.2e+75], N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 0.0075], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * t), $MachinePrecision] * a), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.2 \cdot 10^{+75}:\\
\;\;\;\;\frac{t \cdot a}{c} \cdot -4\\
\mathbf{elif}\;z \leq 0.0075:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(-4 \cdot t\right) \cdot a}{c}\\
\end{array}
\end{array}
if z < -4.19999999999999997e75Initial program 55.2%
Taylor expanded in a around inf
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6464.3
Applied rewrites64.3%
if -4.19999999999999997e75 < z < 0.0074999999999999997Initial program 92.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6451.1
Applied rewrites51.1%
if 0.0074999999999999997 < z Initial program 62.4%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites62.4%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6487.8
Applied rewrites87.8%
Taylor expanded in a around inf
Applied rewrites54.9%
Applied rewrites54.9%
Final simplification54.8%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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 (/ (* (* -4.0 t) a) c))) (if (<= z -4.2e+75) t_1 (if (<= z 0.0075) (/ b (* c z)) t_1))))
assert(x < y && y < z && z < t && t < a && a < b && b < 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 = ((-4.0 * t) * a) / c;
double tmp;
if (z <= -4.2e+75) {
tmp = t_1;
} else if (z <= 0.0075) {
tmp = b / (c * z);
} 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.
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 = (((-4.0d0) * t) * a) / c
if (z <= (-4.2d+75)) then
tmp = t_1
else if (z <= 0.0075d0) then
tmp = b / (c * z)
else
tmp = t_1
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b && b < c;
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 = ((-4.0 * t) * a) / c;
double tmp;
if (z <= -4.2e+75) {
tmp = t_1;
} else if (z <= 0.0075) {
tmp = b / (c * z);
} else {
tmp = t_1;
}
return tmp;
}
[x, y, z, t, a, b, c] = sort([x, y, z, t, a, b, 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): t_1 = ((-4.0 * t) * a) / c tmp = 0 if z <= -4.2e+75: tmp = t_1 elif z <= 0.0075: tmp = b / (c * z) else: tmp = t_1 return tmp
x, y, z, t, a, b, c = sort([x, y, z, t, a, b, 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) t_1 = Float64(Float64(Float64(-4.0 * t) * a) / c) tmp = 0.0 if (z <= -4.2e+75) tmp = t_1; elseif (z <= 0.0075) tmp = Float64(b / Float64(c * z)); else tmp = t_1; end return tmp end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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 = ((-4.0 * t) * a) / c;
tmp = 0.0;
if (z <= -4.2e+75)
tmp = t_1;
elseif (z <= 0.0075)
tmp = b / (c * z);
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.
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[(-4.0 * t), $MachinePrecision] * a), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -4.2e+75], t$95$1, If[LessEqual[z, 0.0075], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\begin{array}{l}
t_1 := \frac{\left(-4 \cdot t\right) \cdot a}{c}\\
\mathbf{if}\;z \leq -4.2 \cdot 10^{+75}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 0.0075:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -4.19999999999999997e75 or 0.0074999999999999997 < z Initial program 58.8%
lift-/.f64N/A
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
Applied rewrites57.9%
Taylor expanded in c around 0
lower-/.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f6485.9
Applied rewrites85.9%
Taylor expanded in a around inf
Applied rewrites59.6%
Applied rewrites59.6%
if -4.19999999999999997e75 < z < 0.0074999999999999997Initial program 92.5%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6451.1
Applied rewrites51.1%
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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);
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.
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;
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]) [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]) 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(c * z)) end
x, y, z, t, a, b, c = num2cell(sort([x, y, z, t, a, b, c])){:}
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. 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[(c * z), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\\\
[x, y, z, t, a, b, c] = \mathsf{sort}([x, y, z, t, a, b, c])\\
\\
\frac{b}{c \cdot z}
\end{array}
Initial program 77.8%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6436.3
Applied rewrites36.3%
(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 2024240
(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)))