
(FPCore (x y z t a b c i j) :precision binary64 (+ (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i)))) (* j (- (* c a) (* y i)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
code = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}
def code(x, y, z, t, a, b, c, i, j): return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
function code(x, y, z, t, a, b, c, i, j) return Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(c * z) - Float64(t * i)))) + Float64(j * Float64(Float64(c * a) - Float64(y * i)))) end
function tmp = code(x, y, z, t, a, b, c, i, j) tmp = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i))); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(N[(c * z), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 22 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c i j) :precision binary64 (+ (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i)))) (* j (- (* c a) (* y i)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
code = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}
def code(x, y, z, t, a, b, c, i, j): return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
function code(x, y, z, t, a, b, c, i, j) return Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(c * z) - Float64(t * i)))) + Float64(j * Float64(Float64(c * a) - Float64(y * i)))) end
function tmp = code(x, y, z, t, a, b, c, i, j) tmp = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i))); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(N[(c * z), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right)
\end{array}
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1
(+
(* j (- (* a c) (* y i)))
(+ (* x (- (* y z) (* t a))) (* b (- (* t i) (* z c)))))))
(if (<= t_1 INFINITY)
t_1
(fma t (fma i b (- (* x a))) (- (* y (* x z)) (* c (* z b)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = (j * ((a * c) - (y * i))) + ((x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c))));
double tmp;
if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = fma(t, fma(i, b, -(x * a)), ((y * (x * z)) - (c * (z * b))));
}
return tmp;
}
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) + Float64(b * Float64(Float64(t * i) - Float64(z * c))))) tmp = 0.0 if (t_1 <= Inf) tmp = t_1; else tmp = fma(t, fma(i, b, Float64(-Float64(x * a))), Float64(Float64(y * Float64(x * z)) - Float64(c * Float64(z * b)))); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(t * N[(i * b + (-N[(x * a), $MachinePrecision])), $MachinePrecision] + N[(N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision] - N[(c * N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := j \cdot \left(a \cdot c - y \cdot i\right) + \left(x \cdot \left(y \cdot z - t \cdot a\right) + b \cdot \left(t \cdot i - z \cdot c\right)\right)\\
\mathbf{if}\;t_1 \leq \infty:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(t, \mathsf{fma}\left(i, b, -x \cdot a\right), y \cdot \left(x \cdot z\right) - c \cdot \left(z \cdot b\right)\right)\\
\end{array}
\end{array}
if (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i)))) < +inf.0Initial program 91.0%
if +inf.0 < (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i)))) Initial program 0.0%
sub-neg0.0%
+-commutative0.0%
associate-+l+0.0%
distribute-rgt-neg-in0.0%
+-commutative0.0%
fma-def4.7%
sub-neg4.7%
+-commutative4.7%
distribute-neg-in4.7%
unsub-neg4.7%
remove-double-neg4.7%
*-commutative4.7%
Simplified14.0%
Taylor expanded in t around 0 46.7%
fma-def46.7%
fma-def49.0%
associate-*r*49.0%
neg-mul-149.0%
+-commutative49.0%
*-commutative49.0%
*-commutative49.0%
mul-1-neg49.0%
distribute-lft-neg-in49.0%
cancel-sign-sub-inv49.0%
Simplified53.7%
Taylor expanded in z around inf 60.8%
Final simplification85.9%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1
(+
(* j (- (* a c) (* y i)))
(+ (* x (- (* y z) (* t a))) (* b (- (* t i) (* z c)))))))
(if (<= t_1 INFINITY) t_1 (* i (- (* t b) (* y j))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = (j * ((a * c) - (y * i))) + ((x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c))));
double tmp;
if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = i * ((t * b) - (y * j));
}
return tmp;
}
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = (j * ((a * c) - (y * i))) + ((x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c))));
double tmp;
if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_1;
} else {
tmp = i * ((t * b) - (y * j));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (j * ((a * c) - (y * i))) + ((x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c)))) tmp = 0 if t_1 <= math.inf: tmp = t_1 else: tmp = i * ((t * b) - (y * j)) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) + Float64(b * Float64(Float64(t * i) - Float64(z * c))))) tmp = 0.0 if (t_1 <= Inf) tmp = t_1; else tmp = Float64(i * Float64(Float64(t * b) - Float64(y * j))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = (j * ((a * c) - (y * i))) + ((x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c)))); tmp = 0.0; if (t_1 <= Inf) tmp = t_1; else tmp = i * ((t * b) - (y * j)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(i * N[(N[(t * b), $MachinePrecision] - N[(y * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := j \cdot \left(a \cdot c - y \cdot i\right) + \left(x \cdot \left(y \cdot z - t \cdot a\right) + b \cdot \left(t \cdot i - z \cdot c\right)\right)\\
\mathbf{if}\;t_1 \leq \infty:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;i \cdot \left(t \cdot b - y \cdot j\right)\\
\end{array}
\end{array}
if (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i)))) < +inf.0Initial program 91.0%
if +inf.0 < (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i)))) Initial program 0.0%
sub-neg0.0%
+-commutative0.0%
associate-+l+0.0%
distribute-rgt-neg-in0.0%
+-commutative0.0%
fma-def4.7%
sub-neg4.7%
+-commutative4.7%
distribute-neg-in4.7%
unsub-neg4.7%
remove-double-neg4.7%
*-commutative4.7%
Simplified14.0%
Taylor expanded in i around inf 51.6%
mul-1-neg51.6%
unsub-neg51.6%
Simplified51.6%
Final simplification84.3%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* j (- (* a c) (* y i))))
(t_2 (+ (* x (- (* y z) (* t a))) (* b (- (* t i) (* z c)))))
(t_3 (- (* t (* b i)) (* j (- (* y i) (* a c))))))
(if (<= j -1.8e+191)
t_1
(if (<= j -1.2e+169)
t_2
(if (<= j -4.2e+28)
t_3
(if (<= j 4.2e-151)
t_2
(if (<= j 1.42e-74)
(* t (- (* b i) (* x a)))
(if (<= j 3.5e-62)
(* z (- (* x y) (* b c)))
(if (<= j 7.5e-13)
t_3
(if (<= j 8e+19) t_2 (- t_1 (* b (* z c)))))))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = j * ((a * c) - (y * i));
double t_2 = (x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c)));
double t_3 = (t * (b * i)) - (j * ((y * i) - (a * c)));
double tmp;
if (j <= -1.8e+191) {
tmp = t_1;
} else if (j <= -1.2e+169) {
tmp = t_2;
} else if (j <= -4.2e+28) {
tmp = t_3;
} else if (j <= 4.2e-151) {
tmp = t_2;
} else if (j <= 1.42e-74) {
tmp = t * ((b * i) - (x * a));
} else if (j <= 3.5e-62) {
tmp = z * ((x * y) - (b * c));
} else if (j <= 7.5e-13) {
tmp = t_3;
} else if (j <= 8e+19) {
tmp = t_2;
} else {
tmp = t_1 - (b * (z * c));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = j * ((a * c) - (y * i))
t_2 = (x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c)))
t_3 = (t * (b * i)) - (j * ((y * i) - (a * c)))
if (j <= (-1.8d+191)) then
tmp = t_1
else if (j <= (-1.2d+169)) then
tmp = t_2
else if (j <= (-4.2d+28)) then
tmp = t_3
else if (j <= 4.2d-151) then
tmp = t_2
else if (j <= 1.42d-74) then
tmp = t * ((b * i) - (x * a))
else if (j <= 3.5d-62) then
tmp = z * ((x * y) - (b * c))
else if (j <= 7.5d-13) then
tmp = t_3
else if (j <= 8d+19) then
tmp = t_2
else
tmp = t_1 - (b * (z * c))
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 i, double j) {
double t_1 = j * ((a * c) - (y * i));
double t_2 = (x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c)));
double t_3 = (t * (b * i)) - (j * ((y * i) - (a * c)));
double tmp;
if (j <= -1.8e+191) {
tmp = t_1;
} else if (j <= -1.2e+169) {
tmp = t_2;
} else if (j <= -4.2e+28) {
tmp = t_3;
} else if (j <= 4.2e-151) {
tmp = t_2;
} else if (j <= 1.42e-74) {
tmp = t * ((b * i) - (x * a));
} else if (j <= 3.5e-62) {
tmp = z * ((x * y) - (b * c));
} else if (j <= 7.5e-13) {
tmp = t_3;
} else if (j <= 8e+19) {
tmp = t_2;
} else {
tmp = t_1 - (b * (z * c));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = j * ((a * c) - (y * i)) t_2 = (x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c))) t_3 = (t * (b * i)) - (j * ((y * i) - (a * c))) tmp = 0 if j <= -1.8e+191: tmp = t_1 elif j <= -1.2e+169: tmp = t_2 elif j <= -4.2e+28: tmp = t_3 elif j <= 4.2e-151: tmp = t_2 elif j <= 1.42e-74: tmp = t * ((b * i) - (x * a)) elif j <= 3.5e-62: tmp = z * ((x * y) - (b * c)) elif j <= 7.5e-13: tmp = t_3 elif j <= 8e+19: tmp = t_2 else: tmp = t_1 - (b * (z * c)) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(j * Float64(Float64(a * c) - Float64(y * i))) t_2 = Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) t_3 = Float64(Float64(t * Float64(b * i)) - Float64(j * Float64(Float64(y * i) - Float64(a * c)))) tmp = 0.0 if (j <= -1.8e+191) tmp = t_1; elseif (j <= -1.2e+169) tmp = t_2; elseif (j <= -4.2e+28) tmp = t_3; elseif (j <= 4.2e-151) tmp = t_2; elseif (j <= 1.42e-74) tmp = Float64(t * Float64(Float64(b * i) - Float64(x * a))); elseif (j <= 3.5e-62) tmp = Float64(z * Float64(Float64(x * y) - Float64(b * c))); elseif (j <= 7.5e-13) tmp = t_3; elseif (j <= 8e+19) tmp = t_2; else tmp = Float64(t_1 - Float64(b * Float64(z * c))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = j * ((a * c) - (y * i)); t_2 = (x * ((y * z) - (t * a))) + (b * ((t * i) - (z * c))); t_3 = (t * (b * i)) - (j * ((y * i) - (a * c))); tmp = 0.0; if (j <= -1.8e+191) tmp = t_1; elseif (j <= -1.2e+169) tmp = t_2; elseif (j <= -4.2e+28) tmp = t_3; elseif (j <= 4.2e-151) tmp = t_2; elseif (j <= 1.42e-74) tmp = t * ((b * i) - (x * a)); elseif (j <= 3.5e-62) tmp = z * ((x * y) - (b * c)); elseif (j <= 7.5e-13) tmp = t_3; elseif (j <= 8e+19) tmp = t_2; else tmp = t_1 - (b * (z * c)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(t * N[(b * i), $MachinePrecision]), $MachinePrecision] - N[(j * N[(N[(y * i), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[j, -1.8e+191], t$95$1, If[LessEqual[j, -1.2e+169], t$95$2, If[LessEqual[j, -4.2e+28], t$95$3, If[LessEqual[j, 4.2e-151], t$95$2, If[LessEqual[j, 1.42e-74], N[(t * N[(N[(b * i), $MachinePrecision] - N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 3.5e-62], N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[j, 7.5e-13], t$95$3, If[LessEqual[j, 8e+19], t$95$2, N[(t$95$1 - N[(b * N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := j \cdot \left(a \cdot c - y \cdot i\right)\\
t_2 := x \cdot \left(y \cdot z - t \cdot a\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
t_3 := t \cdot \left(b \cdot i\right) - j \cdot \left(y \cdot i - a \cdot c\right)\\
\mathbf{if}\;j \leq -1.8 \cdot 10^{+191}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;j \leq -1.2 \cdot 10^{+169}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;j \leq -4.2 \cdot 10^{+28}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;j \leq 4.2 \cdot 10^{-151}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;j \leq 1.42 \cdot 10^{-74}:\\
\;\;\;\;t \cdot \left(b \cdot i - x \cdot a\right)\\
\mathbf{elif}\;j \leq 3.5 \cdot 10^{-62}:\\
\;\;\;\;z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{elif}\;j \leq 7.5 \cdot 10^{-13}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;j \leq 8 \cdot 10^{+19}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;t_1 - b \cdot \left(z \cdot c\right)\\
\end{array}
\end{array}
if j < -1.8e191Initial program 85.6%
sub-neg85.6%
+-commutative85.6%
associate-+l+85.6%
distribute-rgt-neg-in85.6%
+-commutative85.6%
fma-def85.6%
sub-neg85.6%
+-commutative85.6%
distribute-neg-in85.6%
unsub-neg85.6%
remove-double-neg85.6%
*-commutative85.6%
Simplified85.6%
Taylor expanded in t around 0 76.5%
fma-def76.5%
fma-def76.5%
associate-*r*76.5%
neg-mul-176.5%
+-commutative76.5%
*-commutative76.5%
*-commutative76.5%
mul-1-neg76.5%
distribute-lft-neg-in76.5%
cancel-sign-sub-inv76.5%
Simplified76.5%
Taylor expanded in j around inf 95.2%
if -1.8e191 < j < -1.1999999999999999e169 or -4.19999999999999978e28 < j < 4.19999999999999981e-151 or 7.5000000000000004e-13 < j < 8e19Initial program 77.3%
+-commutative77.3%
fma-def77.3%
*-commutative77.3%
*-commutative77.3%
Simplified77.3%
Taylor expanded in j around 0 72.4%
if -1.1999999999999999e169 < j < -4.19999999999999978e28 or 3.5000000000000001e-62 < j < 7.5000000000000004e-13Initial program 73.0%
cancel-sign-sub73.0%
cancel-sign-sub-inv73.0%
*-commutative73.0%
remove-double-neg73.0%
*-commutative73.0%
Simplified73.0%
Taylor expanded in i around inf 76.9%
associate-*r*73.7%
*-commutative73.7%
associate-*r*79.6%
Simplified79.6%
if 4.19999999999999981e-151 < j < 1.4200000000000001e-74Initial program 48.3%
sub-neg48.3%
+-commutative48.3%
associate-+l+48.3%
distribute-rgt-neg-in48.3%
+-commutative48.3%
fma-def53.1%
sub-neg53.1%
+-commutative53.1%
distribute-neg-in53.1%
unsub-neg53.1%
remove-double-neg53.1%
*-commutative53.1%
Simplified53.1%
Taylor expanded in t around inf 71.7%
if 1.4200000000000001e-74 < j < 3.5000000000000001e-62Initial program 75.0%
sub-neg75.0%
+-commutative75.0%
associate-+l+75.0%
distribute-rgt-neg-in75.0%
+-commutative75.0%
fma-def100.0%
sub-neg100.0%
+-commutative100.0%
distribute-neg-in100.0%
unsub-neg100.0%
remove-double-neg100.0%
*-commutative100.0%
Simplified100.0%
Taylor expanded in t around 0 50.0%
fma-def50.0%
fma-def50.0%
associate-*r*50.0%
neg-mul-150.0%
+-commutative50.0%
*-commutative50.0%
*-commutative50.0%
mul-1-neg50.0%
distribute-lft-neg-in50.0%
cancel-sign-sub-inv50.0%
Simplified50.0%
Taylor expanded in z around inf 100.0%
if 8e19 < j Initial program 79.9%
cancel-sign-sub79.9%
cancel-sign-sub-inv79.9%
*-commutative79.9%
remove-double-neg79.9%
*-commutative79.9%
Simplified79.9%
Taylor expanded in c around inf 72.8%
mul-1-neg72.8%
*-commutative72.8%
associate-*r*74.1%
distribute-rgt-neg-in74.1%
*-commutative74.1%
Simplified74.1%
Final simplification76.0%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* b (- (* t i) (* z c))))
(t_2 (+ (- (* c (* a j)) (* a (* x t))) t_1))
(t_3 (* y (- (* x z) (* i j)))))
(if (<= y -1.02e+105)
t_3
(if (<= y 1.2e-62)
t_2
(if (<= y 4.6e+92)
(+ (* x (- (* y z) (* t a))) t_1)
(if (<= y 2.45e+140) t_2 t_3))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = b * ((t * i) - (z * c));
double t_2 = ((c * (a * j)) - (a * (x * t))) + t_1;
double t_3 = y * ((x * z) - (i * j));
double tmp;
if (y <= -1.02e+105) {
tmp = t_3;
} else if (y <= 1.2e-62) {
tmp = t_2;
} else if (y <= 4.6e+92) {
tmp = (x * ((y * z) - (t * a))) + t_1;
} else if (y <= 2.45e+140) {
tmp = t_2;
} else {
tmp = t_3;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = b * ((t * i) - (z * c))
t_2 = ((c * (a * j)) - (a * (x * t))) + t_1
t_3 = y * ((x * z) - (i * j))
if (y <= (-1.02d+105)) then
tmp = t_3
else if (y <= 1.2d-62) then
tmp = t_2
else if (y <= 4.6d+92) then
tmp = (x * ((y * z) - (t * a))) + t_1
else if (y <= 2.45d+140) then
tmp = t_2
else
tmp = t_3
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 i, double j) {
double t_1 = b * ((t * i) - (z * c));
double t_2 = ((c * (a * j)) - (a * (x * t))) + t_1;
double t_3 = y * ((x * z) - (i * j));
double tmp;
if (y <= -1.02e+105) {
tmp = t_3;
} else if (y <= 1.2e-62) {
tmp = t_2;
} else if (y <= 4.6e+92) {
tmp = (x * ((y * z) - (t * a))) + t_1;
} else if (y <= 2.45e+140) {
tmp = t_2;
} else {
tmp = t_3;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = b * ((t * i) - (z * c)) t_2 = ((c * (a * j)) - (a * (x * t))) + t_1 t_3 = y * ((x * z) - (i * j)) tmp = 0 if y <= -1.02e+105: tmp = t_3 elif y <= 1.2e-62: tmp = t_2 elif y <= 4.6e+92: tmp = (x * ((y * z) - (t * a))) + t_1 elif y <= 2.45e+140: tmp = t_2 else: tmp = t_3 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(b * Float64(Float64(t * i) - Float64(z * c))) t_2 = Float64(Float64(Float64(c * Float64(a * j)) - Float64(a * Float64(x * t))) + t_1) t_3 = Float64(y * Float64(Float64(x * z) - Float64(i * j))) tmp = 0.0 if (y <= -1.02e+105) tmp = t_3; elseif (y <= 1.2e-62) tmp = t_2; elseif (y <= 4.6e+92) tmp = Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) + t_1); elseif (y <= 2.45e+140) tmp = t_2; else tmp = t_3; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = b * ((t * i) - (z * c)); t_2 = ((c * (a * j)) - (a * (x * t))) + t_1; t_3 = y * ((x * z) - (i * j)); tmp = 0.0; if (y <= -1.02e+105) tmp = t_3; elseif (y <= 1.2e-62) tmp = t_2; elseif (y <= 4.6e+92) tmp = (x * ((y * z) - (t * a))) + t_1; elseif (y <= 2.45e+140) tmp = t_2; else tmp = t_3; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision] - N[(a * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.02e+105], t$95$3, If[LessEqual[y, 1.2e-62], t$95$2, If[LessEqual[y, 4.6e+92], N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], If[LessEqual[y, 2.45e+140], t$95$2, t$95$3]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(t \cdot i - z \cdot c\right)\\
t_2 := \left(c \cdot \left(a \cdot j\right) - a \cdot \left(x \cdot t\right)\right) + t_1\\
t_3 := y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{if}\;y \leq -1.02 \cdot 10^{+105}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;y \leq 1.2 \cdot 10^{-62}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;y \leq 4.6 \cdot 10^{+92}:\\
\;\;\;\;x \cdot \left(y \cdot z - t \cdot a\right) + t_1\\
\mathbf{elif}\;y \leq 2.45 \cdot 10^{+140}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;t_3\\
\end{array}
\end{array}
if y < -1.02e105 or 2.4499999999999998e140 < y Initial program 63.2%
sub-neg63.2%
+-commutative63.2%
associate-+l+63.2%
distribute-rgt-neg-in63.2%
+-commutative63.2%
fma-def65.9%
sub-neg65.9%
+-commutative65.9%
distribute-neg-in65.9%
unsub-neg65.9%
remove-double-neg65.9%
*-commutative65.9%
Simplified68.7%
Taylor expanded in t around 0 71.4%
fma-def72.7%
fma-def72.7%
associate-*r*72.7%
neg-mul-172.7%
+-commutative72.7%
*-commutative72.7%
*-commutative72.7%
mul-1-neg72.7%
distribute-lft-neg-in72.7%
cancel-sign-sub-inv72.7%
Simplified75.5%
Taylor expanded in y around inf 78.5%
*-commutative78.5%
mul-1-neg78.5%
unsub-neg78.5%
Simplified78.5%
if -1.02e105 < y < 1.19999999999999992e-62 or 4.59999999999999997e92 < y < 2.4499999999999998e140Initial program 81.9%
+-commutative81.9%
fma-def81.9%
*-commutative81.9%
*-commutative81.9%
Simplified81.9%
Taylor expanded in y around 0 73.5%
if 1.19999999999999992e-62 < y < 4.59999999999999997e92Initial program 75.6%
+-commutative75.6%
fma-def75.6%
*-commutative75.6%
*-commutative75.6%
Simplified75.6%
Taylor expanded in j around 0 67.7%
Final simplification74.1%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (- (* t (* b i)) (* j (- (* y i) (* a c)))))
(t_2 (* z (- (* x y) (* b c)))))
(if (<= z -9.5e-22)
t_2
(if (<= z -8.5e-239)
t_1
(if (<= z -1.95e-306)
(- (* c (* a j)) (* a (* x t)))
(if (<= z 9.6e+120) t_1 t_2))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = (t * (b * i)) - (j * ((y * i) - (a * c)));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -9.5e-22) {
tmp = t_2;
} else if (z <= -8.5e-239) {
tmp = t_1;
} else if (z <= -1.95e-306) {
tmp = (c * (a * j)) - (a * (x * t));
} else if (z <= 9.6e+120) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = (t * (b * i)) - (j * ((y * i) - (a * c)))
t_2 = z * ((x * y) - (b * c))
if (z <= (-9.5d-22)) then
tmp = t_2
else if (z <= (-8.5d-239)) then
tmp = t_1
else if (z <= (-1.95d-306)) then
tmp = (c * (a * j)) - (a * (x * t))
else if (z <= 9.6d+120) then
tmp = t_1
else
tmp = 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 i, double j) {
double t_1 = (t * (b * i)) - (j * ((y * i) - (a * c)));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -9.5e-22) {
tmp = t_2;
} else if (z <= -8.5e-239) {
tmp = t_1;
} else if (z <= -1.95e-306) {
tmp = (c * (a * j)) - (a * (x * t));
} else if (z <= 9.6e+120) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (t * (b * i)) - (j * ((y * i) - (a * c))) t_2 = z * ((x * y) - (b * c)) tmp = 0 if z <= -9.5e-22: tmp = t_2 elif z <= -8.5e-239: tmp = t_1 elif z <= -1.95e-306: tmp = (c * (a * j)) - (a * (x * t)) elif z <= 9.6e+120: tmp = t_1 else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(t * Float64(b * i)) - Float64(j * Float64(Float64(y * i) - Float64(a * c)))) t_2 = Float64(z * Float64(Float64(x * y) - Float64(b * c))) tmp = 0.0 if (z <= -9.5e-22) tmp = t_2; elseif (z <= -8.5e-239) tmp = t_1; elseif (z <= -1.95e-306) tmp = Float64(Float64(c * Float64(a * j)) - Float64(a * Float64(x * t))); elseif (z <= 9.6e+120) tmp = t_1; else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = (t * (b * i)) - (j * ((y * i) - (a * c))); t_2 = z * ((x * y) - (b * c)); tmp = 0.0; if (z <= -9.5e-22) tmp = t_2; elseif (z <= -8.5e-239) tmp = t_1; elseif (z <= -1.95e-306) tmp = (c * (a * j)) - (a * (x * t)); elseif (z <= 9.6e+120) tmp = t_1; else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(t * N[(b * i), $MachinePrecision]), $MachinePrecision] - N[(j * N[(N[(y * i), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -9.5e-22], t$95$2, If[LessEqual[z, -8.5e-239], t$95$1, If[LessEqual[z, -1.95e-306], N[(N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision] - N[(a * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 9.6e+120], t$95$1, t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := t \cdot \left(b \cdot i\right) - j \cdot \left(y \cdot i - a \cdot c\right)\\
t_2 := z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{if}\;z \leq -9.5 \cdot 10^{-22}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -8.5 \cdot 10^{-239}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -1.95 \cdot 10^{-306}:\\
\;\;\;\;c \cdot \left(a \cdot j\right) - a \cdot \left(x \cdot t\right)\\
\mathbf{elif}\;z \leq 9.6 \cdot 10^{+120}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -9.4999999999999994e-22 or 9.60000000000000004e120 < z Initial program 72.8%
sub-neg72.8%
+-commutative72.8%
associate-+l+72.8%
distribute-rgt-neg-in72.8%
+-commutative72.8%
fma-def73.6%
sub-neg73.6%
+-commutative73.6%
distribute-neg-in73.6%
unsub-neg73.6%
remove-double-neg73.6%
*-commutative73.6%
Simplified75.3%
Taylor expanded in t around 0 71.9%
fma-def72.8%
fma-def72.8%
associate-*r*72.8%
neg-mul-172.8%
+-commutative72.8%
*-commutative72.8%
*-commutative72.8%
mul-1-neg72.8%
distribute-lft-neg-in72.8%
cancel-sign-sub-inv72.8%
Simplified74.5%
Taylor expanded in z around inf 66.5%
if -9.4999999999999994e-22 < z < -8.49999999999999958e-239 or -1.95e-306 < z < 9.60000000000000004e120Initial program 81.2%
cancel-sign-sub81.2%
cancel-sign-sub-inv81.2%
*-commutative81.2%
remove-double-neg81.2%
*-commutative81.2%
Simplified81.2%
Taylor expanded in i around inf 67.3%
associate-*r*64.3%
*-commutative64.3%
associate-*r*63.7%
Simplified63.7%
if -8.49999999999999958e-239 < z < -1.95e-306Initial program 47.6%
+-commutative47.6%
fma-def47.6%
*-commutative47.6%
*-commutative47.6%
Simplified47.6%
Taylor expanded in y around 0 84.5%
Taylor expanded in b around 0 92.2%
Final simplification66.4%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (- (* c j) (* x t)))))
(if (<= z -1.12e+112)
(* y (* x z))
(if (<= z -4.4e-21)
(* z (* b (- c)))
(if (<= z -6.5e-84)
(* y (* i (- j)))
(if (<= z 3.7e-138)
t_1
(if (<= z 4.3e-116)
(* i (* t b))
(if (<= z 3.8e+162) t_1 (* c (* b (- z)))))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = a * ((c * j) - (x * t));
double tmp;
if (z <= -1.12e+112) {
tmp = y * (x * z);
} else if (z <= -4.4e-21) {
tmp = z * (b * -c);
} else if (z <= -6.5e-84) {
tmp = y * (i * -j);
} else if (z <= 3.7e-138) {
tmp = t_1;
} else if (z <= 4.3e-116) {
tmp = i * (t * b);
} else if (z <= 3.8e+162) {
tmp = t_1;
} else {
tmp = c * (b * -z);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: tmp
t_1 = a * ((c * j) - (x * t))
if (z <= (-1.12d+112)) then
tmp = y * (x * z)
else if (z <= (-4.4d-21)) then
tmp = z * (b * -c)
else if (z <= (-6.5d-84)) then
tmp = y * (i * -j)
else if (z <= 3.7d-138) then
tmp = t_1
else if (z <= 4.3d-116) then
tmp = i * (t * b)
else if (z <= 3.8d+162) then
tmp = t_1
else
tmp = c * (b * -z)
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 i, double j) {
double t_1 = a * ((c * j) - (x * t));
double tmp;
if (z <= -1.12e+112) {
tmp = y * (x * z);
} else if (z <= -4.4e-21) {
tmp = z * (b * -c);
} else if (z <= -6.5e-84) {
tmp = y * (i * -j);
} else if (z <= 3.7e-138) {
tmp = t_1;
} else if (z <= 4.3e-116) {
tmp = i * (t * b);
} else if (z <= 3.8e+162) {
tmp = t_1;
} else {
tmp = c * (b * -z);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * ((c * j) - (x * t)) tmp = 0 if z <= -1.12e+112: tmp = y * (x * z) elif z <= -4.4e-21: tmp = z * (b * -c) elif z <= -6.5e-84: tmp = y * (i * -j) elif z <= 3.7e-138: tmp = t_1 elif z <= 4.3e-116: tmp = i * (t * b) elif z <= 3.8e+162: tmp = t_1 else: tmp = c * (b * -z) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(Float64(c * j) - Float64(x * t))) tmp = 0.0 if (z <= -1.12e+112) tmp = Float64(y * Float64(x * z)); elseif (z <= -4.4e-21) tmp = Float64(z * Float64(b * Float64(-c))); elseif (z <= -6.5e-84) tmp = Float64(y * Float64(i * Float64(-j))); elseif (z <= 3.7e-138) tmp = t_1; elseif (z <= 4.3e-116) tmp = Float64(i * Float64(t * b)); elseif (z <= 3.8e+162) tmp = t_1; else tmp = Float64(c * Float64(b * Float64(-z))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = a * ((c * j) - (x * t)); tmp = 0.0; if (z <= -1.12e+112) tmp = y * (x * z); elseif (z <= -4.4e-21) tmp = z * (b * -c); elseif (z <= -6.5e-84) tmp = y * (i * -j); elseif (z <= 3.7e-138) tmp = t_1; elseif (z <= 4.3e-116) tmp = i * (t * b); elseif (z <= 3.8e+162) tmp = t_1; else tmp = c * (b * -z); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.12e+112], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -4.4e-21], N[(z * N[(b * (-c)), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -6.5e-84], N[(y * N[(i * (-j)), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.7e-138], t$95$1, If[LessEqual[z, 4.3e-116], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.8e+162], t$95$1, N[(c * N[(b * (-z)), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{if}\;z \leq -1.12 \cdot 10^{+112}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\mathbf{elif}\;z \leq -4.4 \cdot 10^{-21}:\\
\;\;\;\;z \cdot \left(b \cdot \left(-c\right)\right)\\
\mathbf{elif}\;z \leq -6.5 \cdot 10^{-84}:\\
\;\;\;\;y \cdot \left(i \cdot \left(-j\right)\right)\\
\mathbf{elif}\;z \leq 3.7 \cdot 10^{-138}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 4.3 \cdot 10^{-116}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;z \leq 3.8 \cdot 10^{+162}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;c \cdot \left(b \cdot \left(-z\right)\right)\\
\end{array}
\end{array}
if z < -1.12e112Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
associate-+l+71.1%
distribute-rgt-neg-in71.1%
+-commutative71.1%
fma-def73.7%
sub-neg73.7%
+-commutative73.7%
distribute-neg-in73.7%
unsub-neg73.7%
remove-double-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in t around 0 66.5%
fma-def66.5%
fma-def66.5%
associate-*r*66.5%
neg-mul-166.5%
+-commutative66.5%
*-commutative66.5%
*-commutative66.5%
mul-1-neg66.5%
distribute-lft-neg-in66.5%
cancel-sign-sub-inv66.5%
Simplified69.1%
Taylor expanded in z around inf 58.9%
Taylor expanded in y around inf 51.1%
if -1.12e112 < z < -4.4000000000000001e-21Initial program 72.6%
sub-neg72.6%
+-commutative72.6%
associate-+l+72.6%
distribute-rgt-neg-in72.6%
+-commutative72.6%
fma-def72.6%
sub-neg72.6%
+-commutative72.6%
distribute-neg-in72.6%
unsub-neg72.6%
remove-double-neg72.6%
*-commutative72.6%
Simplified76.2%
Taylor expanded in t around 0 75.1%
fma-def78.7%
fma-def78.7%
associate-*r*78.7%
neg-mul-178.7%
+-commutative78.7%
*-commutative78.7%
*-commutative78.7%
mul-1-neg78.7%
distribute-lft-neg-in78.7%
cancel-sign-sub-inv78.7%
Simplified82.3%
Taylor expanded in z around inf 68.2%
Taylor expanded in c around inf 47.1%
*-commutative47.1%
neg-mul-147.1%
distribute-lft-neg-in47.1%
*-commutative47.1%
associate-*l*47.2%
distribute-rgt-neg-in47.2%
*-commutative47.2%
Simplified47.2%
if -4.4000000000000001e-21 < z < -6.50000000000000022e-84Initial program 69.6%
sub-neg69.6%
+-commutative69.6%
associate-+l+69.6%
distribute-rgt-neg-in69.6%
+-commutative69.6%
fma-def69.6%
sub-neg69.6%
+-commutative69.6%
distribute-neg-in69.6%
unsub-neg69.6%
remove-double-neg69.6%
*-commutative69.6%
Simplified69.6%
Taylor expanded in t around 0 69.0%
fma-def69.0%
fma-def69.0%
associate-*r*69.0%
neg-mul-169.0%
+-commutative69.0%
*-commutative69.0%
*-commutative69.0%
mul-1-neg69.0%
distribute-lft-neg-in69.0%
cancel-sign-sub-inv69.0%
Simplified69.0%
Taylor expanded in j around inf 38.4%
Taylor expanded in c around 0 50.9%
associate-*r*50.9%
neg-mul-150.9%
Simplified50.9%
if -6.50000000000000022e-84 < z < 3.69999999999999991e-138 or 4.2999999999999997e-116 < z < 3.80000000000000024e162Initial program 78.7%
sub-neg78.7%
+-commutative78.7%
associate-+l+78.7%
distribute-rgt-neg-in78.7%
+-commutative78.7%
fma-def79.4%
sub-neg79.4%
+-commutative79.4%
distribute-neg-in79.4%
unsub-neg79.4%
remove-double-neg79.4%
*-commutative79.4%
Simplified81.6%
Taylor expanded in t around 0 83.3%
fma-def83.3%
fma-def84.1%
associate-*r*84.1%
neg-mul-184.1%
+-commutative84.1%
*-commutative84.1%
*-commutative84.1%
mul-1-neg84.1%
distribute-lft-neg-in84.1%
cancel-sign-sub-inv84.1%
Simplified84.1%
Taylor expanded in a around inf 52.3%
+-commutative52.3%
mul-1-neg52.3%
unsub-neg52.3%
*-commutative52.3%
Simplified52.3%
if 3.69999999999999991e-138 < z < 4.2999999999999997e-116Initial program 80.0%
sub-neg80.0%
+-commutative80.0%
associate-+l+80.0%
distribute-rgt-neg-in80.0%
+-commutative80.0%
fma-def80.0%
sub-neg80.0%
+-commutative80.0%
distribute-neg-in80.0%
unsub-neg80.0%
remove-double-neg80.0%
*-commutative80.0%
Simplified80.0%
Taylor expanded in t around inf 62.6%
Taylor expanded in i around inf 100.0%
if 3.80000000000000024e162 < z Initial program 73.7%
sub-neg73.7%
+-commutative73.7%
associate-+l+73.7%
distribute-rgt-neg-in73.7%
+-commutative73.7%
fma-def73.7%
sub-neg73.7%
+-commutative73.7%
distribute-neg-in73.7%
unsub-neg73.7%
remove-double-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in c around inf 59.8%
distribute-rgt-in59.8%
*-commutative59.8%
mul-1-neg59.8%
cancel-sign-sub-inv59.8%
*-commutative59.8%
distribute-rgt-out--59.8%
Simplified59.8%
Taylor expanded in a around 0 60.4%
associate-*r*60.4%
*-commutative60.4%
*-commutative60.4%
*-commutative60.4%
neg-mul-160.4%
Simplified60.4%
Final simplification53.5%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* b (- (* t i) (* z c))))
(t_2 (* c (- (* a j) (* z b))))
(t_3 (* y (- (* x z) (* i j)))))
(if (<= y -4.5e-14)
t_3
(if (<= y -2.4e-101)
t_1
(if (<= y 5.6e-236)
(* a (- (* c j) (* x t)))
(if (<= y 2.85e-64)
t_2
(if (<= y 1100.0) t_1 (if (<= y 5.5e+53) t_2 t_3))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = b * ((t * i) - (z * c));
double t_2 = c * ((a * j) - (z * b));
double t_3 = y * ((x * z) - (i * j));
double tmp;
if (y <= -4.5e-14) {
tmp = t_3;
} else if (y <= -2.4e-101) {
tmp = t_1;
} else if (y <= 5.6e-236) {
tmp = a * ((c * j) - (x * t));
} else if (y <= 2.85e-64) {
tmp = t_2;
} else if (y <= 1100.0) {
tmp = t_1;
} else if (y <= 5.5e+53) {
tmp = t_2;
} else {
tmp = t_3;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = b * ((t * i) - (z * c))
t_2 = c * ((a * j) - (z * b))
t_3 = y * ((x * z) - (i * j))
if (y <= (-4.5d-14)) then
tmp = t_3
else if (y <= (-2.4d-101)) then
tmp = t_1
else if (y <= 5.6d-236) then
tmp = a * ((c * j) - (x * t))
else if (y <= 2.85d-64) then
tmp = t_2
else if (y <= 1100.0d0) then
tmp = t_1
else if (y <= 5.5d+53) then
tmp = t_2
else
tmp = t_3
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 i, double j) {
double t_1 = b * ((t * i) - (z * c));
double t_2 = c * ((a * j) - (z * b));
double t_3 = y * ((x * z) - (i * j));
double tmp;
if (y <= -4.5e-14) {
tmp = t_3;
} else if (y <= -2.4e-101) {
tmp = t_1;
} else if (y <= 5.6e-236) {
tmp = a * ((c * j) - (x * t));
} else if (y <= 2.85e-64) {
tmp = t_2;
} else if (y <= 1100.0) {
tmp = t_1;
} else if (y <= 5.5e+53) {
tmp = t_2;
} else {
tmp = t_3;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = b * ((t * i) - (z * c)) t_2 = c * ((a * j) - (z * b)) t_3 = y * ((x * z) - (i * j)) tmp = 0 if y <= -4.5e-14: tmp = t_3 elif y <= -2.4e-101: tmp = t_1 elif y <= 5.6e-236: tmp = a * ((c * j) - (x * t)) elif y <= 2.85e-64: tmp = t_2 elif y <= 1100.0: tmp = t_1 elif y <= 5.5e+53: tmp = t_2 else: tmp = t_3 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(b * Float64(Float64(t * i) - Float64(z * c))) t_2 = Float64(c * Float64(Float64(a * j) - Float64(z * b))) t_3 = Float64(y * Float64(Float64(x * z) - Float64(i * j))) tmp = 0.0 if (y <= -4.5e-14) tmp = t_3; elseif (y <= -2.4e-101) tmp = t_1; elseif (y <= 5.6e-236) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif (y <= 2.85e-64) tmp = t_2; elseif (y <= 1100.0) tmp = t_1; elseif (y <= 5.5e+53) tmp = t_2; else tmp = t_3; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = b * ((t * i) - (z * c)); t_2 = c * ((a * j) - (z * b)); t_3 = y * ((x * z) - (i * j)); tmp = 0.0; if (y <= -4.5e-14) tmp = t_3; elseif (y <= -2.4e-101) tmp = t_1; elseif (y <= 5.6e-236) tmp = a * ((c * j) - (x * t)); elseif (y <= 2.85e-64) tmp = t_2; elseif (y <= 1100.0) tmp = t_1; elseif (y <= 5.5e+53) tmp = t_2; else tmp = t_3; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(c * N[(N[(a * j), $MachinePrecision] - N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.5e-14], t$95$3, If[LessEqual[y, -2.4e-101], t$95$1, If[LessEqual[y, 5.6e-236], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.85e-64], t$95$2, If[LessEqual[y, 1100.0], t$95$1, If[LessEqual[y, 5.5e+53], t$95$2, t$95$3]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := b \cdot \left(t \cdot i - z \cdot c\right)\\
t_2 := c \cdot \left(a \cdot j - z \cdot b\right)\\
t_3 := y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{if}\;y \leq -4.5 \cdot 10^{-14}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;y \leq -2.4 \cdot 10^{-101}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 5.6 \cdot 10^{-236}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;y \leq 2.85 \cdot 10^{-64}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;y \leq 1100:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 5.5 \cdot 10^{+53}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;t_3\\
\end{array}
\end{array}
if y < -4.4999999999999998e-14 or 5.49999999999999975e53 < y Initial program 69.6%
sub-neg69.6%
+-commutative69.6%
associate-+l+69.6%
distribute-rgt-neg-in69.6%
+-commutative69.6%
fma-def71.4%
sub-neg71.4%
+-commutative71.4%
distribute-neg-in71.4%
unsub-neg71.4%
remove-double-neg71.4%
*-commutative71.4%
Simplified73.2%
Taylor expanded in t around 0 74.1%
fma-def75.0%
fma-def75.0%
associate-*r*75.0%
neg-mul-175.0%
+-commutative75.0%
*-commutative75.0%
*-commutative75.0%
mul-1-neg75.0%
distribute-lft-neg-in75.0%
cancel-sign-sub-inv75.0%
Simplified76.8%
Taylor expanded in y around inf 69.9%
*-commutative69.9%
mul-1-neg69.9%
unsub-neg69.9%
Simplified69.9%
if -4.4999999999999998e-14 < y < -2.4e-101 or 2.8500000000000001e-64 < y < 1100Initial program 79.3%
sub-neg79.3%
+-commutative79.3%
associate-+l+79.3%
distribute-rgt-neg-in79.3%
+-commutative79.3%
fma-def79.3%
sub-neg79.3%
+-commutative79.3%
distribute-neg-in79.3%
unsub-neg79.3%
remove-double-neg79.3%
*-commutative79.3%
Simplified81.8%
Taylor expanded in t around 0 80.3%
fma-def80.3%
fma-def80.3%
associate-*r*80.3%
neg-mul-180.3%
+-commutative80.3%
*-commutative80.3%
*-commutative80.3%
mul-1-neg80.3%
distribute-lft-neg-in80.3%
cancel-sign-sub-inv80.3%
Simplified80.3%
Taylor expanded in b around inf 62.7%
if -2.4e-101 < y < 5.59999999999999973e-236Initial program 83.7%
sub-neg83.7%
+-commutative83.7%
associate-+l+83.7%
distribute-rgt-neg-in83.7%
+-commutative83.7%
fma-def83.7%
sub-neg83.7%
+-commutative83.7%
distribute-neg-in83.7%
unsub-neg83.7%
remove-double-neg83.7%
*-commutative83.7%
Simplified85.3%
Taylor expanded in t around 0 78.8%
fma-def78.8%
fma-def78.8%
associate-*r*78.8%
neg-mul-178.8%
+-commutative78.8%
*-commutative78.8%
*-commutative78.8%
mul-1-neg78.8%
distribute-lft-neg-in78.8%
cancel-sign-sub-inv78.8%
Simplified78.8%
Taylor expanded in a around inf 59.8%
+-commutative59.8%
mul-1-neg59.8%
unsub-neg59.8%
*-commutative59.8%
Simplified59.8%
if 5.59999999999999973e-236 < y < 2.8500000000000001e-64 or 1100 < y < 5.49999999999999975e53Initial program 76.7%
sub-neg76.7%
+-commutative76.7%
associate-+l+76.7%
distribute-rgt-neg-in76.7%
+-commutative76.7%
fma-def76.7%
sub-neg76.7%
+-commutative76.7%
distribute-neg-in76.7%
unsub-neg76.7%
remove-double-neg76.7%
*-commutative76.7%
Simplified76.7%
Taylor expanded in c around inf 65.5%
distribute-rgt-in65.5%
*-commutative65.5%
mul-1-neg65.5%
cancel-sign-sub-inv65.5%
*-commutative65.5%
distribute-rgt-out--65.5%
Simplified65.5%
Final simplification65.6%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* i (- (* t b) (* y j)))) (t_2 (* z (- (* x y) (* b c)))))
(if (<= z -4.3e-21)
t_2
(if (<= z -7.5e-84)
t_1
(if (<= z 1.4e-307)
(- (* c (* a j)) (* a (* x t)))
(if (<= z 1.15e-115)
t_1
(if (<= z 4.8e+46)
(* y (- (* x z) (* i j)))
(if (<= z 2.5e+126) (* j (- (* a c) (* y i))) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = i * ((t * b) - (y * j));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -4.3e-21) {
tmp = t_2;
} else if (z <= -7.5e-84) {
tmp = t_1;
} else if (z <= 1.4e-307) {
tmp = (c * (a * j)) - (a * (x * t));
} else if (z <= 1.15e-115) {
tmp = t_1;
} else if (z <= 4.8e+46) {
tmp = y * ((x * z) - (i * j));
} else if (z <= 2.5e+126) {
tmp = j * ((a * c) - (y * i));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = i * ((t * b) - (y * j))
t_2 = z * ((x * y) - (b * c))
if (z <= (-4.3d-21)) then
tmp = t_2
else if (z <= (-7.5d-84)) then
tmp = t_1
else if (z <= 1.4d-307) then
tmp = (c * (a * j)) - (a * (x * t))
else if (z <= 1.15d-115) then
tmp = t_1
else if (z <= 4.8d+46) then
tmp = y * ((x * z) - (i * j))
else if (z <= 2.5d+126) then
tmp = j * ((a * c) - (y * i))
else
tmp = 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 i, double j) {
double t_1 = i * ((t * b) - (y * j));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -4.3e-21) {
tmp = t_2;
} else if (z <= -7.5e-84) {
tmp = t_1;
} else if (z <= 1.4e-307) {
tmp = (c * (a * j)) - (a * (x * t));
} else if (z <= 1.15e-115) {
tmp = t_1;
} else if (z <= 4.8e+46) {
tmp = y * ((x * z) - (i * j));
} else if (z <= 2.5e+126) {
tmp = j * ((a * c) - (y * i));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = i * ((t * b) - (y * j)) t_2 = z * ((x * y) - (b * c)) tmp = 0 if z <= -4.3e-21: tmp = t_2 elif z <= -7.5e-84: tmp = t_1 elif z <= 1.4e-307: tmp = (c * (a * j)) - (a * (x * t)) elif z <= 1.15e-115: tmp = t_1 elif z <= 4.8e+46: tmp = y * ((x * z) - (i * j)) elif z <= 2.5e+126: tmp = j * ((a * c) - (y * i)) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(i * Float64(Float64(t * b) - Float64(y * j))) t_2 = Float64(z * Float64(Float64(x * y) - Float64(b * c))) tmp = 0.0 if (z <= -4.3e-21) tmp = t_2; elseif (z <= -7.5e-84) tmp = t_1; elseif (z <= 1.4e-307) tmp = Float64(Float64(c * Float64(a * j)) - Float64(a * Float64(x * t))); elseif (z <= 1.15e-115) tmp = t_1; elseif (z <= 4.8e+46) tmp = Float64(y * Float64(Float64(x * z) - Float64(i * j))); elseif (z <= 2.5e+126) tmp = Float64(j * Float64(Float64(a * c) - Float64(y * i))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = i * ((t * b) - (y * j)); t_2 = z * ((x * y) - (b * c)); tmp = 0.0; if (z <= -4.3e-21) tmp = t_2; elseif (z <= -7.5e-84) tmp = t_1; elseif (z <= 1.4e-307) tmp = (c * (a * j)) - (a * (x * t)); elseif (z <= 1.15e-115) tmp = t_1; elseif (z <= 4.8e+46) tmp = y * ((x * z) - (i * j)); elseif (z <= 2.5e+126) tmp = j * ((a * c) - (y * i)); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(N[(t * b), $MachinePrecision] - N[(y * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -4.3e-21], t$95$2, If[LessEqual[z, -7.5e-84], t$95$1, If[LessEqual[z, 1.4e-307], N[(N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision] - N[(a * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.15e-115], t$95$1, If[LessEqual[z, 4.8e+46], N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.5e+126], N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := i \cdot \left(t \cdot b - y \cdot j\right)\\
t_2 := z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{if}\;z \leq -4.3 \cdot 10^{-21}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -7.5 \cdot 10^{-84}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 1.4 \cdot 10^{-307}:\\
\;\;\;\;c \cdot \left(a \cdot j\right) - a \cdot \left(x \cdot t\right)\\
\mathbf{elif}\;z \leq 1.15 \cdot 10^{-115}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 4.8 \cdot 10^{+46}:\\
\;\;\;\;y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{elif}\;z \leq 2.5 \cdot 10^{+126}:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -4.2999999999999998e-21 or 2.49999999999999989e126 < z Initial program 73.8%
sub-neg73.8%
+-commutative73.8%
associate-+l+73.8%
distribute-rgt-neg-in73.8%
+-commutative73.8%
fma-def74.7%
sub-neg74.7%
+-commutative74.7%
distribute-neg-in74.7%
unsub-neg74.7%
remove-double-neg74.7%
*-commutative74.7%
Simplified75.6%
Taylor expanded in t around 0 73.0%
fma-def73.9%
fma-def73.9%
associate-*r*73.9%
neg-mul-173.9%
+-commutative73.9%
*-commutative73.9%
*-commutative73.9%
mul-1-neg73.9%
distribute-lft-neg-in73.9%
cancel-sign-sub-inv73.9%
Simplified75.6%
Taylor expanded in z around inf 67.4%
if -4.2999999999999998e-21 < z < -7.50000000000000026e-84 or 1.4e-307 < z < 1.14999999999999992e-115Initial program 75.5%
sub-neg75.5%
+-commutative75.5%
associate-+l+75.5%
distribute-rgt-neg-in75.5%
+-commutative75.5%
fma-def75.5%
sub-neg75.5%
+-commutative75.5%
distribute-neg-in75.5%
unsub-neg75.5%
remove-double-neg75.5%
*-commutative75.5%
Simplified77.6%
Taylor expanded in i around inf 69.6%
mul-1-neg69.6%
unsub-neg69.6%
Simplified69.6%
if -7.50000000000000026e-84 < z < 1.4e-307Initial program 75.9%
+-commutative75.9%
fma-def75.9%
*-commutative75.9%
*-commutative75.9%
Simplified75.9%
Taylor expanded in y around 0 77.5%
Taylor expanded in b around 0 64.4%
if 1.14999999999999992e-115 < z < 4.80000000000000017e46Initial program 80.4%
sub-neg80.4%
+-commutative80.4%
associate-+l+80.4%
distribute-rgt-neg-in80.4%
+-commutative80.4%
fma-def83.5%
sub-neg83.5%
+-commutative83.5%
distribute-neg-in83.5%
unsub-neg83.5%
remove-double-neg83.5%
*-commutative83.5%
Simplified83.5%
Taylor expanded in t around 0 93.5%
fma-def93.6%
fma-def96.7%
associate-*r*96.7%
neg-mul-196.7%
+-commutative96.7%
*-commutative96.7%
*-commutative96.7%
mul-1-neg96.7%
distribute-lft-neg-in96.7%
cancel-sign-sub-inv96.7%
Simplified96.7%
Taylor expanded in y around inf 53.4%
*-commutative53.4%
mul-1-neg53.4%
unsub-neg53.4%
Simplified53.4%
if 4.80000000000000017e46 < z < 2.49999999999999989e126Initial program 78.9%
sub-neg78.9%
+-commutative78.9%
associate-+l+78.9%
distribute-rgt-neg-in78.9%
+-commutative78.9%
fma-def78.9%
sub-neg78.9%
+-commutative78.9%
distribute-neg-in78.9%
unsub-neg78.9%
remove-double-neg78.9%
*-commutative78.9%
Simplified89.4%
Taylor expanded in t around 0 73.4%
fma-def73.4%
fma-def73.4%
associate-*r*73.4%
neg-mul-173.4%
+-commutative73.4%
*-commutative73.4%
*-commutative73.4%
mul-1-neg73.4%
distribute-lft-neg-in73.4%
cancel-sign-sub-inv73.4%
Simplified73.4%
Taylor expanded in j around inf 69.2%
Final simplification65.7%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* x (- (* y z) (* t a)))))
(if (<= x -5.8e+115)
t_1
(if (<= x 6.1e+31)
(- (* j (- (* a c) (* y i))) (* b (* z c)))
(if (<= x 1.08e+104)
(* z (- (* x y) (* b c)))
(if (<= x 2.6e+138) (- (* c (* a j)) (* a (* x t))) t_1))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = x * ((y * z) - (t * a));
double tmp;
if (x <= -5.8e+115) {
tmp = t_1;
} else if (x <= 6.1e+31) {
tmp = (j * ((a * c) - (y * i))) - (b * (z * c));
} else if (x <= 1.08e+104) {
tmp = z * ((x * y) - (b * c));
} else if (x <= 2.6e+138) {
tmp = (c * (a * j)) - (a * (x * t));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: tmp
t_1 = x * ((y * z) - (t * a))
if (x <= (-5.8d+115)) then
tmp = t_1
else if (x <= 6.1d+31) then
tmp = (j * ((a * c) - (y * i))) - (b * (z * c))
else if (x <= 1.08d+104) then
tmp = z * ((x * y) - (b * c))
else if (x <= 2.6d+138) then
tmp = (c * (a * j)) - (a * (x * t))
else
tmp = t_1
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 i, double j) {
double t_1 = x * ((y * z) - (t * a));
double tmp;
if (x <= -5.8e+115) {
tmp = t_1;
} else if (x <= 6.1e+31) {
tmp = (j * ((a * c) - (y * i))) - (b * (z * c));
} else if (x <= 1.08e+104) {
tmp = z * ((x * y) - (b * c));
} else if (x <= 2.6e+138) {
tmp = (c * (a * j)) - (a * (x * t));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = x * ((y * z) - (t * a)) tmp = 0 if x <= -5.8e+115: tmp = t_1 elif x <= 6.1e+31: tmp = (j * ((a * c) - (y * i))) - (b * (z * c)) elif x <= 1.08e+104: tmp = z * ((x * y) - (b * c)) elif x <= 2.6e+138: tmp = (c * (a * j)) - (a * (x * t)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(x * Float64(Float64(y * z) - Float64(t * a))) tmp = 0.0 if (x <= -5.8e+115) tmp = t_1; elseif (x <= 6.1e+31) tmp = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) - Float64(b * Float64(z * c))); elseif (x <= 1.08e+104) tmp = Float64(z * Float64(Float64(x * y) - Float64(b * c))); elseif (x <= 2.6e+138) tmp = Float64(Float64(c * Float64(a * j)) - Float64(a * Float64(x * t))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = x * ((y * z) - (t * a)); tmp = 0.0; if (x <= -5.8e+115) tmp = t_1; elseif (x <= 6.1e+31) tmp = (j * ((a * c) - (y * i))) - (b * (z * c)); elseif (x <= 1.08e+104) tmp = z * ((x * y) - (b * c)); elseif (x <= 2.6e+138) tmp = (c * (a * j)) - (a * (x * t)); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -5.8e+115], t$95$1, If[LessEqual[x, 6.1e+31], N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.08e+104], N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.6e+138], N[(N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision] - N[(a * N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := x \cdot \left(y \cdot z - t \cdot a\right)\\
\mathbf{if}\;x \leq -5.8 \cdot 10^{+115}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;x \leq 6.1 \cdot 10^{+31}:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right) - b \cdot \left(z \cdot c\right)\\
\mathbf{elif}\;x \leq 1.08 \cdot 10^{+104}:\\
\;\;\;\;z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{elif}\;x \leq 2.6 \cdot 10^{+138}:\\
\;\;\;\;c \cdot \left(a \cdot j\right) - a \cdot \left(x \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if x < -5.80000000000000009e115 or 2.6000000000000001e138 < x Initial program 75.3%
sub-neg75.3%
+-commutative75.3%
associate-+l+75.3%
distribute-rgt-neg-in75.3%
+-commutative75.3%
fma-def76.9%
sub-neg76.9%
+-commutative76.9%
distribute-neg-in76.9%
unsub-neg76.9%
remove-double-neg76.9%
*-commutative76.9%
Simplified81.5%
Taylor expanded in t around 0 60.2%
fma-def60.2%
fma-def61.8%
associate-*r*61.8%
neg-mul-161.8%
+-commutative61.8%
*-commutative61.8%
*-commutative61.8%
mul-1-neg61.8%
distribute-lft-neg-in61.8%
cancel-sign-sub-inv61.8%
Simplified61.8%
Taylor expanded in z around inf 69.7%
Taylor expanded in b around 0 60.2%
+-commutative60.2%
associate-*r*63.3%
associate-*r*63.3%
associate-*r*65.3%
associate-*r*65.3%
distribute-rgt-in71.4%
mul-1-neg71.4%
*-commutative71.4%
unsub-neg71.4%
Simplified71.4%
if -5.80000000000000009e115 < x < 6.10000000000000009e31Initial program 76.3%
cancel-sign-sub76.3%
cancel-sign-sub-inv76.3%
*-commutative76.3%
remove-double-neg76.3%
*-commutative76.3%
Simplified76.3%
Taylor expanded in c around inf 67.5%
mul-1-neg67.5%
*-commutative67.5%
associate-*r*66.4%
distribute-rgt-neg-in66.4%
*-commutative66.4%
Simplified66.4%
if 6.10000000000000009e31 < x < 1.07999999999999997e104Initial program 71.9%
sub-neg71.9%
+-commutative71.9%
associate-+l+71.9%
distribute-rgt-neg-in71.9%
+-commutative71.9%
fma-def79.0%
sub-neg79.0%
+-commutative79.0%
distribute-neg-in79.0%
unsub-neg79.0%
remove-double-neg79.0%
*-commutative79.0%
Simplified79.0%
Taylor expanded in t around 0 78.8%
fma-def78.8%
fma-def78.8%
associate-*r*78.8%
neg-mul-178.8%
+-commutative78.8%
*-commutative78.8%
*-commutative78.8%
mul-1-neg78.8%
distribute-lft-neg-in78.8%
cancel-sign-sub-inv78.8%
Simplified78.8%
Taylor expanded in z around inf 65.4%
if 1.07999999999999997e104 < x < 2.6000000000000001e138Initial program 72.2%
+-commutative72.2%
fma-def72.2%
*-commutative72.2%
*-commutative72.2%
Simplified72.2%
Taylor expanded in y around 0 99.8%
Taylor expanded in b around 0 99.8%
Final simplification68.5%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* z (* b (- c)))) (t_2 (* i (* y (- j)))))
(if (<= z -1.7e+111)
(* y (* x z))
(if (<= z -2.4e-21)
t_1
(if (<= z -2.3e-84)
t_2
(if (<= z 1.02e-138)
(* c (* a j))
(if (<= z 1.6e-69)
(* i (* t b))
(if (<= z 1.22e+131) t_2 t_1))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = z * (b * -c);
double t_2 = i * (y * -j);
double tmp;
if (z <= -1.7e+111) {
tmp = y * (x * z);
} else if (z <= -2.4e-21) {
tmp = t_1;
} else if (z <= -2.3e-84) {
tmp = t_2;
} else if (z <= 1.02e-138) {
tmp = c * (a * j);
} else if (z <= 1.6e-69) {
tmp = i * (t * b);
} else if (z <= 1.22e+131) {
tmp = t_2;
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = z * (b * -c)
t_2 = i * (y * -j)
if (z <= (-1.7d+111)) then
tmp = y * (x * z)
else if (z <= (-2.4d-21)) then
tmp = t_1
else if (z <= (-2.3d-84)) then
tmp = t_2
else if (z <= 1.02d-138) then
tmp = c * (a * j)
else if (z <= 1.6d-69) then
tmp = i * (t * b)
else if (z <= 1.22d+131) then
tmp = t_2
else
tmp = t_1
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 i, double j) {
double t_1 = z * (b * -c);
double t_2 = i * (y * -j);
double tmp;
if (z <= -1.7e+111) {
tmp = y * (x * z);
} else if (z <= -2.4e-21) {
tmp = t_1;
} else if (z <= -2.3e-84) {
tmp = t_2;
} else if (z <= 1.02e-138) {
tmp = c * (a * j);
} else if (z <= 1.6e-69) {
tmp = i * (t * b);
} else if (z <= 1.22e+131) {
tmp = t_2;
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = z * (b * -c) t_2 = i * (y * -j) tmp = 0 if z <= -1.7e+111: tmp = y * (x * z) elif z <= -2.4e-21: tmp = t_1 elif z <= -2.3e-84: tmp = t_2 elif z <= 1.02e-138: tmp = c * (a * j) elif z <= 1.6e-69: tmp = i * (t * b) elif z <= 1.22e+131: tmp = t_2 else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(z * Float64(b * Float64(-c))) t_2 = Float64(i * Float64(y * Float64(-j))) tmp = 0.0 if (z <= -1.7e+111) tmp = Float64(y * Float64(x * z)); elseif (z <= -2.4e-21) tmp = t_1; elseif (z <= -2.3e-84) tmp = t_2; elseif (z <= 1.02e-138) tmp = Float64(c * Float64(a * j)); elseif (z <= 1.6e-69) tmp = Float64(i * Float64(t * b)); elseif (z <= 1.22e+131) tmp = t_2; else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = z * (b * -c); t_2 = i * (y * -j); tmp = 0.0; if (z <= -1.7e+111) tmp = y * (x * z); elseif (z <= -2.4e-21) tmp = t_1; elseif (z <= -2.3e-84) tmp = t_2; elseif (z <= 1.02e-138) tmp = c * (a * j); elseif (z <= 1.6e-69) tmp = i * (t * b); elseif (z <= 1.22e+131) tmp = t_2; else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(z * N[(b * (-c)), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(y * (-j)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.7e+111], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.4e-21], t$95$1, If[LessEqual[z, -2.3e-84], t$95$2, If[LessEqual[z, 1.02e-138], N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.6e-69], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.22e+131], t$95$2, t$95$1]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := z \cdot \left(b \cdot \left(-c\right)\right)\\
t_2 := i \cdot \left(y \cdot \left(-j\right)\right)\\
\mathbf{if}\;z \leq -1.7 \cdot 10^{+111}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\mathbf{elif}\;z \leq -2.4 \cdot 10^{-21}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -2.3 \cdot 10^{-84}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq 1.02 \cdot 10^{-138}:\\
\;\;\;\;c \cdot \left(a \cdot j\right)\\
\mathbf{elif}\;z \leq 1.6 \cdot 10^{-69}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;z \leq 1.22 \cdot 10^{+131}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if z < -1.7000000000000001e111Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
associate-+l+71.1%
distribute-rgt-neg-in71.1%
+-commutative71.1%
fma-def73.7%
sub-neg73.7%
+-commutative73.7%
distribute-neg-in73.7%
unsub-neg73.7%
remove-double-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in t around 0 66.5%
fma-def66.5%
fma-def66.5%
associate-*r*66.5%
neg-mul-166.5%
+-commutative66.5%
*-commutative66.5%
*-commutative66.5%
mul-1-neg66.5%
distribute-lft-neg-in66.5%
cancel-sign-sub-inv66.5%
Simplified69.1%
Taylor expanded in z around inf 58.9%
Taylor expanded in y around inf 51.1%
if -1.7000000000000001e111 < z < -2.3999999999999999e-21 or 1.22e131 < z Initial program 75.5%
sub-neg75.5%
+-commutative75.5%
associate-+l+75.5%
distribute-rgt-neg-in75.5%
+-commutative75.5%
fma-def75.5%
sub-neg75.5%
+-commutative75.5%
distribute-neg-in75.5%
unsub-neg75.5%
remove-double-neg75.5%
*-commutative75.5%
Simplified76.9%
Taylor expanded in t around 0 75.3%
fma-def76.7%
fma-def76.7%
associate-*r*76.7%
neg-mul-176.7%
+-commutative76.7%
*-commutative76.7%
*-commutative76.7%
mul-1-neg76.7%
distribute-lft-neg-in76.7%
cancel-sign-sub-inv76.7%
Simplified78.1%
Taylor expanded in z around inf 68.9%
Taylor expanded in c around inf 51.5%
*-commutative51.5%
neg-mul-151.5%
distribute-lft-neg-in51.5%
*-commutative51.5%
associate-*l*49.0%
distribute-rgt-neg-in49.0%
*-commutative49.0%
Simplified49.0%
if -2.3999999999999999e-21 < z < -2.29999999999999981e-84 or 1.59999999999999999e-69 < z < 1.22e131Initial program 75.9%
sub-neg75.9%
+-commutative75.9%
associate-+l+75.9%
distribute-rgt-neg-in75.9%
+-commutative75.9%
fma-def77.5%
sub-neg77.5%
+-commutative77.5%
distribute-neg-in77.5%
unsub-neg77.5%
remove-double-neg77.5%
*-commutative77.5%
Simplified80.7%
Taylor expanded in i around inf 52.8%
mul-1-neg52.8%
unsub-neg52.8%
Simplified52.8%
Taylor expanded in t around 0 35.5%
associate-*r*35.5%
neg-mul-135.5%
Simplified35.5%
if -2.29999999999999981e-84 < z < 1.02000000000000007e-138Initial program 77.8%
sub-neg77.8%
+-commutative77.8%
associate-+l+77.8%
distribute-rgt-neg-in77.8%
+-commutative77.8%
fma-def77.8%
sub-neg77.8%
+-commutative77.8%
distribute-neg-in77.8%
unsub-neg77.8%
remove-double-neg77.8%
*-commutative77.8%
Simplified79.2%
Taylor expanded in c around inf 48.5%
distribute-rgt-in48.5%
*-commutative48.5%
mul-1-neg48.5%
cancel-sign-sub-inv48.5%
*-commutative48.5%
distribute-rgt-out--48.5%
Simplified48.5%
Taylor expanded in a around inf 42.9%
if 1.02000000000000007e-138 < z < 1.59999999999999999e-69Initial program 77.3%
sub-neg77.3%
+-commutative77.3%
associate-+l+77.3%
distribute-rgt-neg-in77.3%
+-commutative77.3%
fma-def77.3%
sub-neg77.3%
+-commutative77.3%
distribute-neg-in77.3%
unsub-neg77.3%
remove-double-neg77.3%
*-commutative77.3%
Simplified77.3%
Taylor expanded in t around inf 52.2%
Taylor expanded in i around inf 45.0%
Final simplification44.2%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* z (* b (- c)))) (t_2 (* y (* i (- j)))))
(if (<= z -7.5e+111)
(* y (* x z))
(if (<= z -2.25e-20)
t_1
(if (<= z -3.4e-84)
t_2
(if (<= z 2.2e-138)
(* c (* a j))
(if (<= z 3.8e-101) (* i (* t b)) (if (<= z 6e+130) t_2 t_1))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = z * (b * -c);
double t_2 = y * (i * -j);
double tmp;
if (z <= -7.5e+111) {
tmp = y * (x * z);
} else if (z <= -2.25e-20) {
tmp = t_1;
} else if (z <= -3.4e-84) {
tmp = t_2;
} else if (z <= 2.2e-138) {
tmp = c * (a * j);
} else if (z <= 3.8e-101) {
tmp = i * (t * b);
} else if (z <= 6e+130) {
tmp = t_2;
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = z * (b * -c)
t_2 = y * (i * -j)
if (z <= (-7.5d+111)) then
tmp = y * (x * z)
else if (z <= (-2.25d-20)) then
tmp = t_1
else if (z <= (-3.4d-84)) then
tmp = t_2
else if (z <= 2.2d-138) then
tmp = c * (a * j)
else if (z <= 3.8d-101) then
tmp = i * (t * b)
else if (z <= 6d+130) then
tmp = t_2
else
tmp = t_1
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 i, double j) {
double t_1 = z * (b * -c);
double t_2 = y * (i * -j);
double tmp;
if (z <= -7.5e+111) {
tmp = y * (x * z);
} else if (z <= -2.25e-20) {
tmp = t_1;
} else if (z <= -3.4e-84) {
tmp = t_2;
} else if (z <= 2.2e-138) {
tmp = c * (a * j);
} else if (z <= 3.8e-101) {
tmp = i * (t * b);
} else if (z <= 6e+130) {
tmp = t_2;
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = z * (b * -c) t_2 = y * (i * -j) tmp = 0 if z <= -7.5e+111: tmp = y * (x * z) elif z <= -2.25e-20: tmp = t_1 elif z <= -3.4e-84: tmp = t_2 elif z <= 2.2e-138: tmp = c * (a * j) elif z <= 3.8e-101: tmp = i * (t * b) elif z <= 6e+130: tmp = t_2 else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(z * Float64(b * Float64(-c))) t_2 = Float64(y * Float64(i * Float64(-j))) tmp = 0.0 if (z <= -7.5e+111) tmp = Float64(y * Float64(x * z)); elseif (z <= -2.25e-20) tmp = t_1; elseif (z <= -3.4e-84) tmp = t_2; elseif (z <= 2.2e-138) tmp = Float64(c * Float64(a * j)); elseif (z <= 3.8e-101) tmp = Float64(i * Float64(t * b)); elseif (z <= 6e+130) tmp = t_2; else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = z * (b * -c); t_2 = y * (i * -j); tmp = 0.0; if (z <= -7.5e+111) tmp = y * (x * z); elseif (z <= -2.25e-20) tmp = t_1; elseif (z <= -3.4e-84) tmp = t_2; elseif (z <= 2.2e-138) tmp = c * (a * j); elseif (z <= 3.8e-101) tmp = i * (t * b); elseif (z <= 6e+130) tmp = t_2; else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(z * N[(b * (-c)), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(i * (-j)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -7.5e+111], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -2.25e-20], t$95$1, If[LessEqual[z, -3.4e-84], t$95$2, If[LessEqual[z, 2.2e-138], N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.8e-101], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6e+130], t$95$2, t$95$1]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := z \cdot \left(b \cdot \left(-c\right)\right)\\
t_2 := y \cdot \left(i \cdot \left(-j\right)\right)\\
\mathbf{if}\;z \leq -7.5 \cdot 10^{+111}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\mathbf{elif}\;z \leq -2.25 \cdot 10^{-20}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -3.4 \cdot 10^{-84}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq 2.2 \cdot 10^{-138}:\\
\;\;\;\;c \cdot \left(a \cdot j\right)\\
\mathbf{elif}\;z \leq 3.8 \cdot 10^{-101}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;z \leq 6 \cdot 10^{+130}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if z < -7.49999999999999948e111Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
associate-+l+71.1%
distribute-rgt-neg-in71.1%
+-commutative71.1%
fma-def73.7%
sub-neg73.7%
+-commutative73.7%
distribute-neg-in73.7%
unsub-neg73.7%
remove-double-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in t around 0 66.5%
fma-def66.5%
fma-def66.5%
associate-*r*66.5%
neg-mul-166.5%
+-commutative66.5%
*-commutative66.5%
*-commutative66.5%
mul-1-neg66.5%
distribute-lft-neg-in66.5%
cancel-sign-sub-inv66.5%
Simplified69.1%
Taylor expanded in z around inf 58.9%
Taylor expanded in y around inf 51.1%
if -7.49999999999999948e111 < z < -2.2500000000000001e-20 or 5.9999999999999999e130 < z Initial program 75.5%
sub-neg75.5%
+-commutative75.5%
associate-+l+75.5%
distribute-rgt-neg-in75.5%
+-commutative75.5%
fma-def75.5%
sub-neg75.5%
+-commutative75.5%
distribute-neg-in75.5%
unsub-neg75.5%
remove-double-neg75.5%
*-commutative75.5%
Simplified76.9%
Taylor expanded in t around 0 75.3%
fma-def76.7%
fma-def76.7%
associate-*r*76.7%
neg-mul-176.7%
+-commutative76.7%
*-commutative76.7%
*-commutative76.7%
mul-1-neg76.7%
distribute-lft-neg-in76.7%
cancel-sign-sub-inv76.7%
Simplified78.1%
Taylor expanded in z around inf 68.9%
Taylor expanded in c around inf 51.5%
*-commutative51.5%
neg-mul-151.5%
distribute-lft-neg-in51.5%
*-commutative51.5%
associate-*l*49.0%
distribute-rgt-neg-in49.0%
*-commutative49.0%
Simplified49.0%
if -2.2500000000000001e-20 < z < -3.40000000000000021e-84 or 3.8000000000000001e-101 < z < 5.9999999999999999e130Initial program 76.5%
sub-neg76.5%
+-commutative76.5%
associate-+l+76.5%
distribute-rgt-neg-in76.5%
+-commutative76.5%
fma-def78.0%
sub-neg78.0%
+-commutative78.0%
distribute-neg-in78.0%
unsub-neg78.0%
remove-double-neg78.0%
*-commutative78.0%
Simplified80.9%
Taylor expanded in t around 0 82.2%
fma-def82.3%
fma-def83.7%
associate-*r*83.7%
neg-mul-183.7%
+-commutative83.7%
*-commutative83.7%
*-commutative83.7%
mul-1-neg83.7%
distribute-lft-neg-in83.7%
cancel-sign-sub-inv83.7%
Simplified83.7%
Taylor expanded in j around inf 52.5%
Taylor expanded in c around 0 36.8%
associate-*r*36.8%
neg-mul-136.8%
Simplified36.8%
if -3.40000000000000021e-84 < z < 2.1999999999999999e-138Initial program 77.8%
sub-neg77.8%
+-commutative77.8%
associate-+l+77.8%
distribute-rgt-neg-in77.8%
+-commutative77.8%
fma-def77.8%
sub-neg77.8%
+-commutative77.8%
distribute-neg-in77.8%
unsub-neg77.8%
remove-double-neg77.8%
*-commutative77.8%
Simplified79.2%
Taylor expanded in c around inf 48.5%
distribute-rgt-in48.5%
*-commutative48.5%
mul-1-neg48.5%
cancel-sign-sub-inv48.5%
*-commutative48.5%
distribute-rgt-out--48.5%
Simplified48.5%
Taylor expanded in a around inf 42.9%
if 2.1999999999999999e-138 < z < 3.8000000000000001e-101Initial program 72.9%
sub-neg72.9%
+-commutative72.9%
associate-+l+72.9%
distribute-rgt-neg-in72.9%
+-commutative72.9%
fma-def72.9%
sub-neg72.9%
+-commutative72.9%
distribute-neg-in72.9%
unsub-neg72.9%
remove-double-neg72.9%
*-commutative72.9%
Simplified72.9%
Taylor expanded in t around inf 52.8%
Taylor expanded in i around inf 64.9%
Final simplification44.9%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* y (* i (- j)))))
(if (<= z -2.2e+111)
(* y (* x z))
(if (<= z -1e-20)
(* z (* b (- c)))
(if (<= z -3.8e-86)
t_1
(if (<= z 2.35e-138)
(* c (* a j))
(if (<= z 7.8e-101)
(* i (* t b))
(if (<= z 5.3e+130) t_1 (* b (* z (- c)))))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = y * (i * -j);
double tmp;
if (z <= -2.2e+111) {
tmp = y * (x * z);
} else if (z <= -1e-20) {
tmp = z * (b * -c);
} else if (z <= -3.8e-86) {
tmp = t_1;
} else if (z <= 2.35e-138) {
tmp = c * (a * j);
} else if (z <= 7.8e-101) {
tmp = i * (t * b);
} else if (z <= 5.3e+130) {
tmp = t_1;
} else {
tmp = b * (z * -c);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: tmp
t_1 = y * (i * -j)
if (z <= (-2.2d+111)) then
tmp = y * (x * z)
else if (z <= (-1d-20)) then
tmp = z * (b * -c)
else if (z <= (-3.8d-86)) then
tmp = t_1
else if (z <= 2.35d-138) then
tmp = c * (a * j)
else if (z <= 7.8d-101) then
tmp = i * (t * b)
else if (z <= 5.3d+130) then
tmp = t_1
else
tmp = b * (z * -c)
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 i, double j) {
double t_1 = y * (i * -j);
double tmp;
if (z <= -2.2e+111) {
tmp = y * (x * z);
} else if (z <= -1e-20) {
tmp = z * (b * -c);
} else if (z <= -3.8e-86) {
tmp = t_1;
} else if (z <= 2.35e-138) {
tmp = c * (a * j);
} else if (z <= 7.8e-101) {
tmp = i * (t * b);
} else if (z <= 5.3e+130) {
tmp = t_1;
} else {
tmp = b * (z * -c);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = y * (i * -j) tmp = 0 if z <= -2.2e+111: tmp = y * (x * z) elif z <= -1e-20: tmp = z * (b * -c) elif z <= -3.8e-86: tmp = t_1 elif z <= 2.35e-138: tmp = c * (a * j) elif z <= 7.8e-101: tmp = i * (t * b) elif z <= 5.3e+130: tmp = t_1 else: tmp = b * (z * -c) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(y * Float64(i * Float64(-j))) tmp = 0.0 if (z <= -2.2e+111) tmp = Float64(y * Float64(x * z)); elseif (z <= -1e-20) tmp = Float64(z * Float64(b * Float64(-c))); elseif (z <= -3.8e-86) tmp = t_1; elseif (z <= 2.35e-138) tmp = Float64(c * Float64(a * j)); elseif (z <= 7.8e-101) tmp = Float64(i * Float64(t * b)); elseif (z <= 5.3e+130) tmp = t_1; else tmp = Float64(b * Float64(z * Float64(-c))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = y * (i * -j); tmp = 0.0; if (z <= -2.2e+111) tmp = y * (x * z); elseif (z <= -1e-20) tmp = z * (b * -c); elseif (z <= -3.8e-86) tmp = t_1; elseif (z <= 2.35e-138) tmp = c * (a * j); elseif (z <= 7.8e-101) tmp = i * (t * b); elseif (z <= 5.3e+130) tmp = t_1; else tmp = b * (z * -c); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(y * N[(i * (-j)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.2e+111], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1e-20], N[(z * N[(b * (-c)), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -3.8e-86], t$95$1, If[LessEqual[z, 2.35e-138], N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 7.8e-101], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.3e+130], t$95$1, N[(b * N[(z * (-c)), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := y \cdot \left(i \cdot \left(-j\right)\right)\\
\mathbf{if}\;z \leq -2.2 \cdot 10^{+111}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\mathbf{elif}\;z \leq -1 \cdot 10^{-20}:\\
\;\;\;\;z \cdot \left(b \cdot \left(-c\right)\right)\\
\mathbf{elif}\;z \leq -3.8 \cdot 10^{-86}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 2.35 \cdot 10^{-138}:\\
\;\;\;\;c \cdot \left(a \cdot j\right)\\
\mathbf{elif}\;z \leq 7.8 \cdot 10^{-101}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;z \leq 5.3 \cdot 10^{+130}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(z \cdot \left(-c\right)\right)\\
\end{array}
\end{array}
if z < -2.19999999999999999e111Initial program 71.1%
sub-neg71.1%
+-commutative71.1%
associate-+l+71.1%
distribute-rgt-neg-in71.1%
+-commutative71.1%
fma-def73.7%
sub-neg73.7%
+-commutative73.7%
distribute-neg-in73.7%
unsub-neg73.7%
remove-double-neg73.7%
*-commutative73.7%
Simplified73.7%
Taylor expanded in t around 0 66.5%
fma-def66.5%
fma-def66.5%
associate-*r*66.5%
neg-mul-166.5%
+-commutative66.5%
*-commutative66.5%
*-commutative66.5%
mul-1-neg66.5%
distribute-lft-neg-in66.5%
cancel-sign-sub-inv66.5%
Simplified69.1%
Taylor expanded in z around inf 58.9%
Taylor expanded in y around inf 51.1%
if -2.19999999999999999e111 < z < -9.99999999999999945e-21Initial program 72.6%
sub-neg72.6%
+-commutative72.6%
associate-+l+72.6%
distribute-rgt-neg-in72.6%
+-commutative72.6%
fma-def72.6%
sub-neg72.6%
+-commutative72.6%
distribute-neg-in72.6%
unsub-neg72.6%
remove-double-neg72.6%
*-commutative72.6%
Simplified76.2%
Taylor expanded in t around 0 75.1%
fma-def78.7%
fma-def78.7%
associate-*r*78.7%
neg-mul-178.7%
+-commutative78.7%
*-commutative78.7%
*-commutative78.7%
mul-1-neg78.7%
distribute-lft-neg-in78.7%
cancel-sign-sub-inv78.7%
Simplified82.3%
Taylor expanded in z around inf 68.2%
Taylor expanded in c around inf 47.1%
*-commutative47.1%
neg-mul-147.1%
distribute-lft-neg-in47.1%
*-commutative47.1%
associate-*l*47.2%
distribute-rgt-neg-in47.2%
*-commutative47.2%
Simplified47.2%
if -9.99999999999999945e-21 < z < -3.8e-86 or 7.80000000000000031e-101 < z < 5.2999999999999997e130Initial program 76.5%
sub-neg76.5%
+-commutative76.5%
associate-+l+76.5%
distribute-rgt-neg-in76.5%
+-commutative76.5%
fma-def78.0%
sub-neg78.0%
+-commutative78.0%
distribute-neg-in78.0%
unsub-neg78.0%
remove-double-neg78.0%
*-commutative78.0%
Simplified80.9%
Taylor expanded in t around 0 82.2%
fma-def82.3%
fma-def83.7%
associate-*r*83.7%
neg-mul-183.7%
+-commutative83.7%
*-commutative83.7%
*-commutative83.7%
mul-1-neg83.7%
distribute-lft-neg-in83.7%
cancel-sign-sub-inv83.7%
Simplified83.7%
Taylor expanded in j around inf 52.5%
Taylor expanded in c around 0 36.8%
associate-*r*36.8%
neg-mul-136.8%
Simplified36.8%
if -3.8e-86 < z < 2.3500000000000001e-138Initial program 77.8%
sub-neg77.8%
+-commutative77.8%
associate-+l+77.8%
distribute-rgt-neg-in77.8%
+-commutative77.8%
fma-def77.8%
sub-neg77.8%
+-commutative77.8%
distribute-neg-in77.8%
unsub-neg77.8%
remove-double-neg77.8%
*-commutative77.8%
Simplified79.2%
Taylor expanded in c around inf 48.5%
distribute-rgt-in48.5%
*-commutative48.5%
mul-1-neg48.5%
cancel-sign-sub-inv48.5%
*-commutative48.5%
distribute-rgt-out--48.5%
Simplified48.5%
Taylor expanded in a around inf 42.9%
if 2.3500000000000001e-138 < z < 7.80000000000000031e-101Initial program 72.9%
sub-neg72.9%
+-commutative72.9%
associate-+l+72.9%
distribute-rgt-neg-in72.9%
+-commutative72.9%
fma-def72.9%
sub-neg72.9%
+-commutative72.9%
distribute-neg-in72.9%
unsub-neg72.9%
remove-double-neg72.9%
*-commutative72.9%
Simplified72.9%
Taylor expanded in t around inf 52.8%
Taylor expanded in i around inf 64.9%
if 5.2999999999999997e130 < z Initial program 77.4%
sub-neg77.4%
+-commutative77.4%
associate-+l+77.4%
distribute-rgt-neg-in77.4%
+-commutative77.4%
fma-def77.4%
sub-neg77.4%
+-commutative77.4%
distribute-neg-in77.4%
unsub-neg77.4%
remove-double-neg77.4%
*-commutative77.4%
Simplified77.4%
Taylor expanded in t around 0 75.4%
fma-def75.4%
fma-def75.4%
associate-*r*75.4%
neg-mul-175.4%
+-commutative75.4%
*-commutative75.4%
*-commutative75.4%
mul-1-neg75.4%
distribute-lft-neg-in75.4%
cancel-sign-sub-inv75.4%
Simplified75.4%
Taylor expanded in b around inf 62.8%
Taylor expanded in i around 0 54.3%
*-commutative54.3%
neg-mul-154.3%
Simplified54.3%
Final simplification45.6%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* c (- (* a j) (* z b)))) (t_2 (* y (- (* x z) (* i j)))))
(if (<= y -8.8e-30)
t_2
(if (<= y -7.5e-168)
t_1
(if (<= y 6.5e-237)
(* a (- (* c j) (* x t)))
(if (<= y 4.8e+52) t_1 t_2))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = c * ((a * j) - (z * b));
double t_2 = y * ((x * z) - (i * j));
double tmp;
if (y <= -8.8e-30) {
tmp = t_2;
} else if (y <= -7.5e-168) {
tmp = t_1;
} else if (y <= 6.5e-237) {
tmp = a * ((c * j) - (x * t));
} else if (y <= 4.8e+52) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = c * ((a * j) - (z * b))
t_2 = y * ((x * z) - (i * j))
if (y <= (-8.8d-30)) then
tmp = t_2
else if (y <= (-7.5d-168)) then
tmp = t_1
else if (y <= 6.5d-237) then
tmp = a * ((c * j) - (x * t))
else if (y <= 4.8d+52) then
tmp = t_1
else
tmp = 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 i, double j) {
double t_1 = c * ((a * j) - (z * b));
double t_2 = y * ((x * z) - (i * j));
double tmp;
if (y <= -8.8e-30) {
tmp = t_2;
} else if (y <= -7.5e-168) {
tmp = t_1;
} else if (y <= 6.5e-237) {
tmp = a * ((c * j) - (x * t));
} else if (y <= 4.8e+52) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = c * ((a * j) - (z * b)) t_2 = y * ((x * z) - (i * j)) tmp = 0 if y <= -8.8e-30: tmp = t_2 elif y <= -7.5e-168: tmp = t_1 elif y <= 6.5e-237: tmp = a * ((c * j) - (x * t)) elif y <= 4.8e+52: tmp = t_1 else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(c * Float64(Float64(a * j) - Float64(z * b))) t_2 = Float64(y * Float64(Float64(x * z) - Float64(i * j))) tmp = 0.0 if (y <= -8.8e-30) tmp = t_2; elseif (y <= -7.5e-168) tmp = t_1; elseif (y <= 6.5e-237) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif (y <= 4.8e+52) tmp = t_1; else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = c * ((a * j) - (z * b)); t_2 = y * ((x * z) - (i * j)); tmp = 0.0; if (y <= -8.8e-30) tmp = t_2; elseif (y <= -7.5e-168) tmp = t_1; elseif (y <= 6.5e-237) tmp = a * ((c * j) - (x * t)); elseif (y <= 4.8e+52) tmp = t_1; else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(c * N[(N[(a * j), $MachinePrecision] - N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -8.8e-30], t$95$2, If[LessEqual[y, -7.5e-168], t$95$1, If[LessEqual[y, 6.5e-237], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.8e+52], t$95$1, t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := c \cdot \left(a \cdot j - z \cdot b\right)\\
t_2 := y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{if}\;y \leq -8.8 \cdot 10^{-30}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;y \leq -7.5 \cdot 10^{-168}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 6.5 \cdot 10^{-237}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;y \leq 4.8 \cdot 10^{+52}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if y < -8.79999999999999933e-30 or 4.8e52 < y Initial program 70.1%
sub-neg70.1%
+-commutative70.1%
associate-+l+70.1%
distribute-rgt-neg-in70.1%
+-commutative70.1%
fma-def71.8%
sub-neg71.8%
+-commutative71.8%
distribute-neg-in71.8%
unsub-neg71.8%
remove-double-neg71.8%
*-commutative71.8%
Simplified73.5%
Taylor expanded in t around 0 74.6%
fma-def75.4%
fma-def75.4%
associate-*r*75.4%
neg-mul-175.4%
+-commutative75.4%
*-commutative75.4%
*-commutative75.4%
mul-1-neg75.4%
distribute-lft-neg-in75.4%
cancel-sign-sub-inv75.4%
Simplified77.1%
Taylor expanded in y around inf 67.9%
*-commutative67.9%
mul-1-neg67.9%
unsub-neg67.9%
Simplified67.9%
if -8.79999999999999933e-30 < y < -7.4999999999999995e-168 or 6.5000000000000001e-237 < y < 4.8e52Initial program 76.1%
sub-neg76.1%
+-commutative76.1%
associate-+l+76.1%
distribute-rgt-neg-in76.1%
+-commutative76.1%
fma-def76.1%
sub-neg76.1%
+-commutative76.1%
distribute-neg-in76.1%
unsub-neg76.1%
remove-double-neg76.1%
*-commutative76.1%
Simplified78.3%
Taylor expanded in c around inf 56.7%
distribute-rgt-in56.7%
*-commutative56.7%
mul-1-neg56.7%
cancel-sign-sub-inv56.7%
*-commutative56.7%
distribute-rgt-out--56.7%
Simplified56.7%
if -7.4999999999999995e-168 < y < 6.5000000000000001e-237Initial program 88.0%
sub-neg88.0%
+-commutative88.0%
associate-+l+88.0%
distribute-rgt-neg-in88.0%
+-commutative88.0%
fma-def88.0%
sub-neg88.0%
+-commutative88.0%
distribute-neg-in88.0%
unsub-neg88.0%
remove-double-neg88.0%
*-commutative88.0%
Simplified88.0%
Taylor expanded in t around 0 78.1%
fma-def78.2%
fma-def78.2%
associate-*r*78.2%
neg-mul-178.2%
+-commutative78.2%
*-commutative78.2%
*-commutative78.2%
mul-1-neg78.2%
distribute-lft-neg-in78.2%
cancel-sign-sub-inv78.2%
Simplified78.2%
Taylor expanded in a around inf 62.8%
+-commutative62.8%
mul-1-neg62.8%
unsub-neg62.8%
*-commutative62.8%
Simplified62.8%
Final simplification63.0%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* i (* y (- j)))))
(if (<= y -2e-20)
t_1
(if (<= y 3.7e-68)
(* j (* a c))
(if (<= y 1.8e+84)
(* i (* t b))
(if (or (<= y 1.75e+167) (not (<= y 2.05e+220)))
t_1
(* y (* x z))))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = i * (y * -j);
double tmp;
if (y <= -2e-20) {
tmp = t_1;
} else if (y <= 3.7e-68) {
tmp = j * (a * c);
} else if (y <= 1.8e+84) {
tmp = i * (t * b);
} else if ((y <= 1.75e+167) || !(y <= 2.05e+220)) {
tmp = t_1;
} else {
tmp = y * (x * z);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: tmp
t_1 = i * (y * -j)
if (y <= (-2d-20)) then
tmp = t_1
else if (y <= 3.7d-68) then
tmp = j * (a * c)
else if (y <= 1.8d+84) then
tmp = i * (t * b)
else if ((y <= 1.75d+167) .or. (.not. (y <= 2.05d+220))) then
tmp = t_1
else
tmp = y * (x * z)
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 i, double j) {
double t_1 = i * (y * -j);
double tmp;
if (y <= -2e-20) {
tmp = t_1;
} else if (y <= 3.7e-68) {
tmp = j * (a * c);
} else if (y <= 1.8e+84) {
tmp = i * (t * b);
} else if ((y <= 1.75e+167) || !(y <= 2.05e+220)) {
tmp = t_1;
} else {
tmp = y * (x * z);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = i * (y * -j) tmp = 0 if y <= -2e-20: tmp = t_1 elif y <= 3.7e-68: tmp = j * (a * c) elif y <= 1.8e+84: tmp = i * (t * b) elif (y <= 1.75e+167) or not (y <= 2.05e+220): tmp = t_1 else: tmp = y * (x * z) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(i * Float64(y * Float64(-j))) tmp = 0.0 if (y <= -2e-20) tmp = t_1; elseif (y <= 3.7e-68) tmp = Float64(j * Float64(a * c)); elseif (y <= 1.8e+84) tmp = Float64(i * Float64(t * b)); elseif ((y <= 1.75e+167) || !(y <= 2.05e+220)) tmp = t_1; else tmp = Float64(y * Float64(x * z)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = i * (y * -j); tmp = 0.0; if (y <= -2e-20) tmp = t_1; elseif (y <= 3.7e-68) tmp = j * (a * c); elseif (y <= 1.8e+84) tmp = i * (t * b); elseif ((y <= 1.75e+167) || ~((y <= 2.05e+220))) tmp = t_1; else tmp = y * (x * z); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(y * (-j)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2e-20], t$95$1, If[LessEqual[y, 3.7e-68], N[(j * N[(a * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.8e+84], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[y, 1.75e+167], N[Not[LessEqual[y, 2.05e+220]], $MachinePrecision]], t$95$1, N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := i \cdot \left(y \cdot \left(-j\right)\right)\\
\mathbf{if}\;y \leq -2 \cdot 10^{-20}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 3.7 \cdot 10^{-68}:\\
\;\;\;\;j \cdot \left(a \cdot c\right)\\
\mathbf{elif}\;y \leq 1.8 \cdot 10^{+84}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;y \leq 1.75 \cdot 10^{+167} \lor \neg \left(y \leq 2.05 \cdot 10^{+220}\right):\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\end{array}
\end{array}
if y < -1.99999999999999989e-20 or 1.8e84 < y < 1.74999999999999994e167 or 2.0499999999999999e220 < y Initial program 66.1%
sub-neg66.1%
+-commutative66.1%
associate-+l+66.1%
distribute-rgt-neg-in66.1%
+-commutative66.1%
fma-def68.3%
sub-neg68.3%
+-commutative68.3%
distribute-neg-in68.3%
unsub-neg68.3%
remove-double-neg68.3%
*-commutative68.3%
Simplified70.4%
Taylor expanded in i around inf 53.1%
mul-1-neg53.1%
unsub-neg53.1%
Simplified53.1%
Taylor expanded in t around 0 44.8%
associate-*r*44.8%
neg-mul-144.8%
Simplified44.8%
if -1.99999999999999989e-20 < y < 3.70000000000000002e-68Initial program 82.9%
sub-neg82.9%
+-commutative82.9%
associate-+l+82.9%
distribute-rgt-neg-in82.9%
+-commutative82.9%
fma-def82.9%
sub-neg82.9%
+-commutative82.9%
distribute-neg-in82.9%
unsub-neg82.9%
remove-double-neg82.9%
*-commutative82.9%
Simplified84.7%
Taylor expanded in t around 0 78.7%
fma-def78.8%
fma-def79.6%
associate-*r*79.6%
neg-mul-179.6%
+-commutative79.6%
*-commutative79.6%
*-commutative79.6%
mul-1-neg79.6%
distribute-lft-neg-in79.6%
cancel-sign-sub-inv79.6%
Simplified79.6%
Taylor expanded in j around inf 42.6%
Taylor expanded in c around inf 36.8%
if 3.70000000000000002e-68 < y < 1.8e84Initial program 76.8%
sub-neg76.8%
+-commutative76.8%
associate-+l+76.8%
distribute-rgt-neg-in76.8%
+-commutative76.8%
fma-def76.8%
sub-neg76.8%
+-commutative76.8%
distribute-neg-in76.8%
unsub-neg76.8%
remove-double-neg76.8%
*-commutative76.8%
Simplified76.8%
Taylor expanded in t around inf 48.5%
Taylor expanded in i around inf 31.3%
if 1.74999999999999994e167 < y < 2.0499999999999999e220Initial program 77.6%
sub-neg77.6%
+-commutative77.6%
associate-+l+77.6%
distribute-rgt-neg-in77.6%
+-commutative77.6%
fma-def77.6%
sub-neg77.6%
+-commutative77.6%
distribute-neg-in77.6%
unsub-neg77.6%
remove-double-neg77.6%
*-commutative77.6%
Simplified77.6%
Taylor expanded in t around 0 85.3%
fma-def85.3%
fma-def85.3%
associate-*r*85.3%
neg-mul-185.3%
+-commutative85.3%
*-commutative85.3%
*-commutative85.3%
mul-1-neg85.3%
distribute-lft-neg-in85.3%
cancel-sign-sub-inv85.3%
Simplified85.3%
Taylor expanded in z around inf 84.5%
Taylor expanded in y around inf 76.9%
Final simplification41.1%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* i (* y (- j)))))
(if (<= y -2e-20)
t_1
(if (<= y 9.5e-67)
(* j (* a c))
(if (<= y 8.5e+69)
(* i (* t b))
(if (<= y 3.8e+139)
(* t (- (* x a)))
(if (<= y 7e+220) (* y (* x z)) t_1)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = i * (y * -j);
double tmp;
if (y <= -2e-20) {
tmp = t_1;
} else if (y <= 9.5e-67) {
tmp = j * (a * c);
} else if (y <= 8.5e+69) {
tmp = i * (t * b);
} else if (y <= 3.8e+139) {
tmp = t * -(x * a);
} else if (y <= 7e+220) {
tmp = y * (x * z);
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: tmp
t_1 = i * (y * -j)
if (y <= (-2d-20)) then
tmp = t_1
else if (y <= 9.5d-67) then
tmp = j * (a * c)
else if (y <= 8.5d+69) then
tmp = i * (t * b)
else if (y <= 3.8d+139) then
tmp = t * -(x * a)
else if (y <= 7d+220) then
tmp = y * (x * z)
else
tmp = t_1
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 i, double j) {
double t_1 = i * (y * -j);
double tmp;
if (y <= -2e-20) {
tmp = t_1;
} else if (y <= 9.5e-67) {
tmp = j * (a * c);
} else if (y <= 8.5e+69) {
tmp = i * (t * b);
} else if (y <= 3.8e+139) {
tmp = t * -(x * a);
} else if (y <= 7e+220) {
tmp = y * (x * z);
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = i * (y * -j) tmp = 0 if y <= -2e-20: tmp = t_1 elif y <= 9.5e-67: tmp = j * (a * c) elif y <= 8.5e+69: tmp = i * (t * b) elif y <= 3.8e+139: tmp = t * -(x * a) elif y <= 7e+220: tmp = y * (x * z) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(i * Float64(y * Float64(-j))) tmp = 0.0 if (y <= -2e-20) tmp = t_1; elseif (y <= 9.5e-67) tmp = Float64(j * Float64(a * c)); elseif (y <= 8.5e+69) tmp = Float64(i * Float64(t * b)); elseif (y <= 3.8e+139) tmp = Float64(t * Float64(-Float64(x * a))); elseif (y <= 7e+220) tmp = Float64(y * Float64(x * z)); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = i * (y * -j); tmp = 0.0; if (y <= -2e-20) tmp = t_1; elseif (y <= 9.5e-67) tmp = j * (a * c); elseif (y <= 8.5e+69) tmp = i * (t * b); elseif (y <= 3.8e+139) tmp = t * -(x * a); elseif (y <= 7e+220) tmp = y * (x * z); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(y * (-j)), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2e-20], t$95$1, If[LessEqual[y, 9.5e-67], N[(j * N[(a * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.5e+69], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.8e+139], N[(t * (-N[(x * a), $MachinePrecision])), $MachinePrecision], If[LessEqual[y, 7e+220], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := i \cdot \left(y \cdot \left(-j\right)\right)\\
\mathbf{if}\;y \leq -2 \cdot 10^{-20}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq 9.5 \cdot 10^{-67}:\\
\;\;\;\;j \cdot \left(a \cdot c\right)\\
\mathbf{elif}\;y \leq 8.5 \cdot 10^{+69}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;y \leq 3.8 \cdot 10^{+139}:\\
\;\;\;\;t \cdot \left(-x \cdot a\right)\\
\mathbf{elif}\;y \leq 7 \cdot 10^{+220}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if y < -1.99999999999999989e-20 or 6.99999999999999972e220 < y Initial program 65.4%
sub-neg65.4%
+-commutative65.4%
associate-+l+65.4%
distribute-rgt-neg-in65.4%
+-commutative65.4%
fma-def67.9%
sub-neg67.9%
+-commutative67.9%
distribute-neg-in67.9%
unsub-neg67.9%
remove-double-neg67.9%
*-commutative67.9%
Simplified69.1%
Taylor expanded in i around inf 55.2%
mul-1-neg55.2%
unsub-neg55.2%
Simplified55.2%
Taylor expanded in t around 0 45.6%
associate-*r*45.6%
neg-mul-145.6%
Simplified45.6%
if -1.99999999999999989e-20 < y < 9.4999999999999994e-67Initial program 82.9%
sub-neg82.9%
+-commutative82.9%
associate-+l+82.9%
distribute-rgt-neg-in82.9%
+-commutative82.9%
fma-def82.9%
sub-neg82.9%
+-commutative82.9%
distribute-neg-in82.9%
unsub-neg82.9%
remove-double-neg82.9%
*-commutative82.9%
Simplified84.7%
Taylor expanded in t around 0 78.7%
fma-def78.8%
fma-def79.6%
associate-*r*79.6%
neg-mul-179.6%
+-commutative79.6%
*-commutative79.6%
*-commutative79.6%
mul-1-neg79.6%
distribute-lft-neg-in79.6%
cancel-sign-sub-inv79.6%
Simplified79.6%
Taylor expanded in j around inf 42.6%
Taylor expanded in c around inf 36.8%
if 9.4999999999999994e-67 < y < 8.5000000000000002e69Initial program 75.3%
sub-neg75.3%
+-commutative75.3%
associate-+l+75.3%
distribute-rgt-neg-in75.3%
+-commutative75.3%
fma-def75.3%
sub-neg75.3%
+-commutative75.3%
distribute-neg-in75.3%
unsub-neg75.3%
remove-double-neg75.3%
*-commutative75.3%
Simplified75.3%
Taylor expanded in t around inf 45.4%
Taylor expanded in i around inf 33.1%
if 8.5000000000000002e69 < y < 3.79999999999999999e139Initial program 83.1%
sub-neg83.1%
+-commutative83.1%
associate-+l+83.1%
distribute-rgt-neg-in83.1%
+-commutative83.1%
fma-def83.1%
sub-neg83.1%
+-commutative83.1%
distribute-neg-in83.1%
unsub-neg83.1%
remove-double-neg83.1%
*-commutative83.1%
Simplified83.1%
Taylor expanded in t around inf 55.7%
Taylor expanded in i around 0 46.9%
neg-mul-146.9%
*-commutative46.9%
distribute-rgt-neg-in46.9%
Simplified46.9%
if 3.79999999999999999e139 < y < 6.99999999999999972e220Initial program 71.3%
sub-neg71.3%
+-commutative71.3%
associate-+l+71.3%
distribute-rgt-neg-in71.3%
+-commutative71.3%
fma-def71.3%
sub-neg71.3%
+-commutative71.3%
distribute-neg-in71.3%
unsub-neg71.3%
remove-double-neg71.3%
*-commutative71.3%
Simplified77.2%
Taylor expanded in t around 0 77.2%
fma-def77.2%
fma-def77.2%
associate-*r*77.2%
neg-mul-177.2%
+-commutative77.2%
*-commutative77.2%
*-commutative77.2%
mul-1-neg77.2%
distribute-lft-neg-in77.2%
cancel-sign-sub-inv77.2%
Simplified77.2%
Taylor expanded in z around inf 76.8%
Taylor expanded in y around inf 65.0%
Final simplification41.4%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= a -5.6e+113) (not (<= a 2.7e+97))) (* a (- (* c j) (* x t))) (* c (- (* a j) (* z b)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if ((a <= -5.6e+113) || !(a <= 2.7e+97)) {
tmp = a * ((c * j) - (x * t));
} else {
tmp = c * ((a * j) - (z * b));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: tmp
if ((a <= (-5.6d+113)) .or. (.not. (a <= 2.7d+97))) then
tmp = a * ((c * j) - (x * t))
else
tmp = c * ((a * j) - (z * b))
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 i, double j) {
double tmp;
if ((a <= -5.6e+113) || !(a <= 2.7e+97)) {
tmp = a * ((c * j) - (x * t));
} else {
tmp = c * ((a * j) - (z * b));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (a <= -5.6e+113) or not (a <= 2.7e+97): tmp = a * ((c * j) - (x * t)) else: tmp = c * ((a * j) - (z * b)) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((a <= -5.6e+113) || !(a <= 2.7e+97)) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); else tmp = Float64(c * Float64(Float64(a * j) - Float64(z * b))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((a <= -5.6e+113) || ~((a <= 2.7e+97))) tmp = a * ((c * j) - (x * t)); else tmp = c * ((a * j) - (z * b)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[a, -5.6e+113], N[Not[LessEqual[a, 2.7e+97]], $MachinePrecision]], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c * N[(N[(a * j), $MachinePrecision] - N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \leq -5.6 \cdot 10^{+113} \lor \neg \left(a \leq 2.7 \cdot 10^{+97}\right):\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;c \cdot \left(a \cdot j - z \cdot b\right)\\
\end{array}
\end{array}
if a < -5.59999999999999995e113 or 2.69999999999999993e97 < a Initial program 65.0%
sub-neg65.0%
+-commutative65.0%
associate-+l+65.0%
distribute-rgt-neg-in65.0%
+-commutative65.0%
fma-def65.0%
sub-neg65.0%
+-commutative65.0%
distribute-neg-in65.0%
unsub-neg65.0%
remove-double-neg65.0%
*-commutative65.0%
Simplified68.5%
Taylor expanded in t around 0 74.0%
fma-def74.0%
fma-def75.2%
associate-*r*75.2%
neg-mul-175.2%
+-commutative75.2%
*-commutative75.2%
*-commutative75.2%
mul-1-neg75.2%
distribute-lft-neg-in75.2%
cancel-sign-sub-inv75.2%
Simplified77.5%
Taylor expanded in a around inf 71.9%
+-commutative71.9%
mul-1-neg71.9%
unsub-neg71.9%
*-commutative71.9%
Simplified71.9%
if -5.59999999999999995e113 < a < 2.69999999999999993e97Initial program 81.2%
sub-neg81.2%
+-commutative81.2%
associate-+l+81.2%
distribute-rgt-neg-in81.2%
+-commutative81.2%
fma-def82.4%
sub-neg82.4%
+-commutative82.4%
distribute-neg-in82.4%
unsub-neg82.4%
remove-double-neg82.4%
*-commutative82.4%
Simplified82.9%
Taylor expanded in c around inf 41.9%
distribute-rgt-in41.9%
*-commutative41.9%
mul-1-neg41.9%
cancel-sign-sub-inv41.9%
*-commutative41.9%
distribute-rgt-out--41.9%
Simplified41.9%
Final simplification52.1%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= i -1e-62) (not (<= i 1.25e+39))) (* i (- (* t b) (* y j))) (* c (- (* a j) (* z b)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if ((i <= -1e-62) || !(i <= 1.25e+39)) {
tmp = i * ((t * b) - (y * j));
} else {
tmp = c * ((a * j) - (z * b));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: tmp
if ((i <= (-1d-62)) .or. (.not. (i <= 1.25d+39))) then
tmp = i * ((t * b) - (y * j))
else
tmp = c * ((a * j) - (z * b))
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 i, double j) {
double tmp;
if ((i <= -1e-62) || !(i <= 1.25e+39)) {
tmp = i * ((t * b) - (y * j));
} else {
tmp = c * ((a * j) - (z * b));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (i <= -1e-62) or not (i <= 1.25e+39): tmp = i * ((t * b) - (y * j)) else: tmp = c * ((a * j) - (z * b)) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((i <= -1e-62) || !(i <= 1.25e+39)) tmp = Float64(i * Float64(Float64(t * b) - Float64(y * j))); else tmp = Float64(c * Float64(Float64(a * j) - Float64(z * b))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((i <= -1e-62) || ~((i <= 1.25e+39))) tmp = i * ((t * b) - (y * j)); else tmp = c * ((a * j) - (z * b)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[i, -1e-62], N[Not[LessEqual[i, 1.25e+39]], $MachinePrecision]], N[(i * N[(N[(t * b), $MachinePrecision] - N[(y * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c * N[(N[(a * j), $MachinePrecision] - N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;i \leq -1 \cdot 10^{-62} \lor \neg \left(i \leq 1.25 \cdot 10^{+39}\right):\\
\;\;\;\;i \cdot \left(t \cdot b - y \cdot j\right)\\
\mathbf{else}:\\
\;\;\;\;c \cdot \left(a \cdot j - z \cdot b\right)\\
\end{array}
\end{array}
if i < -1e-62 or 1.25000000000000004e39 < i Initial program 68.4%
sub-neg68.4%
+-commutative68.4%
associate-+l+68.4%
distribute-rgt-neg-in68.4%
+-commutative68.4%
fma-def69.1%
sub-neg69.1%
+-commutative69.1%
distribute-neg-in69.1%
unsub-neg69.1%
remove-double-neg69.1%
*-commutative69.1%
Simplified72.1%
Taylor expanded in i around inf 60.4%
mul-1-neg60.4%
unsub-neg60.4%
Simplified60.4%
if -1e-62 < i < 1.25000000000000004e39Initial program 83.9%
sub-neg83.9%
+-commutative83.9%
associate-+l+83.9%
distribute-rgt-neg-in83.9%
+-commutative83.9%
fma-def84.7%
sub-neg84.7%
+-commutative84.7%
distribute-neg-in84.7%
unsub-neg84.7%
remove-double-neg84.7%
*-commutative84.7%
Simplified84.7%
Taylor expanded in c around inf 55.0%
distribute-rgt-in55.0%
*-commutative55.0%
mul-1-neg55.0%
cancel-sign-sub-inv55.0%
*-commutative55.0%
distribute-rgt-out--55.0%
Simplified55.0%
Final simplification57.9%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= j -9e-22) (not (<= j 6.5e-63))) (* c (* a j)) (* i (* t b))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if ((j <= -9e-22) || !(j <= 6.5e-63)) {
tmp = c * (a * j);
} else {
tmp = i * (t * b);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: tmp
if ((j <= (-9d-22)) .or. (.not. (j <= 6.5d-63))) then
tmp = c * (a * j)
else
tmp = i * (t * b)
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 i, double j) {
double tmp;
if ((j <= -9e-22) || !(j <= 6.5e-63)) {
tmp = c * (a * j);
} else {
tmp = i * (t * b);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (j <= -9e-22) or not (j <= 6.5e-63): tmp = c * (a * j) else: tmp = i * (t * b) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((j <= -9e-22) || !(j <= 6.5e-63)) tmp = Float64(c * Float64(a * j)); else tmp = Float64(i * Float64(t * b)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((j <= -9e-22) || ~((j <= 6.5e-63))) tmp = c * (a * j); else tmp = i * (t * b); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[j, -9e-22], N[Not[LessEqual[j, 6.5e-63]], $MachinePrecision]], N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;j \leq -9 \cdot 10^{-22} \lor \neg \left(j \leq 6.5 \cdot 10^{-63}\right):\\
\;\;\;\;c \cdot \left(a \cdot j\right)\\
\mathbf{else}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\end{array}
\end{array}
if j < -8.99999999999999973e-22 or 6.4999999999999998e-63 < j Initial program 81.0%
sub-neg81.0%
+-commutative81.0%
associate-+l+81.0%
distribute-rgt-neg-in81.0%
+-commutative81.0%
fma-def81.0%
sub-neg81.0%
+-commutative81.0%
distribute-neg-in81.0%
unsub-neg81.0%
remove-double-neg81.0%
*-commutative81.0%
Simplified83.7%
Taylor expanded in c around inf 49.8%
distribute-rgt-in49.1%
*-commutative49.1%
mul-1-neg49.1%
cancel-sign-sub-inv49.1%
*-commutative49.1%
distribute-rgt-out--49.8%
Simplified49.8%
Taylor expanded in a around inf 38.6%
if -8.99999999999999973e-22 < j < 6.4999999999999998e-63Initial program 68.7%
sub-neg68.7%
+-commutative68.7%
associate-+l+68.7%
distribute-rgt-neg-in68.7%
+-commutative68.7%
fma-def70.5%
sub-neg70.5%
+-commutative70.5%
distribute-neg-in70.5%
unsub-neg70.5%
remove-double-neg70.5%
*-commutative70.5%
Simplified70.5%
Taylor expanded in t around inf 46.3%
Taylor expanded in i around inf 26.7%
Final simplification33.5%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= j -4.9e+28) (not (<= j 4.8e+22))) (* c (* a j)) (* y (* x z))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if ((j <= -4.9e+28) || !(j <= 4.8e+22)) {
tmp = c * (a * j);
} else {
tmp = y * (x * z);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: tmp
if ((j <= (-4.9d+28)) .or. (.not. (j <= 4.8d+22))) then
tmp = c * (a * j)
else
tmp = y * (x * z)
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 i, double j) {
double tmp;
if ((j <= -4.9e+28) || !(j <= 4.8e+22)) {
tmp = c * (a * j);
} else {
tmp = y * (x * z);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (j <= -4.9e+28) or not (j <= 4.8e+22): tmp = c * (a * j) else: tmp = y * (x * z) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((j <= -4.9e+28) || !(j <= 4.8e+22)) tmp = Float64(c * Float64(a * j)); else tmp = Float64(y * Float64(x * z)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((j <= -4.9e+28) || ~((j <= 4.8e+22))) tmp = c * (a * j); else tmp = y * (x * z); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[j, -4.9e+28], N[Not[LessEqual[j, 4.8e+22]], $MachinePrecision]], N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;j \leq -4.9 \cdot 10^{+28} \lor \neg \left(j \leq 4.8 \cdot 10^{+22}\right):\\
\;\;\;\;c \cdot \left(a \cdot j\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\end{array}
\end{array}
if j < -4.8999999999999996e28 or 4.8e22 < j Initial program 82.0%
sub-neg82.0%
+-commutative82.0%
associate-+l+82.0%
distribute-rgt-neg-in82.0%
+-commutative82.0%
fma-def82.0%
sub-neg82.0%
+-commutative82.0%
distribute-neg-in82.0%
unsub-neg82.0%
remove-double-neg82.0%
*-commutative82.0%
Simplified85.5%
Taylor expanded in c around inf 53.7%
distribute-rgt-in52.8%
*-commutative52.8%
mul-1-neg52.8%
cancel-sign-sub-inv52.8%
*-commutative52.8%
distribute-rgt-out--53.7%
Simplified53.7%
Taylor expanded in a around inf 43.6%
if -4.8999999999999996e28 < j < 4.8e22Initial program 70.4%
sub-neg70.4%
+-commutative70.4%
associate-+l+70.4%
distribute-rgt-neg-in70.4%
+-commutative70.4%
fma-def71.8%
sub-neg71.8%
+-commutative71.8%
distribute-neg-in71.8%
unsub-neg71.8%
remove-double-neg71.8%
*-commutative71.8%
Simplified71.8%
Taylor expanded in t around 0 74.8%
fma-def74.8%
fma-def75.5%
associate-*r*75.5%
neg-mul-175.5%
+-commutative75.5%
*-commutative75.5%
*-commutative75.5%
mul-1-neg75.5%
distribute-lft-neg-in75.5%
cancel-sign-sub-inv75.5%
Simplified75.5%
Taylor expanded in z around inf 69.5%
Taylor expanded in y around inf 28.0%
Final simplification35.1%
(FPCore (x y z t a b c i j) :precision binary64 (if (<= x 7.2e+145) (* a (* c j)) (* a (* x t))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if (x <= 7.2e+145) {
tmp = a * (c * j);
} else {
tmp = a * (x * t);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: tmp
if (x <= 7.2d+145) then
tmp = a * (c * j)
else
tmp = a * (x * t)
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 i, double j) {
double tmp;
if (x <= 7.2e+145) {
tmp = a * (c * j);
} else {
tmp = a * (x * t);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if x <= 7.2e+145: tmp = a * (c * j) else: tmp = a * (x * t) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if (x <= 7.2e+145) tmp = Float64(a * Float64(c * j)); else tmp = Float64(a * Float64(x * t)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if (x <= 7.2e+145) tmp = a * (c * j); else tmp = a * (x * t); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[x, 7.2e+145], N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision], N[(a * N[(x * t), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \leq 7.2 \cdot 10^{+145}:\\
\;\;\;\;a \cdot \left(c \cdot j\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(x \cdot t\right)\\
\end{array}
\end{array}
if x < 7.19999999999999948e145Initial program 76.5%
sub-neg76.5%
+-commutative76.5%
associate-+l+76.5%
distribute-rgt-neg-in76.5%
+-commutative76.5%
fma-def77.0%
sub-neg77.0%
+-commutative77.0%
distribute-neg-in77.0%
unsub-neg77.0%
remove-double-neg77.0%
*-commutative77.0%
Simplified77.9%
Taylor expanded in t around 0 80.2%
fma-def80.7%
fma-def81.2%
associate-*r*81.2%
neg-mul-181.2%
+-commutative81.2%
*-commutative81.2%
*-commutative81.2%
mul-1-neg81.2%
distribute-lft-neg-in81.2%
cancel-sign-sub-inv81.2%
Simplified82.1%
Taylor expanded in a around inf 41.9%
+-commutative41.9%
mul-1-neg41.9%
unsub-neg41.9%
*-commutative41.9%
Simplified41.9%
Taylor expanded in c around inf 27.5%
if 7.19999999999999948e145 < x Initial program 71.0%
sub-neg71.0%
+-commutative71.0%
associate-+l+71.0%
distribute-rgt-neg-in71.0%
+-commutative71.0%
fma-def73.6%
sub-neg73.6%
+-commutative73.6%
distribute-neg-in73.6%
unsub-neg73.6%
remove-double-neg73.6%
*-commutative73.6%
Simplified78.9%
Taylor expanded in t around inf 50.8%
Taylor expanded in i around 0 34.9%
associate-*r*35.6%
associate-*r*35.6%
*-commutative35.6%
mul-1-neg35.6%
distribute-rgt-neg-in35.6%
Simplified35.6%
expm1-log1p-u16.4%
expm1-udef16.4%
*-commutative16.4%
add-sqr-sqrt10.7%
sqrt-unprod21.7%
sqr-neg21.7%
sqrt-unprod10.9%
add-sqr-sqrt13.9%
Applied egg-rr13.9%
expm1-def14.0%
expm1-log1p19.4%
associate-*r*21.9%
*-commutative21.9%
Simplified21.9%
Final simplification26.7%
(FPCore (x y z t a b c i j) :precision binary64 (* a (* c j)))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return a * (c * j);
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
code = a * (c * j)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return a * (c * j);
}
def code(x, y, z, t, a, b, c, i, j): return a * (c * j)
function code(x, y, z, t, a, b, c, i, j) return Float64(a * Float64(c * j)) end
function tmp = code(x, y, z, t, a, b, c, i, j) tmp = a * (c * j); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
a \cdot \left(c \cdot j\right)
\end{array}
Initial program 75.7%
sub-neg75.7%
+-commutative75.7%
associate-+l+75.7%
distribute-rgt-neg-in75.7%
+-commutative75.7%
fma-def76.5%
sub-neg76.5%
+-commutative76.5%
distribute-neg-in76.5%
unsub-neg76.5%
remove-double-neg76.5%
*-commutative76.5%
Simplified78.0%
Taylor expanded in t around 0 76.9%
fma-def77.3%
fma-def77.7%
associate-*r*77.7%
neg-mul-177.7%
+-commutative77.7%
*-commutative77.7%
*-commutative77.7%
mul-1-neg77.7%
distribute-lft-neg-in77.7%
cancel-sign-sub-inv77.7%
Simplified78.5%
Taylor expanded in a around inf 41.0%
+-commutative41.0%
mul-1-neg41.0%
unsub-neg41.0%
*-commutative41.0%
Simplified41.0%
Taylor expanded in c around inf 24.9%
Final simplification24.9%
(FPCore (x y z t a b c i j) :precision binary64 (* c (* a j)))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return c * (a * j);
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
code = c * (a * j)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
return c * (a * j);
}
def code(x, y, z, t, a, b, c, i, j): return c * (a * j)
function code(x, y, z, t, a, b, c, i, j) return Float64(c * Float64(a * j)) end
function tmp = code(x, y, z, t, a, b, c, i, j) tmp = c * (a * j); end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(c * N[(a * j), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
c \cdot \left(a \cdot j\right)
\end{array}
Initial program 75.7%
sub-neg75.7%
+-commutative75.7%
associate-+l+75.7%
distribute-rgt-neg-in75.7%
+-commutative75.7%
fma-def76.5%
sub-neg76.5%
+-commutative76.5%
distribute-neg-in76.5%
unsub-neg76.5%
remove-double-neg76.5%
*-commutative76.5%
Simplified78.0%
Taylor expanded in c around inf 43.3%
distribute-rgt-in42.9%
*-commutative42.9%
mul-1-neg42.9%
cancel-sign-sub-inv42.9%
*-commutative42.9%
distribute-rgt-out--43.3%
Simplified43.3%
Taylor expanded in a around inf 26.1%
Final simplification26.1%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* j (- (* c a) (* y i))))
(t_2
(+
(-
(* x (- (* y z) (* t a)))
(/
(* b (- (pow (* c z) 2.0) (pow (* t i) 2.0)))
(+ (* c z) (* t i))))
t_1)))
(if (< x -1.469694296777705e-64)
t_2
(if (< x 3.2113527362226803e-147)
(- (* (- (* b i) (* x a)) t) (- (* z (* c b)) t_1))
t_2))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double t_1 = j * ((c * a) - (y * i));
double t_2 = ((x * ((y * z) - (t * a))) - ((b * (pow((c * z), 2.0) - pow((t * i), 2.0))) / ((c * z) + (t * i)))) + t_1;
double tmp;
if (x < -1.469694296777705e-64) {
tmp = t_2;
} else if (x < 3.2113527362226803e-147) {
tmp = (((b * i) - (x * a)) * t) - ((z * (c * b)) - t_1);
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i, j)
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), intent (in) :: i
real(8), intent (in) :: j
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = j * ((c * a) - (y * i))
t_2 = ((x * ((y * z) - (t * a))) - ((b * (((c * z) ** 2.0d0) - ((t * i) ** 2.0d0))) / ((c * z) + (t * i)))) + t_1
if (x < (-1.469694296777705d-64)) then
tmp = t_2
else if (x < 3.2113527362226803d-147) then
tmp = (((b * i) - (x * a)) * t) - ((z * (c * b)) - t_1)
else
tmp = 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 i, double j) {
double t_1 = j * ((c * a) - (y * i));
double t_2 = ((x * ((y * z) - (t * a))) - ((b * (Math.pow((c * z), 2.0) - Math.pow((t * i), 2.0))) / ((c * z) + (t * i)))) + t_1;
double tmp;
if (x < -1.469694296777705e-64) {
tmp = t_2;
} else if (x < 3.2113527362226803e-147) {
tmp = (((b * i) - (x * a)) * t) - ((z * (c * b)) - t_1);
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = j * ((c * a) - (y * i)) t_2 = ((x * ((y * z) - (t * a))) - ((b * (math.pow((c * z), 2.0) - math.pow((t * i), 2.0))) / ((c * z) + (t * i)))) + t_1 tmp = 0 if x < -1.469694296777705e-64: tmp = t_2 elif x < 3.2113527362226803e-147: tmp = (((b * i) - (x * a)) * t) - ((z * (c * b)) - t_1) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(j * Float64(Float64(c * a) - Float64(y * i))) t_2 = Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(Float64(b * Float64((Float64(c * z) ^ 2.0) - (Float64(t * i) ^ 2.0))) / Float64(Float64(c * z) + Float64(t * i)))) + t_1) tmp = 0.0 if (x < -1.469694296777705e-64) tmp = t_2; elseif (x < 3.2113527362226803e-147) tmp = Float64(Float64(Float64(Float64(b * i) - Float64(x * a)) * t) - Float64(Float64(z * Float64(c * b)) - t_1)); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = j * ((c * a) - (y * i)); t_2 = ((x * ((y * z) - (t * a))) - ((b * (((c * z) ^ 2.0) - ((t * i) ^ 2.0))) / ((c * z) + (t * i)))) + t_1; tmp = 0.0; if (x < -1.469694296777705e-64) tmp = t_2; elseif (x < 3.2113527362226803e-147) tmp = (((b * i) - (x * a)) * t) - ((z * (c * b)) - t_1); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(b * N[(N[Power[N[(c * z), $MachinePrecision], 2.0], $MachinePrecision] - N[Power[N[(t * i), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(c * z), $MachinePrecision] + N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[Less[x, -1.469694296777705e-64], t$95$2, If[Less[x, 3.2113527362226803e-147], N[(N[(N[(N[(b * i), $MachinePrecision] - N[(x * a), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision] - N[(N[(z * N[(c * b), $MachinePrecision]), $MachinePrecision] - t$95$1), $MachinePrecision]), $MachinePrecision], t$95$2]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := j \cdot \left(c \cdot a - y \cdot i\right)\\
t_2 := \left(x \cdot \left(y \cdot z - t \cdot a\right) - \frac{b \cdot \left({\left(c \cdot z\right)}^{2} - {\left(t \cdot i\right)}^{2}\right)}{c \cdot z + t \cdot i}\right) + t_1\\
\mathbf{if}\;x < -1.469694296777705 \cdot 10^{-64}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;x < 3.2113527362226803 \cdot 10^{-147}:\\
\;\;\;\;\left(b \cdot i - x \cdot a\right) \cdot t - \left(z \cdot \left(c \cdot b\right) - t_1\right)\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
herbie shell --seed 2023192
(FPCore (x y z t a b c i j)
:name "Data.Colour.Matrix:determinant from colour-2.3.3, A"
:precision binary64
:herbie-target
(if (< x -1.469694296777705e-64) (+ (- (* x (- (* y z) (* t a))) (/ (* b (- (pow (* c z) 2.0) (pow (* t i) 2.0))) (+ (* c z) (* t i)))) (* j (- (* c a) (* y i)))) (if (< x 3.2113527362226803e-147) (- (* (- (* b i) (* x a)) t) (- (* z (* c b)) (* j (- (* c a) (* y i))))) (+ (- (* x (- (* y z) (* t a))) (/ (* b (- (pow (* c z) 2.0) (pow (* t i) 2.0))) (+ (* c z) (* t i)))) (* j (- (* c a) (* y i))))))
(+ (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i)))) (* j (- (* c a) (* y i)))))