
(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 24 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)))))
(if (<=
(- t_1 (+ (* b (- (* z c) (* t i))) (* x (- (* t a) (* y z)))))
INFINITY)
(fma b (- (* t i) (* z c)) (+ t_1 (* x (- (* y z) (* t a)))))
(* z (- (* x y) (* b 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 tmp;
if ((t_1 - ((b * ((z * c) - (t * i))) + (x * ((t * a) - (y * z))))) <= ((double) INFINITY)) {
tmp = fma(b, ((t * i) - (z * c)), (t_1 + (x * ((y * z) - (t * a)))));
} else {
tmp = z * ((x * y) - (b * 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))) tmp = 0.0 if (Float64(t_1 - Float64(Float64(b * Float64(Float64(z * c) - Float64(t * i))) + Float64(x * Float64(Float64(t * a) - Float64(y * z))))) <= Inf) tmp = fma(b, Float64(Float64(t * i) - Float64(z * c)), Float64(t_1 + Float64(x * Float64(Float64(y * z) - Float64(t * a))))); else tmp = Float64(z * Float64(Float64(x * y) - Float64(b * c))); end return 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]}, If[LessEqual[N[(t$95$1 - N[(N[(b * N[(N[(z * c), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * N[(N[(t * a), $MachinePrecision] - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 + N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := j \cdot \left(a \cdot c - y \cdot i\right)\\
\mathbf{if}\;t_1 - \left(b \cdot \left(z \cdot c - t \cdot i\right) + x \cdot \left(t \cdot a - y \cdot z\right)\right) \leq \infty:\\
\;\;\;\;\mathsf{fma}\left(b, t \cdot i - z \cdot c, t_1 + x \cdot \left(y \cdot z - t \cdot a\right)\right)\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(x \cdot y - b \cdot c\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 94.1%
sub-neg94.1%
+-commutative94.1%
associate-+l+94.1%
distribute-rgt-neg-in94.1%
+-commutative94.1%
fma-def94.1%
sub-neg94.1%
+-commutative94.1%
distribute-neg-in94.1%
unsub-neg94.1%
remove-double-neg94.1%
*-commutative94.1%
Simplified94.1%
fma-udef94.1%
*-commutative94.1%
Applied egg-rr94.1%
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%
cancel-sign-sub0.0%
cancel-sign-sub-inv0.0%
*-commutative0.0%
remove-double-neg0.0%
*-commutative0.0%
Simplified0.0%
Taylor expanded in z around inf 52.5%
Final simplification85.0%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1
(-
(* j (- (* a c) (* y i)))
(+ (* b (- (* z c) (* t i))) (* x (- (* t a) (* y z)))))))
(if (<= t_1 INFINITY) t_1 (* z (- (* x y) (* b 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))) - ((b * ((z * c) - (t * i))) + (x * ((t * a) - (y * z))));
double tmp;
if (t_1 <= ((double) INFINITY)) {
tmp = t_1;
} else {
tmp = z * ((x * y) - (b * c));
}
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))) - ((b * ((z * c) - (t * i))) + (x * ((t * a) - (y * z))));
double tmp;
if (t_1 <= Double.POSITIVE_INFINITY) {
tmp = t_1;
} else {
tmp = z * ((x * y) - (b * c));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (j * ((a * c) - (y * i))) - ((b * ((z * c) - (t * i))) + (x * ((t * a) - (y * z)))) tmp = 0 if t_1 <= math.inf: tmp = t_1 else: tmp = z * ((x * y) - (b * c)) 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(b * Float64(Float64(z * c) - Float64(t * i))) + Float64(x * Float64(Float64(t * a) - Float64(y * z))))) tmp = 0.0 if (t_1 <= Inf) tmp = t_1; else tmp = Float64(z * Float64(Float64(x * y) - Float64(b * 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))) - ((b * ((z * c) - (t * i))) + (x * ((t * a) - (y * z)))); tmp = 0.0; if (t_1 <= Inf) tmp = t_1; else tmp = z * ((x * y) - (b * c)); 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[(b * N[(N[(z * c), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x * N[(N[(t * a), $MachinePrecision] - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := j \cdot \left(a \cdot c - y \cdot i\right) - \left(b \cdot \left(z \cdot c - t \cdot i\right) + x \cdot \left(t \cdot a - y \cdot z\right)\right)\\
\mathbf{if}\;t_1 \leq \infty:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(x \cdot y - b \cdot c\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 94.1%
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%
cancel-sign-sub0.0%
cancel-sign-sub-inv0.0%
*-commutative0.0%
remove-double-neg0.0%
*-commutative0.0%
Simplified0.0%
Taylor expanded in z around inf 52.5%
Final simplification85.0%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (+ (* a (* c j)) (* b (- (* t i) (* z c)))))
(t_2 (* t (- (* b i) (* x a))))
(t_3 (* z (- (* x y) (* b c)))))
(if (<= z -3.3e+112)
t_3
(if (<= z -18500000000000.0)
t_2
(if (<= z -1.2e-130)
t_1
(if (<= z -9e-216)
(* a (- (* c j) (* x t)))
(if (<= z 3.4e-269)
t_1
(if (<= z 6.2e-171)
(* i (- (* t b) (* y j)))
(if (<= z 3.4e-39)
(* j (- (* a c) (* y i)))
(if (<= z 3.65e-9) t_2 (if (<= z 4.3e+186) t_1 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 = (a * (c * j)) + (b * ((t * i) - (z * c)));
double t_2 = t * ((b * i) - (x * a));
double t_3 = z * ((x * y) - (b * c));
double tmp;
if (z <= -3.3e+112) {
tmp = t_3;
} else if (z <= -18500000000000.0) {
tmp = t_2;
} else if (z <= -1.2e-130) {
tmp = t_1;
} else if (z <= -9e-216) {
tmp = a * ((c * j) - (x * t));
} else if (z <= 3.4e-269) {
tmp = t_1;
} else if (z <= 6.2e-171) {
tmp = i * ((t * b) - (y * j));
} else if (z <= 3.4e-39) {
tmp = j * ((a * c) - (y * i));
} else if (z <= 3.65e-9) {
tmp = t_2;
} else if (z <= 4.3e+186) {
tmp = t_1;
} 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 = (a * (c * j)) + (b * ((t * i) - (z * c)))
t_2 = t * ((b * i) - (x * a))
t_3 = z * ((x * y) - (b * c))
if (z <= (-3.3d+112)) then
tmp = t_3
else if (z <= (-18500000000000.0d0)) then
tmp = t_2
else if (z <= (-1.2d-130)) then
tmp = t_1
else if (z <= (-9d-216)) then
tmp = a * ((c * j) - (x * t))
else if (z <= 3.4d-269) then
tmp = t_1
else if (z <= 6.2d-171) then
tmp = i * ((t * b) - (y * j))
else if (z <= 3.4d-39) then
tmp = j * ((a * c) - (y * i))
else if (z <= 3.65d-9) then
tmp = t_2
else if (z <= 4.3d+186) then
tmp = t_1
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 = (a * (c * j)) + (b * ((t * i) - (z * c)));
double t_2 = t * ((b * i) - (x * a));
double t_3 = z * ((x * y) - (b * c));
double tmp;
if (z <= -3.3e+112) {
tmp = t_3;
} else if (z <= -18500000000000.0) {
tmp = t_2;
} else if (z <= -1.2e-130) {
tmp = t_1;
} else if (z <= -9e-216) {
tmp = a * ((c * j) - (x * t));
} else if (z <= 3.4e-269) {
tmp = t_1;
} else if (z <= 6.2e-171) {
tmp = i * ((t * b) - (y * j));
} else if (z <= 3.4e-39) {
tmp = j * ((a * c) - (y * i));
} else if (z <= 3.65e-9) {
tmp = t_2;
} else if (z <= 4.3e+186) {
tmp = t_1;
} else {
tmp = t_3;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (a * (c * j)) + (b * ((t * i) - (z * c))) t_2 = t * ((b * i) - (x * a)) t_3 = z * ((x * y) - (b * c)) tmp = 0 if z <= -3.3e+112: tmp = t_3 elif z <= -18500000000000.0: tmp = t_2 elif z <= -1.2e-130: tmp = t_1 elif z <= -9e-216: tmp = a * ((c * j) - (x * t)) elif z <= 3.4e-269: tmp = t_1 elif z <= 6.2e-171: tmp = i * ((t * b) - (y * j)) elif z <= 3.4e-39: tmp = j * ((a * c) - (y * i)) elif z <= 3.65e-9: tmp = t_2 elif z <= 4.3e+186: tmp = t_1 else: tmp = t_3 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(a * Float64(c * j)) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) t_2 = Float64(t * Float64(Float64(b * i) - Float64(x * a))) t_3 = Float64(z * Float64(Float64(x * y) - Float64(b * c))) tmp = 0.0 if (z <= -3.3e+112) tmp = t_3; elseif (z <= -18500000000000.0) tmp = t_2; elseif (z <= -1.2e-130) tmp = t_1; elseif (z <= -9e-216) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif (z <= 3.4e-269) tmp = t_1; elseif (z <= 6.2e-171) tmp = Float64(i * Float64(Float64(t * b) - Float64(y * j))); elseif (z <= 3.4e-39) tmp = Float64(j * Float64(Float64(a * c) - Float64(y * i))); elseif (z <= 3.65e-9) tmp = t_2; elseif (z <= 4.3e+186) tmp = t_1; else tmp = t_3; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = (a * (c * j)) + (b * ((t * i) - (z * c))); t_2 = t * ((b * i) - (x * a)); t_3 = z * ((x * y) - (b * c)); tmp = 0.0; if (z <= -3.3e+112) tmp = t_3; elseif (z <= -18500000000000.0) tmp = t_2; elseif (z <= -1.2e-130) tmp = t_1; elseif (z <= -9e-216) tmp = a * ((c * j) - (x * t)); elseif (z <= 3.4e-269) tmp = t_1; elseif (z <= 6.2e-171) tmp = i * ((t * b) - (y * j)); elseif (z <= 3.4e-39) tmp = j * ((a * c) - (y * i)); elseif (z <= 3.65e-9) tmp = t_2; elseif (z <= 4.3e+186) tmp = t_1; else tmp = t_3; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(N[(b * i), $MachinePrecision] - N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.3e+112], t$95$3, If[LessEqual[z, -18500000000000.0], t$95$2, If[LessEqual[z, -1.2e-130], t$95$1, If[LessEqual[z, -9e-216], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.4e-269], t$95$1, If[LessEqual[z, 6.2e-171], N[(i * N[(N[(t * b), $MachinePrecision] - N[(y * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.4e-39], N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.65e-9], t$95$2, If[LessEqual[z, 4.3e+186], t$95$1, t$95$3]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
t_2 := t \cdot \left(b \cdot i - x \cdot a\right)\\
t_3 := z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{if}\;z \leq -3.3 \cdot 10^{+112}:\\
\;\;\;\;t_3\\
\mathbf{elif}\;z \leq -18500000000000:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -1.2 \cdot 10^{-130}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -9 \cdot 10^{-216}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;z \leq 3.4 \cdot 10^{-269}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 6.2 \cdot 10^{-171}:\\
\;\;\;\;i \cdot \left(t \cdot b - y \cdot j\right)\\
\mathbf{elif}\;z \leq 3.4 \cdot 10^{-39}:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right)\\
\mathbf{elif}\;z \leq 3.65 \cdot 10^{-9}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq 4.3 \cdot 10^{+186}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_3\\
\end{array}
\end{array}
if z < -3.2999999999999999e112 or 4.3e186 < z Initial program 60.2%
cancel-sign-sub60.2%
cancel-sign-sub-inv60.2%
*-commutative60.2%
remove-double-neg60.2%
*-commutative60.2%
Simplified60.2%
Taylor expanded in z around inf 79.0%
if -3.2999999999999999e112 < z < -1.85e13 or 3.3999999999999999e-39 < z < 3.65000000000000001e-9Initial program 79.4%
cancel-sign-sub79.4%
cancel-sign-sub-inv79.4%
*-commutative79.4%
remove-double-neg79.4%
*-commutative79.4%
Simplified79.4%
Taylor expanded in t around inf 59.6%
distribute-lft-out--59.6%
associate-*r*59.6%
mul-1-neg59.6%
*-commutative59.6%
Simplified59.6%
if -1.85e13 < z < -1.19999999999999998e-130 or -8.9999999999999997e-216 < z < 3.3999999999999997e-269 or 3.65000000000000001e-9 < z < 4.3e186Initial program 82.4%
cancel-sign-sub82.4%
cancel-sign-sub-inv82.4%
*-commutative82.4%
remove-double-neg82.4%
*-commutative82.4%
Simplified82.4%
Taylor expanded in y around 0 68.6%
sub-neg68.6%
+-commutative68.6%
*-commutative68.6%
associate-*r*74.9%
*-commutative74.9%
mul-1-neg74.9%
distribute-rgt-neg-in74.9%
mul-1-neg74.9%
distribute-lft-in74.9%
mul-1-neg74.9%
unsub-neg74.9%
*-commutative74.9%
*-commutative74.9%
distribute-rgt-neg-in74.9%
neg-sub074.9%
associate-+l-74.9%
neg-sub074.9%
+-commutative74.9%
sub-neg74.9%
Simplified74.9%
Taylor expanded in j around inf 70.5%
*-commutative37.0%
Simplified70.5%
if -1.19999999999999998e-130 < z < -8.9999999999999997e-216Initial program 59.2%
cancel-sign-sub59.2%
cancel-sign-sub-inv59.2%
*-commutative59.2%
remove-double-neg59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in a around inf 68.9%
+-commutative68.9%
mul-1-neg68.9%
unsub-neg68.9%
*-commutative68.9%
Simplified68.9%
if 3.3999999999999997e-269 < z < 6.2000000000000001e-171Initial program 77.5%
sub-neg77.5%
+-commutative77.5%
associate-+l+77.5%
distribute-rgt-neg-in77.5%
+-commutative77.5%
fma-def77.6%
sub-neg77.6%
+-commutative77.6%
distribute-neg-in77.6%
unsub-neg77.6%
remove-double-neg77.6%
*-commutative77.6%
Simplified77.6%
fma-udef77.6%
*-commutative77.6%
Applied egg-rr77.6%
Taylor expanded in i around inf 73.9%
mul-1-neg73.9%
unsub-neg73.9%
Simplified73.9%
if 6.2000000000000001e-171 < z < 3.3999999999999999e-39Initial program 81.5%
sub-neg81.5%
+-commutative81.5%
associate-+l+81.5%
distribute-rgt-neg-in81.5%
+-commutative81.5%
fma-def85.2%
sub-neg85.2%
+-commutative85.2%
distribute-neg-in85.2%
unsub-neg85.2%
remove-double-neg85.2%
*-commutative85.2%
Simplified85.2%
fma-udef85.2%
*-commutative85.2%
Applied egg-rr85.2%
Taylor expanded in j around inf 59.8%
Final simplification70.6%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (+ (* a (* c j)) (* b (- (* t i) (* z c)))))
(t_2 (* z (- (* x y) (* b c)))))
(if (<= z -3.2e+112)
t_2
(if (<= z -980000000000.0)
(* t (- (* b i) (* x a)))
(if (<= z -7.2e-133)
t_1
(if (<= z -5.6e-216)
(* a (- (* c j) (* x t)))
(if (<= z -1.66e-239)
t_1
(if (<= z 1.05e-76)
(+ (* j (- (* a c) (* y i))) (* i (* t b)))
(if (<= z 3.8e+134)
t_1
(if (<= z 8e+233) (* x (- (* y z) (* t a))) 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 = (a * (c * j)) + (b * ((t * i) - (z * c)));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -3.2e+112) {
tmp = t_2;
} else if (z <= -980000000000.0) {
tmp = t * ((b * i) - (x * a));
} else if (z <= -7.2e-133) {
tmp = t_1;
} else if (z <= -5.6e-216) {
tmp = a * ((c * j) - (x * t));
} else if (z <= -1.66e-239) {
tmp = t_1;
} else if (z <= 1.05e-76) {
tmp = (j * ((a * c) - (y * i))) + (i * (t * b));
} else if (z <= 3.8e+134) {
tmp = t_1;
} else if (z <= 8e+233) {
tmp = x * ((y * z) - (t * a));
} 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 = (a * (c * j)) + (b * ((t * i) - (z * c)))
t_2 = z * ((x * y) - (b * c))
if (z <= (-3.2d+112)) then
tmp = t_2
else if (z <= (-980000000000.0d0)) then
tmp = t * ((b * i) - (x * a))
else if (z <= (-7.2d-133)) then
tmp = t_1
else if (z <= (-5.6d-216)) then
tmp = a * ((c * j) - (x * t))
else if (z <= (-1.66d-239)) then
tmp = t_1
else if (z <= 1.05d-76) then
tmp = (j * ((a * c) - (y * i))) + (i * (t * b))
else if (z <= 3.8d+134) then
tmp = t_1
else if (z <= 8d+233) then
tmp = x * ((y * z) - (t * a))
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 = (a * (c * j)) + (b * ((t * i) - (z * c)));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -3.2e+112) {
tmp = t_2;
} else if (z <= -980000000000.0) {
tmp = t * ((b * i) - (x * a));
} else if (z <= -7.2e-133) {
tmp = t_1;
} else if (z <= -5.6e-216) {
tmp = a * ((c * j) - (x * t));
} else if (z <= -1.66e-239) {
tmp = t_1;
} else if (z <= 1.05e-76) {
tmp = (j * ((a * c) - (y * i))) + (i * (t * b));
} else if (z <= 3.8e+134) {
tmp = t_1;
} else if (z <= 8e+233) {
tmp = x * ((y * z) - (t * a));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (a * (c * j)) + (b * ((t * i) - (z * c))) t_2 = z * ((x * y) - (b * c)) tmp = 0 if z <= -3.2e+112: tmp = t_2 elif z <= -980000000000.0: tmp = t * ((b * i) - (x * a)) elif z <= -7.2e-133: tmp = t_1 elif z <= -5.6e-216: tmp = a * ((c * j) - (x * t)) elif z <= -1.66e-239: tmp = t_1 elif z <= 1.05e-76: tmp = (j * ((a * c) - (y * i))) + (i * (t * b)) elif z <= 3.8e+134: tmp = t_1 elif z <= 8e+233: tmp = x * ((y * z) - (t * a)) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(a * Float64(c * j)) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) t_2 = Float64(z * Float64(Float64(x * y) - Float64(b * c))) tmp = 0.0 if (z <= -3.2e+112) tmp = t_2; elseif (z <= -980000000000.0) tmp = Float64(t * Float64(Float64(b * i) - Float64(x * a))); elseif (z <= -7.2e-133) tmp = t_1; elseif (z <= -5.6e-216) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif (z <= -1.66e-239) tmp = t_1; elseif (z <= 1.05e-76) tmp = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(i * Float64(t * b))); elseif (z <= 3.8e+134) tmp = t_1; elseif (z <= 8e+233) tmp = Float64(x * Float64(Float64(y * z) - Float64(t * a))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = (a * (c * j)) + (b * ((t * i) - (z * c))); t_2 = z * ((x * y) - (b * c)); tmp = 0.0; if (z <= -3.2e+112) tmp = t_2; elseif (z <= -980000000000.0) tmp = t * ((b * i) - (x * a)); elseif (z <= -7.2e-133) tmp = t_1; elseif (z <= -5.6e-216) tmp = a * ((c * j) - (x * t)); elseif (z <= -1.66e-239) tmp = t_1; elseif (z <= 1.05e-76) tmp = (j * ((a * c) - (y * i))) + (i * (t * b)); elseif (z <= 3.8e+134) tmp = t_1; elseif (z <= 8e+233) tmp = x * ((y * z) - (t * a)); 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[(a * N[(c * j), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * 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, -3.2e+112], t$95$2, If[LessEqual[z, -980000000000.0], N[(t * N[(N[(b * i), $MachinePrecision] - N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -7.2e-133], t$95$1, If[LessEqual[z, -5.6e-216], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, -1.66e-239], t$95$1, If[LessEqual[z, 1.05e-76], N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.8e+134], t$95$1, If[LessEqual[z, 8e+233], N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
t_2 := z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{if}\;z \leq -3.2 \cdot 10^{+112}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -980000000000:\\
\;\;\;\;t \cdot \left(b \cdot i - x \cdot a\right)\\
\mathbf{elif}\;z \leq -7.2 \cdot 10^{-133}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq -5.6 \cdot 10^{-216}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;z \leq -1.66 \cdot 10^{-239}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 1.05 \cdot 10^{-76}:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right) + i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;z \leq 3.8 \cdot 10^{+134}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 8 \cdot 10^{+233}:\\
\;\;\;\;x \cdot \left(y \cdot z - t \cdot a\right)\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -3.19999999999999986e112 or 7.99999999999999979e233 < z Initial program 60.8%
cancel-sign-sub60.8%
cancel-sign-sub-inv60.8%
*-commutative60.8%
remove-double-neg60.8%
*-commutative60.8%
Simplified60.8%
Taylor expanded in z around inf 82.4%
if -3.19999999999999986e112 < z < -9.8e11Initial program 75.2%
cancel-sign-sub75.2%
cancel-sign-sub-inv75.2%
*-commutative75.2%
remove-double-neg75.2%
*-commutative75.2%
Simplified75.2%
Taylor expanded in t around inf 56.0%
distribute-lft-out--56.0%
associate-*r*56.0%
mul-1-neg56.0%
*-commutative56.0%
Simplified56.0%
if -9.8e11 < z < -7.2000000000000008e-133 or -5.6e-216 < z < -1.6599999999999999e-239 or 1.04999999999999996e-76 < z < 3.79999999999999998e134Initial program 86.2%
cancel-sign-sub86.2%
cancel-sign-sub-inv86.2%
*-commutative86.2%
remove-double-neg86.2%
*-commutative86.2%
Simplified86.2%
Taylor expanded in y around 0 75.9%
sub-neg75.9%
+-commutative75.9%
*-commutative75.9%
associate-*r*79.4%
*-commutative79.4%
mul-1-neg79.4%
distribute-rgt-neg-in79.4%
mul-1-neg79.4%
distribute-lft-in79.4%
mul-1-neg79.4%
unsub-neg79.4%
*-commutative79.4%
*-commutative79.4%
distribute-rgt-neg-in79.4%
neg-sub079.4%
associate-+l-79.4%
neg-sub079.4%
+-commutative79.4%
sub-neg79.4%
Simplified79.4%
Taylor expanded in j around inf 70.8%
*-commutative32.4%
Simplified70.8%
if -7.2000000000000008e-133 < z < -5.6e-216Initial program 59.2%
cancel-sign-sub59.2%
cancel-sign-sub-inv59.2%
*-commutative59.2%
remove-double-neg59.2%
*-commutative59.2%
Simplified59.2%
Taylor expanded in a around inf 68.9%
+-commutative68.9%
mul-1-neg68.9%
unsub-neg68.9%
*-commutative68.9%
Simplified68.9%
if -1.6599999999999999e-239 < z < 1.04999999999999996e-76Initial program 77.2%
cancel-sign-sub77.2%
cancel-sign-sub-inv77.2%
*-commutative77.2%
remove-double-neg77.2%
*-commutative77.2%
Simplified77.2%
Taylor expanded in i around inf 68.2%
if 3.79999999999999998e134 < z < 7.99999999999999979e233Initial program 62.8%
cancel-sign-sub62.8%
cancel-sign-sub-inv62.8%
*-commutative62.8%
remove-double-neg62.8%
*-commutative62.8%
Simplified62.8%
Taylor expanded in x around inf 67.0%
Final simplification71.4%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (+ (* a (- (* c j) (* x t))) (* b (- (* t i) (* z c))))))
(if (<= t -6.8e-23)
t_1
(if (<= t -1.3e-73)
(* y (- (* x z) (* i j)))
(if (<= t -4e-150)
t_1
(if (<= t 0.00025)
(+ (* j (- (* a c) (* y i))) (* z (- (* x y) (* b c))))
(if (<= t 2.4e+218) t_1 (* t (- (* b i) (* x a))))))))))
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))) + (b * ((t * i) - (z * c)));
double tmp;
if (t <= -6.8e-23) {
tmp = t_1;
} else if (t <= -1.3e-73) {
tmp = y * ((x * z) - (i * j));
} else if (t <= -4e-150) {
tmp = t_1;
} else if (t <= 0.00025) {
tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c)));
} else if (t <= 2.4e+218) {
tmp = t_1;
} else {
tmp = t * ((b * i) - (x * a));
}
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))) + (b * ((t * i) - (z * c)))
if (t <= (-6.8d-23)) then
tmp = t_1
else if (t <= (-1.3d-73)) then
tmp = y * ((x * z) - (i * j))
else if (t <= (-4d-150)) then
tmp = t_1
else if (t <= 0.00025d0) then
tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c)))
else if (t <= 2.4d+218) then
tmp = t_1
else
tmp = t * ((b * i) - (x * a))
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))) + (b * ((t * i) - (z * c)));
double tmp;
if (t <= -6.8e-23) {
tmp = t_1;
} else if (t <= -1.3e-73) {
tmp = y * ((x * z) - (i * j));
} else if (t <= -4e-150) {
tmp = t_1;
} else if (t <= 0.00025) {
tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c)));
} else if (t <= 2.4e+218) {
tmp = t_1;
} else {
tmp = t * ((b * i) - (x * a));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c))) tmp = 0 if t <= -6.8e-23: tmp = t_1 elif t <= -1.3e-73: tmp = y * ((x * z) - (i * j)) elif t <= -4e-150: tmp = t_1 elif t <= 0.00025: tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c))) elif t <= 2.4e+218: tmp = t_1 else: tmp = t * ((b * i) - (x * a)) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(a * Float64(Float64(c * j) - Float64(x * t))) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) tmp = 0.0 if (t <= -6.8e-23) tmp = t_1; elseif (t <= -1.3e-73) tmp = Float64(y * Float64(Float64(x * z) - Float64(i * j))); elseif (t <= -4e-150) tmp = t_1; elseif (t <= 0.00025) tmp = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(z * Float64(Float64(x * y) - Float64(b * c)))); elseif (t <= 2.4e+218) tmp = t_1; else tmp = Float64(t * Float64(Float64(b * i) - Float64(x * a))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c))); tmp = 0.0; if (t <= -6.8e-23) tmp = t_1; elseif (t <= -1.3e-73) tmp = y * ((x * z) - (i * j)); elseif (t <= -4e-150) tmp = t_1; elseif (t <= 0.00025) tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c))); elseif (t <= 2.4e+218) tmp = t_1; else tmp = t * ((b * i) - (x * a)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -6.8e-23], t$95$1, If[LessEqual[t, -1.3e-73], N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -4e-150], t$95$1, If[LessEqual[t, 0.00025], N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.4e+218], t$95$1, N[(t * N[(N[(b * i), $MachinePrecision] - N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j - x \cdot t\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
\mathbf{if}\;t \leq -6.8 \cdot 10^{-23}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -1.3 \cdot 10^{-73}:\\
\;\;\;\;y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{elif}\;t \leq -4 \cdot 10^{-150}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 0.00025:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right) + z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{elif}\;t \leq 2.4 \cdot 10^{+218}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(b \cdot i - x \cdot a\right)\\
\end{array}
\end{array}
if t < -6.8000000000000001e-23 or -1.3e-73 < t < -4.00000000000000003e-150 or 2.5000000000000001e-4 < t < 2.39999999999999981e218Initial program 65.8%
cancel-sign-sub65.8%
cancel-sign-sub-inv65.8%
*-commutative65.8%
remove-double-neg65.8%
*-commutative65.8%
Simplified65.8%
Taylor expanded in y around 0 67.0%
sub-neg67.0%
+-commutative67.0%
*-commutative67.0%
associate-*r*67.7%
*-commutative67.7%
mul-1-neg67.7%
distribute-rgt-neg-in67.7%
mul-1-neg67.7%
distribute-lft-in71.5%
mul-1-neg71.5%
unsub-neg71.5%
*-commutative71.5%
*-commutative71.5%
distribute-rgt-neg-in71.5%
neg-sub071.5%
associate-+l-71.5%
neg-sub071.5%
+-commutative71.5%
sub-neg71.5%
Simplified71.5%
if -6.8000000000000001e-23 < t < -1.3e-73Initial program 69.0%
cancel-sign-sub69.0%
cancel-sign-sub-inv69.0%
*-commutative69.0%
remove-double-neg69.0%
*-commutative69.0%
Simplified69.0%
Taylor expanded in y around inf 69.5%
*-commutative69.5%
mul-1-neg69.5%
unsub-neg69.5%
*-commutative69.5%
Simplified69.5%
if -4.00000000000000003e-150 < t < 2.5000000000000001e-4Initial program 88.3%
cancel-sign-sub88.3%
cancel-sign-sub-inv88.3%
*-commutative88.3%
remove-double-neg88.3%
*-commutative88.3%
Simplified88.3%
Taylor expanded in t around 0 78.2%
+-commutative78.2%
associate--l+78.2%
sub-neg78.2%
+-commutative78.2%
associate-*r*82.3%
distribute-lft-neg-in82.3%
mul-1-neg82.3%
*-commutative82.3%
associate-*r*81.3%
distribute-rgt-in81.3%
+-commutative81.3%
mul-1-neg81.3%
sub-neg81.3%
Simplified81.3%
if 2.39999999999999981e218 < t Initial program 55.5%
cancel-sign-sub55.5%
cancel-sign-sub-inv55.5%
*-commutative55.5%
remove-double-neg55.5%
*-commutative55.5%
Simplified55.5%
Taylor expanded in t around inf 80.8%
distribute-lft-out--80.8%
associate-*r*80.8%
mul-1-neg80.8%
*-commutative80.8%
Simplified80.8%
Final simplification75.6%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (+ (* a (- (* c j) (* x t))) (* b (- (* t i) (* z c))))))
(if (<= t -2.9e-14)
t_1
(if (<= t -4.2e-76)
(+ (* x (- (* y z) (* t a))) (* i (- (* t b) (* y j))))
(if (<= t -2e-150)
t_1
(if (<= t 3e-5)
(+ (* j (- (* a c) (* y i))) (* z (- (* x y) (* b c))))
(if (<= t 6.8e+217) t_1 (* t (- (* b i) (* x a))))))))))
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))) + (b * ((t * i) - (z * c)));
double tmp;
if (t <= -2.9e-14) {
tmp = t_1;
} else if (t <= -4.2e-76) {
tmp = (x * ((y * z) - (t * a))) + (i * ((t * b) - (y * j)));
} else if (t <= -2e-150) {
tmp = t_1;
} else if (t <= 3e-5) {
tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c)));
} else if (t <= 6.8e+217) {
tmp = t_1;
} else {
tmp = t * ((b * i) - (x * a));
}
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))) + (b * ((t * i) - (z * c)))
if (t <= (-2.9d-14)) then
tmp = t_1
else if (t <= (-4.2d-76)) then
tmp = (x * ((y * z) - (t * a))) + (i * ((t * b) - (y * j)))
else if (t <= (-2d-150)) then
tmp = t_1
else if (t <= 3d-5) then
tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c)))
else if (t <= 6.8d+217) then
tmp = t_1
else
tmp = t * ((b * i) - (x * a))
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))) + (b * ((t * i) - (z * c)));
double tmp;
if (t <= -2.9e-14) {
tmp = t_1;
} else if (t <= -4.2e-76) {
tmp = (x * ((y * z) - (t * a))) + (i * ((t * b) - (y * j)));
} else if (t <= -2e-150) {
tmp = t_1;
} else if (t <= 3e-5) {
tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c)));
} else if (t <= 6.8e+217) {
tmp = t_1;
} else {
tmp = t * ((b * i) - (x * a));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c))) tmp = 0 if t <= -2.9e-14: tmp = t_1 elif t <= -4.2e-76: tmp = (x * ((y * z) - (t * a))) + (i * ((t * b) - (y * j))) elif t <= -2e-150: tmp = t_1 elif t <= 3e-5: tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c))) elif t <= 6.8e+217: tmp = t_1 else: tmp = t * ((b * i) - (x * a)) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(a * Float64(Float64(c * j) - Float64(x * t))) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) tmp = 0.0 if (t <= -2.9e-14) tmp = t_1; elseif (t <= -4.2e-76) tmp = Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) + Float64(i * Float64(Float64(t * b) - Float64(y * j)))); elseif (t <= -2e-150) tmp = t_1; elseif (t <= 3e-5) tmp = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(z * Float64(Float64(x * y) - Float64(b * c)))); elseif (t <= 6.8e+217) tmp = t_1; else tmp = Float64(t * Float64(Float64(b * i) - Float64(x * a))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c))); tmp = 0.0; if (t <= -2.9e-14) tmp = t_1; elseif (t <= -4.2e-76) tmp = (x * ((y * z) - (t * a))) + (i * ((t * b) - (y * j))); elseif (t <= -2e-150) tmp = t_1; elseif (t <= 3e-5) tmp = (j * ((a * c) - (y * i))) + (z * ((x * y) - (b * c))); elseif (t <= 6.8e+217) tmp = t_1; else tmp = t * ((b * i) - (x * a)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.9e-14], t$95$1, If[LessEqual[t, -4.2e-76], N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(i * N[(N[(t * b), $MachinePrecision] - N[(y * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -2e-150], t$95$1, If[LessEqual[t, 3e-5], N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 6.8e+217], t$95$1, N[(t * N[(N[(b * i), $MachinePrecision] - N[(x * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j - x \cdot t\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
\mathbf{if}\;t \leq -2.9 \cdot 10^{-14}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -4.2 \cdot 10^{-76}:\\
\;\;\;\;x \cdot \left(y \cdot z - t \cdot a\right) + i \cdot \left(t \cdot b - y \cdot j\right)\\
\mathbf{elif}\;t \leq -2 \cdot 10^{-150}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 3 \cdot 10^{-5}:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right) + z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{elif}\;t \leq 6.8 \cdot 10^{+217}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(b \cdot i - x \cdot a\right)\\
\end{array}
\end{array}
if t < -2.9000000000000003e-14 or -4.19999999999999985e-76 < t < -2.00000000000000001e-150 or 3.00000000000000008e-5 < t < 6.7999999999999998e217Initial program 65.8%
cancel-sign-sub65.8%
cancel-sign-sub-inv65.8%
*-commutative65.8%
remove-double-neg65.8%
*-commutative65.8%
Simplified65.8%
Taylor expanded in y around 0 67.0%
sub-neg67.0%
+-commutative67.0%
*-commutative67.0%
associate-*r*67.7%
*-commutative67.7%
mul-1-neg67.7%
distribute-rgt-neg-in67.7%
mul-1-neg67.7%
distribute-lft-in71.5%
mul-1-neg71.5%
unsub-neg71.5%
*-commutative71.5%
*-commutative71.5%
distribute-rgt-neg-in71.5%
neg-sub071.5%
associate-+l-71.5%
neg-sub071.5%
+-commutative71.5%
sub-neg71.5%
Simplified71.5%
if -2.9000000000000003e-14 < t < -4.19999999999999985e-76Initial program 69.0%
sub-neg69.0%
+-commutative69.0%
associate-+l+69.0%
distribute-rgt-neg-in69.0%
+-commutative69.0%
fma-def76.7%
sub-neg76.7%
+-commutative76.7%
distribute-neg-in76.7%
unsub-neg76.7%
remove-double-neg76.7%
*-commutative76.7%
Simplified76.7%
fma-udef76.7%
*-commutative76.7%
Applied egg-rr76.7%
Taylor expanded in c around 0 69.3%
+-commutative69.3%
associate-+l+69.3%
associate-*r*69.3%
*-commutative69.3%
associate-*r*77.1%
associate-*r*77.1%
*-commutative77.1%
distribute-lft-in77.1%
+-commutative77.1%
mul-1-neg77.1%
unsub-neg77.1%
Simplified77.1%
if -2.00000000000000001e-150 < t < 3.00000000000000008e-5Initial program 88.3%
cancel-sign-sub88.3%
cancel-sign-sub-inv88.3%
*-commutative88.3%
remove-double-neg88.3%
*-commutative88.3%
Simplified88.3%
Taylor expanded in t around 0 78.2%
+-commutative78.2%
associate--l+78.2%
sub-neg78.2%
+-commutative78.2%
associate-*r*82.3%
distribute-lft-neg-in82.3%
mul-1-neg82.3%
*-commutative82.3%
associate-*r*81.3%
distribute-rgt-in81.3%
+-commutative81.3%
mul-1-neg81.3%
sub-neg81.3%
Simplified81.3%
if 6.7999999999999998e217 < t Initial program 55.5%
cancel-sign-sub55.5%
cancel-sign-sub-inv55.5%
*-commutative55.5%
remove-double-neg55.5%
*-commutative55.5%
Simplified55.5%
Taylor expanded in t around inf 80.8%
distribute-lft-out--80.8%
associate-*r*80.8%
mul-1-neg80.8%
*-commutative80.8%
Simplified80.8%
Final simplification76.0%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (+ (* a (* c j)) (* b (- (* t i) (* z c)))))
(t_2 (+ (* j (- (* a c) (* y i))) (* y (* x z)))))
(if (<= b -3e+49)
t_1
(if (<= b -7.5e-142)
t_2
(if (<= b -2.65e-219)
(* a (- (* c j) (* x t)))
(if (or (<= b 1.6e+62) (and (not (<= b 8.4e+165)) (<= b 2.25e+204)))
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 = (a * (c * j)) + (b * ((t * i) - (z * c)));
double t_2 = (j * ((a * c) - (y * i))) + (y * (x * z));
double tmp;
if (b <= -3e+49) {
tmp = t_1;
} else if (b <= -7.5e-142) {
tmp = t_2;
} else if (b <= -2.65e-219) {
tmp = a * ((c * j) - (x * t));
} else if ((b <= 1.6e+62) || (!(b <= 8.4e+165) && (b <= 2.25e+204))) {
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 = (a * (c * j)) + (b * ((t * i) - (z * c)))
t_2 = (j * ((a * c) - (y * i))) + (y * (x * z))
if (b <= (-3d+49)) then
tmp = t_1
else if (b <= (-7.5d-142)) then
tmp = t_2
else if (b <= (-2.65d-219)) then
tmp = a * ((c * j) - (x * t))
else if ((b <= 1.6d+62) .or. (.not. (b <= 8.4d+165)) .and. (b <= 2.25d+204)) 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 = (a * (c * j)) + (b * ((t * i) - (z * c)));
double t_2 = (j * ((a * c) - (y * i))) + (y * (x * z));
double tmp;
if (b <= -3e+49) {
tmp = t_1;
} else if (b <= -7.5e-142) {
tmp = t_2;
} else if (b <= -2.65e-219) {
tmp = a * ((c * j) - (x * t));
} else if ((b <= 1.6e+62) || (!(b <= 8.4e+165) && (b <= 2.25e+204))) {
tmp = t_2;
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (a * (c * j)) + (b * ((t * i) - (z * c))) t_2 = (j * ((a * c) - (y * i))) + (y * (x * z)) tmp = 0 if b <= -3e+49: tmp = t_1 elif b <= -7.5e-142: tmp = t_2 elif b <= -2.65e-219: tmp = a * ((c * j) - (x * t)) elif (b <= 1.6e+62) or (not (b <= 8.4e+165) and (b <= 2.25e+204)): tmp = t_2 else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(a * Float64(c * j)) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) t_2 = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(y * Float64(x * z))) tmp = 0.0 if (b <= -3e+49) tmp = t_1; elseif (b <= -7.5e-142) tmp = t_2; elseif (b <= -2.65e-219) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif ((b <= 1.6e+62) || (!(b <= 8.4e+165) && (b <= 2.25e+204))) 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 = (a * (c * j)) + (b * ((t * i) - (z * c))); t_2 = (j * ((a * c) - (y * i))) + (y * (x * z)); tmp = 0.0; if (b <= -3e+49) tmp = t_1; elseif (b <= -7.5e-142) tmp = t_2; elseif (b <= -2.65e-219) tmp = a * ((c * j) - (x * t)); elseif ((b <= 1.6e+62) || (~((b <= 8.4e+165)) && (b <= 2.25e+204))) 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[(N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -3e+49], t$95$1, If[LessEqual[b, -7.5e-142], t$95$2, If[LessEqual[b, -2.65e-219], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[b, 1.6e+62], And[N[Not[LessEqual[b, 8.4e+165]], $MachinePrecision], LessEqual[b, 2.25e+204]]], t$95$2, t$95$1]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
t_2 := j \cdot \left(a \cdot c - y \cdot i\right) + y \cdot \left(x \cdot z\right)\\
\mathbf{if}\;b \leq -3 \cdot 10^{+49}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;b \leq -7.5 \cdot 10^{-142}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;b \leq -2.65 \cdot 10^{-219}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;b \leq 1.6 \cdot 10^{+62} \lor \neg \left(b \leq 8.4 \cdot 10^{+165}\right) \land b \leq 2.25 \cdot 10^{+204}:\\
\;\;\;\;t_2\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if b < -3.0000000000000002e49 or 1.59999999999999992e62 < b < 8.4000000000000002e165 or 2.25000000000000001e204 < b Initial program 67.0%
cancel-sign-sub67.0%
cancel-sign-sub-inv67.0%
*-commutative67.0%
remove-double-neg67.0%
*-commutative67.0%
Simplified67.0%
Taylor expanded in y around 0 76.5%
sub-neg76.5%
+-commutative76.5%
*-commutative76.5%
associate-*r*80.1%
*-commutative80.1%
mul-1-neg80.1%
distribute-rgt-neg-in80.1%
mul-1-neg80.1%
distribute-lft-in81.0%
mul-1-neg81.0%
unsub-neg81.0%
*-commutative81.0%
*-commutative81.0%
distribute-rgt-neg-in81.0%
neg-sub081.0%
associate-+l-81.0%
neg-sub081.0%
+-commutative81.0%
sub-neg81.0%
Simplified81.0%
Taylor expanded in j around inf 78.2%
*-commutative25.2%
Simplified78.2%
if -3.0000000000000002e49 < b < -7.49999999999999958e-142 or -2.6500000000000001e-219 < b < 1.59999999999999992e62 or 8.4000000000000002e165 < b < 2.25000000000000001e204Initial program 81.4%
cancel-sign-sub81.4%
cancel-sign-sub-inv81.4%
*-commutative81.4%
remove-double-neg81.4%
*-commutative81.4%
Simplified81.4%
Taylor expanded in t around 0 73.4%
+-commutative73.4%
associate--l+73.4%
sub-neg73.4%
+-commutative73.4%
associate-*r*73.5%
distribute-lft-neg-in73.5%
mul-1-neg73.5%
*-commutative73.5%
associate-*r*72.0%
distribute-rgt-in72.0%
+-commutative72.0%
mul-1-neg72.0%
sub-neg72.0%
Simplified72.0%
Taylor expanded in b around 0 71.1%
if -7.49999999999999958e-142 < b < -2.6500000000000001e-219Initial program 58.4%
cancel-sign-sub58.4%
cancel-sign-sub-inv58.4%
*-commutative58.4%
remove-double-neg58.4%
*-commutative58.4%
Simplified58.4%
Taylor expanded in a around inf 59.5%
+-commutative59.5%
mul-1-neg59.5%
unsub-neg59.5%
*-commutative59.5%
Simplified59.5%
Final simplification73.3%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (+ (* a (- (* c j) (* x t))) (* b (- (* t i) (* z c)))))
(t_2 (* z (- (* x y) (* b c)))))
(if (<= z -3.6e+112)
t_2
(if (<= z -7.5e-243)
t_1
(if (<= z 1e-150)
(+ (* j (- (* a c) (* y i))) (* i (* t b)))
(if (<= z 1.4e+192) 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 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c)));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -3.6e+112) {
tmp = t_2;
} else if (z <= -7.5e-243) {
tmp = t_1;
} else if (z <= 1e-150) {
tmp = (j * ((a * c) - (y * i))) + (i * (t * b));
} else if (z <= 1.4e+192) {
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 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c)))
t_2 = z * ((x * y) - (b * c))
if (z <= (-3.6d+112)) then
tmp = t_2
else if (z <= (-7.5d-243)) then
tmp = t_1
else if (z <= 1d-150) then
tmp = (j * ((a * c) - (y * i))) + (i * (t * b))
else if (z <= 1.4d+192) 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 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c)));
double t_2 = z * ((x * y) - (b * c));
double tmp;
if (z <= -3.6e+112) {
tmp = t_2;
} else if (z <= -7.5e-243) {
tmp = t_1;
} else if (z <= 1e-150) {
tmp = (j * ((a * c) - (y * i))) + (i * (t * b));
} else if (z <= 1.4e+192) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c))) t_2 = z * ((x * y) - (b * c)) tmp = 0 if z <= -3.6e+112: tmp = t_2 elif z <= -7.5e-243: tmp = t_1 elif z <= 1e-150: tmp = (j * ((a * c) - (y * i))) + (i * (t * b)) elif z <= 1.4e+192: tmp = t_1 else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(Float64(a * Float64(Float64(c * j) - Float64(x * t))) + Float64(b * Float64(Float64(t * i) - Float64(z * c)))) t_2 = Float64(z * Float64(Float64(x * y) - Float64(b * c))) tmp = 0.0 if (z <= -3.6e+112) tmp = t_2; elseif (z <= -7.5e-243) tmp = t_1; elseif (z <= 1e-150) tmp = Float64(Float64(j * Float64(Float64(a * c) - Float64(y * i))) + Float64(i * Float64(t * b))); elseif (z <= 1.4e+192) 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 = (a * ((c * j) - (x * t))) + (b * ((t * i) - (z * c))); t_2 = z * ((x * y) - (b * c)); tmp = 0.0; if (z <= -3.6e+112) tmp = t_2; elseif (z <= -7.5e-243) tmp = t_1; elseif (z <= 1e-150) tmp = (j * ((a * c) - (y * i))) + (i * (t * b)); elseif (z <= 1.4e+192) 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[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * 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, -3.6e+112], t$95$2, If[LessEqual[z, -7.5e-243], t$95$1, If[LessEqual[z, 1e-150], N[(N[(j * N[(N[(a * c), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.4e+192], t$95$1, t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j - x \cdot t\right) + b \cdot \left(t \cdot i - z \cdot c\right)\\
t_2 := z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{if}\;z \leq -3.6 \cdot 10^{+112}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;z \leq -7.5 \cdot 10^{-243}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;z \leq 10^{-150}:\\
\;\;\;\;j \cdot \left(a \cdot c - y \cdot i\right) + i \cdot \left(t \cdot b\right)\\
\mathbf{elif}\;z \leq 1.4 \cdot 10^{+192}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if z < -3.6e112 or 1.39999999999999988e192 < z Initial program 60.2%
cancel-sign-sub60.2%
cancel-sign-sub-inv60.2%
*-commutative60.2%
remove-double-neg60.2%
*-commutative60.2%
Simplified60.2%
Taylor expanded in z around inf 79.0%
if -3.6e112 < z < -7.5e-243 or 1.00000000000000001e-150 < z < 1.39999999999999988e192Initial program 78.8%
cancel-sign-sub78.8%
cancel-sign-sub-inv78.8%
*-commutative78.8%
remove-double-neg78.8%
*-commutative78.8%
Simplified78.8%
Taylor expanded in y around 0 66.2%
sub-neg66.2%
+-commutative66.2%
*-commutative66.2%
associate-*r*69.5%
*-commutative69.5%
mul-1-neg69.5%
distribute-rgt-neg-in69.5%
mul-1-neg69.5%
distribute-lft-in71.6%
mul-1-neg71.6%
unsub-neg71.6%
*-commutative71.6%
*-commutative71.6%
distribute-rgt-neg-in71.6%
neg-sub071.6%
associate-+l-71.6%
neg-sub071.6%
+-commutative71.6%
sub-neg71.6%
Simplified71.6%
if -7.5e-243 < z < 1.00000000000000001e-150Initial program 77.8%
cancel-sign-sub77.8%
cancel-sign-sub-inv77.8%
*-commutative77.8%
remove-double-neg77.8%
*-commutative77.8%
Simplified77.8%
Taylor expanded in i around inf 70.7%
Final simplification73.5%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* i (- (* t b) (* y j)))) (t_2 (* c (- (* a j) (* z b)))))
(if (<= c -8e+49)
t_2
(if (<= c -3.4e-292)
t_1
(if (<= c 4.9e-228)
(* z (* x y))
(if (<= c 7.8)
t_1
(if (<= c 9.5e+139) (* a (- (* c j) (* x t))) 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 = c * ((a * j) - (z * b));
double tmp;
if (c <= -8e+49) {
tmp = t_2;
} else if (c <= -3.4e-292) {
tmp = t_1;
} else if (c <= 4.9e-228) {
tmp = z * (x * y);
} else if (c <= 7.8) {
tmp = t_1;
} else if (c <= 9.5e+139) {
tmp = a * ((c * j) - (x * t));
} 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 = c * ((a * j) - (z * b))
if (c <= (-8d+49)) then
tmp = t_2
else if (c <= (-3.4d-292)) then
tmp = t_1
else if (c <= 4.9d-228) then
tmp = z * (x * y)
else if (c <= 7.8d0) then
tmp = t_1
else if (c <= 9.5d+139) then
tmp = a * ((c * j) - (x * t))
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 = c * ((a * j) - (z * b));
double tmp;
if (c <= -8e+49) {
tmp = t_2;
} else if (c <= -3.4e-292) {
tmp = t_1;
} else if (c <= 4.9e-228) {
tmp = z * (x * y);
} else if (c <= 7.8) {
tmp = t_1;
} else if (c <= 9.5e+139) {
tmp = a * ((c * j) - (x * t));
} 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 = c * ((a * j) - (z * b)) tmp = 0 if c <= -8e+49: tmp = t_2 elif c <= -3.4e-292: tmp = t_1 elif c <= 4.9e-228: tmp = z * (x * y) elif c <= 7.8: tmp = t_1 elif c <= 9.5e+139: tmp = a * ((c * j) - (x * t)) 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(c * Float64(Float64(a * j) - Float64(z * b))) tmp = 0.0 if (c <= -8e+49) tmp = t_2; elseif (c <= -3.4e-292) tmp = t_1; elseif (c <= 4.9e-228) tmp = Float64(z * Float64(x * y)); elseif (c <= 7.8) tmp = t_1; elseif (c <= 9.5e+139) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); 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 = c * ((a * j) - (z * b)); tmp = 0.0; if (c <= -8e+49) tmp = t_2; elseif (c <= -3.4e-292) tmp = t_1; elseif (c <= 4.9e-228) tmp = z * (x * y); elseif (c <= 7.8) tmp = t_1; elseif (c <= 9.5e+139) tmp = a * ((c * j) - (x * t)); 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[(c * N[(N[(a * j), $MachinePrecision] - N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -8e+49], t$95$2, If[LessEqual[c, -3.4e-292], t$95$1, If[LessEqual[c, 4.9e-228], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 7.8], t$95$1, If[LessEqual[c, 9.5e+139], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $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 := c \cdot \left(a \cdot j - z \cdot b\right)\\
\mathbf{if}\;c \leq -8 \cdot 10^{+49}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;c \leq -3.4 \cdot 10^{-292}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;c \leq 4.9 \cdot 10^{-228}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;c \leq 7.8:\\
\;\;\;\;t_1\\
\mathbf{elif}\;c \leq 9.5 \cdot 10^{+139}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if c < -7.99999999999999957e49 or 9.5000000000000002e139 < c Initial program 66.9%
cancel-sign-sub66.9%
cancel-sign-sub-inv66.9%
*-commutative66.9%
remove-double-neg66.9%
*-commutative66.9%
Simplified66.9%
Taylor expanded in c around inf 72.2%
*-commutative72.2%
Simplified72.2%
if -7.99999999999999957e49 < c < -3.40000000000000017e-292 or 4.89999999999999988e-228 < c < 7.79999999999999982Initial program 79.4%
sub-neg79.4%
+-commutative79.4%
associate-+l+79.4%
distribute-rgt-neg-in79.4%
+-commutative79.4%
fma-def81.2%
sub-neg81.2%
+-commutative81.2%
distribute-neg-in81.2%
unsub-neg81.2%
remove-double-neg81.2%
*-commutative81.2%
Simplified81.2%
fma-udef81.2%
*-commutative81.2%
Applied egg-rr81.2%
Taylor expanded in i around inf 51.1%
mul-1-neg51.1%
unsub-neg51.1%
Simplified51.1%
if -3.40000000000000017e-292 < c < 4.89999999999999988e-228Initial program 79.8%
cancel-sign-sub79.8%
cancel-sign-sub-inv79.8%
*-commutative79.8%
remove-double-neg79.8%
*-commutative79.8%
Simplified79.8%
Taylor expanded in a around 0 57.4%
sub-neg57.4%
*-commutative57.4%
+-commutative57.4%
mul-1-neg57.4%
distribute-rgt-neg-in57.4%
mul-1-neg57.4%
distribute-lft-in57.4%
fma-udef60.7%
mul-1-neg60.7%
unsub-neg60.7%
*-commutative60.7%
distribute-rgt-neg-in60.7%
neg-sub060.7%
associate-+l-60.7%
neg-sub060.7%
Simplified60.7%
Taylor expanded in x around inf 44.9%
*-commutative44.9%
associate-*l*45.0%
*-commutative45.0%
Simplified45.0%
if 7.79999999999999982 < c < 9.5000000000000002e139Initial program 64.7%
cancel-sign-sub64.7%
cancel-sign-sub-inv64.7%
*-commutative64.7%
remove-double-neg64.7%
*-commutative64.7%
Simplified64.7%
Taylor expanded in a around inf 65.5%
+-commutative65.5%
mul-1-neg65.5%
unsub-neg65.5%
*-commutative65.5%
Simplified65.5%
Final simplification59.0%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))))
(if (<= t -4.6e-25)
(* b (* t i))
(if (<= t -1.3e-213)
t_1
(if (<= t 2.9e-131)
(* z (* x y))
(if (<= t 4e+58)
t_1
(if (<= t 2.3e+162)
(* (* z c) (- b))
(if (<= t 4.8e+232) (* i (* j (- y))) (* t (* x (- a)))))))))))
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);
double tmp;
if (t <= -4.6e-25) {
tmp = b * (t * i);
} else if (t <= -1.3e-213) {
tmp = t_1;
} else if (t <= 2.9e-131) {
tmp = z * (x * y);
} else if (t <= 4e+58) {
tmp = t_1;
} else if (t <= 2.3e+162) {
tmp = (z * c) * -b;
} else if (t <= 4.8e+232) {
tmp = i * (j * -y);
} else {
tmp = t * (x * -a);
}
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)
if (t <= (-4.6d-25)) then
tmp = b * (t * i)
else if (t <= (-1.3d-213)) then
tmp = t_1
else if (t <= 2.9d-131) then
tmp = z * (x * y)
else if (t <= 4d+58) then
tmp = t_1
else if (t <= 2.3d+162) then
tmp = (z * c) * -b
else if (t <= 4.8d+232) then
tmp = i * (j * -y)
else
tmp = t * (x * -a)
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);
double tmp;
if (t <= -4.6e-25) {
tmp = b * (t * i);
} else if (t <= -1.3e-213) {
tmp = t_1;
} else if (t <= 2.9e-131) {
tmp = z * (x * y);
} else if (t <= 4e+58) {
tmp = t_1;
} else if (t <= 2.3e+162) {
tmp = (z * c) * -b;
} else if (t <= 4.8e+232) {
tmp = i * (j * -y);
} else {
tmp = t * (x * -a);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) tmp = 0 if t <= -4.6e-25: tmp = b * (t * i) elif t <= -1.3e-213: tmp = t_1 elif t <= 2.9e-131: tmp = z * (x * y) elif t <= 4e+58: tmp = t_1 elif t <= 2.3e+162: tmp = (z * c) * -b elif t <= 4.8e+232: tmp = i * (j * -y) else: tmp = t * (x * -a) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) tmp = 0.0 if (t <= -4.6e-25) tmp = Float64(b * Float64(t * i)); elseif (t <= -1.3e-213) tmp = t_1; elseif (t <= 2.9e-131) tmp = Float64(z * Float64(x * y)); elseif (t <= 4e+58) tmp = t_1; elseif (t <= 2.3e+162) tmp = Float64(Float64(z * c) * Float64(-b)); elseif (t <= 4.8e+232) tmp = Float64(i * Float64(j * Float64(-y))); else tmp = Float64(t * Float64(x * Float64(-a))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = a * (c * j); tmp = 0.0; if (t <= -4.6e-25) tmp = b * (t * i); elseif (t <= -1.3e-213) tmp = t_1; elseif (t <= 2.9e-131) tmp = z * (x * y); elseif (t <= 4e+58) tmp = t_1; elseif (t <= 2.3e+162) tmp = (z * c) * -b; elseif (t <= 4.8e+232) tmp = i * (j * -y); else tmp = t * (x * -a); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -4.6e-25], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.3e-213], t$95$1, If[LessEqual[t, 2.9e-131], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 4e+58], t$95$1, If[LessEqual[t, 2.3e+162], N[(N[(z * c), $MachinePrecision] * (-b)), $MachinePrecision], If[LessEqual[t, 4.8e+232], N[(i * N[(j * (-y)), $MachinePrecision]), $MachinePrecision], N[(t * N[(x * (-a)), $MachinePrecision]), $MachinePrecision]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
\mathbf{if}\;t \leq -4.6 \cdot 10^{-25}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{elif}\;t \leq -1.3 \cdot 10^{-213}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 2.9 \cdot 10^{-131}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;t \leq 4 \cdot 10^{+58}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 2.3 \cdot 10^{+162}:\\
\;\;\;\;\left(z \cdot c\right) \cdot \left(-b\right)\\
\mathbf{elif}\;t \leq 4.8 \cdot 10^{+232}:\\
\;\;\;\;i \cdot \left(j \cdot \left(-y\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(x \cdot \left(-a\right)\right)\\
\end{array}
\end{array}
if t < -4.5999999999999998e-25Initial program 66.7%
cancel-sign-sub66.7%
cancel-sign-sub-inv66.7%
*-commutative66.7%
remove-double-neg66.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in b around inf 55.8%
Taylor expanded in i around inf 47.4%
*-commutative47.4%
Simplified47.4%
if -4.5999999999999998e-25 < t < -1.3000000000000001e-213 or 2.9000000000000002e-131 < t < 3.99999999999999978e58Initial program 81.6%
cancel-sign-sub81.6%
cancel-sign-sub-inv81.6%
*-commutative81.6%
remove-double-neg81.6%
*-commutative81.6%
Simplified81.6%
Taylor expanded in a around inf 49.5%
+-commutative49.5%
mul-1-neg49.5%
unsub-neg49.5%
*-commutative49.5%
Simplified49.5%
Taylor expanded in j around inf 44.3%
*-commutative44.3%
Simplified44.3%
if -1.3000000000000001e-213 < t < 2.9000000000000002e-131Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
*-commutative36.1%
associate-*l*38.0%
*-commutative38.0%
Simplified38.0%
if 3.99999999999999978e58 < t < 2.29999999999999994e162Initial program 33.7%
cancel-sign-sub33.7%
cancel-sign-sub-inv33.7%
*-commutative33.7%
remove-double-neg33.7%
*-commutative33.7%
Simplified33.7%
Taylor expanded in b around inf 67.7%
Taylor expanded in i around 0 54.5%
mul-1-neg54.5%
distribute-lft-neg-out54.5%
*-commutative54.5%
Simplified54.5%
if 2.29999999999999994e162 < t < 4.8000000000000003e232Initial program 62.5%
cancel-sign-sub62.5%
cancel-sign-sub-inv62.5%
*-commutative62.5%
remove-double-neg62.5%
*-commutative62.5%
Simplified62.5%
Taylor expanded in a around 0 56.4%
sub-neg56.4%
*-commutative56.4%
+-commutative56.4%
mul-1-neg56.4%
distribute-rgt-neg-in56.4%
mul-1-neg56.4%
distribute-lft-in56.4%
fma-udef62.6%
mul-1-neg62.6%
unsub-neg62.6%
*-commutative62.6%
distribute-rgt-neg-in62.6%
neg-sub062.6%
associate-+l-62.6%
neg-sub062.6%
Simplified62.6%
Taylor expanded in j around inf 44.9%
*-commutative44.9%
associate-*r*44.9%
associate-*r*45.0%
associate-*r*45.0%
*-commutative45.0%
mul-1-neg45.0%
distribute-rgt-neg-in45.0%
Simplified45.0%
if 4.8000000000000003e232 < t Initial program 57.0%
cancel-sign-sub57.0%
cancel-sign-sub-inv57.0%
*-commutative57.0%
remove-double-neg57.0%
*-commutative57.0%
Simplified57.0%
Taylor expanded in t around inf 89.3%
distribute-lft-out--89.3%
associate-*r*89.3%
mul-1-neg89.3%
*-commutative89.3%
Simplified89.3%
Taylor expanded in a around inf 65.0%
Final simplification45.7%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))))
(if (<= t -5e-25)
(* b (* t i))
(if (<= t -5.2e-213)
t_1
(if (<= t 2.7e-130)
(* z (* x y))
(if (<= t 4.4e-9)
t_1
(if (<= t 4.2e+211) (* i (* t b)) (* t (* x (- a))))))))))
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);
double tmp;
if (t <= -5e-25) {
tmp = b * (t * i);
} else if (t <= -5.2e-213) {
tmp = t_1;
} else if (t <= 2.7e-130) {
tmp = z * (x * y);
} else if (t <= 4.4e-9) {
tmp = t_1;
} else if (t <= 4.2e+211) {
tmp = i * (t * b);
} else {
tmp = t * (x * -a);
}
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)
if (t <= (-5d-25)) then
tmp = b * (t * i)
else if (t <= (-5.2d-213)) then
tmp = t_1
else if (t <= 2.7d-130) then
tmp = z * (x * y)
else if (t <= 4.4d-9) then
tmp = t_1
else if (t <= 4.2d+211) then
tmp = i * (t * b)
else
tmp = t * (x * -a)
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);
double tmp;
if (t <= -5e-25) {
tmp = b * (t * i);
} else if (t <= -5.2e-213) {
tmp = t_1;
} else if (t <= 2.7e-130) {
tmp = z * (x * y);
} else if (t <= 4.4e-9) {
tmp = t_1;
} else if (t <= 4.2e+211) {
tmp = i * (t * b);
} else {
tmp = t * (x * -a);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) tmp = 0 if t <= -5e-25: tmp = b * (t * i) elif t <= -5.2e-213: tmp = t_1 elif t <= 2.7e-130: tmp = z * (x * y) elif t <= 4.4e-9: tmp = t_1 elif t <= 4.2e+211: tmp = i * (t * b) else: tmp = t * (x * -a) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) tmp = 0.0 if (t <= -5e-25) tmp = Float64(b * Float64(t * i)); elseif (t <= -5.2e-213) tmp = t_1; elseif (t <= 2.7e-130) tmp = Float64(z * Float64(x * y)); elseif (t <= 4.4e-9) tmp = t_1; elseif (t <= 4.2e+211) tmp = Float64(i * Float64(t * b)); else tmp = Float64(t * Float64(x * Float64(-a))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = a * (c * j); tmp = 0.0; if (t <= -5e-25) tmp = b * (t * i); elseif (t <= -5.2e-213) tmp = t_1; elseif (t <= 2.7e-130) tmp = z * (x * y); elseif (t <= 4.4e-9) tmp = t_1; elseif (t <= 4.2e+211) tmp = i * (t * b); else tmp = t * (x * -a); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -5e-25], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -5.2e-213], t$95$1, If[LessEqual[t, 2.7e-130], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 4.4e-9], t$95$1, If[LessEqual[t, 4.2e+211], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], N[(t * N[(x * (-a)), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
\mathbf{if}\;t \leq -5 \cdot 10^{-25}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{elif}\;t \leq -5.2 \cdot 10^{-213}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 2.7 \cdot 10^{-130}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;t \leq 4.4 \cdot 10^{-9}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 4.2 \cdot 10^{+211}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(x \cdot \left(-a\right)\right)\\
\end{array}
\end{array}
if t < -4.99999999999999962e-25Initial program 66.7%
cancel-sign-sub66.7%
cancel-sign-sub-inv66.7%
*-commutative66.7%
remove-double-neg66.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in b around inf 55.8%
Taylor expanded in i around inf 47.4%
*-commutative47.4%
Simplified47.4%
if -4.99999999999999962e-25 < t < -5.2000000000000003e-213 or 2.69999999999999991e-130 < t < 4.3999999999999997e-9Initial program 83.9%
cancel-sign-sub83.9%
cancel-sign-sub-inv83.9%
*-commutative83.9%
remove-double-neg83.9%
*-commutative83.9%
Simplified83.9%
Taylor expanded in a around inf 51.7%
+-commutative51.7%
mul-1-neg51.7%
unsub-neg51.7%
*-commutative51.7%
Simplified51.7%
Taylor expanded in j around inf 46.9%
*-commutative46.9%
Simplified46.9%
if -5.2000000000000003e-213 < t < 2.69999999999999991e-130Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
*-commutative36.1%
associate-*l*38.0%
*-commutative38.0%
Simplified38.0%
if 4.3999999999999997e-9 < t < 4.2e211Initial program 52.8%
cancel-sign-sub52.8%
cancel-sign-sub-inv52.8%
*-commutative52.8%
remove-double-neg52.8%
*-commutative52.8%
Simplified52.8%
Taylor expanded in b around inf 59.4%
Taylor expanded in i around inf 37.8%
if 4.2e211 < t Initial program 57.1%
cancel-sign-sub57.1%
cancel-sign-sub-inv57.1%
*-commutative57.1%
remove-double-neg57.1%
*-commutative57.1%
Simplified57.1%
Taylor expanded in t around inf 74.3%
distribute-lft-out--74.3%
associate-*r*74.3%
mul-1-neg74.3%
*-commutative74.3%
Simplified74.3%
Taylor expanded in a around inf 58.3%
Final simplification44.9%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))))
(if (<= t -3.75e-25)
(* b (* t i))
(if (<= t -3.4e-214)
t_1
(if (<= t 1.02e-129)
(* z (* x y))
(if (<= t 3.1e-9)
t_1
(if (<= t 1.12e+204) (* i (* t b)) (* a (* x (- t))))))))))
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);
double tmp;
if (t <= -3.75e-25) {
tmp = b * (t * i);
} else if (t <= -3.4e-214) {
tmp = t_1;
} else if (t <= 1.02e-129) {
tmp = z * (x * y);
} else if (t <= 3.1e-9) {
tmp = t_1;
} else if (t <= 1.12e+204) {
tmp = i * (t * b);
} 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) :: t_1
real(8) :: tmp
t_1 = a * (c * j)
if (t <= (-3.75d-25)) then
tmp = b * (t * i)
else if (t <= (-3.4d-214)) then
tmp = t_1
else if (t <= 1.02d-129) then
tmp = z * (x * y)
else if (t <= 3.1d-9) then
tmp = t_1
else if (t <= 1.12d+204) then
tmp = i * (t * b)
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 t_1 = a * (c * j);
double tmp;
if (t <= -3.75e-25) {
tmp = b * (t * i);
} else if (t <= -3.4e-214) {
tmp = t_1;
} else if (t <= 1.02e-129) {
tmp = z * (x * y);
} else if (t <= 3.1e-9) {
tmp = t_1;
} else if (t <= 1.12e+204) {
tmp = i * (t * b);
} else {
tmp = a * (x * -t);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) tmp = 0 if t <= -3.75e-25: tmp = b * (t * i) elif t <= -3.4e-214: tmp = t_1 elif t <= 1.02e-129: tmp = z * (x * y) elif t <= 3.1e-9: tmp = t_1 elif t <= 1.12e+204: tmp = i * (t * b) else: tmp = a * (x * -t) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) tmp = 0.0 if (t <= -3.75e-25) tmp = Float64(b * Float64(t * i)); elseif (t <= -3.4e-214) tmp = t_1; elseif (t <= 1.02e-129) tmp = Float64(z * Float64(x * y)); elseif (t <= 3.1e-9) tmp = t_1; elseif (t <= 1.12e+204) tmp = Float64(i * Float64(t * b)); else tmp = Float64(a * Float64(x * Float64(-t))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = a * (c * j); tmp = 0.0; if (t <= -3.75e-25) tmp = b * (t * i); elseif (t <= -3.4e-214) tmp = t_1; elseif (t <= 1.02e-129) tmp = z * (x * y); elseif (t <= 3.1e-9) tmp = t_1; elseif (t <= 1.12e+204) tmp = i * (t * b); else tmp = a * (x * -t); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -3.75e-25], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -3.4e-214], t$95$1, If[LessEqual[t, 1.02e-129], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.1e-9], t$95$1, If[LessEqual[t, 1.12e+204], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], N[(a * N[(x * (-t)), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
\mathbf{if}\;t \leq -3.75 \cdot 10^{-25}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{elif}\;t \leq -3.4 \cdot 10^{-214}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 1.02 \cdot 10^{-129}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;t \leq 3.1 \cdot 10^{-9}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 1.12 \cdot 10^{+204}:\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(x \cdot \left(-t\right)\right)\\
\end{array}
\end{array}
if t < -3.74999999999999994e-25Initial program 66.7%
cancel-sign-sub66.7%
cancel-sign-sub-inv66.7%
*-commutative66.7%
remove-double-neg66.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in b around inf 55.8%
Taylor expanded in i around inf 47.4%
*-commutative47.4%
Simplified47.4%
if -3.74999999999999994e-25 < t < -3.3999999999999999e-214 or 1.02e-129 < t < 3.10000000000000005e-9Initial program 83.9%
cancel-sign-sub83.9%
cancel-sign-sub-inv83.9%
*-commutative83.9%
remove-double-neg83.9%
*-commutative83.9%
Simplified83.9%
Taylor expanded in a around inf 51.7%
+-commutative51.7%
mul-1-neg51.7%
unsub-neg51.7%
*-commutative51.7%
Simplified51.7%
Taylor expanded in j around inf 46.9%
*-commutative46.9%
Simplified46.9%
if -3.3999999999999999e-214 < t < 1.02e-129Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
*-commutative36.1%
associate-*l*38.0%
*-commutative38.0%
Simplified38.0%
if 3.10000000000000005e-9 < t < 1.11999999999999996e204Initial program 52.8%
cancel-sign-sub52.8%
cancel-sign-sub-inv52.8%
*-commutative52.8%
remove-double-neg52.8%
*-commutative52.8%
Simplified52.8%
Taylor expanded in b around inf 59.4%
Taylor expanded in i around inf 37.8%
if 1.11999999999999996e204 < t Initial program 57.1%
cancel-sign-sub57.1%
cancel-sign-sub-inv57.1%
*-commutative57.1%
remove-double-neg57.1%
*-commutative57.1%
Simplified57.1%
Taylor expanded in a around inf 58.4%
+-commutative58.4%
mul-1-neg58.4%
unsub-neg58.4%
*-commutative58.4%
Simplified58.4%
Taylor expanded in j around 0 58.3%
neg-mul-158.3%
distribute-rgt-neg-in58.3%
Simplified58.3%
Final simplification44.9%
(FPCore (x y z t a b c i j)
:precision binary64
(if (<= i -2.6e+58)
(* b (* t i))
(if (or (<= i 7.2e-78) (not (<= i 3.7e+63)))
(* a (- (* c j) (* x t)))
(* 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 (i <= -2.6e+58) {
tmp = b * (t * i);
} else if ((i <= 7.2e-78) || !(i <= 3.7e+63)) {
tmp = a * ((c * j) - (x * t));
} 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 (i <= (-2.6d+58)) then
tmp = b * (t * i)
else if ((i <= 7.2d-78) .or. (.not. (i <= 3.7d+63))) then
tmp = a * ((c * j) - (x * t))
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 (i <= -2.6e+58) {
tmp = b * (t * i);
} else if ((i <= 7.2e-78) || !(i <= 3.7e+63)) {
tmp = a * ((c * j) - (x * t));
} else {
tmp = y * (x * z);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if i <= -2.6e+58: tmp = b * (t * i) elif (i <= 7.2e-78) or not (i <= 3.7e+63): tmp = a * ((c * j) - (x * t)) else: tmp = y * (x * z) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if (i <= -2.6e+58) tmp = Float64(b * Float64(t * i)); elseif ((i <= 7.2e-78) || !(i <= 3.7e+63)) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); 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 (i <= -2.6e+58) tmp = b * (t * i); elseif ((i <= 7.2e-78) || ~((i <= 3.7e+63))) tmp = a * ((c * j) - (x * t)); else tmp = y * (x * z); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[i, -2.6e+58], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[i, 7.2e-78], N[Not[LessEqual[i, 3.7e+63]], $MachinePrecision]], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;i \leq -2.6 \cdot 10^{+58}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{elif}\;i \leq 7.2 \cdot 10^{-78} \lor \neg \left(i \leq 3.7 \cdot 10^{+63}\right):\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\end{array}
\end{array}
if i < -2.59999999999999988e58Initial program 63.5%
cancel-sign-sub63.5%
cancel-sign-sub-inv63.5%
*-commutative63.5%
remove-double-neg63.5%
*-commutative63.5%
Simplified63.5%
Taylor expanded in b around inf 65.9%
Taylor expanded in i around inf 52.7%
*-commutative52.7%
Simplified52.7%
if -2.59999999999999988e58 < i < 7.2000000000000005e-78 or 3.69999999999999968e63 < i Initial 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 a around inf 48.1%
+-commutative48.1%
mul-1-neg48.1%
unsub-neg48.1%
*-commutative48.1%
Simplified48.1%
if 7.2000000000000005e-78 < i < 3.69999999999999968e63Initial program 74.7%
cancel-sign-sub74.7%
cancel-sign-sub-inv74.7%
*-commutative74.7%
remove-double-neg74.7%
*-commutative74.7%
Simplified74.7%
Taylor expanded in a around 0 76.8%
sub-neg76.8%
*-commutative76.8%
+-commutative76.8%
mul-1-neg76.8%
distribute-rgt-neg-in76.8%
mul-1-neg76.8%
distribute-lft-in76.8%
fma-udef76.9%
mul-1-neg76.9%
unsub-neg76.9%
*-commutative76.9%
distribute-rgt-neg-in76.9%
neg-sub076.9%
associate-+l-76.9%
neg-sub076.9%
Simplified76.9%
Taylor expanded in x around inf 46.4%
Final simplification48.9%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* y (- (* x z) (* i j)))))
(if (<= y -2.15e+104)
t_1
(if (<= y -6.4e-113)
(* b (- (* t i) (* z c)))
(if (<= y 6.5e-7) (* a (- (* c j) (* 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 = y * ((x * z) - (i * j));
double tmp;
if (y <= -2.15e+104) {
tmp = t_1;
} else if (y <= -6.4e-113) {
tmp = b * ((t * i) - (z * c));
} else if (y <= 6.5e-7) {
tmp = a * ((c * j) - (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 = y * ((x * z) - (i * j))
if (y <= (-2.15d+104)) then
tmp = t_1
else if (y <= (-6.4d-113)) then
tmp = b * ((t * i) - (z * c))
else if (y <= 6.5d-7) then
tmp = a * ((c * j) - (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 = y * ((x * z) - (i * j));
double tmp;
if (y <= -2.15e+104) {
tmp = t_1;
} else if (y <= -6.4e-113) {
tmp = b * ((t * i) - (z * c));
} else if (y <= 6.5e-7) {
tmp = a * ((c * j) - (x * t));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = y * ((x * z) - (i * j)) tmp = 0 if y <= -2.15e+104: tmp = t_1 elif y <= -6.4e-113: tmp = b * ((t * i) - (z * c)) elif y <= 6.5e-7: tmp = a * ((c * j) - (x * t)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(y * Float64(Float64(x * z) - Float64(i * j))) tmp = 0.0 if (y <= -2.15e+104) tmp = t_1; elseif (y <= -6.4e-113) tmp = Float64(b * Float64(Float64(t * i) - Float64(z * c))); elseif (y <= 6.5e-7) tmp = Float64(a * Float64(Float64(c * j) - 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 = y * ((x * z) - (i * j)); tmp = 0.0; if (y <= -2.15e+104) tmp = t_1; elseif (y <= -6.4e-113) tmp = b * ((t * i) - (z * c)); elseif (y <= 6.5e-7) tmp = a * ((c * j) - (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[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.15e+104], t$95$1, If[LessEqual[y, -6.4e-113], N[(b * N[(N[(t * i), $MachinePrecision] - N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.5e-7], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{if}\;y \leq -2.15 \cdot 10^{+104}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;y \leq -6.4 \cdot 10^{-113}:\\
\;\;\;\;b \cdot \left(t \cdot i - z \cdot c\right)\\
\mathbf{elif}\;y \leq 6.5 \cdot 10^{-7}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if y < -2.1500000000000001e104 or 6.50000000000000024e-7 < y Initial program 62.3%
cancel-sign-sub62.3%
cancel-sign-sub-inv62.3%
*-commutative62.3%
remove-double-neg62.3%
*-commutative62.3%
Simplified62.3%
Taylor expanded in y around inf 64.3%
*-commutative64.3%
mul-1-neg64.3%
unsub-neg64.3%
*-commutative64.3%
Simplified64.3%
if -2.1500000000000001e104 < y < -6.4000000000000003e-113Initial program 85.3%
cancel-sign-sub85.3%
cancel-sign-sub-inv85.3%
*-commutative85.3%
remove-double-neg85.3%
*-commutative85.3%
Simplified85.3%
Taylor expanded in b around inf 54.5%
if -6.4000000000000003e-113 < y < 6.50000000000000024e-7Initial program 81.5%
cancel-sign-sub81.5%
cancel-sign-sub-inv81.5%
*-commutative81.5%
remove-double-neg81.5%
*-commutative81.5%
Simplified81.5%
Taylor expanded in a around inf 53.4%
+-commutative53.4%
mul-1-neg53.4%
unsub-neg53.4%
*-commutative53.4%
Simplified53.4%
Final simplification58.5%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* i (- (* t b) (* y j)))))
(if (<= i -1.85e+43)
t_1
(if (<= i 2.2e-241)
(* a (- (* c j) (* x t)))
(if (<= i 1.02e+89) (* z (- (* x y) (* b c))) 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 * ((t * b) - (y * j));
double tmp;
if (i <= -1.85e+43) {
tmp = t_1;
} else if (i <= 2.2e-241) {
tmp = a * ((c * j) - (x * t));
} else if (i <= 1.02e+89) {
tmp = z * ((x * y) - (b * c));
} 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 * ((t * b) - (y * j))
if (i <= (-1.85d+43)) then
tmp = t_1
else if (i <= 2.2d-241) then
tmp = a * ((c * j) - (x * t))
else if (i <= 1.02d+89) then
tmp = z * ((x * y) - (b * c))
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 * ((t * b) - (y * j));
double tmp;
if (i <= -1.85e+43) {
tmp = t_1;
} else if (i <= 2.2e-241) {
tmp = a * ((c * j) - (x * t));
} else if (i <= 1.02e+89) {
tmp = z * ((x * y) - (b * c));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = i * ((t * b) - (y * j)) tmp = 0 if i <= -1.85e+43: tmp = t_1 elif i <= 2.2e-241: tmp = a * ((c * j) - (x * t)) elif i <= 1.02e+89: tmp = z * ((x * y) - (b * c)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(i * Float64(Float64(t * b) - Float64(y * j))) tmp = 0.0 if (i <= -1.85e+43) tmp = t_1; elseif (i <= 2.2e-241) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif (i <= 1.02e+89) tmp = Float64(z * Float64(Float64(x * y) - Float64(b * c))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = i * ((t * b) - (y * j)); tmp = 0.0; if (i <= -1.85e+43) tmp = t_1; elseif (i <= 2.2e-241) tmp = a * ((c * j) - (x * t)); elseif (i <= 1.02e+89) tmp = z * ((x * y) - (b * c)); 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[(N[(t * b), $MachinePrecision] - N[(y * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, -1.85e+43], t$95$1, If[LessEqual[i, 2.2e-241], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[i, 1.02e+89], N[(z * N[(N[(x * y), $MachinePrecision] - N[(b * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := i \cdot \left(t \cdot b - y \cdot j\right)\\
\mathbf{if}\;i \leq -1.85 \cdot 10^{+43}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;i \leq 2.2 \cdot 10^{-241}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;i \leq 1.02 \cdot 10^{+89}:\\
\;\;\;\;z \cdot \left(x \cdot y - b \cdot c\right)\\
\mathbf{else}:\\
\;\;\;\;t_1\\
\end{array}
\end{array}
if i < -1.85e43 or 1.0199999999999999e89 < i Initial program 63.2%
sub-neg63.2%
+-commutative63.2%
associate-+l+63.2%
distribute-rgt-neg-in63.2%
+-commutative63.2%
fma-def64.2%
sub-neg64.2%
+-commutative64.2%
distribute-neg-in64.2%
unsub-neg64.2%
remove-double-neg64.2%
*-commutative64.2%
Simplified65.2%
fma-udef64.2%
*-commutative64.2%
Applied egg-rr64.2%
Taylor expanded in i around inf 68.3%
mul-1-neg68.3%
unsub-neg68.3%
Simplified68.3%
if -1.85e43 < i < 2.1999999999999999e-241Initial program 84.5%
cancel-sign-sub84.5%
cancel-sign-sub-inv84.5%
*-commutative84.5%
remove-double-neg84.5%
*-commutative84.5%
Simplified84.5%
Taylor expanded in a around inf 48.3%
+-commutative48.3%
mul-1-neg48.3%
unsub-neg48.3%
*-commutative48.3%
Simplified48.3%
if 2.1999999999999999e-241 < i < 1.0199999999999999e89Initial program 73.3%
cancel-sign-sub73.3%
cancel-sign-sub-inv73.3%
*-commutative73.3%
remove-double-neg73.3%
*-commutative73.3%
Simplified73.3%
Taylor expanded in z around inf 63.7%
Final simplification59.7%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))))
(if (<= t -5.1e-25)
(* b (* t i))
(if (<= t -5.5e-217)
t_1
(if (<= t 1.7e-126)
(* z (* x y))
(if (<= t 1e+83) t_1 (* x (* a (- t)))))))))
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);
double tmp;
if (t <= -5.1e-25) {
tmp = b * (t * i);
} else if (t <= -5.5e-217) {
tmp = t_1;
} else if (t <= 1.7e-126) {
tmp = z * (x * y);
} else if (t <= 1e+83) {
tmp = t_1;
} else {
tmp = x * (a * -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) :: t_1
real(8) :: tmp
t_1 = a * (c * j)
if (t <= (-5.1d-25)) then
tmp = b * (t * i)
else if (t <= (-5.5d-217)) then
tmp = t_1
else if (t <= 1.7d-126) then
tmp = z * (x * y)
else if (t <= 1d+83) then
tmp = t_1
else
tmp = x * (a * -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 t_1 = a * (c * j);
double tmp;
if (t <= -5.1e-25) {
tmp = b * (t * i);
} else if (t <= -5.5e-217) {
tmp = t_1;
} else if (t <= 1.7e-126) {
tmp = z * (x * y);
} else if (t <= 1e+83) {
tmp = t_1;
} else {
tmp = x * (a * -t);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) tmp = 0 if t <= -5.1e-25: tmp = b * (t * i) elif t <= -5.5e-217: tmp = t_1 elif t <= 1.7e-126: tmp = z * (x * y) elif t <= 1e+83: tmp = t_1 else: tmp = x * (a * -t) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) tmp = 0.0 if (t <= -5.1e-25) tmp = Float64(b * Float64(t * i)); elseif (t <= -5.5e-217) tmp = t_1; elseif (t <= 1.7e-126) tmp = Float64(z * Float64(x * y)); elseif (t <= 1e+83) tmp = t_1; else tmp = Float64(x * Float64(a * Float64(-t))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = a * (c * j); tmp = 0.0; if (t <= -5.1e-25) tmp = b * (t * i); elseif (t <= -5.5e-217) tmp = t_1; elseif (t <= 1.7e-126) tmp = z * (x * y); elseif (t <= 1e+83) tmp = t_1; else tmp = x * (a * -t); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -5.1e-25], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -5.5e-217], t$95$1, If[LessEqual[t, 1.7e-126], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1e+83], t$95$1, N[(x * N[(a * (-t)), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
\mathbf{if}\;t \leq -5.1 \cdot 10^{-25}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{elif}\;t \leq -5.5 \cdot 10^{-217}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 1.7 \cdot 10^{-126}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;t \leq 10^{+83}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;x \cdot \left(a \cdot \left(-t\right)\right)\\
\end{array}
\end{array}
if t < -5.1000000000000003e-25Initial program 66.7%
cancel-sign-sub66.7%
cancel-sign-sub-inv66.7%
*-commutative66.7%
remove-double-neg66.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in b around inf 55.8%
Taylor expanded in i around inf 47.4%
*-commutative47.4%
Simplified47.4%
if -5.1000000000000003e-25 < t < -5.49999999999999975e-217 or 1.7e-126 < t < 1.00000000000000003e83Initial program 81.3%
cancel-sign-sub81.3%
cancel-sign-sub-inv81.3%
*-commutative81.3%
remove-double-neg81.3%
*-commutative81.3%
Simplified81.3%
Taylor expanded in a around inf 47.5%
+-commutative47.5%
mul-1-neg47.5%
unsub-neg47.5%
*-commutative47.5%
Simplified47.5%
Taylor expanded in j around inf 42.5%
*-commutative42.5%
Simplified42.5%
if -5.49999999999999975e-217 < t < 1.7e-126Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
*-commutative36.1%
associate-*l*38.0%
*-commutative38.0%
Simplified38.0%
if 1.00000000000000003e83 < t Initial program 48.9%
cancel-sign-sub48.9%
cancel-sign-sub-inv48.9%
*-commutative48.9%
remove-double-neg48.9%
*-commutative48.9%
Simplified48.9%
Taylor expanded in a around inf 47.7%
+-commutative47.7%
mul-1-neg47.7%
unsub-neg47.7%
*-commutative47.7%
Simplified47.7%
Taylor expanded in j around 0 43.5%
neg-mul-143.5%
distribute-rgt-neg-in43.5%
Simplified43.5%
Taylor expanded in a around 0 43.5%
mul-1-neg43.5%
*-commutative43.5%
*-commutative43.5%
associate-*r*47.8%
distribute-rgt-neg-in47.8%
distribute-rgt-neg-in47.8%
Simplified47.8%
Final simplification43.8%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))) (t_2 (* t (* b i))))
(if (<= t -1.35e-8)
t_2
(if (<= t -2.6e-215)
t_1
(if (<= t 1.9e-127) (* y (* x z)) (if (<= t 3.7e-10) 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 = a * (c * j);
double t_2 = t * (b * i);
double tmp;
if (t <= -1.35e-8) {
tmp = t_2;
} else if (t <= -2.6e-215) {
tmp = t_1;
} else if (t <= 1.9e-127) {
tmp = y * (x * z);
} else if (t <= 3.7e-10) {
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 = a * (c * j)
t_2 = t * (b * i)
if (t <= (-1.35d-8)) then
tmp = t_2
else if (t <= (-2.6d-215)) then
tmp = t_1
else if (t <= 1.9d-127) then
tmp = y * (x * z)
else if (t <= 3.7d-10) 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 = a * (c * j);
double t_2 = t * (b * i);
double tmp;
if (t <= -1.35e-8) {
tmp = t_2;
} else if (t <= -2.6e-215) {
tmp = t_1;
} else if (t <= 1.9e-127) {
tmp = y * (x * z);
} else if (t <= 3.7e-10) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) t_2 = t * (b * i) tmp = 0 if t <= -1.35e-8: tmp = t_2 elif t <= -2.6e-215: tmp = t_1 elif t <= 1.9e-127: tmp = y * (x * z) elif t <= 3.7e-10: tmp = t_1 else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) t_2 = Float64(t * Float64(b * i)) tmp = 0.0 if (t <= -1.35e-8) tmp = t_2; elseif (t <= -2.6e-215) tmp = t_1; elseif (t <= 1.9e-127) tmp = Float64(y * Float64(x * z)); elseif (t <= 3.7e-10) 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 = a * (c * j); t_2 = t * (b * i); tmp = 0.0; if (t <= -1.35e-8) tmp = t_2; elseif (t <= -2.6e-215) tmp = t_1; elseif (t <= 1.9e-127) tmp = y * (x * z); elseif (t <= 3.7e-10) 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[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(b * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.35e-8], t$95$2, If[LessEqual[t, -2.6e-215], t$95$1, If[LessEqual[t, 1.9e-127], N[(y * N[(x * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.7e-10], t$95$1, t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
t_2 := t \cdot \left(b \cdot i\right)\\
\mathbf{if}\;t \leq -1.35 \cdot 10^{-8}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq -2.6 \cdot 10^{-215}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 1.9 \cdot 10^{-127}:\\
\;\;\;\;y \cdot \left(x \cdot z\right)\\
\mathbf{elif}\;t \leq 3.7 \cdot 10^{-10}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if t < -1.35000000000000001e-8 or 3.70000000000000015e-10 < t Initial program 61.6%
cancel-sign-sub61.6%
cancel-sign-sub-inv61.6%
*-commutative61.6%
remove-double-neg61.6%
*-commutative61.6%
Simplified61.6%
Taylor expanded in b around inf 52.4%
Taylor expanded in i around inf 35.6%
associate-*r*40.9%
*-commutative40.9%
associate-*r*38.7%
Simplified38.7%
if -1.35000000000000001e-8 < t < -2.6e-215 or 1.90000000000000001e-127 < t < 3.70000000000000015e-10Initial program 82.8%
cancel-sign-sub82.8%
cancel-sign-sub-inv82.8%
*-commutative82.8%
remove-double-neg82.8%
*-commutative82.8%
Simplified82.8%
Taylor expanded in a around inf 51.1%
+-commutative51.1%
mul-1-neg51.1%
unsub-neg51.1%
*-commutative51.1%
Simplified51.1%
Taylor expanded in j around inf 46.3%
*-commutative46.3%
Simplified46.3%
if -2.6e-215 < t < 1.90000000000000001e-127Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
Final simplification40.6%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))) (t_2 (* t (* b i))))
(if (<= t -3.3e-9)
t_2
(if (<= t -6.5e-215)
t_1
(if (<= t 7e-127) (* z (* x y)) (if (<= t 1.85e-7) 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 = a * (c * j);
double t_2 = t * (b * i);
double tmp;
if (t <= -3.3e-9) {
tmp = t_2;
} else if (t <= -6.5e-215) {
tmp = t_1;
} else if (t <= 7e-127) {
tmp = z * (x * y);
} else if (t <= 1.85e-7) {
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 = a * (c * j)
t_2 = t * (b * i)
if (t <= (-3.3d-9)) then
tmp = t_2
else if (t <= (-6.5d-215)) then
tmp = t_1
else if (t <= 7d-127) then
tmp = z * (x * y)
else if (t <= 1.85d-7) 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 = a * (c * j);
double t_2 = t * (b * i);
double tmp;
if (t <= -3.3e-9) {
tmp = t_2;
} else if (t <= -6.5e-215) {
tmp = t_1;
} else if (t <= 7e-127) {
tmp = z * (x * y);
} else if (t <= 1.85e-7) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) t_2 = t * (b * i) tmp = 0 if t <= -3.3e-9: tmp = t_2 elif t <= -6.5e-215: tmp = t_1 elif t <= 7e-127: tmp = z * (x * y) elif t <= 1.85e-7: tmp = t_1 else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) t_2 = Float64(t * Float64(b * i)) tmp = 0.0 if (t <= -3.3e-9) tmp = t_2; elseif (t <= -6.5e-215) tmp = t_1; elseif (t <= 7e-127) tmp = Float64(z * Float64(x * y)); elseif (t <= 1.85e-7) 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 = a * (c * j); t_2 = t * (b * i); tmp = 0.0; if (t <= -3.3e-9) tmp = t_2; elseif (t <= -6.5e-215) tmp = t_1; elseif (t <= 7e-127) tmp = z * (x * y); elseif (t <= 1.85e-7) 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[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(b * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -3.3e-9], t$95$2, If[LessEqual[t, -6.5e-215], t$95$1, If[LessEqual[t, 7e-127], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.85e-7], t$95$1, t$95$2]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
t_2 := t \cdot \left(b \cdot i\right)\\
\mathbf{if}\;t \leq -3.3 \cdot 10^{-9}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq -6.5 \cdot 10^{-215}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 7 \cdot 10^{-127}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;t \leq 1.85 \cdot 10^{-7}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if t < -3.30000000000000018e-9 or 1.85000000000000002e-7 < t Initial program 61.6%
cancel-sign-sub61.6%
cancel-sign-sub-inv61.6%
*-commutative61.6%
remove-double-neg61.6%
*-commutative61.6%
Simplified61.6%
Taylor expanded in b around inf 52.4%
Taylor expanded in i around inf 35.6%
associate-*r*40.9%
*-commutative40.9%
associate-*r*38.7%
Simplified38.7%
if -3.30000000000000018e-9 < t < -6.4999999999999999e-215 or 6.99999999999999979e-127 < t < 1.85000000000000002e-7Initial program 82.8%
cancel-sign-sub82.8%
cancel-sign-sub-inv82.8%
*-commutative82.8%
remove-double-neg82.8%
*-commutative82.8%
Simplified82.8%
Taylor expanded in a around inf 51.1%
+-commutative51.1%
mul-1-neg51.1%
unsub-neg51.1%
*-commutative51.1%
Simplified51.1%
Taylor expanded in j around inf 46.3%
*-commutative46.3%
Simplified46.3%
if -6.4999999999999999e-215 < t < 6.99999999999999979e-127Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
*-commutative36.1%
associate-*l*38.0%
*-commutative38.0%
Simplified38.0%
Final simplification40.9%
(FPCore (x y z t a b c i j)
:precision binary64
(let* ((t_1 (* a (* c j))))
(if (<= t -3.4e-25)
(* b (* t i))
(if (<= t -2.6e-215)
t_1
(if (<= t 2.7e-128)
(* z (* x y))
(if (<= t 3.5e-9) t_1 (* t (* b i))))))))
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);
double tmp;
if (t <= -3.4e-25) {
tmp = b * (t * i);
} else if (t <= -2.6e-215) {
tmp = t_1;
} else if (t <= 2.7e-128) {
tmp = z * (x * y);
} else if (t <= 3.5e-9) {
tmp = t_1;
} else {
tmp = t * (b * i);
}
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)
if (t <= (-3.4d-25)) then
tmp = b * (t * i)
else if (t <= (-2.6d-215)) then
tmp = t_1
else if (t <= 2.7d-128) then
tmp = z * (x * y)
else if (t <= 3.5d-9) then
tmp = t_1
else
tmp = t * (b * i)
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);
double tmp;
if (t <= -3.4e-25) {
tmp = b * (t * i);
} else if (t <= -2.6e-215) {
tmp = t_1;
} else if (t <= 2.7e-128) {
tmp = z * (x * y);
} else if (t <= 3.5e-9) {
tmp = t_1;
} else {
tmp = t * (b * i);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): t_1 = a * (c * j) tmp = 0 if t <= -3.4e-25: tmp = b * (t * i) elif t <= -2.6e-215: tmp = t_1 elif t <= 2.7e-128: tmp = z * (x * y) elif t <= 3.5e-9: tmp = t_1 else: tmp = t * (b * i) return tmp
function code(x, y, z, t, a, b, c, i, j) t_1 = Float64(a * Float64(c * j)) tmp = 0.0 if (t <= -3.4e-25) tmp = Float64(b * Float64(t * i)); elseif (t <= -2.6e-215) tmp = t_1; elseif (t <= 2.7e-128) tmp = Float64(z * Float64(x * y)); elseif (t <= 3.5e-9) tmp = t_1; else tmp = Float64(t * Float64(b * i)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) t_1 = a * (c * j); tmp = 0.0; if (t <= -3.4e-25) tmp = b * (t * i); elseif (t <= -2.6e-215) tmp = t_1; elseif (t <= 2.7e-128) tmp = z * (x * y); elseif (t <= 3.5e-9) tmp = t_1; else tmp = t * (b * i); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -3.4e-25], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -2.6e-215], t$95$1, If[LessEqual[t, 2.7e-128], N[(z * N[(x * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.5e-9], t$95$1, N[(t * N[(b * i), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a \cdot \left(c \cdot j\right)\\
\mathbf{if}\;t \leq -3.4 \cdot 10^{-25}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{elif}\;t \leq -2.6 \cdot 10^{-215}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 2.7 \cdot 10^{-128}:\\
\;\;\;\;z \cdot \left(x \cdot y\right)\\
\mathbf{elif}\;t \leq 3.5 \cdot 10^{-9}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t \cdot \left(b \cdot i\right)\\
\end{array}
\end{array}
if t < -3.40000000000000002e-25Initial program 66.7%
cancel-sign-sub66.7%
cancel-sign-sub-inv66.7%
*-commutative66.7%
remove-double-neg66.7%
*-commutative66.7%
Simplified66.7%
Taylor expanded in b around inf 55.8%
Taylor expanded in i around inf 47.4%
*-commutative47.4%
Simplified47.4%
if -3.40000000000000002e-25 < t < -2.6e-215 or 2.70000000000000006e-128 < t < 3.4999999999999999e-9Initial program 83.9%
cancel-sign-sub83.9%
cancel-sign-sub-inv83.9%
*-commutative83.9%
remove-double-neg83.9%
*-commutative83.9%
Simplified83.9%
Taylor expanded in a around inf 51.7%
+-commutative51.7%
mul-1-neg51.7%
unsub-neg51.7%
*-commutative51.7%
Simplified51.7%
Taylor expanded in j around inf 46.9%
*-commutative46.9%
Simplified46.9%
if -2.6e-215 < t < 2.70000000000000006e-128Initial program 88.2%
cancel-sign-sub88.2%
cancel-sign-sub-inv88.2%
*-commutative88.2%
remove-double-neg88.2%
*-commutative88.2%
Simplified88.2%
Taylor expanded in a around 0 72.7%
sub-neg72.7%
*-commutative72.7%
+-commutative72.7%
mul-1-neg72.7%
distribute-rgt-neg-in72.7%
mul-1-neg72.7%
distribute-lft-in72.7%
fma-udef72.7%
mul-1-neg72.7%
unsub-neg72.7%
*-commutative72.7%
distribute-rgt-neg-in72.7%
neg-sub072.7%
associate-+l-72.7%
neg-sub072.7%
Simplified72.7%
Taylor expanded in x around inf 36.1%
*-commutative36.1%
associate-*l*38.0%
*-commutative38.0%
Simplified38.0%
if 3.4999999999999999e-9 < t Initial program 54.4%
cancel-sign-sub54.4%
cancel-sign-sub-inv54.4%
*-commutative54.4%
remove-double-neg54.4%
*-commutative54.4%
Simplified54.4%
Taylor expanded in b around inf 49.2%
Taylor expanded in i around inf 32.3%
associate-*r*32.3%
*-commutative32.3%
associate-*r*32.3%
Simplified32.3%
Final simplification42.0%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= y -3950000.0) (not (<= y 1.6e-7))) (* y (- (* x z) (* i j))) (* a (- (* c j) (* 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 ((y <= -3950000.0) || !(y <= 1.6e-7)) {
tmp = y * ((x * z) - (i * j));
} else {
tmp = a * ((c * j) - (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 ((y <= (-3950000.0d0)) .or. (.not. (y <= 1.6d-7))) then
tmp = y * ((x * z) - (i * j))
else
tmp = a * ((c * j) - (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 ((y <= -3950000.0) || !(y <= 1.6e-7)) {
tmp = y * ((x * z) - (i * j));
} else {
tmp = a * ((c * j) - (x * t));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (y <= -3950000.0) or not (y <= 1.6e-7): tmp = y * ((x * z) - (i * j)) else: tmp = a * ((c * j) - (x * t)) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((y <= -3950000.0) || !(y <= 1.6e-7)) tmp = Float64(y * Float64(Float64(x * z) - Float64(i * j))); else tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((y <= -3950000.0) || ~((y <= 1.6e-7))) tmp = y * ((x * z) - (i * j)); else tmp = a * ((c * j) - (x * t)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[y, -3950000.0], N[Not[LessEqual[y, 1.6e-7]], $MachinePrecision]], N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;y \leq -3950000 \lor \neg \left(y \leq 1.6 \cdot 10^{-7}\right):\\
\;\;\;\;y \cdot \left(x \cdot z - i \cdot j\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\end{array}
\end{array}
if y < -3.95e6 or 1.6e-7 < y Initial program 66.9%
cancel-sign-sub66.9%
cancel-sign-sub-inv66.9%
*-commutative66.9%
remove-double-neg66.9%
*-commutative66.9%
Simplified66.9%
Taylor expanded in y around inf 61.5%
*-commutative61.5%
mul-1-neg61.5%
unsub-neg61.5%
*-commutative61.5%
Simplified61.5%
if -3.95e6 < y < 1.6e-7Initial program 80.9%
cancel-sign-sub80.9%
cancel-sign-sub-inv80.9%
*-commutative80.9%
remove-double-neg80.9%
*-commutative80.9%
Simplified80.9%
Taylor expanded in a around inf 47.7%
+-commutative47.7%
mul-1-neg47.7%
unsub-neg47.7%
*-commutative47.7%
Simplified47.7%
Final simplification55.0%
(FPCore (x y z t a b c i j)
:precision binary64
(if (<= b -5.9e+59)
(* c (- (* a j) (* z b)))
(if (<= b 8.5e+113)
(* a (- (* c j) (* x t)))
(if (<= b 2.6e+161) (* b (* t i)) (* (* z c) (- b))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if (b <= -5.9e+59) {
tmp = c * ((a * j) - (z * b));
} else if (b <= 8.5e+113) {
tmp = a * ((c * j) - (x * t));
} else if (b <= 2.6e+161) {
tmp = b * (t * i);
} else {
tmp = (z * c) * -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 (b <= (-5.9d+59)) then
tmp = c * ((a * j) - (z * b))
else if (b <= 8.5d+113) then
tmp = a * ((c * j) - (x * t))
else if (b <= 2.6d+161) then
tmp = b * (t * i)
else
tmp = (z * c) * -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 (b <= -5.9e+59) {
tmp = c * ((a * j) - (z * b));
} else if (b <= 8.5e+113) {
tmp = a * ((c * j) - (x * t));
} else if (b <= 2.6e+161) {
tmp = b * (t * i);
} else {
tmp = (z * c) * -b;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if b <= -5.9e+59: tmp = c * ((a * j) - (z * b)) elif b <= 8.5e+113: tmp = a * ((c * j) - (x * t)) elif b <= 2.6e+161: tmp = b * (t * i) else: tmp = (z * c) * -b return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if (b <= -5.9e+59) tmp = Float64(c * Float64(Float64(a * j) - Float64(z * b))); elseif (b <= 8.5e+113) tmp = Float64(a * Float64(Float64(c * j) - Float64(x * t))); elseif (b <= 2.6e+161) tmp = Float64(b * Float64(t * i)); else tmp = Float64(Float64(z * c) * Float64(-b)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if (b <= -5.9e+59) tmp = c * ((a * j) - (z * b)); elseif (b <= 8.5e+113) tmp = a * ((c * j) - (x * t)); elseif (b <= 2.6e+161) tmp = b * (t * i); else tmp = (z * c) * -b; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[b, -5.9e+59], N[(c * N[(N[(a * j), $MachinePrecision] - N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 8.5e+113], N[(a * N[(N[(c * j), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 2.6e+161], N[(b * N[(t * i), $MachinePrecision]), $MachinePrecision], N[(N[(z * c), $MachinePrecision] * (-b)), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq -5.9 \cdot 10^{+59}:\\
\;\;\;\;c \cdot \left(a \cdot j - z \cdot b\right)\\
\mathbf{elif}\;b \leq 8.5 \cdot 10^{+113}:\\
\;\;\;\;a \cdot \left(c \cdot j - x \cdot t\right)\\
\mathbf{elif}\;b \leq 2.6 \cdot 10^{+161}:\\
\;\;\;\;b \cdot \left(t \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;\left(z \cdot c\right) \cdot \left(-b\right)\\
\end{array}
\end{array}
if b < -5.90000000000000038e59Initial program 73.5%
cancel-sign-sub73.5%
cancel-sign-sub-inv73.5%
*-commutative73.5%
remove-double-neg73.5%
*-commutative73.5%
Simplified73.5%
Taylor expanded in c around inf 55.4%
*-commutative55.4%
Simplified55.4%
if -5.90000000000000038e59 < b < 8.5000000000000001e113Initial program 76.7%
cancel-sign-sub76.7%
cancel-sign-sub-inv76.7%
*-commutative76.7%
remove-double-neg76.7%
*-commutative76.7%
Simplified76.7%
Taylor expanded in a around inf 49.7%
+-commutative49.7%
mul-1-neg49.7%
unsub-neg49.7%
*-commutative49.7%
Simplified49.7%
if 8.5000000000000001e113 < b < 2.5999999999999998e161Initial program 59.5%
cancel-sign-sub59.5%
cancel-sign-sub-inv59.5%
*-commutative59.5%
remove-double-neg59.5%
*-commutative59.5%
Simplified59.5%
Taylor expanded in b around inf 71.0%
Taylor expanded in i around inf 65.4%
*-commutative65.4%
Simplified65.4%
if 2.5999999999999998e161 < b Initial program 66.6%
cancel-sign-sub66.6%
cancel-sign-sub-inv66.6%
*-commutative66.6%
remove-double-neg66.6%
*-commutative66.6%
Simplified66.6%
Taylor expanded in b around inf 57.7%
Taylor expanded in i around 0 55.0%
mul-1-neg55.0%
distribute-lft-neg-out55.0%
*-commutative55.0%
Simplified55.0%
Final simplification52.7%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= t -4.8e-25) (not (<= t 3.4e-10))) (* i (* t b)) (* a (* c j))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if ((t <= -4.8e-25) || !(t <= 3.4e-10)) {
tmp = i * (t * b);
} else {
tmp = a * (c * j);
}
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 ((t <= (-4.8d-25)) .or. (.not. (t <= 3.4d-10))) then
tmp = i * (t * b)
else
tmp = a * (c * j)
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 ((t <= -4.8e-25) || !(t <= 3.4e-10)) {
tmp = i * (t * b);
} else {
tmp = a * (c * j);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (t <= -4.8e-25) or not (t <= 3.4e-10): tmp = i * (t * b) else: tmp = a * (c * j) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((t <= -4.8e-25) || !(t <= 3.4e-10)) tmp = Float64(i * Float64(t * b)); else tmp = Float64(a * Float64(c * j)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((t <= -4.8e-25) || ~((t <= 3.4e-10))) tmp = i * (t * b); else tmp = a * (c * j); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[t, -4.8e-25], N[Not[LessEqual[t, 3.4e-10]], $MachinePrecision]], N[(i * N[(t * b), $MachinePrecision]), $MachinePrecision], N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq -4.8 \cdot 10^{-25} \lor \neg \left(t \leq 3.4 \cdot 10^{-10}\right):\\
\;\;\;\;i \cdot \left(t \cdot b\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(c \cdot j\right)\\
\end{array}
\end{array}
if t < -4.80000000000000018e-25 or 3.40000000000000015e-10 < t Initial program 61.1%
cancel-sign-sub61.1%
cancel-sign-sub-inv61.1%
*-commutative61.1%
remove-double-neg61.1%
*-commutative61.1%
Simplified61.1%
Taylor expanded in b around inf 52.8%
Taylor expanded in i around inf 35.3%
if -4.80000000000000018e-25 < t < 3.40000000000000015e-10Initial program 85.6%
cancel-sign-sub85.6%
cancel-sign-sub-inv85.6%
*-commutative85.6%
remove-double-neg85.6%
*-commutative85.6%
Simplified85.6%
Taylor expanded in a around inf 40.7%
+-commutative40.7%
mul-1-neg40.7%
unsub-neg40.7%
*-commutative40.7%
Simplified40.7%
Taylor expanded in j around inf 34.8%
*-commutative34.8%
Simplified34.8%
Final simplification35.0%
(FPCore (x y z t a b c i j) :precision binary64 (if (or (<= t -3.9e-25) (not (<= t 2.5e-7))) (* t (* b i)) (* a (* c j))))
double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
double tmp;
if ((t <= -3.9e-25) || !(t <= 2.5e-7)) {
tmp = t * (b * i);
} else {
tmp = a * (c * j);
}
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 ((t <= (-3.9d-25)) .or. (.not. (t <= 2.5d-7))) then
tmp = t * (b * i)
else
tmp = a * (c * j)
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 ((t <= -3.9e-25) || !(t <= 2.5e-7)) {
tmp = t * (b * i);
} else {
tmp = a * (c * j);
}
return tmp;
}
def code(x, y, z, t, a, b, c, i, j): tmp = 0 if (t <= -3.9e-25) or not (t <= 2.5e-7): tmp = t * (b * i) else: tmp = a * (c * j) return tmp
function code(x, y, z, t, a, b, c, i, j) tmp = 0.0 if ((t <= -3.9e-25) || !(t <= 2.5e-7)) tmp = Float64(t * Float64(b * i)); else tmp = Float64(a * Float64(c * j)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i, j) tmp = 0.0; if ((t <= -3.9e-25) || ~((t <= 2.5e-7))) tmp = t * (b * i); else tmp = a * (c * j); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[Or[LessEqual[t, -3.9e-25], N[Not[LessEqual[t, 2.5e-7]], $MachinePrecision]], N[(t * N[(b * i), $MachinePrecision]), $MachinePrecision], N[(a * N[(c * j), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;t \leq -3.9 \cdot 10^{-25} \lor \neg \left(t \leq 2.5 \cdot 10^{-7}\right):\\
\;\;\;\;t \cdot \left(b \cdot i\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(c \cdot j\right)\\
\end{array}
\end{array}
if t < -3.9e-25 or 2.49999999999999989e-7 < t Initial program 61.1%
cancel-sign-sub61.1%
cancel-sign-sub-inv61.1%
*-commutative61.1%
remove-double-neg61.1%
*-commutative61.1%
Simplified61.1%
Taylor expanded in b around inf 52.8%
Taylor expanded in i around inf 35.3%
associate-*r*40.6%
*-commutative40.6%
associate-*r*38.4%
Simplified38.4%
if -3.9e-25 < t < 2.49999999999999989e-7Initial program 85.6%
cancel-sign-sub85.6%
cancel-sign-sub-inv85.6%
*-commutative85.6%
remove-double-neg85.6%
*-commutative85.6%
Simplified85.6%
Taylor expanded in a around inf 40.7%
+-commutative40.7%
mul-1-neg40.7%
unsub-neg40.7%
*-commutative40.7%
Simplified40.7%
Taylor expanded in j around inf 34.8%
*-commutative34.8%
Simplified34.8%
Final simplification36.6%
(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 73.5%
cancel-sign-sub73.5%
cancel-sign-sub-inv73.5%
*-commutative73.5%
remove-double-neg73.5%
*-commutative73.5%
Simplified73.5%
Taylor expanded in a around inf 40.6%
+-commutative40.6%
mul-1-neg40.6%
unsub-neg40.6%
*-commutative40.6%
Simplified40.6%
Taylor expanded in j around inf 24.8%
*-commutative24.8%
Simplified24.8%
Final simplification24.8%
(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 2023196
(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)))))