
(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 13 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 (* -9.0 x) (/ y z) (fma (* 4.0 a) t (/ (- b) z))) (- c))))
(if (<= z -1.95e-38)
t_1
(if (<= z 7e-57)
(/ (fma (* 9.0 x) 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((-9.0 * x), (y / z), fma((4.0 * a), t, (-b / z))) / -c;
double tmp;
if (z <= -1.95e-38) {
tmp = t_1;
} else if (z <= 7e-57) {
tmp = fma((9.0 * x), 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(-9.0 * x), Float64(y / z), fma(Float64(4.0 * a), t, Float64(Float64(-b) / z))) / Float64(-c)) tmp = 0.0 if (z <= -1.95e-38) tmp = t_1; elseif (z <= 7e-57) tmp = Float64(fma(Float64(9.0 * x), 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[(-9.0 * x), $MachinePrecision] * N[(y / z), $MachinePrecision] + N[(N[(4.0 * a), $MachinePrecision] * t + N[((-b) / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / (-c)), $MachinePrecision]}, If[LessEqual[z, -1.95e-38], t$95$1, If[LessEqual[z, 7e-57], N[(N[(N[(9.0 * x), $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(-9 \cdot x, \frac{y}{z}, \mathsf{fma}\left(4 \cdot a, t, \frac{-b}{z}\right)\right)}{-c}\\
\mathbf{if}\;z \leq -1.95 \cdot 10^{-38}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 7 \cdot 10^{-57}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, 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 < -1.95e-38 or 6.99999999999999983e-57 < z Initial program 66.8%
lift-/.f64N/A
div-invN/A
lift-+.f64N/A
flip-+N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
div-invN/A
Applied rewrites67.6%
Taylor expanded in z around inf
+-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites86.0%
Taylor expanded in c around -inf
Applied rewrites95.1%
if -1.95e-38 < z < 6.99999999999999983e-57Initial program 93.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.8%
Final simplification93.2%
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 (* (* 9.0 x) y)))
(if (<= t_1 -2e+80)
(* (/ y (* c z)) (* 9.0 x))
(if (<= t_1 -1e-132)
(* (* (* (/ 1.0 c) t) a) -4.0)
(if (<= t_1 5e-213)
(/ b (* c z))
(if (<= t_1 5e-22)
(* (* (/ a c) t) -4.0)
(* (* (/ x (* c z)) 9.0) y)))))))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 = (9.0 * x) * y;
double tmp;
if (t_1 <= -2e+80) {
tmp = (y / (c * z)) * (9.0 * x);
} else if (t_1 <= -1e-132) {
tmp = (((1.0 / c) * t) * a) * -4.0;
} else if (t_1 <= 5e-213) {
tmp = b / (c * z);
} else if (t_1 <= 5e-22) {
tmp = ((a / c) * t) * -4.0;
} else {
tmp = ((x / (c * z)) * 9.0) * y;
}
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 = (9.0d0 * x) * y
if (t_1 <= (-2d+80)) then
tmp = (y / (c * z)) * (9.0d0 * x)
else if (t_1 <= (-1d-132)) then
tmp = (((1.0d0 / c) * t) * a) * (-4.0d0)
else if (t_1 <= 5d-213) then
tmp = b / (c * z)
else if (t_1 <= 5d-22) then
tmp = ((a / c) * t) * (-4.0d0)
else
tmp = ((x / (c * z)) * 9.0d0) * y
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 = (9.0 * x) * y;
double tmp;
if (t_1 <= -2e+80) {
tmp = (y / (c * z)) * (9.0 * x);
} else if (t_1 <= -1e-132) {
tmp = (((1.0 / c) * t) * a) * -4.0;
} else if (t_1 <= 5e-213) {
tmp = b / (c * z);
} else if (t_1 <= 5e-22) {
tmp = ((a / c) * t) * -4.0;
} else {
tmp = ((x / (c * z)) * 9.0) * y;
}
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 = (9.0 * x) * y tmp = 0 if t_1 <= -2e+80: tmp = (y / (c * z)) * (9.0 * x) elif t_1 <= -1e-132: tmp = (((1.0 / c) * t) * a) * -4.0 elif t_1 <= 5e-213: tmp = b / (c * z) elif t_1 <= 5e-22: tmp = ((a / c) * t) * -4.0 else: tmp = ((x / (c * z)) * 9.0) * y 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(9.0 * x) * y) tmp = 0.0 if (t_1 <= -2e+80) tmp = Float64(Float64(y / Float64(c * z)) * Float64(9.0 * x)); elseif (t_1 <= -1e-132) tmp = Float64(Float64(Float64(Float64(1.0 / c) * t) * a) * -4.0); elseif (t_1 <= 5e-213) tmp = Float64(b / Float64(c * z)); elseif (t_1 <= 5e-22) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); else tmp = Float64(Float64(Float64(x / Float64(c * z)) * 9.0) * y); 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 = (9.0 * x) * y;
tmp = 0.0;
if (t_1 <= -2e+80)
tmp = (y / (c * z)) * (9.0 * x);
elseif (t_1 <= -1e-132)
tmp = (((1.0 / c) * t) * a) * -4.0;
elseif (t_1 <= 5e-213)
tmp = b / (c * z);
elseif (t_1 <= 5e-22)
tmp = ((a / c) * t) * -4.0;
else
tmp = ((x / (c * z)) * 9.0) * y;
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+80], N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * N[(9.0 * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -1e-132], N[(N[(N[(N[(1.0 / c), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 5e-213], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-22], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y), $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}
t_1 := \left(9 \cdot x\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+80}:\\
\;\;\;\;\frac{y}{c \cdot z} \cdot \left(9 \cdot x\right)\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-132}:\\
\;\;\;\;\left(\left(\frac{1}{c} \cdot t\right) \cdot a\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-213}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-22}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{x}{c \cdot z} \cdot 9\right) \cdot y\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e80Initial program 77.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites71.3%
Taylor expanded in x around inf
associate-/l*N/A
associate-*r*N/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6462.6
Applied rewrites62.6%
if -2e80 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999999e-133Initial program 80.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.1%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6458.0
Applied rewrites58.0%
Applied rewrites60.3%
if -9.9999999999999999e-133 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999977e-213Initial program 85.4%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6461.9
Applied rewrites61.9%
if 4.99999999999999977e-213 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999954e-22Initial program 68.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites71.3%
if 4.99999999999999954e-22 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.5%
Taylor expanded in x around inf
associate-*r/N/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-*.f6462.8
Applied rewrites62.8%
Final simplification63.2%
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 (* (* 9.0 x) y)) (t_2 (* (* (/ x (* c z)) 9.0) y)))
(if (<= t_1 -2e+80)
t_2
(if (<= t_1 -1e-132)
(* (* (* (/ 1.0 c) t) a) -4.0)
(if (<= t_1 5e-213)
(/ b (* c z))
(if (<= t_1 5e-22) (* (* (/ a c) t) -4.0) t_2))))))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 = (9.0 * x) * y;
double t_2 = ((x / (c * z)) * 9.0) * y;
double tmp;
if (t_1 <= -2e+80) {
tmp = t_2;
} else if (t_1 <= -1e-132) {
tmp = (((1.0 / c) * t) * a) * -4.0;
} else if (t_1 <= 5e-213) {
tmp = b / (c * z);
} else if (t_1 <= 5e-22) {
tmp = ((a / c) * t) * -4.0;
} else {
tmp = t_2;
}
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) :: t_2
real(8) :: tmp
t_1 = (9.0d0 * x) * y
t_2 = ((x / (c * z)) * 9.0d0) * y
if (t_1 <= (-2d+80)) then
tmp = t_2
else if (t_1 <= (-1d-132)) then
tmp = (((1.0d0 / c) * t) * a) * (-4.0d0)
else if (t_1 <= 5d-213) then
tmp = b / (c * z)
else if (t_1 <= 5d-22) then
tmp = ((a / c) * t) * (-4.0d0)
else
tmp = t_2
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 = (9.0 * x) * y;
double t_2 = ((x / (c * z)) * 9.0) * y;
double tmp;
if (t_1 <= -2e+80) {
tmp = t_2;
} else if (t_1 <= -1e-132) {
tmp = (((1.0 / c) * t) * a) * -4.0;
} else if (t_1 <= 5e-213) {
tmp = b / (c * z);
} else if (t_1 <= 5e-22) {
tmp = ((a / c) * t) * -4.0;
} else {
tmp = t_2;
}
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 = (9.0 * x) * y t_2 = ((x / (c * z)) * 9.0) * y tmp = 0 if t_1 <= -2e+80: tmp = t_2 elif t_1 <= -1e-132: tmp = (((1.0 / c) * t) * a) * -4.0 elif t_1 <= 5e-213: tmp = b / (c * z) elif t_1 <= 5e-22: tmp = ((a / c) * t) * -4.0 else: tmp = t_2 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(9.0 * x) * y) t_2 = Float64(Float64(Float64(x / Float64(c * z)) * 9.0) * y) tmp = 0.0 if (t_1 <= -2e+80) tmp = t_2; elseif (t_1 <= -1e-132) tmp = Float64(Float64(Float64(Float64(1.0 / c) * t) * a) * -4.0); elseif (t_1 <= 5e-213) tmp = Float64(b / Float64(c * z)); elseif (t_1 <= 5e-22) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); else tmp = t_2; 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 = (9.0 * x) * y;
t_2 = ((x / (c * z)) * 9.0) * y;
tmp = 0.0;
if (t_1 <= -2e+80)
tmp = t_2;
elseif (t_1 <= -1e-132)
tmp = (((1.0 / c) * t) * a) * -4.0;
elseif (t_1 <= 5e-213)
tmp = b / (c * z);
elseif (t_1 <= 5e-22)
tmp = ((a / c) * t) * -4.0;
else
tmp = t_2;
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+80], t$95$2, If[LessEqual[t$95$1, -1e-132], N[(N[(N[(N[(1.0 / c), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 5e-213], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-22], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], t$95$2]]]]]]
\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 := \left(9 \cdot x\right) \cdot y\\
t_2 := \left(\frac{x}{c \cdot z} \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+80}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-132}:\\
\;\;\;\;\left(\left(\frac{1}{c} \cdot t\right) \cdot a\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-213}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-22}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e80 or 4.99999999999999954e-22 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.3%
Taylor expanded in x around inf
associate-*r/N/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-*.f6462.8
Applied rewrites62.8%
if -2e80 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999999e-133Initial program 80.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.1%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6458.0
Applied rewrites58.0%
Applied rewrites60.3%
if -9.9999999999999999e-133 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999977e-213Initial program 85.4%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6461.9
Applied rewrites61.9%
if 4.99999999999999977e-213 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999954e-22Initial program 68.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites71.3%
Final simplification63.2%
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 (* (* 9.0 x) y)) (t_2 (* (* (/ x (* c z)) 9.0) y)))
(if (<= t_1 -2e+80)
t_2
(if (<= t_1 -1e-132)
(* (* (/ t c) a) -4.0)
(if (<= t_1 5e-213)
(/ b (* c z))
(if (<= t_1 5e-22) (* (* (/ a c) t) -4.0) t_2))))))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 = (9.0 * x) * y;
double t_2 = ((x / (c * z)) * 9.0) * y;
double tmp;
if (t_1 <= -2e+80) {
tmp = t_2;
} else if (t_1 <= -1e-132) {
tmp = ((t / c) * a) * -4.0;
} else if (t_1 <= 5e-213) {
tmp = b / (c * z);
} else if (t_1 <= 5e-22) {
tmp = ((a / c) * t) * -4.0;
} else {
tmp = t_2;
}
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) :: t_2
real(8) :: tmp
t_1 = (9.0d0 * x) * y
t_2 = ((x / (c * z)) * 9.0d0) * y
if (t_1 <= (-2d+80)) then
tmp = t_2
else if (t_1 <= (-1d-132)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (t_1 <= 5d-213) then
tmp = b / (c * z)
else if (t_1 <= 5d-22) then
tmp = ((a / c) * t) * (-4.0d0)
else
tmp = t_2
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 = (9.0 * x) * y;
double t_2 = ((x / (c * z)) * 9.0) * y;
double tmp;
if (t_1 <= -2e+80) {
tmp = t_2;
} else if (t_1 <= -1e-132) {
tmp = ((t / c) * a) * -4.0;
} else if (t_1 <= 5e-213) {
tmp = b / (c * z);
} else if (t_1 <= 5e-22) {
tmp = ((a / c) * t) * -4.0;
} else {
tmp = t_2;
}
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 = (9.0 * x) * y t_2 = ((x / (c * z)) * 9.0) * y tmp = 0 if t_1 <= -2e+80: tmp = t_2 elif t_1 <= -1e-132: tmp = ((t / c) * a) * -4.0 elif t_1 <= 5e-213: tmp = b / (c * z) elif t_1 <= 5e-22: tmp = ((a / c) * t) * -4.0 else: tmp = t_2 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(9.0 * x) * y) t_2 = Float64(Float64(Float64(x / Float64(c * z)) * 9.0) * y) tmp = 0.0 if (t_1 <= -2e+80) tmp = t_2; elseif (t_1 <= -1e-132) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (t_1 <= 5e-213) tmp = Float64(b / Float64(c * z)); elseif (t_1 <= 5e-22) tmp = Float64(Float64(Float64(a / c) * t) * -4.0); else tmp = t_2; 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 = (9.0 * x) * y;
t_2 = ((x / (c * z)) * 9.0) * y;
tmp = 0.0;
if (t_1 <= -2e+80)
tmp = t_2;
elseif (t_1 <= -1e-132)
tmp = ((t / c) * a) * -4.0;
elseif (t_1 <= 5e-213)
tmp = b / (c * z);
elseif (t_1 <= 5e-22)
tmp = ((a / c) * t) * -4.0;
else
tmp = t_2;
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[(9.0 * x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x / N[(c * z), $MachinePrecision]), $MachinePrecision] * 9.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+80], t$95$2, If[LessEqual[t$95$1, -1e-132], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[t$95$1, 5e-213], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e-22], N[(N[(N[(a / c), $MachinePrecision] * t), $MachinePrecision] * -4.0), $MachinePrecision], t$95$2]]]]]]
\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 := \left(9 \cdot x\right) \cdot y\\
t_2 := \left(\frac{x}{c \cdot z} \cdot 9\right) \cdot y\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+80}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq -1 \cdot 10^{-132}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-213}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-22}:\\
\;\;\;\;\left(\frac{a}{c} \cdot t\right) \cdot -4\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -2e80 or 4.99999999999999954e-22 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) Initial program 77.3%
Taylor expanded in x around inf
associate-*r/N/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-*.f6462.8
Applied rewrites62.8%
if -2e80 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < -9.9999999999999999e-133Initial program 80.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.1%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6458.0
Applied rewrites58.0%
Applied rewrites60.3%
if -9.9999999999999999e-133 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999977e-213Initial program 85.4%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6461.9
Applied rewrites61.9%
if 4.99999999999999977e-213 < (*.f64 (*.f64 x #s(literal 9 binary64)) y) < 4.99999999999999954e-22Initial program 68.6%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites78.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.5
Applied rewrites68.5%
Applied rewrites71.3%
Final simplification63.2%
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 (* a -4.0) t (* (* (/ x z) 9.0) y)) c)))
(if (<= z -7.4e+26)
t_1
(if (<= z 2.8e+112)
(/ (fma (* 9.0 x) 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((a * -4.0), t, (((x / z) * 9.0) * y)) / c;
double tmp;
if (z <= -7.4e+26) {
tmp = t_1;
} else if (z <= 2.8e+112) {
tmp = fma((9.0 * x), 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(a * -4.0), t, Float64(Float64(Float64(x / z) * 9.0) * y)) / c) tmp = 0.0 if (z <= -7.4e+26) tmp = t_1; elseif (z <= 2.8e+112) tmp = Float64(fma(Float64(9.0 * x), 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[(a * -4.0), $MachinePrecision] * t + N[(N[(N[(x / z), $MachinePrecision] * 9.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -7.4e+26], t$95$1, If[LessEqual[z, 2.8e+112], N[(N[(N[(9.0 * x), $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(a \cdot -4, t, \left(\frac{x}{z} \cdot 9\right) \cdot y\right)}{c}\\
\mathbf{if}\;z \leq -7.4 \cdot 10^{+26}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 2.8 \cdot 10^{+112}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, 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 < -7.39999999999999977e26 or 2.8000000000000001e112 < z Initial program 54.6%
lift-/.f64N/A
div-invN/A
lift-+.f64N/A
flip-+N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
div-invN/A
Applied rewrites56.4%
Taylor expanded in z around inf
+-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites87.7%
Taylor expanded in c around -inf
Applied rewrites93.9%
Taylor expanded in b around 0
Applied rewrites86.6%
if -7.39999999999999977e26 < z < 2.8000000000000001e112Initial program 93.2%
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 rewrites91.5%
Final simplification89.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
(let* ((t_1 (/ (fma (* a -4.0) t (* (* (/ x z) 9.0) y)) c)))
(if (<= z -1.16e-52)
t_1
(if (<= z 5e+104) (/ (fma (* y x) 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((a * -4.0), t, (((x / z) * 9.0) * y)) / c;
double tmp;
if (z <= -1.16e-52) {
tmp = t_1;
} else if (z <= 5e+104) {
tmp = fma((y * x), 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(a * -4.0), t, Float64(Float64(Float64(x / z) * 9.0) * y)) / c) tmp = 0.0 if (z <= -1.16e-52) tmp = t_1; elseif (z <= 5e+104) tmp = Float64(fma(Float64(y * x), 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[(a * -4.0), $MachinePrecision] * t + N[(N[(N[(x / z), $MachinePrecision] * 9.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[z, -1.16e-52], t$95$1, If[LessEqual[z, 5e+104], N[(N[(N[(y * x), $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(a \cdot -4, t, \left(\frac{x}{z} \cdot 9\right) \cdot y\right)}{c}\\
\mathbf{if}\;z \leq -1.16 \cdot 10^{-52}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 5 \cdot 10^{+104}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -1.1599999999999999e-52 or 4.9999999999999997e104 < z Initial program 60.2%
lift-/.f64N/A
div-invN/A
lift-+.f64N/A
flip-+N/A
clear-numN/A
lift-*.f64N/A
associate-/r*N/A
frac-timesN/A
div-invN/A
Applied rewrites61.7%
Taylor expanded in z around inf
+-commutativeN/A
metadata-evalN/A
cancel-sign-sub-invN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower-*.f64N/A
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
Applied rewrites85.9%
Taylor expanded in c around -inf
Applied rewrites94.7%
Taylor expanded in b around 0
Applied rewrites84.3%
if -1.1599999999999999e-52 < z < 4.9999999999999997e104Initial program 93.2%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6480.4
Applied rewrites80.4%
Final simplification82.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.1e+163)
(* (* (/ t c) a) -4.0)
(if (<= z -1.16e-52)
(/ (fma (* 9.0 x) y (* (* (* t z) a) -4.0)) (* c z))
(if (<= z 9.5e+166)
(/ (fma (* y x) 9.0 b) (* c z))
(* (/ -4.0 c) (* t a))))))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.1e+163) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= -1.16e-52) {
tmp = fma((9.0 * x), y, (((t * z) * a) * -4.0)) / (c * z);
} else if (z <= 9.5e+166) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = (-4.0 / c) * (t * a);
}
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.1e+163) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (z <= -1.16e-52) tmp = Float64(fma(Float64(9.0 * x), y, Float64(Float64(Float64(t * z) * a) * -4.0)) / Float64(c * z)); elseif (z <= 9.5e+166) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(-4.0 / c) * Float64(t * a)); 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, -4.1e+163], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, -1.16e-52], N[(N[(N[(9.0 * x), $MachinePrecision] * y + N[(N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9.5e+166], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 / c), $MachinePrecision] * N[(t * a), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.1 \cdot 10^{+163}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;z \leq -1.16 \cdot 10^{-52}:\\
\;\;\;\;\frac{\mathsf{fma}\left(9 \cdot x, y, \left(\left(t \cdot z\right) \cdot a\right) \cdot -4\right)}{c \cdot z}\\
\mathbf{elif}\;z \leq 9.5 \cdot 10^{+166}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4}{c} \cdot \left(t \cdot a\right)\\
\end{array}
\end{array}
if z < -4.0999999999999999e163Initial program 29.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites40.1%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6477.3
Applied rewrites77.3%
Applied rewrites81.5%
if -4.0999999999999999e163 < z < -1.1599999999999999e-52Initial program 84.5%
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 rewrites82.2%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6470.9
Applied rewrites70.9%
if -1.1599999999999999e-52 < z < 9.49999999999999984e166Initial program 92.3%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6478.6
Applied rewrites78.6%
if 9.49999999999999984e166 < z Initial program 42.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites60.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6478.6
Applied rewrites78.6%
Applied rewrites78.8%
Final simplification77.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 -4.1e+163)
(* (* (/ t c) a) -4.0)
(if (<= z -1.85e-171)
(/ (fma (* y x) 9.0 (* (* (* t z) a) -4.0)) (* c z))
(if (<= z 9.5e+166)
(/ (fma (* y x) 9.0 b) (* c z))
(* (/ -4.0 c) (* t a))))))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.1e+163) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= -1.85e-171) {
tmp = fma((y * x), 9.0, (((t * z) * a) * -4.0)) / (c * z);
} else if (z <= 9.5e+166) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = (-4.0 / c) * (t * a);
}
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.1e+163) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (z <= -1.85e-171) tmp = Float64(fma(Float64(y * x), 9.0, Float64(Float64(Float64(t * z) * a) * -4.0)) / Float64(c * z)); elseif (z <= 9.5e+166) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(-4.0 / c) * Float64(t * a)); 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, -4.1e+163], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, -1.85e-171], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + N[(N[(N[(t * z), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision]), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9.5e+166], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 / c), $MachinePrecision] * N[(t * a), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -4.1 \cdot 10^{+163}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;z \leq -1.85 \cdot 10^{-171}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, \left(\left(t \cdot z\right) \cdot a\right) \cdot -4\right)}{c \cdot z}\\
\mathbf{elif}\;z \leq 9.5 \cdot 10^{+166}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4}{c} \cdot \left(t \cdot a\right)\\
\end{array}
\end{array}
if z < -4.0999999999999999e163Initial program 29.9%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites40.1%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6477.3
Applied rewrites77.3%
Applied rewrites81.5%
if -4.0999999999999999e163 < z < -1.85000000000000006e-171Initial program 86.3%
Taylor expanded in x around 0
cancel-sign-sub-invN/A
metadata-evalN/A
+-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6459.1
Applied rewrites59.1%
Taylor expanded in b around 0
cancel-sign-sub-invN/A
*-commutativeN/A
metadata-evalN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6469.6
Applied rewrites69.6%
if -1.85000000000000006e-171 < z < 9.49999999999999984e166Initial program 93.0%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6481.7
Applied rewrites81.7%
if 9.49999999999999984e166 < z Initial program 42.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites60.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6478.6
Applied rewrites78.6%
Applied rewrites78.8%
Final simplification77.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
(if (<= z -8.6e+64)
(* (* (* (/ 1.0 c) t) a) -4.0)
(if (<= z 9.5e+166)
(/ (fma (* y x) 9.0 b) (* c z))
(* (/ -4.0 c) (* t a)))))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 <= -8.6e+64) {
tmp = (((1.0 / c) * t) * a) * -4.0;
} else if (z <= 9.5e+166) {
tmp = fma((y * x), 9.0, b) / (c * z);
} else {
tmp = (-4.0 / c) * (t * a);
}
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 <= -8.6e+64) tmp = Float64(Float64(Float64(Float64(1.0 / c) * t) * a) * -4.0); elseif (z <= 9.5e+166) tmp = Float64(fma(Float64(y * x), 9.0, b) / Float64(c * z)); else tmp = Float64(Float64(-4.0 / c) * Float64(t * a)); 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, -8.6e+64], N[(N[(N[(N[(1.0 / c), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 9.5e+166], N[(N[(N[(y * x), $MachinePrecision] * 9.0 + b), $MachinePrecision] / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 / c), $MachinePrecision] * N[(t * a), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -8.6 \cdot 10^{+64}:\\
\;\;\;\;\left(\left(\frac{1}{c} \cdot t\right) \cdot a\right) \cdot -4\\
\mathbf{elif}\;z \leq 9.5 \cdot 10^{+166}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot x, 9, b\right)}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4}{c} \cdot \left(t \cdot a\right)\\
\end{array}
\end{array}
if z < -8.5999999999999995e64Initial program 56.7%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites63.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6468.6
Applied rewrites68.6%
Applied rewrites66.3%
if -8.5999999999999995e64 < z < 9.49999999999999984e166Initial program 91.6%
Taylor expanded in z around 0
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6476.4
Applied rewrites76.4%
if 9.49999999999999984e166 < z Initial program 42.1%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites60.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6478.6
Applied rewrites78.6%
Applied rewrites78.8%
Final simplification75.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 -7e-53) (* (* (/ t c) a) -4.0) (if (<= z 1e+92) (/ b (* c z)) (* (/ -4.0 c) (* t a)))))
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 <= -7e-53) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= 1e+92) {
tmp = b / (c * z);
} else {
tmp = (-4.0 / c) * (t * a);
}
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 <= (-7d-53)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (z <= 1d+92) then
tmp = b / (c * z)
else
tmp = ((-4.0d0) / c) * (t * a)
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 <= -7e-53) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= 1e+92) {
tmp = b / (c * z);
} else {
tmp = (-4.0 / c) * (t * a);
}
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 <= -7e-53: tmp = ((t / c) * a) * -4.0 elif z <= 1e+92: tmp = b / (c * z) else: tmp = (-4.0 / c) * (t * a) 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 <= -7e-53) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (z <= 1e+92) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(-4.0 / c) * Float64(t * a)); 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 <= -7e-53)
tmp = ((t / c) * a) * -4.0;
elseif (z <= 1e+92)
tmp = b / (c * z);
else
tmp = (-4.0 / c) * (t * a);
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -7e-53], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 1e+92], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(-4.0 / c), $MachinePrecision] * N[(t * a), $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])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -7 \cdot 10^{-53}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;z \leq 10^{+92}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{-4}{c} \cdot \left(t \cdot a\right)\\
\end{array}
\end{array}
if z < -6.99999999999999987e-53Initial program 66.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites74.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.4
Applied rewrites55.4%
Applied rewrites54.0%
if -6.99999999999999987e-53 < z < 1e92Initial program 93.0%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6449.1
Applied rewrites49.1%
if 1e92 < z Initial program 54.0%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites65.8%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.3
Applied rewrites71.3%
Applied rewrites71.4%
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 (if (<= z -7e-53) (* (* (/ t c) a) -4.0) (if (<= z 1e+92) (/ b (* c z)) (* (/ (* t a) c) -4.0))))
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 <= -7e-53) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= 1e+92) {
tmp = b / (c * z);
} else {
tmp = ((t * a) / c) * -4.0;
}
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 <= (-7d-53)) then
tmp = ((t / c) * a) * (-4.0d0)
else if (z <= 1d+92) then
tmp = b / (c * z)
else
tmp = ((t * a) / c) * (-4.0d0)
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 <= -7e-53) {
tmp = ((t / c) * a) * -4.0;
} else if (z <= 1e+92) {
tmp = b / (c * z);
} else {
tmp = ((t * a) / c) * -4.0;
}
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 <= -7e-53: tmp = ((t / c) * a) * -4.0 elif z <= 1e+92: tmp = b / (c * z) else: tmp = ((t * a) / c) * -4.0 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 <= -7e-53) tmp = Float64(Float64(Float64(t / c) * a) * -4.0); elseif (z <= 1e+92) tmp = Float64(b / Float64(c * z)); else tmp = Float64(Float64(Float64(t * a) / c) * -4.0); 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 <= -7e-53)
tmp = ((t / c) * a) * -4.0;
elseif (z <= 1e+92)
tmp = b / (c * z);
else
tmp = ((t * a) / c) * -4.0;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, b, and c should be sorted in increasing order before calling this function. 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, -7e-53], N[(N[(N[(t / c), $MachinePrecision] * a), $MachinePrecision] * -4.0), $MachinePrecision], If[LessEqual[z, 1e+92], N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $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 -7 \cdot 10^{-53}:\\
\;\;\;\;\left(\frac{t}{c} \cdot a\right) \cdot -4\\
\mathbf{elif}\;z \leq 10^{+92}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;\frac{t \cdot a}{c} \cdot -4\\
\end{array}
\end{array}
if z < -6.99999999999999987e-53Initial program 66.8%
lift-/.f64N/A
lift-*.f64N/A
associate-/r*N/A
lower-/.f64N/A
Applied rewrites74.5%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6455.4
Applied rewrites55.4%
Applied rewrites54.0%
if -6.99999999999999987e-53 < z < 1e92Initial program 93.0%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6449.1
Applied rewrites49.1%
if 1e92 < z Initial program 54.0%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6471.3
Applied rewrites71.3%
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 (* (/ (* t a) c) -4.0))) (if (<= z -7e-53) t_1 (if (<= z 1e+92) (/ 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 = ((t * a) / c) * -4.0;
double tmp;
if (z <= -7e-53) {
tmp = t_1;
} else if (z <= 1e+92) {
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 = ((t * a) / c) * (-4.0d0)
if (z <= (-7d-53)) then
tmp = t_1
else if (z <= 1d+92) 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 = ((t * a) / c) * -4.0;
double tmp;
if (z <= -7e-53) {
tmp = t_1;
} else if (z <= 1e+92) {
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 = ((t * a) / c) * -4.0 tmp = 0 if z <= -7e-53: tmp = t_1 elif z <= 1e+92: 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(t * a) / c) * -4.0) tmp = 0.0 if (z <= -7e-53) tmp = t_1; elseif (z <= 1e+92) 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 = ((t * a) / c) * -4.0;
tmp = 0.0;
if (z <= -7e-53)
tmp = t_1;
elseif (z <= 1e+92)
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[(t * a), $MachinePrecision] / c), $MachinePrecision] * -4.0), $MachinePrecision]}, If[LessEqual[z, -7e-53], t$95$1, If[LessEqual[z, 1e+92], 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{t \cdot a}{c} \cdot -4\\
\mathbf{if}\;z \leq -7 \cdot 10^{-53}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;z \leq 10^{+92}:\\
\;\;\;\;\frac{b}{c \cdot z}\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if z < -6.99999999999999987e-53 or 1e92 < z Initial program 61.2%
Taylor expanded in z around inf
*-commutativeN/A
lower-*.f64N/A
lower-/.f64N/A
*-commutativeN/A
lower-*.f6462.4
Applied rewrites62.4%
if -6.99999999999999987e-53 < z < 1e92Initial program 93.0%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6449.1
Applied rewrites49.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 78.6%
Taylor expanded in b around inf
lower-/.f64N/A
lower-*.f6434.1
Applied rewrites34.1%
(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 2024235
(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)))