
(FPCore (x y z t a b) :precision binary64 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
def code(x, y, z, t, a, b): return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b
\end{array}
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b) :precision binary64 (+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))
double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((x * 2.0d0) - (((y * 9.0d0) * z) * t)) + ((a * 27.0d0) * b)
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b);
}
def code(x, y, z, t, a, b): return ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b)
function code(x, y, z, t, a, b) return Float64(Float64(Float64(x * 2.0) - Float64(Float64(Float64(y * 9.0) * z) * t)) + Float64(Float64(a * 27.0) * b)) end
function tmp = code(x, y, z, t, a, b) tmp = ((x * 2.0) - (((y * 9.0) * z) * t)) + ((a * 27.0) * b); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(x * 2.0), $MachinePrecision] - N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] + N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot 2 - \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\right) + \left(a \cdot 27\right) \cdot b
\end{array}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= z 4.2e+14) (fma (* -9.0 (* t z)) y (fma (* b a) 27.0 (+ x x))) (fma (* b 27.0) a (fma (* -9.0 t) (* z y) (+ x x)))))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= 4.2e+14) {
tmp = fma((-9.0 * (t * z)), y, fma((b * a), 27.0, (x + x)));
} else {
tmp = fma((b * 27.0), a, fma((-9.0 * t), (z * y), (x + x)));
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= 4.2e+14) tmp = fma(Float64(-9.0 * Float64(t * z)), y, fma(Float64(b * a), 27.0, Float64(x + x))); else tmp = fma(Float64(b * 27.0), a, fma(Float64(-9.0 * t), Float64(z * y), Float64(x + x))); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 4.2e+14], N[(N[(-9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] * y + N[(N[(b * a), $MachinePrecision] * 27.0 + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b * 27.0), $MachinePrecision] * a + N[(N[(-9.0 * t), $MachinePrecision] * N[(z * y), $MachinePrecision] + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 4.2 \cdot 10^{+14}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot \left(t \cdot z\right), y, \mathsf{fma}\left(b \cdot a, 27, x + x\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(b \cdot 27, a, \mathsf{fma}\left(-9 \cdot t, z \cdot y, x + x\right)\right)\\
\end{array}
\end{array}
if z < 4.2e14Initial program 95.7%
Applied rewrites96.0%
if 4.2e14 < z Initial program 95.7%
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lower-fma.f64N/A
*-commutativeN/A
lower-*.f6496.3
lift--.f64N/A
sub-negate-revN/A
sub-flipN/A
distribute-neg-inN/A
lift-*.f64N/A
distribute-lft-neg-outN/A
add-flipN/A
remove-double-negN/A
*-lft-identityN/A
fp-cancel-sub-sign-invN/A
Applied rewrites96.4%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= y -4.4e-46) (fma (* -9.0 (* t z)) y (fma (* b a) 27.0 (+ x x))) (+ (fma (* (* y t) -9.0) z (fma (* 27.0 b) a x)) x)))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (y <= -4.4e-46) {
tmp = fma((-9.0 * (t * z)), y, fma((b * a), 27.0, (x + x)));
} else {
tmp = fma(((y * t) * -9.0), z, fma((27.0 * b), a, x)) + x;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (y <= -4.4e-46) tmp = fma(Float64(-9.0 * Float64(t * z)), y, fma(Float64(b * a), 27.0, Float64(x + x))); else tmp = Float64(fma(Float64(Float64(y * t) * -9.0), z, fma(Float64(27.0 * b), a, x)) + x); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[y, -4.4e-46], N[(N[(-9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] * y + N[(N[(b * a), $MachinePrecision] * 27.0 + N[(x + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y * t), $MachinePrecision] * -9.0), $MachinePrecision] * z + N[(N[(27.0 * b), $MachinePrecision] * a + x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq -4.4 \cdot 10^{-46}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot \left(t \cdot z\right), y, \mathsf{fma}\left(b \cdot a, 27, x + x\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(y \cdot t\right) \cdot -9, z, \mathsf{fma}\left(27 \cdot b, a, x\right)\right) + x\\
\end{array}
\end{array}
if y < -4.4000000000000002e-46Initial program 95.7%
Applied rewrites96.0%
if -4.4000000000000002e-46 < y Initial program 95.7%
Applied rewrites96.0%
Applied rewrites93.3%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= z 4e-139) (+ (fma (* (* z t) y) -9.0 (fma 27.0 (* a b) x)) x) (+ (fma (* -9.0 t) (* z y) (fma (* b a) 27.0 x)) x)))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= 4e-139) {
tmp = fma(((z * t) * y), -9.0, fma(27.0, (a * b), x)) + x;
} else {
tmp = fma((-9.0 * t), (z * y), fma((b * a), 27.0, x)) + x;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= 4e-139) tmp = Float64(fma(Float64(Float64(z * t) * y), -9.0, fma(27.0, Float64(a * b), x)) + x); else tmp = Float64(fma(Float64(-9.0 * t), Float64(z * y), fma(Float64(b * a), 27.0, x)) + x); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, 4e-139], N[(N[(N[(N[(z * t), $MachinePrecision] * y), $MachinePrecision] * -9.0 + N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(N[(N[(-9.0 * t), $MachinePrecision] * N[(z * y), $MachinePrecision] + N[(N[(b * a), $MachinePrecision] * 27.0 + x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 4 \cdot 10^{-139}:\\
\;\;\;\;\mathsf{fma}\left(\left(z \cdot t\right) \cdot y, -9, \mathsf{fma}\left(27, a \cdot b, x\right)\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot t, z \cdot y, \mathsf{fma}\left(b \cdot a, 27, x\right)\right) + x\\
\end{array}
\end{array}
if z < 4.00000000000000012e-139Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
lift-fma.f64N/A
add-flipN/A
sub-flipN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
remove-double-negN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f6495.7
Applied rewrites95.7%
if 4.00000000000000012e-139 < z Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= (* (* y 9.0) z) 4e+125) (+ (fma (* -9.0 t) (* z y) (fma (* b a) 27.0 x)) x) (+ (fma (* (* y t) -9.0) z (fma (* 27.0 b) a x)) x)))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (((y * 9.0) * z) <= 4e+125) {
tmp = fma((-9.0 * t), (z * y), fma((b * a), 27.0, x)) + x;
} else {
tmp = fma(((y * t) * -9.0), z, fma((27.0 * b), a, x)) + x;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (Float64(Float64(y * 9.0) * z) <= 4e+125) tmp = Float64(fma(Float64(-9.0 * t), Float64(z * y), fma(Float64(b * a), 27.0, x)) + x); else tmp = Float64(fma(Float64(Float64(y * t) * -9.0), z, fma(Float64(27.0 * b), a, x)) + x); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision], 4e+125], N[(N[(N[(-9.0 * t), $MachinePrecision] * N[(z * y), $MachinePrecision] + N[(N[(b * a), $MachinePrecision] * 27.0 + x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(N[(N[(N[(y * t), $MachinePrecision] * -9.0), $MachinePrecision] * z + N[(N[(27.0 * b), $MachinePrecision] * a + x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;\left(y \cdot 9\right) \cdot z \leq 4 \cdot 10^{+125}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot t, z \cdot y, \mathsf{fma}\left(b \cdot a, 27, x\right)\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(y \cdot t\right) \cdot -9, z, \mathsf{fma}\left(27 \cdot b, a, x\right)\right) + x\\
\end{array}
\end{array}
if (*.f64 (*.f64 y #s(literal 9 binary64)) z) < 3.9999999999999997e125Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
if 3.9999999999999997e125 < (*.f64 (*.f64 y #s(literal 9 binary64)) z) Initial program 95.7%
Applied rewrites96.0%
Applied rewrites93.3%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (<= z -3e+85) (+ (fma (* t z) (* -9.0 y) x) x) (+ (fma (* -9.0 t) (* z y) (fma (* b a) 27.0 x)) x)))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if (z <= -3e+85) {
tmp = fma((t * z), (-9.0 * y), x) + x;
} else {
tmp = fma((-9.0 * t), (z * y), fma((b * a), 27.0, x)) + x;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) tmp = 0.0 if (z <= -3e+85) tmp = Float64(fma(Float64(t * z), Float64(-9.0 * y), x) + x); else tmp = Float64(fma(Float64(-9.0 * t), Float64(z * y), fma(Float64(b * a), 27.0, x)) + x); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -3e+85], N[(N[(N[(t * z), $MachinePrecision] * N[(-9.0 * y), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], N[(N[(N[(-9.0 * t), $MachinePrecision] * N[(z * y), $MachinePrecision] + N[(N[(b * a), $MachinePrecision] * 27.0 + x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -3 \cdot 10^{+85}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot z, -9 \cdot y, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot t, z \cdot y, \mathsf{fma}\left(b \cdot a, 27, x\right)\right) + x\\
\end{array}
\end{array}
if z < -3e85Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
lift-*.f64N/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6464.2
Applied rewrites64.2%
if -3e85 < z Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* (* y 9.0) z) t)))
(if (<= t_1 -5e+306)
(+ (fma (* (* -9.0 z) t) y x) x)
(if (<= t_1 -1.56e+82)
(fma (* 27.0 b) a (* (* (* y z) t) -9.0))
(if (<= t_1 2e+117)
(+ (fma 27.0 (* a b) x) x)
(fma (* z t) (* y -9.0) (* (* 27.0 a) b)))))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = ((y * 9.0) * z) * t;
double tmp;
if (t_1 <= -5e+306) {
tmp = fma(((-9.0 * z) * t), y, x) + x;
} else if (t_1 <= -1.56e+82) {
tmp = fma((27.0 * b), a, (((y * z) * t) * -9.0));
} else if (t_1 <= 2e+117) {
tmp = fma(27.0, (a * b), x) + x;
} else {
tmp = fma((z * t), (y * -9.0), ((27.0 * a) * b));
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(Float64(y * 9.0) * z) * t) tmp = 0.0 if (t_1 <= -5e+306) tmp = Float64(fma(Float64(Float64(-9.0 * z) * t), y, x) + x); elseif (t_1 <= -1.56e+82) tmp = fma(Float64(27.0 * b), a, Float64(Float64(Float64(y * z) * t) * -9.0)); elseif (t_1 <= 2e+117) tmp = Float64(fma(27.0, Float64(a * b), x) + x); else tmp = fma(Float64(z * t), Float64(y * -9.0), Float64(Float64(27.0 * a) * b)); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+306], N[(N[(N[(N[(-9.0 * z), $MachinePrecision] * t), $MachinePrecision] * y + x), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, -1.56e+82], N[(N[(27.0 * b), $MachinePrecision] * a + N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+117], N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], N[(N[(z * t), $MachinePrecision] * N[(y * -9.0), $MachinePrecision] + N[(N[(27.0 * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+306}:\\
\;\;\;\;\mathsf{fma}\left(\left(-9 \cdot z\right) \cdot t, y, x\right) + x\\
\mathbf{elif}\;t\_1 \leq -1.56 \cdot 10^{+82}:\\
\;\;\;\;\mathsf{fma}\left(27 \cdot b, a, \left(\left(y \cdot z\right) \cdot t\right) \cdot -9\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+117}:\\
\;\;\;\;\mathsf{fma}\left(27, a \cdot b, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(z \cdot t, y \cdot -9, \left(27 \cdot a\right) \cdot b\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -4.99999999999999993e306Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
Applied rewrites64.3%
if -4.99999999999999993e306 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -1.56e82Initial program 95.7%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6466.6
Applied rewrites66.6%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
sub-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
remove-double-negN/A
lower-fma.f6467.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.2
Applied rewrites67.2%
if -1.56e82 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2.0000000000000001e117Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
if 2.0000000000000001e117 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) Initial program 95.7%
Applied rewrites96.0%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f6466.8
Applied rewrites66.8%
lift-fma.f64N/A
add-flipN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
sub-flipN/A
Applied rewrites66.6%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* (* y 9.0) z) t)))
(if (<= t_1 -5e+306)
(+ (fma (* (* -9.0 z) t) y x) x)
(if (<= t_1 -1.56e+82)
(fma (* 27.0 b) a (* (* (* y z) t) -9.0))
(if (<= t_1 2e+117)
(+ (fma 27.0 (* a b) x) x)
(fma (* -9.0 (* t z)) y (* 27.0 (* a b))))))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = ((y * 9.0) * z) * t;
double tmp;
if (t_1 <= -5e+306) {
tmp = fma(((-9.0 * z) * t), y, x) + x;
} else if (t_1 <= -1.56e+82) {
tmp = fma((27.0 * b), a, (((y * z) * t) * -9.0));
} else if (t_1 <= 2e+117) {
tmp = fma(27.0, (a * b), x) + x;
} else {
tmp = fma((-9.0 * (t * z)), y, (27.0 * (a * b)));
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(Float64(y * 9.0) * z) * t) tmp = 0.0 if (t_1 <= -5e+306) tmp = Float64(fma(Float64(Float64(-9.0 * z) * t), y, x) + x); elseif (t_1 <= -1.56e+82) tmp = fma(Float64(27.0 * b), a, Float64(Float64(Float64(y * z) * t) * -9.0)); elseif (t_1 <= 2e+117) tmp = Float64(fma(27.0, Float64(a * b), x) + x); else tmp = fma(Float64(-9.0 * Float64(t * z)), y, Float64(27.0 * Float64(a * b))); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+306], N[(N[(N[(N[(-9.0 * z), $MachinePrecision] * t), $MachinePrecision] * y + x), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, -1.56e+82], N[(N[(27.0 * b), $MachinePrecision] * a + N[(N[(N[(y * z), $MachinePrecision] * t), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+117], N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], N[(N[(-9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] * y + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+306}:\\
\;\;\;\;\mathsf{fma}\left(\left(-9 \cdot z\right) \cdot t, y, x\right) + x\\
\mathbf{elif}\;t\_1 \leq -1.56 \cdot 10^{+82}:\\
\;\;\;\;\mathsf{fma}\left(27 \cdot b, a, \left(\left(y \cdot z\right) \cdot t\right) \cdot -9\right)\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+117}:\\
\;\;\;\;\mathsf{fma}\left(27, a \cdot b, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(-9 \cdot \left(t \cdot z\right), y, 27 \cdot \left(a \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -4.99999999999999993e306Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
Applied rewrites64.3%
if -4.99999999999999993e306 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -1.56e82Initial program 95.7%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6466.6
Applied rewrites66.6%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
sub-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
lift-*.f64N/A
remove-double-negN/A
lower-fma.f6467.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.2
lift-*.f64N/A
*-commutativeN/A
lower-*.f6467.2
Applied rewrites67.2%
if -1.56e82 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2.0000000000000001e117Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
if 2.0000000000000001e117 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) Initial program 95.7%
Applied rewrites96.0%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f6466.8
Applied rewrites66.8%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b)) (t_2 (fma (* -9.0 (* t z)) y (* 27.0 (* a b)))))
(if (<= t_1 -4e+137)
t_2
(if (<= t_1 5e+48)
(+ (fma (* t z) (* -9.0 y) x) x)
(if (<= t_1 4e+170) (fma (* 27.0 b) a (+ x x)) t_2)))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = fma((-9.0 * (t * z)), y, (27.0 * (a * b)));
double tmp;
if (t_1 <= -4e+137) {
tmp = t_2;
} else if (t_1 <= 5e+48) {
tmp = fma((t * z), (-9.0 * y), x) + x;
} else if (t_1 <= 4e+170) {
tmp = fma((27.0 * b), a, (x + x));
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) t_2 = fma(Float64(-9.0 * Float64(t * z)), y, Float64(27.0 * Float64(a * b))) tmp = 0.0 if (t_1 <= -4e+137) tmp = t_2; elseif (t_1 <= 5e+48) tmp = Float64(fma(Float64(t * z), Float64(-9.0 * y), x) + x); elseif (t_1 <= 4e+170) tmp = fma(Float64(27.0 * b), a, Float64(x + x)); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-9.0 * N[(t * z), $MachinePrecision]), $MachinePrecision] * y + N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+137], t$95$2, If[LessEqual[t$95$1, 5e+48], N[(N[(N[(t * z), $MachinePrecision] * N[(-9.0 * y), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e+170], N[(N[(27.0 * b), $MachinePrecision] * a + N[(x + x), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
t_2 := \mathsf{fma}\left(-9 \cdot \left(t \cdot z\right), y, 27 \cdot \left(a \cdot b\right)\right)\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+137}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+48}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot z, -9 \cdot y, x\right) + x\\
\mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+170}:\\
\;\;\;\;\mathsf{fma}\left(27 \cdot b, a, x + x\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -4.0000000000000001e137 or 4.00000000000000014e170 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 95.7%
Applied rewrites96.0%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f6466.8
Applied rewrites66.8%
if -4.0000000000000001e137 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4.99999999999999973e48Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
lift-*.f64N/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6464.2
Applied rewrites64.2%
if 4.99999999999999973e48 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4.00000000000000014e170Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* (* y 9.0) z) t)))
(if (<= t_1 -5e+137)
(+ (fma (* y t) (* -9.0 z) x) x)
(if (<= t_1 2e-18)
(+ (fma 27.0 (* a b) x) x)
(+ (fma (* (* -9.0 z) t) y x) x)))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = ((y * 9.0) * z) * t;
double tmp;
if (t_1 <= -5e+137) {
tmp = fma((y * t), (-9.0 * z), x) + x;
} else if (t_1 <= 2e-18) {
tmp = fma(27.0, (a * b), x) + x;
} else {
tmp = fma(((-9.0 * z) * t), y, x) + x;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(Float64(y * 9.0) * z) * t) tmp = 0.0 if (t_1 <= -5e+137) tmp = Float64(fma(Float64(y * t), Float64(-9.0 * z), x) + x); elseif (t_1 <= 2e-18) tmp = Float64(fma(27.0, Float64(a * b), x) + x); else tmp = Float64(fma(Float64(Float64(-9.0 * z) * t), y, x) + x); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+137], N[(N[(N[(y * t), $MachinePrecision] * N[(-9.0 * z), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e-18], N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], N[(N[(N[(N[(-9.0 * z), $MachinePrecision] * t), $MachinePrecision] * y + x), $MachinePrecision] + x), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+137}:\\
\;\;\;\;\mathsf{fma}\left(y \cdot t, -9 \cdot z, x\right) + x\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\
\;\;\;\;\mathsf{fma}\left(27, a \cdot b, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\left(-9 \cdot z\right) \cdot t, y, x\right) + x\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.0000000000000002e137Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
remove-double-negN/A
lower-fma.f6462.4
Applied rewrites62.4%
if -5.0000000000000002e137 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2.0000000000000001e-18Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
if 2.0000000000000001e-18 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
*-commutativeN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
Applied rewrites64.3%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* (* y 9.0) z) t)))
(if (<= t_1 -5e+137)
(+ (fma (* y t) (* -9.0 z) x) x)
(if (<= t_1 2e-18)
(+ (fma 27.0 (* a b) x) x)
(+ (fma (* t z) (* -9.0 y) x) x)))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = ((y * 9.0) * z) * t;
double tmp;
if (t_1 <= -5e+137) {
tmp = fma((y * t), (-9.0 * z), x) + x;
} else if (t_1 <= 2e-18) {
tmp = fma(27.0, (a * b), x) + x;
} else {
tmp = fma((t * z), (-9.0 * y), x) + x;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(Float64(y * 9.0) * z) * t) tmp = 0.0 if (t_1 <= -5e+137) tmp = Float64(fma(Float64(y * t), Float64(-9.0 * z), x) + x); elseif (t_1 <= 2e-18) tmp = Float64(fma(27.0, Float64(a * b), x) + x); else tmp = Float64(fma(Float64(t * z), Float64(-9.0 * y), x) + x); end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+137], N[(N[(N[(y * t), $MachinePrecision] * N[(-9.0 * z), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e-18], N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], N[(N[(N[(t * z), $MachinePrecision] * N[(-9.0 * y), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\
\mathbf{if}\;t\_1 \leq -5 \cdot 10^{+137}:\\
\;\;\;\;\mathsf{fma}\left(y \cdot t, -9 \cdot z, x\right) + x\\
\mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\
\;\;\;\;\mathsf{fma}\left(27, a \cdot b, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot z, -9 \cdot y, x\right) + x\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.0000000000000002e137Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
remove-double-negN/A
lower-fma.f6462.4
Applied rewrites62.4%
if -5.0000000000000002e137 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 2.0000000000000001e-18Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
if 2.0000000000000001e-18 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
lift-*.f64N/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6464.2
Applied rewrites64.2%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* (* a 27.0) b)) (t_2 (+ (fma 27.0 (* a b) x) x)))
(if (<= t_1 -2e+33)
t_2
(if (<= t_1 5e+48) (+ (fma (* t z) (* -9.0 y) x) x) t_2))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = fma(27.0, (a * b), x) + x;
double tmp;
if (t_1 <= -2e+33) {
tmp = t_2;
} else if (t_1 <= 5e+48) {
tmp = fma((t * z), (-9.0 * y), x) + x;
} else {
tmp = t_2;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) t_2 = Float64(fma(27.0, Float64(a * b), x) + x) tmp = 0.0 if (t_1 <= -2e+33) tmp = t_2; elseif (t_1 <= 5e+48) tmp = Float64(fma(Float64(t * z), Float64(-9.0 * y), x) + x); else tmp = t_2; end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+33], t$95$2, If[LessEqual[t$95$1, 5e+48], N[(N[(N[(t * z), $MachinePrecision] * N[(-9.0 * y), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
t_2 := \mathsf{fma}\left(27, a \cdot b, x\right) + x\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+33}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+48}:\\
\;\;\;\;\mathsf{fma}\left(t \cdot z, -9 \cdot y, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.9999999999999999e33 or 4.99999999999999973e48 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
if -1.9999999999999999e33 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 4.99999999999999973e48Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
lift-+.f64N/A
+-commutativeN/A
add-flipN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
sub-flipN/A
lift-*.f64N/A
associate-*l*N/A
remove-double-negN/A
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lower-*.f64N/A
*-commutativeN/A
lower-*.f6464.2
Applied rewrites64.2%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (+ (* -9.0 (* t (* y z))) x)) (t_2 (* (* (* y 9.0) z) t)))
(if (<= t_2 -5e+137)
t_1
(if (<= t_2 4e+163) (+ (fma 27.0 (* a b) x) x) t_1))))assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (-9.0 * (t * (y * z))) + x;
double t_2 = ((y * 9.0) * z) * t;
double tmp;
if (t_2 <= -5e+137) {
tmp = t_1;
} else if (t_2 <= 4e+163) {
tmp = fma(27.0, (a * b), x) + x;
} else {
tmp = t_1;
}
return tmp;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(-9.0 * Float64(t * Float64(y * z))) + x) t_2 = Float64(Float64(Float64(y * 9.0) * z) * t) tmp = 0.0 if (t_2 <= -5e+137) tmp = t_1; elseif (t_2 <= 4e+163) tmp = Float64(fma(27.0, Float64(a * b), x) + x); else tmp = t_1; end return tmp end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(-9.0 * N[(t * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(y * 9.0), $MachinePrecision] * z), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$2, -5e+137], t$95$1, If[LessEqual[t$95$2, 4e+163], N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := -9 \cdot \left(t \cdot \left(y \cdot z\right)\right) + x\\
t_2 := \left(\left(y \cdot 9\right) \cdot z\right) \cdot t\\
\mathbf{if}\;t\_2 \leq -5 \cdot 10^{+137}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;t\_2 \leq 4 \cdot 10^{+163}:\\
\;\;\;\;\mathsf{fma}\left(27, a \cdot b, x\right) + x\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < -5.0000000000000002e137 or 3.9999999999999998e163 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
Taylor expanded in a around 0
lower-+.f64N/A
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6464.4
Applied rewrites64.4%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f64N/A
lower-*.f6440.5
Applied rewrites40.5%
if -5.0000000000000002e137 < (*.f64 (*.f64 (*.f64 y #s(literal 9 binary64)) z) t) < 3.9999999999999998e163Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (+ (fma 27.0 (* a b) x) x))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
return fma(27.0, (a * b), x) + x;
}
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) return Float64(fma(27.0, Float64(a * b), x) + x) end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(27.0 * N[(a * b), $MachinePrecision] + x), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\mathsf{fma}\left(27, a \cdot b, x\right) + x
\end{array}
Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (let* ((t_1 (* (* a 27.0) b)) (t_2 (+ (* 27.0 (* a b)) x))) (if (<= t_1 -2e+33) t_2 (if (<= t_1 5e+94) (* 2.0 x) t_2))))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = (27.0 * (a * b)) + x;
double tmp;
if (t_1 <= -2e+33) {
tmp = t_2;
} else if (t_1 <= 5e+94) {
tmp = 2.0 * x;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (a * 27.0d0) * b
t_2 = (27.0d0 * (a * b)) + x
if (t_1 <= (-2d+33)) then
tmp = t_2
else if (t_1 <= 5d+94) then
tmp = 2.0d0 * x
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = (27.0 * (a * b)) + x;
double tmp;
if (t_1 <= -2e+33) {
tmp = t_2;
} else if (t_1 <= 5e+94) {
tmp = 2.0 * x;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b t_2 = (27.0 * (a * b)) + x tmp = 0 if t_1 <= -2e+33: tmp = t_2 elif t_1 <= 5e+94: tmp = 2.0 * x else: tmp = t_2 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) t_2 = Float64(Float64(27.0 * Float64(a * b)) + x) tmp = 0.0 if (t_1 <= -2e+33) tmp = t_2; elseif (t_1 <= 5e+94) tmp = Float64(2.0 * x); else tmp = t_2; end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
t_2 = (27.0 * (a * b)) + x;
tmp = 0.0;
if (t_1 <= -2e+33)
tmp = t_2;
elseif (t_1 <= 5e+94)
tmp = 2.0 * x;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(N[(27.0 * N[(a * b), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+33], t$95$2, If[LessEqual[t$95$1, 5e+94], N[(2.0 * x), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
t_2 := 27 \cdot \left(a \cdot b\right) + x\\
\mathbf{if}\;t\_1 \leq -2 \cdot 10^{+33}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+94}:\\
\;\;\;\;2 \cdot x\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -1.9999999999999999e33 or 5.0000000000000001e94 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
lift-fma.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-+.f64N/A
lift-*.f64N/A
associate-+r+N/A
lift-fma.f64N/A
lower-+.f6465.2
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
Applied rewrites65.2%
Taylor expanded in x around 0
lower-*.f64N/A
lower-*.f6440.7
Applied rewrites40.7%
if -1.9999999999999999e33 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 5.0000000000000001e94Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
lift-fma.f64N/A
add-flipN/A
sub-flipN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
remove-double-negN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f6495.7
Applied rewrites95.7%
Taylor expanded in x around inf
lower-*.f6431.3
Applied rewrites31.3%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (let* ((t_1 (* (* a 27.0) b)) (t_2 (* a (* 27.0 b)))) (if (<= t_1 -4e+172) t_2 (if (<= t_1 5e+94) (* 2.0 x) t_2))))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = a * (27.0 * b);
double tmp;
if (t_1 <= -4e+172) {
tmp = t_2;
} else if (t_1 <= 5e+94) {
tmp = 2.0 * x;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (a * 27.0d0) * b
t_2 = a * (27.0d0 * b)
if (t_1 <= (-4d+172)) then
tmp = t_2
else if (t_1 <= 5d+94) then
tmp = 2.0d0 * x
else
tmp = t_2
end if
code = tmp
end function
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (a * 27.0) * b;
double t_2 = a * (27.0 * b);
double tmp;
if (t_1 <= -4e+172) {
tmp = t_2;
} else if (t_1 <= 5e+94) {
tmp = 2.0 * x;
} else {
tmp = t_2;
}
return tmp;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): t_1 = (a * 27.0) * b t_2 = a * (27.0 * b) tmp = 0 if t_1 <= -4e+172: tmp = t_2 elif t_1 <= 5e+94: tmp = 2.0 * x else: tmp = t_2 return tmp
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) t_1 = Float64(Float64(a * 27.0) * b) t_2 = Float64(a * Float64(27.0 * b)) tmp = 0.0 if (t_1 <= -4e+172) tmp = t_2; elseif (t_1 <= 5e+94) tmp = Float64(2.0 * x); else tmp = t_2; end return tmp end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = (a * 27.0) * b;
t_2 = a * (27.0 * b);
tmp = 0.0;
if (t_1 <= -4e+172)
tmp = t_2;
elseif (t_1 <= 5e+94)
tmp = 2.0 * x;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(a * 27.0), $MachinePrecision] * b), $MachinePrecision]}, Block[{t$95$2 = N[(a * N[(27.0 * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+172], t$95$2, If[LessEqual[t$95$1, 5e+94], N[(2.0 * x), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
\begin{array}{l}
t_1 := \left(a \cdot 27\right) \cdot b\\
t_2 := a \cdot \left(27 \cdot b\right)\\
\mathbf{if}\;t\_1 \leq -4 \cdot 10^{+172}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+94}:\\
\;\;\;\;2 \cdot x\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 a #s(literal 27 binary64)) b) < -4.0000000000000003e172 or 5.0000000000000001e94 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) Initial program 95.7%
Taylor expanded in y around 0
lower-fma.f64N/A
lower-*.f64N/A
lower-*.f6465.2
Applied rewrites65.2%
lift-fma.f64N/A
count-2-revN/A
lift-+.f64N/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-fma.f6465.2
lift-*.f64N/A
*-commutativeN/A
lift-*.f6465.2
lower-fma.f64N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
lift-*.f64N/A
*-lft-identityN/A
lift-+.f64N/A
remove-double-negN/A
lift-+.f64N/A
distribute-lft-neg-outN/A
distribute-rgt-neg-inN/A
Applied rewrites65.1%
Taylor expanded in a around inf
lower-*.f64N/A
lower-fma.f64N/A
lower-/.f64N/A
lower-*.f6457.3
Applied rewrites57.3%
Taylor expanded in x around 0
lower-*.f6435.7
Applied rewrites35.7%
if -4.0000000000000003e172 < (*.f64 (*.f64 a #s(literal 27 binary64)) b) < 5.0000000000000001e94Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
lift-fma.f64N/A
add-flipN/A
sub-flipN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
remove-double-negN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f6495.7
Applied rewrites95.7%
Taylor expanded in x around inf
lower-*.f6431.3
Applied rewrites31.3%
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* 2.0 x))
assert(x < y && y < z && z < t && t < a && a < b);
double code(double x, double y, double z, double t, double a, double b) {
return 2.0 * x;
}
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function.
module fmin_fmax_functions
implicit none
private
public fmax
public fmin
interface fmax
module procedure fmax88
module procedure fmax44
module procedure fmax84
module procedure fmax48
end interface
interface fmin
module procedure fmin88
module procedure fmin44
module procedure fmin84
module procedure fmin48
end interface
contains
real(8) function fmax88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(4) function fmax44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, max(x, y), y /= y), x /= x)
end function
real(8) function fmax84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmax48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
end function
real(8) function fmin88(x, y) result (res)
real(8), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(4) function fmin44(x, y) result (res)
real(4), intent (in) :: x
real(4), intent (in) :: y
res = merge(y, merge(x, min(x, y), y /= y), x /= x)
end function
real(8) function fmin84(x, y) result(res)
real(8), intent (in) :: x
real(4), intent (in) :: y
res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
end function
real(8) function fmin48(x, y) result(res)
real(4), intent (in) :: x
real(8), intent (in) :: y
res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
end function
end module
real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = 2.0d0 * x
end function
assert x < y && y < z && z < t && t < a && a < b;
public static double code(double x, double y, double z, double t, double a, double b) {
return 2.0 * x;
}
[x, y, z, t, a, b] = sort([x, y, z, t, a, b]) def code(x, y, z, t, a, b): return 2.0 * x
x, y, z, t, a, b = sort([x, y, z, t, a, b]) function code(x, y, z, t, a, b) return Float64(2.0 * x) end
x, y, z, t, a, b = num2cell(sort([x, y, z, t, a, b])){:}
function tmp = code(x, y, z, t, a, b)
tmp = 2.0 * x;
end
NOTE: x, y, z, t, a, and b should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(2.0 * x), $MachinePrecision]
\begin{array}{l}
[x, y, z, t, a, b] = \mathsf{sort}([x, y, z, t, a, b])\\
\\
2 \cdot x
\end{array}
Initial program 95.7%
lift-+.f64N/A
lift--.f64N/A
associate-+l-N/A
lift-*.f64N/A
*-commutativeN/A
count-2-revN/A
associate--l+N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites96.1%
lift-fma.f64N/A
add-flipN/A
sub-flipN/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
associate-*r*N/A
lift-*.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
*-commutativeN/A
remove-double-negN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lower-*.f6495.7
lift-fma.f64N/A
*-commutativeN/A
lower-fma.f6495.7
lift-*.f64N/A
*-commutativeN/A
lift-*.f6495.7
Applied rewrites95.7%
Taylor expanded in x around inf
lower-*.f6431.3
Applied rewrites31.3%
herbie shell --seed 2025156
(FPCore (x y z t a b)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, A"
:precision binary64
(+ (- (* x 2.0) (* (* (* y 9.0) z) t)) (* (* a 27.0) b)))