
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 19 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c) :precision binary64 (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))
double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = ((((x * 9.0d0) * y) - (((z * 4.0d0) * t) * a)) + b) / (z * c)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c);
}
def code(x, y, z, t, a, b, c): return ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c)
function code(x, y, z, t, a, b, c) return Float64(Float64(Float64(Float64(Float64(x * 9.0) * y) - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) / Float64(z * c)) end
function tmp = code(x, y, z, t, a, b, c) tmp = ((((x * 9.0) * y) - (((z * 4.0) * t) * a)) + b) / (z * c); end
code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision] - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{\left(\left(x \cdot 9\right) \cdot y - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b}{z \cdot c}
\end{array}
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -2.55e+29) (not (<= z 1.9e-37))) (/ (fma (* -4.0 a) t (+ (/ b z) (* (/ y z) (* 9.0 x)))) c) (/ (fma x (* 9.0 y) (+ b (* t (* a (* z -4.0))))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.55e+29) || !(z <= 1.9e-37)) {
tmp = fma((-4.0 * a), t, ((b / z) + ((y / z) * (9.0 * x)))) / c;
} else {
tmp = fma(x, (9.0 * y), (b + (t * (a * (z * -4.0))))) / (z * c);
}
return tmp;
}
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.55e+29) || !(z <= 1.9e-37)) tmp = Float64(fma(Float64(-4.0 * a), t, Float64(Float64(b / z) + Float64(Float64(y / z) * Float64(9.0 * x)))) / c); else tmp = Float64(fma(x, Float64(9.0 * y), Float64(b + Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(z * c)); end return tmp end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.55e+29], N[Not[LessEqual[z, 1.9e-37]], $MachinePrecision]], N[(N[(N[(-4.0 * a), $MachinePrecision] * t + N[(N[(b / z), $MachinePrecision] + N[(N[(y / z), $MachinePrecision] * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(b + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.55 \cdot 10^{+29} \lor \neg \left(z \leq 1.9 \cdot 10^{-37}\right):\\
\;\;\;\;\frac{\mathsf{fma}\left(-4 \cdot a, t, \frac{b}{z} + \frac{y}{z} \cdot \left(9 \cdot x\right)\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b + t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.55e29 or 1.9000000000000002e-37 < z Initial program 63.2%
associate-+l-63.2%
*-commutative63.2%
associate-*r*59.1%
*-commutative59.1%
associate-+l-59.1%
Simplified64.7%
Taylor expanded in x around 0 74.5%
cancel-sign-sub-inv74.5%
metadata-eval74.5%
+-commutative74.5%
*-commutative74.5%
fma-def74.5%
associate-/l*75.7%
associate-/r/76.2%
fma-def76.2%
times-frac83.8%
*-commutative83.8%
Simplified83.8%
Taylor expanded in c around 0 84.8%
+-commutative84.8%
div-inv84.8%
fma-def84.8%
associate-*r/84.8%
associate-*r*84.8%
Applied egg-rr84.8%
associate-*r*84.8%
fma-def84.8%
fma-udef84.8%
div-inv84.8%
associate-*r/88.9%
Applied egg-rr88.9%
if -2.55e29 < z < 1.9000000000000002e-37Initial program 97.2%
associate-+l-97.2%
associate-*l*97.2%
fma-neg98.0%
neg-sub098.0%
associate-+l-98.0%
neg-sub098.0%
+-commutative98.0%
distribute-rgt-neg-out98.0%
*-commutative98.0%
associate-*l*97.2%
distribute-rgt-neg-in97.2%
*-commutative97.2%
distribute-rgt-neg-in97.2%
distribute-rgt-neg-in97.2%
metadata-eval97.2%
Simplified97.2%
Final simplification92.7%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -1.2e+29) (not (<= z 5e-37))) (/ (+ (* -4.0 (* a t)) (+ (/ b z) (* 9.0 (/ (* x y) z)))) c) (/ (fma x (* 9.0 y) (+ b (* t (* a (* z -4.0))))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -1.2e+29) || !(z <= 5e-37)) {
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
} else {
tmp = fma(x, (9.0 * y), (b + (t * (a * (z * -4.0))))) / (z * c);
}
return tmp;
}
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -1.2e+29) || !(z <= 5e-37)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(Float64(b / z) + Float64(9.0 * Float64(Float64(x * y) / z)))) / c); else tmp = Float64(fma(x, Float64(9.0 * y), Float64(b + Float64(t * Float64(a * Float64(z * -4.0))))) / Float64(z * c)); end return tmp end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -1.2e+29], N[Not[LessEqual[z, 5e-37]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(N[(b / z), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(x * N[(9.0 * y), $MachinePrecision] + N[(b + N[(t * N[(a * N[(z * -4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -1.2 \cdot 10^{+29} \lor \neg \left(z \leq 5 \cdot 10^{-37}\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(\frac{b}{z} + 9 \cdot \frac{x \cdot y}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\mathsf{fma}\left(x, 9 \cdot y, b + t \cdot \left(a \cdot \left(z \cdot -4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -1.2e29 or 4.9999999999999997e-37 < z Initial program 63.2%
associate-+l-63.2%
*-commutative63.2%
associate-*r*59.1%
*-commutative59.1%
associate-+l-59.1%
Simplified64.7%
Taylor expanded in x around 0 74.5%
cancel-sign-sub-inv74.5%
metadata-eval74.5%
+-commutative74.5%
*-commutative74.5%
fma-def74.5%
associate-/l*75.7%
associate-/r/76.2%
fma-def76.2%
times-frac83.8%
*-commutative83.8%
Simplified83.8%
Taylor expanded in c around 0 84.8%
if -1.2e29 < z < 4.9999999999999997e-37Initial program 97.2%
associate-+l-97.2%
associate-*l*97.2%
fma-neg98.0%
neg-sub098.0%
associate-+l-98.0%
neg-sub098.0%
+-commutative98.0%
distribute-rgt-neg-out98.0%
*-commutative98.0%
associate-*l*97.2%
distribute-rgt-neg-in97.2%
*-commutative97.2%
distribute-rgt-neg-in97.2%
distribute-rgt-neg-in97.2%
metadata-eval97.2%
Simplified97.2%
Final simplification90.4%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* y (* 9.0 x))))
(if (or (<= t_1 (- INFINITY)) (not (<= t_1 2e+255)))
(* 9.0 (* (/ y z) (/ x c)))
(/ (+ (* -4.0 (* a t)) (+ (/ b z) (* 9.0 (/ (* x y) z)))) c))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (9.0 * x);
double tmp;
if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 2e+255)) {
tmp = 9.0 * ((y / z) * (x / c));
} else {
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
}
return tmp;
}
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = y * (9.0 * x);
double tmp;
if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 2e+255)) {
tmp = 9.0 * ((y / z) * (x / c));
} else {
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = y * (9.0 * x) tmp = 0 if (t_1 <= -math.inf) or not (t_1 <= 2e+255): tmp = 9.0 * ((y / z) * (x / c)) else: tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(y * Float64(9.0 * x)) tmp = 0.0 if ((t_1 <= Float64(-Inf)) || !(t_1 <= 2e+255)) tmp = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))); else tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(Float64(b / z) + Float64(9.0 * Float64(Float64(x * y) / z)))) / c); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = y * (9.0 * x);
tmp = 0.0;
if ((t_1 <= -Inf) || ~((t_1 <= 2e+255)))
tmp = 9.0 * ((y / z) * (x / c));
else
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 2e+255]], $MachinePrecision]], N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(N[(b / z), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := y \cdot \left(9 \cdot x\right)\\
\mathbf{if}\;t_1 \leq -\infty \lor \neg \left(t_1 \leq 2 \cdot 10^{+255}\right):\\
\;\;\;\;9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(\frac{b}{z} + 9 \cdot \frac{x \cdot y}{z}\right)}{c}\\
\end{array}
\end{array}
if (*.f64 (*.f64 x 9) y) < -inf.0 or 1.99999999999999998e255 < (*.f64 (*.f64 x 9) y) Initial program 67.4%
associate-+l-67.4%
*-commutative67.4%
associate-*r*67.5%
*-commutative67.5%
associate-+l-67.5%
Simplified62.0%
Taylor expanded in x around inf 67.6%
times-frac94.5%
Simplified94.5%
if -inf.0 < (*.f64 (*.f64 x 9) y) < 1.99999999999999998e255Initial program 80.4%
associate-+l-80.4%
*-commutative80.4%
associate-*r*77.4%
*-commutative77.4%
associate-+l-77.4%
Simplified80.9%
Taylor expanded in x around 0 81.3%
cancel-sign-sub-inv81.3%
metadata-eval81.3%
+-commutative81.3%
*-commutative81.3%
fma-def81.3%
associate-/l*82.5%
associate-/r/83.3%
fma-def83.3%
times-frac84.5%
*-commutative84.5%
Simplified84.5%
Taylor expanded in c around 0 88.9%
Final simplification89.7%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(if (<= t -1.35e+139)
(/ (+ (* -4.0 (* a t)) (* 9.0 (/ (* x y) z))) c)
(if (<= t -4.1e+105)
(/ (+ b (* 9.0 (* x y))) (* z c))
(if (<= t -5.5e+85)
(+ (* -4.0 (/ (* a t) c)) (* 9.0 (/ (* x y) (* z c))))
(if (<= t 1.35e-23)
(/ (- (/ b z) (* x (* (/ y z) -9.0))) c)
(* -4.0 (/ a (/ c t))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.35e+139) {
tmp = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c;
} else if (t <= -4.1e+105) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else if (t <= -5.5e+85) {
tmp = (-4.0 * ((a * t) / c)) + (9.0 * ((x * y) / (z * c)));
} else if (t <= 1.35e-23) {
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
} else {
tmp = -4.0 * (a / (c / t));
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (t <= (-1.35d+139)) then
tmp = (((-4.0d0) * (a * t)) + (9.0d0 * ((x * y) / z))) / c
else if (t <= (-4.1d+105)) then
tmp = (b + (9.0d0 * (x * y))) / (z * c)
else if (t <= (-5.5d+85)) then
tmp = ((-4.0d0) * ((a * t) / c)) + (9.0d0 * ((x * y) / (z * c)))
else if (t <= 1.35d-23) then
tmp = ((b / z) - (x * ((y / z) * (-9.0d0)))) / c
else
tmp = (-4.0d0) * (a / (c / t))
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (t <= -1.35e+139) {
tmp = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c;
} else if (t <= -4.1e+105) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else if (t <= -5.5e+85) {
tmp = (-4.0 * ((a * t) / c)) + (9.0 * ((x * y) / (z * c)));
} else if (t <= 1.35e-23) {
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
} else {
tmp = -4.0 * (a / (c / t));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if t <= -1.35e+139: tmp = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c elif t <= -4.1e+105: tmp = (b + (9.0 * (x * y))) / (z * c) elif t <= -5.5e+85: tmp = (-4.0 * ((a * t) / c)) + (9.0 * ((x * y) / (z * c))) elif t <= 1.35e-23: tmp = ((b / z) - (x * ((y / z) * -9.0))) / c else: tmp = -4.0 * (a / (c / t)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (t <= -1.35e+139) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(9.0 * Float64(Float64(x * y) / z))) / c); elseif (t <= -4.1e+105) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); elseif (t <= -5.5e+85) tmp = Float64(Float64(-4.0 * Float64(Float64(a * t) / c)) + Float64(9.0 * Float64(Float64(x * y) / Float64(z * c)))); elseif (t <= 1.35e-23) tmp = Float64(Float64(Float64(b / z) - Float64(x * Float64(Float64(y / z) * -9.0))) / c); else tmp = Float64(-4.0 * Float64(a / Float64(c / t))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (t <= -1.35e+139)
tmp = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c;
elseif (t <= -4.1e+105)
tmp = (b + (9.0 * (x * y))) / (z * c);
elseif (t <= -5.5e+85)
tmp = (-4.0 * ((a * t) / c)) + (9.0 * ((x * y) / (z * c)));
elseif (t <= 1.35e-23)
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
else
tmp = -4.0 * (a / (c / t));
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[t, -1.35e+139], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -4.1e+105], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -5.5e+85], N[(N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.35e-23], N[(N[(N[(b / z), $MachinePrecision] - N[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.35 \cdot 10^{+139}:\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + 9 \cdot \frac{x \cdot y}{z}}{c}\\
\mathbf{elif}\;t \leq -4.1 \cdot 10^{+105}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;t \leq -5.5 \cdot 10^{+85}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c} + 9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;t \leq 1.35 \cdot 10^{-23}:\\
\;\;\;\;\frac{\frac{b}{z} - x \cdot \left(\frac{y}{z} \cdot -9\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\end{array}
\end{array}
if t < -1.3499999999999999e139Initial program 83.2%
associate-+l-83.2%
*-commutative83.2%
associate-*r*87.4%
*-commutative87.4%
associate-+l-87.4%
Simplified87.4%
Taylor expanded in x around 0 87.4%
cancel-sign-sub-inv87.4%
metadata-eval87.4%
+-commutative87.4%
*-commutative87.4%
fma-def87.4%
associate-/l*79.0%
associate-/r/83.4%
fma-def83.4%
times-frac87.7%
*-commutative87.7%
Simplified87.7%
Taylor expanded in c around 0 91.6%
Taylor expanded in b around 0 88.0%
if -1.3499999999999999e139 < t < -4.1000000000000002e105Initial program 99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
Simplified99.6%
Taylor expanded in x around inf 87.5%
if -4.1000000000000002e105 < t < -5.50000000000000008e85Initial program 99.7%
associate-+l-99.7%
*-commutative99.7%
associate-*r*99.7%
*-commutative99.7%
associate-+l-99.7%
Simplified99.4%
Taylor expanded in x around 0 99.7%
cancel-sign-sub-inv99.7%
metadata-eval99.7%
+-commutative99.7%
*-commutative99.7%
fma-def99.7%
associate-/l*99.7%
associate-/r/99.7%
fma-def99.7%
times-frac99.7%
*-commutative99.7%
Simplified99.7%
Taylor expanded in b around 0 99.7%
if -5.50000000000000008e85 < t < 1.34999999999999992e-23Initial program 82.5%
associate-+l-82.5%
*-commutative82.5%
associate-*r*76.7%
*-commutative76.7%
associate-+l-76.7%
Simplified80.6%
Taylor expanded in x around 0 77.8%
cancel-sign-sub-inv77.8%
metadata-eval77.8%
+-commutative77.8%
*-commutative77.8%
fma-def77.8%
associate-/l*74.6%
associate-/r/74.0%
fma-def74.0%
times-frac82.2%
*-commutative82.2%
Simplified82.2%
Taylor expanded in a around 0 60.5%
fma-def60.5%
times-frac68.6%
associate-/r*66.8%
Simplified66.8%
Taylor expanded in c around -inf 68.3%
Simplified70.7%
if 1.34999999999999992e-23 < t Initial program 64.3%
associate-+l-64.3%
*-commutative64.3%
associate-*r*65.8%
*-commutative65.8%
associate-+l-65.8%
Simplified65.8%
Taylor expanded in z around inf 44.9%
*-commutative44.9%
associate-/l*61.5%
Simplified61.5%
Final simplification71.0%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= z -2.6e+58) (not (<= z 1e-37))) (/ (+ (* -4.0 (* a t)) (+ (/ b z) (* 9.0 (/ (* x y) z)))) c) (/ (+ b (- (* y (* 9.0 x)) (* a (* t (* z 4.0))))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.6e+58) || !(z <= 1e-37)) {
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((z <= (-2.6d+58)) .or. (.not. (z <= 1d-37))) then
tmp = (((-4.0d0) * (a * t)) + ((b / z) + (9.0d0 * ((x * y) / z)))) / c
else
tmp = (b + ((y * (9.0d0 * x)) - (a * (t * (z * 4.0d0))))) / (z * c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((z <= -2.6e+58) || !(z <= 1e-37)) {
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
} else {
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (z <= -2.6e+58) or not (z <= 1e-37): tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c else: tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((z <= -2.6e+58) || !(z <= 1e-37)) tmp = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(Float64(b / z) + Float64(9.0 * Float64(Float64(x * y) / z)))) / c); else tmp = Float64(Float64(b + Float64(Float64(y * Float64(9.0 * x)) - Float64(a * Float64(t * Float64(z * 4.0))))) / Float64(z * c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((z <= -2.6e+58) || ~((z <= 1e-37)))
tmp = ((-4.0 * (a * t)) + ((b / z) + (9.0 * ((x * y) / z)))) / c;
else
tmp = (b + ((y * (9.0 * x)) - (a * (t * (z * 4.0))))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[z, -2.6e+58], N[Not[LessEqual[z, 1e-37]], $MachinePrecision]], N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(N[(b / z), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(N[(b + N[(N[(y * N[(9.0 * x), $MachinePrecision]), $MachinePrecision] - N[(a * N[(t * N[(z * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq -2.6 \cdot 10^{+58} \lor \neg \left(z \leq 10^{-37}\right):\\
\;\;\;\;\frac{-4 \cdot \left(a \cdot t\right) + \left(\frac{b}{z} + 9 \cdot \frac{x \cdot y}{z}\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + \left(y \cdot \left(9 \cdot x\right) - a \cdot \left(t \cdot \left(z \cdot 4\right)\right)\right)}{z \cdot c}\\
\end{array}
\end{array}
if z < -2.59999999999999988e58 or 1.00000000000000007e-37 < z Initial program 62.4%
associate-+l-62.4%
*-commutative62.4%
associate-*r*59.5%
*-commutative59.5%
associate-+l-59.5%
Simplified64.0%
Taylor expanded in x around 0 74.4%
cancel-sign-sub-inv74.4%
metadata-eval74.4%
+-commutative74.4%
*-commutative74.4%
fma-def74.4%
associate-/l*75.0%
associate-/r/76.2%
fma-def76.2%
times-frac83.6%
*-commutative83.6%
Simplified83.6%
Taylor expanded in c around 0 85.3%
if -2.59999999999999988e58 < z < 1.00000000000000007e-37Initial program 95.8%
Final simplification90.4%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* (/ y z) (/ x c)))) (t_2 (* -4.0 (/ a (/ c t)))))
(if (<= t -2.3e+119)
t_2
(if (<= t -1.35e+45)
t_1
(if (<= t -6.8e-228)
(/ (/ b z) c)
(if (<= t -7.2e-259)
t_1
(if (<= t -2.9e-301)
(/ b (* z c))
(if (<= t 3.8e-32) t_1 t_2))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = -4.0 * (a / (c / t));
double tmp;
if (t <= -2.3e+119) {
tmp = t_2;
} else if (t <= -1.35e+45) {
tmp = t_1;
} else if (t <= -6.8e-228) {
tmp = (b / z) / c;
} else if (t <= -7.2e-259) {
tmp = t_1;
} else if (t <= -2.9e-301) {
tmp = b / (z * c);
} else if (t <= 3.8e-32) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * ((y / z) * (x / c))
t_2 = (-4.0d0) * (a / (c / t))
if (t <= (-2.3d+119)) then
tmp = t_2
else if (t <= (-1.35d+45)) then
tmp = t_1
else if (t <= (-6.8d-228)) then
tmp = (b / z) / c
else if (t <= (-7.2d-259)) then
tmp = t_1
else if (t <= (-2.9d-301)) then
tmp = b / (z * c)
else if (t <= 3.8d-32) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = -4.0 * (a / (c / t));
double tmp;
if (t <= -2.3e+119) {
tmp = t_2;
} else if (t <= -1.35e+45) {
tmp = t_1;
} else if (t <= -6.8e-228) {
tmp = (b / z) / c;
} else if (t <= -7.2e-259) {
tmp = t_1;
} else if (t <= -2.9e-301) {
tmp = b / (z * c);
} else if (t <= 3.8e-32) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((y / z) * (x / c)) t_2 = -4.0 * (a / (c / t)) tmp = 0 if t <= -2.3e+119: tmp = t_2 elif t <= -1.35e+45: tmp = t_1 elif t <= -6.8e-228: tmp = (b / z) / c elif t <= -7.2e-259: tmp = t_1 elif t <= -2.9e-301: tmp = b / (z * c) elif t <= 3.8e-32: tmp = t_1 else: tmp = t_2 return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))) t_2 = Float64(-4.0 * Float64(a / Float64(c / t))) tmp = 0.0 if (t <= -2.3e+119) tmp = t_2; elseif (t <= -1.35e+45) tmp = t_1; elseif (t <= -6.8e-228) tmp = Float64(Float64(b / z) / c); elseif (t <= -7.2e-259) tmp = t_1; elseif (t <= -2.9e-301) tmp = Float64(b / Float64(z * c)); elseif (t <= 3.8e-32) tmp = t_1; else tmp = t_2; end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((y / z) * (x / c));
t_2 = -4.0 * (a / (c / t));
tmp = 0.0;
if (t <= -2.3e+119)
tmp = t_2;
elseif (t <= -1.35e+45)
tmp = t_1;
elseif (t <= -6.8e-228)
tmp = (b / z) / c;
elseif (t <= -7.2e-259)
tmp = t_1;
elseif (t <= -2.9e-301)
tmp = b / (z * c);
elseif (t <= 3.8e-32)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.3e+119], t$95$2, If[LessEqual[t, -1.35e+45], t$95$1, If[LessEqual[t, -6.8e-228], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -7.2e-259], t$95$1, If[LessEqual[t, -2.9e-301], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 3.8e-32], t$95$1, t$95$2]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
t_2 := -4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{if}\;t \leq -2.3 \cdot 10^{+119}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq -1.35 \cdot 10^{+45}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -6.8 \cdot 10^{-228}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;t \leq -7.2 \cdot 10^{-259}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -2.9 \cdot 10^{-301}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;t \leq 3.8 \cdot 10^{-32}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if t < -2.3000000000000001e119 or 3.80000000000000008e-32 < t Initial program 71.4%
associate-+l-71.4%
*-commutative71.4%
associate-*r*73.4%
*-commutative73.4%
associate-+l-73.4%
Simplified73.4%
Taylor expanded in z around inf 47.5%
*-commutative47.5%
associate-/l*60.8%
Simplified60.8%
if -2.3000000000000001e119 < t < -1.34999999999999992e45 or -6.79999999999999981e-228 < t < -7.1999999999999996e-259 or -2.89999999999999984e-301 < t < 3.80000000000000008e-32Initial program 87.0%
associate-+l-87.0%
*-commutative87.0%
associate-*r*81.0%
*-commutative81.0%
associate-+l-81.0%
Simplified84.6%
Taylor expanded in x around inf 45.2%
times-frac49.4%
Simplified49.4%
if -1.34999999999999992e45 < t < -6.79999999999999981e-228Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*73.8%
*-commutative73.8%
associate-+l-73.8%
Simplified75.3%
Taylor expanded in x around 0 73.5%
cancel-sign-sub-inv73.5%
metadata-eval73.5%
+-commutative73.5%
*-commutative73.5%
fma-def73.5%
associate-/l*70.5%
associate-/r/69.1%
fma-def69.1%
times-frac78.4%
*-commutative78.4%
Simplified78.4%
Taylor expanded in c around 0 86.0%
Taylor expanded in b around inf 45.4%
if -7.1999999999999996e-259 < t < -2.89999999999999984e-301Initial program 90.5%
associate-+l-90.5%
*-commutative90.5%
associate-*r*73.5%
*-commutative73.5%
associate-+l-73.5%
Simplified90.5%
Taylor expanded in b around inf 82.1%
*-commutative82.1%
Simplified82.1%
Final simplification54.2%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* (/ y z) (/ x c)))) (t_2 (* -4.0 (/ a (/ c t)))))
(if (<= t -8.5e+138)
t_2
(if (<= t -1.6e+46)
(* 9.0 (/ (* x y) (* z c)))
(if (<= t -1.65e-227)
(/ (/ b z) c)
(if (<= t -4.6e-259)
t_1
(if (<= t -3.1e-301) (/ b (* z c)) (if (<= t 5e-26) t_1 t_2))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = -4.0 * (a / (c / t));
double tmp;
if (t <= -8.5e+138) {
tmp = t_2;
} else if (t <= -1.6e+46) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (t <= -1.65e-227) {
tmp = (b / z) / c;
} else if (t <= -4.6e-259) {
tmp = t_1;
} else if (t <= -3.1e-301) {
tmp = b / (z * c);
} else if (t <= 5e-26) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * ((y / z) * (x / c))
t_2 = (-4.0d0) * (a / (c / t))
if (t <= (-8.5d+138)) then
tmp = t_2
else if (t <= (-1.6d+46)) then
tmp = 9.0d0 * ((x * y) / (z * c))
else if (t <= (-1.65d-227)) then
tmp = (b / z) / c
else if (t <= (-4.6d-259)) then
tmp = t_1
else if (t <= (-3.1d-301)) then
tmp = b / (z * c)
else if (t <= 5d-26) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = -4.0 * (a / (c / t));
double tmp;
if (t <= -8.5e+138) {
tmp = t_2;
} else if (t <= -1.6e+46) {
tmp = 9.0 * ((x * y) / (z * c));
} else if (t <= -1.65e-227) {
tmp = (b / z) / c;
} else if (t <= -4.6e-259) {
tmp = t_1;
} else if (t <= -3.1e-301) {
tmp = b / (z * c);
} else if (t <= 5e-26) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((y / z) * (x / c)) t_2 = -4.0 * (a / (c / t)) tmp = 0 if t <= -8.5e+138: tmp = t_2 elif t <= -1.6e+46: tmp = 9.0 * ((x * y) / (z * c)) elif t <= -1.65e-227: tmp = (b / z) / c elif t <= -4.6e-259: tmp = t_1 elif t <= -3.1e-301: tmp = b / (z * c) elif t <= 5e-26: tmp = t_1 else: tmp = t_2 return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))) t_2 = Float64(-4.0 * Float64(a / Float64(c / t))) tmp = 0.0 if (t <= -8.5e+138) tmp = t_2; elseif (t <= -1.6e+46) tmp = Float64(9.0 * Float64(Float64(x * y) / Float64(z * c))); elseif (t <= -1.65e-227) tmp = Float64(Float64(b / z) / c); elseif (t <= -4.6e-259) tmp = t_1; elseif (t <= -3.1e-301) tmp = Float64(b / Float64(z * c)); elseif (t <= 5e-26) tmp = t_1; else tmp = t_2; end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((y / z) * (x / c));
t_2 = -4.0 * (a / (c / t));
tmp = 0.0;
if (t <= -8.5e+138)
tmp = t_2;
elseif (t <= -1.6e+46)
tmp = 9.0 * ((x * y) / (z * c));
elseif (t <= -1.65e-227)
tmp = (b / z) / c;
elseif (t <= -4.6e-259)
tmp = t_1;
elseif (t <= -3.1e-301)
tmp = b / (z * c);
elseif (t <= 5e-26)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8.5e+138], t$95$2, If[LessEqual[t, -1.6e+46], N[(9.0 * N[(N[(x * y), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -1.65e-227], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -4.6e-259], t$95$1, If[LessEqual[t, -3.1e-301], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5e-26], t$95$1, t$95$2]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
t_2 := -4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{if}\;t \leq -8.5 \cdot 10^{+138}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq -1.6 \cdot 10^{+46}:\\
\;\;\;\;9 \cdot \frac{x \cdot y}{z \cdot c}\\
\mathbf{elif}\;t \leq -1.65 \cdot 10^{-227}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;t \leq -4.6 \cdot 10^{-259}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -3.1 \cdot 10^{-301}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;t \leq 5 \cdot 10^{-26}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if t < -8.5000000000000006e138 or 5.00000000000000019e-26 < t Initial program 69.2%
associate-+l-69.2%
*-commutative69.2%
associate-*r*71.4%
*-commutative71.4%
associate-+l-71.4%
Simplified71.4%
Taylor expanded in z around inf 49.8%
*-commutative49.8%
associate-/l*64.0%
Simplified64.0%
if -8.5000000000000006e138 < t < -1.5999999999999999e46Initial program 91.7%
associate-+l-91.7%
*-commutative91.7%
associate-*r*91.7%
*-commutative91.7%
associate-+l-91.7%
Simplified83.6%
Taylor expanded in x around inf 43.1%
if -1.5999999999999999e46 < t < -1.65e-227Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*73.8%
*-commutative73.8%
associate-+l-73.8%
Simplified75.3%
Taylor expanded in x around 0 73.5%
cancel-sign-sub-inv73.5%
metadata-eval73.5%
+-commutative73.5%
*-commutative73.5%
fma-def73.5%
associate-/l*70.5%
associate-/r/69.1%
fma-def69.1%
times-frac78.4%
*-commutative78.4%
Simplified78.4%
Taylor expanded in c around 0 86.0%
Taylor expanded in b around inf 45.4%
if -1.65e-227 < t < -4.5999999999999999e-259 or -3.10000000000000014e-301 < t < 5.00000000000000019e-26Initial program 86.6%
associate-+l-86.6%
*-commutative86.6%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified86.6%
Taylor expanded in x around inf 44.4%
times-frac49.7%
Simplified49.7%
if -4.5999999999999999e-259 < t < -3.10000000000000014e-301Initial program 90.5%
associate-+l-90.5%
*-commutative90.5%
associate-*r*73.5%
*-commutative73.5%
associate-+l-73.5%
Simplified90.5%
Taylor expanded in b around inf 82.1%
*-commutative82.1%
Simplified82.1%
Final simplification54.6%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* 9.0 (* (/ y z) (/ x c)))) (t_2 (* -4.0 (/ a (/ c t)))))
(if (<= t -2.1e+139)
t_2
(if (<= t -1.3e+45)
(* (/ x (/ c y)) (/ 9.0 z))
(if (<= t -4.6e-226)
(/ (/ b z) c)
(if (<= t -5e-256)
t_1
(if (<= t -1.75e-300)
(/ b (* z c))
(if (<= t 4.9e-26) t_1 t_2))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = -4.0 * (a / (c / t));
double tmp;
if (t <= -2.1e+139) {
tmp = t_2;
} else if (t <= -1.3e+45) {
tmp = (x / (c / y)) * (9.0 / z);
} else if (t <= -4.6e-226) {
tmp = (b / z) / c;
} else if (t <= -5e-256) {
tmp = t_1;
} else if (t <= -1.75e-300) {
tmp = b / (z * c);
} else if (t <= 4.9e-26) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 9.0d0 * ((y / z) * (x / c))
t_2 = (-4.0d0) * (a / (c / t))
if (t <= (-2.1d+139)) then
tmp = t_2
else if (t <= (-1.3d+45)) then
tmp = (x / (c / y)) * (9.0d0 / z)
else if (t <= (-4.6d-226)) then
tmp = (b / z) / c
else if (t <= (-5d-256)) then
tmp = t_1
else if (t <= (-1.75d-300)) then
tmp = b / (z * c)
else if (t <= 4.9d-26) then
tmp = t_1
else
tmp = t_2
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = 9.0 * ((y / z) * (x / c));
double t_2 = -4.0 * (a / (c / t));
double tmp;
if (t <= -2.1e+139) {
tmp = t_2;
} else if (t <= -1.3e+45) {
tmp = (x / (c / y)) * (9.0 / z);
} else if (t <= -4.6e-226) {
tmp = (b / z) / c;
} else if (t <= -5e-256) {
tmp = t_1;
} else if (t <= -1.75e-300) {
tmp = b / (z * c);
} else if (t <= 4.9e-26) {
tmp = t_1;
} else {
tmp = t_2;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = 9.0 * ((y / z) * (x / c)) t_2 = -4.0 * (a / (c / t)) tmp = 0 if t <= -2.1e+139: tmp = t_2 elif t <= -1.3e+45: tmp = (x / (c / y)) * (9.0 / z) elif t <= -4.6e-226: tmp = (b / z) / c elif t <= -5e-256: tmp = t_1 elif t <= -1.75e-300: tmp = b / (z * c) elif t <= 4.9e-26: tmp = t_1 else: tmp = t_2 return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(9.0 * Float64(Float64(y / z) * Float64(x / c))) t_2 = Float64(-4.0 * Float64(a / Float64(c / t))) tmp = 0.0 if (t <= -2.1e+139) tmp = t_2; elseif (t <= -1.3e+45) tmp = Float64(Float64(x / Float64(c / y)) * Float64(9.0 / z)); elseif (t <= -4.6e-226) tmp = Float64(Float64(b / z) / c); elseif (t <= -5e-256) tmp = t_1; elseif (t <= -1.75e-300) tmp = Float64(b / Float64(z * c)); elseif (t <= 4.9e-26) tmp = t_1; else tmp = t_2; end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = 9.0 * ((y / z) * (x / c));
t_2 = -4.0 * (a / (c / t));
tmp = 0.0;
if (t <= -2.1e+139)
tmp = t_2;
elseif (t <= -1.3e+45)
tmp = (x / (c / y)) * (9.0 / z);
elseif (t <= -4.6e-226)
tmp = (b / z) / c;
elseif (t <= -5e-256)
tmp = t_1;
elseif (t <= -1.75e-300)
tmp = b / (z * c);
elseif (t <= 4.9e-26)
tmp = t_1;
else
tmp = t_2;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(9.0 * N[(N[(y / z), $MachinePrecision] * N[(x / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.1e+139], t$95$2, If[LessEqual[t, -1.3e+45], N[(N[(x / N[(c / y), $MachinePrecision]), $MachinePrecision] * N[(9.0 / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -4.6e-226], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision], If[LessEqual[t, -5e-256], t$95$1, If[LessEqual[t, -1.75e-300], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 4.9e-26], t$95$1, t$95$2]]]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := 9 \cdot \left(\frac{y}{z} \cdot \frac{x}{c}\right)\\
t_2 := -4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{if}\;t \leq -2.1 \cdot 10^{+139}:\\
\;\;\;\;t_2\\
\mathbf{elif}\;t \leq -1.3 \cdot 10^{+45}:\\
\;\;\;\;\frac{x}{\frac{c}{y}} \cdot \frac{9}{z}\\
\mathbf{elif}\;t \leq -4.6 \cdot 10^{-226}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\mathbf{elif}\;t \leq -5 \cdot 10^{-256}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -1.75 \cdot 10^{-300}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;t \leq 4.9 \cdot 10^{-26}:\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;t_2\\
\end{array}
\end{array}
if t < -2.0999999999999999e139 or 4.8999999999999999e-26 < t Initial program 69.2%
associate-+l-69.2%
*-commutative69.2%
associate-*r*71.4%
*-commutative71.4%
associate-+l-71.4%
Simplified71.4%
Taylor expanded in z around inf 49.8%
*-commutative49.8%
associate-/l*64.0%
Simplified64.0%
if -2.0999999999999999e139 < t < -1.30000000000000004e45Initial program 91.7%
associate-+l-91.7%
*-commutative91.7%
associate-*r*91.7%
*-commutative91.7%
associate-+l-91.7%
Simplified83.6%
Taylor expanded in x around inf 43.1%
associate-*r/43.2%
*-commutative43.2%
times-frac43.0%
associate-/l*43.1%
Simplified43.1%
if -1.30000000000000004e45 < t < -4.6000000000000001e-226Initial program 76.8%
associate-+l-76.8%
*-commutative76.8%
associate-*r*73.8%
*-commutative73.8%
associate-+l-73.8%
Simplified75.3%
Taylor expanded in x around 0 73.5%
cancel-sign-sub-inv73.5%
metadata-eval73.5%
+-commutative73.5%
*-commutative73.5%
fma-def73.5%
associate-/l*70.5%
associate-/r/69.1%
fma-def69.1%
times-frac78.4%
*-commutative78.4%
Simplified78.4%
Taylor expanded in c around 0 86.0%
Taylor expanded in b around inf 45.4%
if -4.6000000000000001e-226 < t < -5e-256 or -1.7500000000000001e-300 < t < 4.8999999999999999e-26Initial program 86.6%
associate-+l-86.6%
*-commutative86.6%
associate-*r*79.1%
*-commutative79.1%
associate-+l-79.1%
Simplified86.6%
Taylor expanded in x around inf 44.4%
times-frac49.7%
Simplified49.7%
if -5e-256 < t < -1.7500000000000001e-300Initial program 90.5%
associate-+l-90.5%
*-commutative90.5%
associate-*r*73.5%
*-commutative73.5%
associate-+l-73.5%
Simplified90.5%
Taylor expanded in b around inf 82.1%
*-commutative82.1%
Simplified82.1%
Final simplification54.6%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ (+ (* -4.0 (* a t)) (* 9.0 (/ (* x y) z))) c)))
(if (<= t -8.5e+138)
t_1
(if (<= t -1.25e+106)
(/ (+ b (* 9.0 (* x y))) (* z c))
(if (<= t -5e+84)
t_1
(if (<= t 2.1e-30)
(/ (- (/ b z) (* x (* (/ y z) -9.0))) c)
(* -4.0 (/ a (/ c t)))))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c;
double tmp;
if (t <= -8.5e+138) {
tmp = t_1;
} else if (t <= -1.25e+106) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else if (t <= -5e+84) {
tmp = t_1;
} else if (t <= 2.1e-30) {
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
} else {
tmp = -4.0 * (a / (c / t));
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (((-4.0d0) * (a * t)) + (9.0d0 * ((x * y) / z))) / c
if (t <= (-8.5d+138)) then
tmp = t_1
else if (t <= (-1.25d+106)) then
tmp = (b + (9.0d0 * (x * y))) / (z * c)
else if (t <= (-5d+84)) then
tmp = t_1
else if (t <= 2.1d-30) then
tmp = ((b / z) - (x * ((y / z) * (-9.0d0)))) / c
else
tmp = (-4.0d0) * (a / (c / t))
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c;
double tmp;
if (t <= -8.5e+138) {
tmp = t_1;
} else if (t <= -1.25e+106) {
tmp = (b + (9.0 * (x * y))) / (z * c);
} else if (t <= -5e+84) {
tmp = t_1;
} else if (t <= 2.1e-30) {
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
} else {
tmp = -4.0 * (a / (c / t));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c tmp = 0 if t <= -8.5e+138: tmp = t_1 elif t <= -1.25e+106: tmp = (b + (9.0 * (x * y))) / (z * c) elif t <= -5e+84: tmp = t_1 elif t <= 2.1e-30: tmp = ((b / z) - (x * ((y / z) * -9.0))) / c else: tmp = -4.0 * (a / (c / t)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(Float64(Float64(-4.0 * Float64(a * t)) + Float64(9.0 * Float64(Float64(x * y) / z))) / c) tmp = 0.0 if (t <= -8.5e+138) tmp = t_1; elseif (t <= -1.25e+106) tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); elseif (t <= -5e+84) tmp = t_1; elseif (t <= 2.1e-30) tmp = Float64(Float64(Float64(b / z) - Float64(x * Float64(Float64(y / z) * -9.0))) / c); else tmp = Float64(-4.0 * Float64(a / Float64(c / t))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = ((-4.0 * (a * t)) + (9.0 * ((x * y) / z))) / c;
tmp = 0.0;
if (t <= -8.5e+138)
tmp = t_1;
elseif (t <= -1.25e+106)
tmp = (b + (9.0 * (x * y))) / (z * c);
elseif (t <= -5e+84)
tmp = t_1;
elseif (t <= 2.1e-30)
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
else
tmp = -4.0 * (a / (c / t));
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(-4.0 * N[(a * t), $MachinePrecision]), $MachinePrecision] + N[(9.0 * N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]}, If[LessEqual[t, -8.5e+138], t$95$1, If[LessEqual[t, -1.25e+106], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, -5e+84], t$95$1, If[LessEqual[t, 2.1e-30], N[(N[(N[(b / z), $MachinePrecision] - N[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := \frac{-4 \cdot \left(a \cdot t\right) + 9 \cdot \frac{x \cdot y}{z}}{c}\\
\mathbf{if}\;t \leq -8.5 \cdot 10^{+138}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -1.25 \cdot 10^{+106}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\mathbf{elif}\;t \leq -5 \cdot 10^{+84}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq 2.1 \cdot 10^{-30}:\\
\;\;\;\;\frac{\frac{b}{z} - x \cdot \left(\frac{y}{z} \cdot -9\right)}{c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\end{array}
\end{array}
if t < -8.5000000000000006e138 or -1.25e106 < t < -5.0000000000000001e84Initial program 86.0%
associate-+l-86.0%
*-commutative86.0%
associate-*r*89.5%
*-commutative89.5%
associate-+l-89.5%
Simplified89.4%
Taylor expanded in x around 0 89.5%
cancel-sign-sub-inv89.5%
metadata-eval89.5%
+-commutative89.5%
*-commutative89.5%
fma-def89.5%
associate-/l*82.6%
associate-/r/86.2%
fma-def86.2%
times-frac89.7%
*-commutative89.7%
Simplified89.7%
Taylor expanded in c around 0 89.8%
Taylor expanded in b around 0 86.8%
if -8.5000000000000006e138 < t < -1.25e106Initial program 99.6%
associate-+l-99.6%
*-commutative99.6%
associate-*r*99.6%
*-commutative99.6%
associate-+l-99.6%
Simplified99.6%
Taylor expanded in x around inf 87.5%
if -5.0000000000000001e84 < t < 2.1000000000000002e-30Initial program 82.3%
associate-+l-82.3%
*-commutative82.3%
associate-*r*76.4%
*-commutative76.4%
associate-+l-76.4%
Simplified80.3%
Taylor expanded in x around 0 77.5%
cancel-sign-sub-inv77.5%
metadata-eval77.5%
+-commutative77.5%
*-commutative77.5%
fma-def77.5%
associate-/l*74.3%
associate-/r/73.7%
fma-def73.7%
times-frac82.0%
*-commutative82.0%
Simplified82.0%
Taylor expanded in a around 0 60.0%
fma-def60.0%
times-frac68.1%
associate-/r*67.0%
Simplified67.0%
Taylor expanded in c around -inf 67.8%
Simplified70.3%
if 2.1000000000000002e-30 < t Initial program 65.3%
associate-+l-65.3%
*-commutative65.3%
associate-*r*66.8%
*-commutative66.8%
associate-+l-66.8%
Simplified66.7%
Taylor expanded in z around inf 43.8%
*-commutative43.8%
associate-/l*59.8%
Simplified59.8%
Final simplification69.8%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -8.8e+138) (not (<= t 7.2e-22))) (* -4.0 (/ a (/ c t))) (/ (- (/ b z) (* x (* (/ y z) -9.0))) c)))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -8.8e+138) || !(t <= 7.2e-22)) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((t <= (-8.8d+138)) .or. (.not. (t <= 7.2d-22))) then
tmp = (-4.0d0) * (a / (c / t))
else
tmp = ((b / z) - (x * ((y / z) * (-9.0d0)))) / c
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -8.8e+138) || !(t <= 7.2e-22)) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -8.8e+138) or not (t <= 7.2e-22): tmp = -4.0 * (a / (c / t)) else: tmp = ((b / z) - (x * ((y / z) * -9.0))) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -8.8e+138) || !(t <= 7.2e-22)) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); else tmp = Float64(Float64(Float64(b / z) - Float64(x * Float64(Float64(y / z) * -9.0))) / c); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -8.8e+138) || ~((t <= 7.2e-22)))
tmp = -4.0 * (a / (c / t));
else
tmp = ((b / z) - (x * ((y / z) * -9.0))) / c;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -8.8e+138], N[Not[LessEqual[t, 7.2e-22]], $MachinePrecision]], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b / z), $MachinePrecision] - N[(x * N[(N[(y / z), $MachinePrecision] * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / c), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -8.8 \cdot 10^{+138} \lor \neg \left(t \leq 7.2 \cdot 10^{-22}\right):\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z} - x \cdot \left(\frac{y}{z} \cdot -9\right)}{c}\\
\end{array}
\end{array}
if t < -8.8000000000000003e138 or 7.1999999999999996e-22 < t Initial program 69.2%
associate-+l-69.2%
*-commutative69.2%
associate-*r*71.4%
*-commutative71.4%
associate-+l-71.4%
Simplified71.4%
Taylor expanded in z around inf 49.8%
*-commutative49.8%
associate-/l*64.0%
Simplified64.0%
if -8.8000000000000003e138 < t < 7.1999999999999996e-22Initial program 83.9%
associate-+l-83.9%
*-commutative83.9%
associate-*r*78.6%
*-commutative78.6%
associate-+l-78.6%
Simplified82.1%
Taylor expanded in x around 0 79.5%
cancel-sign-sub-inv79.5%
metadata-eval79.5%
+-commutative79.5%
*-commutative79.5%
fma-def79.5%
associate-/l*76.6%
associate-/r/76.0%
fma-def76.0%
times-frac83.0%
*-commutative83.0%
Simplified83.0%
Taylor expanded in a around 0 61.8%
fma-def61.8%
times-frac68.7%
associate-/r*67.0%
Simplified67.0%
Taylor expanded in c around -inf 67.8%
Simplified70.1%
Final simplification67.9%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* -4.0 (/ a (/ c t)))))
(if (<= t -8e+131)
t_1
(if (<= t -2.2e+103)
(/ b (* z c))
(if (or (<= t -3.8e+38) (not (<= t 1.7e-84))) t_1 (/ (/ b z) c))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a / (c / t));
double tmp;
if (t <= -8e+131) {
tmp = t_1;
} else if (t <= -2.2e+103) {
tmp = b / (z * c);
} else if ((t <= -3.8e+38) || !(t <= 1.7e-84)) {
tmp = t_1;
} else {
tmp = (b / z) / c;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * (a / (c / t))
if (t <= (-8d+131)) then
tmp = t_1
else if (t <= (-2.2d+103)) then
tmp = b / (z * c)
else if ((t <= (-3.8d+38)) .or. (.not. (t <= 1.7d-84))) then
tmp = t_1
else
tmp = (b / z) / c
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a / (c / t));
double tmp;
if (t <= -8e+131) {
tmp = t_1;
} else if (t <= -2.2e+103) {
tmp = b / (z * c);
} else if ((t <= -3.8e+38) || !(t <= 1.7e-84)) {
tmp = t_1;
} else {
tmp = (b / z) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * (a / (c / t)) tmp = 0 if t <= -8e+131: tmp = t_1 elif t <= -2.2e+103: tmp = b / (z * c) elif (t <= -3.8e+38) or not (t <= 1.7e-84): tmp = t_1 else: tmp = (b / z) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(a / Float64(c / t))) tmp = 0.0 if (t <= -8e+131) tmp = t_1; elseif (t <= -2.2e+103) tmp = Float64(b / Float64(z * c)); elseif ((t <= -3.8e+38) || !(t <= 1.7e-84)) tmp = t_1; else tmp = Float64(Float64(b / z) / c); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * (a / (c / t));
tmp = 0.0;
if (t <= -8e+131)
tmp = t_1;
elseif (t <= -2.2e+103)
tmp = b / (z * c);
elseif ((t <= -3.8e+38) || ~((t <= 1.7e-84)))
tmp = t_1;
else
tmp = (b / z) / c;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -8e+131], t$95$1, If[LessEqual[t, -2.2e+103], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t, -3.8e+38], N[Not[LessEqual[t, 1.7e-84]], $MachinePrecision]], t$95$1, N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{if}\;t \leq -8 \cdot 10^{+131}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -2.2 \cdot 10^{+103}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;t \leq -3.8 \cdot 10^{+38} \lor \neg \left(t \leq 1.7 \cdot 10^{-84}\right):\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\end{array}
\end{array}
if t < -7.9999999999999993e131 or -2.19999999999999992e103 < t < -3.7999999999999998e38 or 1.7000000000000001e-84 < t Initial program 72.4%
associate-+l-72.4%
*-commutative72.4%
associate-*r*74.1%
*-commutative74.1%
associate-+l-74.1%
Simplified72.5%
Taylor expanded in z around inf 44.8%
*-commutative44.8%
associate-/l*56.9%
Simplified56.9%
if -7.9999999999999993e131 < t < -2.19999999999999992e103Initial program 99.8%
associate-+l-99.8%
*-commutative99.8%
associate-*r*99.8%
*-commutative99.8%
associate-+l-99.8%
Simplified99.8%
Taylor expanded in b around inf 58.3%
*-commutative58.3%
Simplified58.3%
if -3.7999999999999998e38 < t < 1.7000000000000001e-84Initial program 83.5%
associate-+l-83.5%
*-commutative83.5%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
Simplified82.8%
Taylor expanded in x around 0 79.3%
cancel-sign-sub-inv79.3%
metadata-eval79.3%
+-commutative79.3%
*-commutative79.3%
fma-def79.3%
associate-/l*74.1%
associate-/r/74.0%
fma-def74.0%
times-frac82.4%
*-commutative82.4%
Simplified82.4%
Taylor expanded in c around 0 89.0%
Taylor expanded in b around inf 45.3%
Final simplification51.3%
NOTE: t and a should be sorted in increasing order before calling this function.
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (* -4.0 (/ a (/ c t)))))
(if (<= t -7.5e+131)
t_1
(if (<= t -5.2e+102)
(/ b (* z c))
(if (or (<= t -8.8e+36) (not (<= t 7.8e-84)))
t_1
(* (/ b z) (/ 1.0 c)))))))assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a / (c / t));
double tmp;
if (t <= -7.5e+131) {
tmp = t_1;
} else if (t <= -5.2e+102) {
tmp = b / (z * c);
} else if ((t <= -8.8e+36) || !(t <= 7.8e-84)) {
tmp = t_1;
} else {
tmp = (b / z) * (1.0 / c);
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: tmp
t_1 = (-4.0d0) * (a / (c / t))
if (t <= (-7.5d+131)) then
tmp = t_1
else if (t <= (-5.2d+102)) then
tmp = b / (z * c)
else if ((t <= (-8.8d+36)) .or. (.not. (t <= 7.8d-84))) then
tmp = t_1
else
tmp = (b / z) * (1.0d0 / c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = -4.0 * (a / (c / t));
double tmp;
if (t <= -7.5e+131) {
tmp = t_1;
} else if (t <= -5.2e+102) {
tmp = b / (z * c);
} else if ((t <= -8.8e+36) || !(t <= 7.8e-84)) {
tmp = t_1;
} else {
tmp = (b / z) * (1.0 / c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): t_1 = -4.0 * (a / (c / t)) tmp = 0 if t <= -7.5e+131: tmp = t_1 elif t <= -5.2e+102: tmp = b / (z * c) elif (t <= -8.8e+36) or not (t <= 7.8e-84): tmp = t_1 else: tmp = (b / z) * (1.0 / c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) t_1 = Float64(-4.0 * Float64(a / Float64(c / t))) tmp = 0.0 if (t <= -7.5e+131) tmp = t_1; elseif (t <= -5.2e+102) tmp = Float64(b / Float64(z * c)); elseif ((t <= -8.8e+36) || !(t <= 7.8e-84)) tmp = t_1; else tmp = Float64(Float64(b / z) * Float64(1.0 / c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
t_1 = -4.0 * (a / (c / t));
tmp = 0.0;
if (t <= -7.5e+131)
tmp = t_1;
elseif (t <= -5.2e+102)
tmp = b / (z * c);
elseif ((t <= -8.8e+36) || ~((t <= 7.8e-84)))
tmp = t_1;
else
tmp = (b / z) * (1.0 / c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -7.5e+131], t$95$1, If[LessEqual[t, -5.2e+102], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t, -8.8e+36], N[Not[LessEqual[t, 7.8e-84]], $MachinePrecision]], t$95$1, N[(N[(b / z), $MachinePrecision] * N[(1.0 / c), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
t_1 := -4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{if}\;t \leq -7.5 \cdot 10^{+131}:\\
\;\;\;\;t_1\\
\mathbf{elif}\;t \leq -5.2 \cdot 10^{+102}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{elif}\;t \leq -8.8 \cdot 10^{+36} \lor \neg \left(t \leq 7.8 \cdot 10^{-84}\right):\\
\;\;\;\;t_1\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z} \cdot \frac{1}{c}\\
\end{array}
\end{array}
if t < -7.4999999999999995e131 or -5.20000000000000013e102 < t < -8.80000000000000002e36 or 7.80000000000000045e-84 < t Initial program 72.4%
associate-+l-72.4%
*-commutative72.4%
associate-*r*74.1%
*-commutative74.1%
associate-+l-74.1%
Simplified72.5%
Taylor expanded in z around inf 44.8%
*-commutative44.8%
associate-/l*56.9%
Simplified56.9%
if -7.4999999999999995e131 < t < -5.20000000000000013e102Initial program 99.8%
associate-+l-99.8%
*-commutative99.8%
associate-*r*99.8%
*-commutative99.8%
associate-+l-99.8%
Simplified99.8%
Taylor expanded in b around inf 58.3%
*-commutative58.3%
Simplified58.3%
if -8.80000000000000002e36 < t < 7.80000000000000045e-84Initial program 83.5%
associate-+l-83.5%
*-commutative83.5%
associate-*r*76.6%
*-commutative76.6%
associate-+l-76.6%
Simplified82.8%
Taylor expanded in x around 0 79.3%
cancel-sign-sub-inv79.3%
metadata-eval79.3%
+-commutative79.3%
*-commutative79.3%
fma-def79.3%
associate-/l*74.1%
associate-/r/74.0%
fma-def74.0%
times-frac82.4%
*-commutative82.4%
Simplified82.4%
Taylor expanded in c around 0 89.0%
Taylor expanded in b around inf 45.3%
div-inv45.3%
Applied egg-rr45.3%
Final simplification51.3%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= t -2.6e+139) (not (<= t 7.2e-22))) (* -4.0 (/ a (/ c t))) (/ (+ b (* 9.0 (* x y))) (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.6e+139) || !(t <= 7.2e-22)) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((t <= (-2.6d+139)) .or. (.not. (t <= 7.2d-22))) then
tmp = (-4.0d0) * (a / (c / t))
else
tmp = (b + (9.0d0 * (x * y))) / (z * c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((t <= -2.6e+139) || !(t <= 7.2e-22)) {
tmp = -4.0 * (a / (c / t));
} else {
tmp = (b + (9.0 * (x * y))) / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (t <= -2.6e+139) or not (t <= 7.2e-22): tmp = -4.0 * (a / (c / t)) else: tmp = (b + (9.0 * (x * y))) / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((t <= -2.6e+139) || !(t <= 7.2e-22)) tmp = Float64(-4.0 * Float64(a / Float64(c / t))); else tmp = Float64(Float64(b + Float64(9.0 * Float64(x * y))) / Float64(z * c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((t <= -2.6e+139) || ~((t <= 7.2e-22)))
tmp = -4.0 * (a / (c / t));
else
tmp = (b + (9.0 * (x * y))) / (z * c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[t, -2.6e+139], N[Not[LessEqual[t, 7.2e-22]], $MachinePrecision]], N[(-4.0 * N[(a / N[(c / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(b + N[(9.0 * N[(x * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.6 \cdot 10^{+139} \lor \neg \left(t \leq 7.2 \cdot 10^{-22}\right):\\
\;\;\;\;-4 \cdot \frac{a}{\frac{c}{t}}\\
\mathbf{else}:\\
\;\;\;\;\frac{b + 9 \cdot \left(x \cdot y\right)}{z \cdot c}\\
\end{array}
\end{array}
if t < -2.60000000000000022e139 or 7.1999999999999996e-22 < t Initial program 69.2%
associate-+l-69.2%
*-commutative69.2%
associate-*r*71.4%
*-commutative71.4%
associate-+l-71.4%
Simplified71.4%
Taylor expanded in z around inf 49.8%
*-commutative49.8%
associate-/l*64.0%
Simplified64.0%
if -2.60000000000000022e139 < t < 7.1999999999999996e-22Initial program 83.9%
associate-+l-83.9%
*-commutative83.9%
associate-*r*78.6%
*-commutative78.6%
associate-+l-78.6%
Simplified82.1%
Taylor expanded in x around inf 67.9%
Final simplification66.5%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= a -7.9e-66) (not (<= a 1.2e-54))) (* -4.0 (/ (* a t) c)) (/ b (* z c))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((a <= -7.9e-66) || !(a <= 1.2e-54)) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = b / (z * c);
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((a <= (-7.9d-66)) .or. (.not. (a <= 1.2d-54))) then
tmp = (-4.0d0) * ((a * t) / c)
else
tmp = b / (z * c)
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((a <= -7.9e-66) || !(a <= 1.2e-54)) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = b / (z * c);
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (a <= -7.9e-66) or not (a <= 1.2e-54): tmp = -4.0 * ((a * t) / c) else: tmp = b / (z * c) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((a <= -7.9e-66) || !(a <= 1.2e-54)) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); else tmp = Float64(b / Float64(z * c)); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((a <= -7.9e-66) || ~((a <= 1.2e-54)))
tmp = -4.0 * ((a * t) / c);
else
tmp = b / (z * c);
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[a, -7.9e-66], N[Not[LessEqual[a, 1.2e-54]], $MachinePrecision]], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -7.9 \cdot 10^{-66} \lor \neg \left(a \leq 1.2 \cdot 10^{-54}\right):\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{else}:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\end{array}
\end{array}
if a < -7.90000000000000026e-66 or 1.20000000000000007e-54 < a Initial program 75.9%
associate-+l-75.9%
*-commutative75.9%
associate-*r*70.3%
*-commutative70.3%
associate-+l-70.3%
Simplified74.0%
Taylor expanded in z around inf 47.3%
if -7.90000000000000026e-66 < a < 1.20000000000000007e-54Initial program 82.8%
associate-+l-82.8%
*-commutative82.8%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
Simplified84.8%
Taylor expanded in b around inf 51.5%
*-commutative51.5%
Simplified51.5%
Final simplification48.9%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (or (<= a -2.05e-66) (not (<= a 7.7e-59))) (* -4.0 (/ (* a t) c)) (* b (/ 1.0 (* z c)))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((a <= -2.05e-66) || !(a <= 7.7e-59)) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = b * (1.0 / (z * c));
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if ((a <= (-2.05d-66)) .or. (.not. (a <= 7.7d-59))) then
tmp = (-4.0d0) * ((a * t) / c)
else
tmp = b * (1.0d0 / (z * c))
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if ((a <= -2.05e-66) || !(a <= 7.7e-59)) {
tmp = -4.0 * ((a * t) / c);
} else {
tmp = b * (1.0 / (z * c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if (a <= -2.05e-66) or not (a <= 7.7e-59): tmp = -4.0 * ((a * t) / c) else: tmp = b * (1.0 / (z * c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if ((a <= -2.05e-66) || !(a <= 7.7e-59)) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); else tmp = Float64(b * Float64(1.0 / Float64(z * c))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if ((a <= -2.05e-66) || ~((a <= 7.7e-59)))
tmp = -4.0 * ((a * t) / c);
else
tmp = b * (1.0 / (z * c));
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[Or[LessEqual[a, -2.05e-66], N[Not[LessEqual[a, 7.7e-59]], $MachinePrecision]], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.05 \cdot 10^{-66} \lor \neg \left(a \leq 7.7 \cdot 10^{-59}\right):\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{else}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\end{array}
\end{array}
if a < -2.04999999999999999e-66 or 7.7e-59 < a Initial program 75.9%
associate-+l-75.9%
*-commutative75.9%
associate-*r*70.3%
*-commutative70.3%
associate-+l-70.3%
Simplified74.0%
Taylor expanded in z around inf 47.3%
if -2.04999999999999999e-66 < a < 7.7e-59Initial program 82.8%
associate-+l-82.8%
*-commutative82.8%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
Simplified84.8%
Taylor expanded in b around inf 51.5%
*-commutative51.5%
Simplified51.5%
div-inv52.4%
*-commutative52.4%
Applied egg-rr52.4%
Final simplification49.3%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= a -2.3e-72) (* -4.0 (/ (* a t) c)) (if (<= a 3.5e-55) (* b (/ 1.0 (* z c))) (* t (/ -4.0 (/ c a))))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -2.3e-72) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 3.5e-55) {
tmp = b * (1.0 / (z * c));
} else {
tmp = t * (-4.0 / (c / a));
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-2.3d-72)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (a <= 3.5d-55) then
tmp = b * (1.0d0 / (z * c))
else
tmp = t * ((-4.0d0) / (c / a))
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -2.3e-72) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 3.5e-55) {
tmp = b * (1.0 / (z * c));
} else {
tmp = t * (-4.0 / (c / a));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -2.3e-72: tmp = -4.0 * ((a * t) / c) elif a <= 3.5e-55: tmp = b * (1.0 / (z * c)) else: tmp = t * (-4.0 / (c / a)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -2.3e-72) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (a <= 3.5e-55) tmp = Float64(b * Float64(1.0 / Float64(z * c))); else tmp = Float64(t * Float64(-4.0 / Float64(c / a))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -2.3e-72)
tmp = -4.0 * ((a * t) / c);
elseif (a <= 3.5e-55)
tmp = b * (1.0 / (z * c));
else
tmp = t * (-4.0 / (c / a));
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -2.3e-72], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 3.5e-55], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t * N[(-4.0 / N[(c / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -2.3 \cdot 10^{-72}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;a \leq 3.5 \cdot 10^{-55}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;t \cdot \frac{-4}{\frac{c}{a}}\\
\end{array}
\end{array}
if a < -2.29999999999999995e-72Initial program 84.8%
associate-+l-84.8%
*-commutative84.8%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
Simplified82.3%
Taylor expanded in z around inf 46.4%
if -2.29999999999999995e-72 < a < 3.50000000000000025e-55Initial program 82.8%
associate-+l-82.8%
*-commutative82.8%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
Simplified84.8%
Taylor expanded in b around inf 51.5%
*-commutative51.5%
Simplified51.5%
div-inv52.4%
*-commutative52.4%
Applied egg-rr52.4%
if 3.50000000000000025e-55 < a Initial program 66.9%
associate-+l-66.9%
*-commutative66.9%
associate-*r*63.1%
*-commutative63.1%
associate-+l-63.1%
Simplified65.5%
Taylor expanded in x around 0 69.5%
cancel-sign-sub-inv69.5%
metadata-eval69.5%
+-commutative69.5%
*-commutative69.5%
fma-def69.5%
associate-/l*76.9%
associate-/r/74.5%
fma-def74.5%
times-frac84.2%
*-commutative84.2%
Simplified84.2%
Taylor expanded in c around 0 77.4%
Taylor expanded in a around inf 48.2%
associate-/l*55.5%
associate-*r/55.5%
*-commutative55.5%
associate-/r/54.4%
*-commutative54.4%
*-commutative54.4%
associate-/l*54.4%
Simplified54.4%
Final simplification51.1%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= a -6.5e-67) (* -4.0 (/ (* a t) c)) (if (<= a 1.7e-53) (* b (/ 1.0 (* z c))) (* -4.0 (* t (/ a c))))))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -6.5e-67) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 1.7e-53) {
tmp = b * (1.0 / (z * c));
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (a <= (-6.5d-67)) then
tmp = (-4.0d0) * ((a * t) / c)
else if (a <= 1.7d-53) then
tmp = b * (1.0d0 / (z * c))
else
tmp = (-4.0d0) * (t * (a / c))
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (a <= -6.5e-67) {
tmp = -4.0 * ((a * t) / c);
} else if (a <= 1.7e-53) {
tmp = b * (1.0 / (z * c));
} else {
tmp = -4.0 * (t * (a / c));
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if a <= -6.5e-67: tmp = -4.0 * ((a * t) / c) elif a <= 1.7e-53: tmp = b * (1.0 / (z * c)) else: tmp = -4.0 * (t * (a / c)) return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (a <= -6.5e-67) tmp = Float64(-4.0 * Float64(Float64(a * t) / c)); elseif (a <= 1.7e-53) tmp = Float64(b * Float64(1.0 / Float64(z * c))); else tmp = Float64(-4.0 * Float64(t * Float64(a / c))); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (a <= -6.5e-67)
tmp = -4.0 * ((a * t) / c);
elseif (a <= 1.7e-53)
tmp = b * (1.0 / (z * c));
else
tmp = -4.0 * (t * (a / c));
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[a, -6.5e-67], N[(-4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.7e-53], N[(b * N[(1.0 / N[(z * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-4.0 * N[(t * N[(a / c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -6.5 \cdot 10^{-67}:\\
\;\;\;\;-4 \cdot \frac{a \cdot t}{c}\\
\mathbf{elif}\;a \leq 1.7 \cdot 10^{-53}:\\
\;\;\;\;b \cdot \frac{1}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;-4 \cdot \left(t \cdot \frac{a}{c}\right)\\
\end{array}
\end{array}
if a < -6.4999999999999997e-67Initial program 84.8%
associate-+l-84.8%
*-commutative84.8%
associate-*r*77.3%
*-commutative77.3%
associate-+l-77.3%
Simplified82.3%
Taylor expanded in z around inf 46.4%
if -6.4999999999999997e-67 < a < 1.7e-53Initial program 82.8%
associate-+l-82.8%
*-commutative82.8%
associate-*r*84.8%
*-commutative84.8%
associate-+l-84.8%
Simplified84.8%
Taylor expanded in b around inf 51.5%
*-commutative51.5%
Simplified51.5%
div-inv52.4%
*-commutative52.4%
Applied egg-rr52.4%
if 1.7e-53 < a Initial program 66.9%
associate-+l-66.9%
*-commutative66.9%
associate-*r*63.1%
*-commutative63.1%
associate-+l-63.1%
Simplified65.5%
Taylor expanded in z around inf 48.2%
*-commutative48.2%
associate-/l*55.5%
associate-/r/54.4%
Simplified54.4%
Final simplification51.2%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (if (<= z 20000000000000.0) (/ b (* z c)) (/ (/ b z) c)))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= 20000000000000.0) {
tmp = b / (z * c);
} else {
tmp = (b / z) / c;
}
return tmp;
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: tmp
if (z <= 20000000000000.0d0) then
tmp = b / (z * c)
else
tmp = (b / z) / c
end if
code = tmp
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double tmp;
if (z <= 20000000000000.0) {
tmp = b / (z * c);
} else {
tmp = (b / z) / c;
}
return tmp;
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): tmp = 0 if z <= 20000000000000.0: tmp = b / (z * c) else: tmp = (b / z) / c return tmp
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) tmp = 0.0 if (z <= 20000000000000.0) tmp = Float64(b / Float64(z * c)); else tmp = Float64(Float64(b / z) / c); end return tmp end
t, a = num2cell(sort([t, a])){:}
function tmp_2 = code(x, y, z, t, a, b, c)
tmp = 0.0;
if (z <= 20000000000000.0)
tmp = b / (z * c);
else
tmp = (b / z) / c;
end
tmp_2 = tmp;
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[z, 20000000000000.0], N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision], N[(N[(b / z), $MachinePrecision] / c), $MachinePrecision]]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 20000000000000:\\
\;\;\;\;\frac{b}{z \cdot c}\\
\mathbf{else}:\\
\;\;\;\;\frac{\frac{b}{z}}{c}\\
\end{array}
\end{array}
if z < 2e13Initial program 86.6%
associate-+l-86.6%
*-commutative86.6%
associate-*r*83.0%
*-commutative83.0%
associate-+l-83.0%
Simplified86.0%
Taylor expanded in b around inf 40.4%
*-commutative40.4%
Simplified40.4%
if 2e13 < z Initial program 58.2%
associate-+l-58.2%
*-commutative58.2%
associate-*r*58.2%
*-commutative58.2%
associate-+l-58.2%
Simplified58.4%
Taylor expanded in x around 0 67.7%
cancel-sign-sub-inv67.7%
metadata-eval67.7%
+-commutative67.7%
*-commutative67.7%
fma-def67.7%
associate-/l*66.3%
associate-/r/71.8%
fma-def71.8%
times-frac83.9%
*-commutative83.9%
Simplified83.9%
Taylor expanded in c around 0 83.8%
Taylor expanded in b around inf 27.7%
Final simplification36.9%
NOTE: t and a should be sorted in increasing order before calling this function. (FPCore (x y z t a b c) :precision binary64 (/ b (* z c)))
assert(t < a);
double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
NOTE: t and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
code = b / (z * c)
end function
assert t < a;
public static double code(double x, double y, double z, double t, double a, double b, double c) {
return b / (z * c);
}
[t, a] = sort([t, a]) def code(x, y, z, t, a, b, c): return b / (z * c)
t, a = sort([t, a]) function code(x, y, z, t, a, b, c) return Float64(b / Float64(z * c)) end
t, a = num2cell(sort([t, a])){:}
function tmp = code(x, y, z, t, a, b, c)
tmp = b / (z * c);
end
NOTE: t and a should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_, c_] := N[(b / N[(z * c), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[t, a] = \mathsf{sort}([t, a])\\
\\
\frac{b}{z \cdot c}
\end{array}
Initial program 78.6%
associate-+l-78.6%
*-commutative78.6%
associate-*r*76.0%
*-commutative76.0%
associate-+l-76.0%
Simplified78.2%
Taylor expanded in b around inf 35.0%
*-commutative35.0%
Simplified35.0%
Final simplification35.0%
(FPCore (x y z t a b c)
:precision binary64
(let* ((t_1 (/ b (* c z)))
(t_2 (* 4.0 (/ (* a t) c)))
(t_3 (* (* x 9.0) y))
(t_4 (+ (- t_3 (* (* (* z 4.0) t) a)) b))
(t_5 (/ t_4 (* z c)))
(t_6 (/ (+ (- t_3 (* (* z 4.0) (* t a))) b) (* z c))))
(if (< t_5 -1.100156740804105e-171)
t_6
(if (< t_5 0.0)
(/ (/ t_4 z) c)
(if (< t_5 1.1708877911747488e-53)
t_6
(if (< t_5 2.876823679546137e+130)
(- (+ (* (* 9.0 (/ y c)) (/ x z)) t_1) t_2)
(if (< t_5 1.3838515042456319e+158)
t_6
(- (+ (* 9.0 (* (/ y (* c z)) x)) t_1) t_2))))))))
double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: tmp
t_1 = b / (c * z)
t_2 = 4.0d0 * ((a * t) / c)
t_3 = (x * 9.0d0) * y
t_4 = (t_3 - (((z * 4.0d0) * t) * a)) + b
t_5 = t_4 / (z * c)
t_6 = ((t_3 - ((z * 4.0d0) * (t * a))) + b) / (z * c)
if (t_5 < (-1.100156740804105d-171)) then
tmp = t_6
else if (t_5 < 0.0d0) then
tmp = (t_4 / z) / c
else if (t_5 < 1.1708877911747488d-53) then
tmp = t_6
else if (t_5 < 2.876823679546137d+130) then
tmp = (((9.0d0 * (y / c)) * (x / z)) + t_1) - t_2
else if (t_5 < 1.3838515042456319d+158) then
tmp = t_6
else
tmp = ((9.0d0 * ((y / (c * z)) * x)) + t_1) - t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c) {
double t_1 = b / (c * z);
double t_2 = 4.0 * ((a * t) / c);
double t_3 = (x * 9.0) * y;
double t_4 = (t_3 - (((z * 4.0) * t) * a)) + b;
double t_5 = t_4 / (z * c);
double t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c);
double tmp;
if (t_5 < -1.100156740804105e-171) {
tmp = t_6;
} else if (t_5 < 0.0) {
tmp = (t_4 / z) / c;
} else if (t_5 < 1.1708877911747488e-53) {
tmp = t_6;
} else if (t_5 < 2.876823679546137e+130) {
tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2;
} else if (t_5 < 1.3838515042456319e+158) {
tmp = t_6;
} else {
tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c): t_1 = b / (c * z) t_2 = 4.0 * ((a * t) / c) t_3 = (x * 9.0) * y t_4 = (t_3 - (((z * 4.0) * t) * a)) + b t_5 = t_4 / (z * c) t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c) tmp = 0 if t_5 < -1.100156740804105e-171: tmp = t_6 elif t_5 < 0.0: tmp = (t_4 / z) / c elif t_5 < 1.1708877911747488e-53: tmp = t_6 elif t_5 < 2.876823679546137e+130: tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2 elif t_5 < 1.3838515042456319e+158: tmp = t_6 else: tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2 return tmp
function code(x, y, z, t, a, b, c) t_1 = Float64(b / Float64(c * z)) t_2 = Float64(4.0 * Float64(Float64(a * t) / c)) t_3 = Float64(Float64(x * 9.0) * y) t_4 = Float64(Float64(t_3 - Float64(Float64(Float64(z * 4.0) * t) * a)) + b) t_5 = Float64(t_4 / Float64(z * c)) t_6 = Float64(Float64(Float64(t_3 - Float64(Float64(z * 4.0) * Float64(t * a))) + b) / Float64(z * c)) tmp = 0.0 if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = Float64(Float64(t_4 / z) / c); elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = Float64(Float64(Float64(Float64(9.0 * Float64(y / c)) * Float64(x / z)) + t_1) - t_2); elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = Float64(Float64(Float64(9.0 * Float64(Float64(y / Float64(c * z)) * x)) + t_1) - t_2); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c) t_1 = b / (c * z); t_2 = 4.0 * ((a * t) / c); t_3 = (x * 9.0) * y; t_4 = (t_3 - (((z * 4.0) * t) * a)) + b; t_5 = t_4 / (z * c); t_6 = ((t_3 - ((z * 4.0) * (t * a))) + b) / (z * c); tmp = 0.0; if (t_5 < -1.100156740804105e-171) tmp = t_6; elseif (t_5 < 0.0) tmp = (t_4 / z) / c; elseif (t_5 < 1.1708877911747488e-53) tmp = t_6; elseif (t_5 < 2.876823679546137e+130) tmp = (((9.0 * (y / c)) * (x / z)) + t_1) - t_2; elseif (t_5 < 1.3838515042456319e+158) tmp = t_6; else tmp = ((9.0 * ((y / (c * z)) * x)) + t_1) - t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(b / N[(c * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(N[(a * t), $MachinePrecision] / c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[(x * 9.0), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$4 = N[(N[(t$95$3 - N[(N[(N[(z * 4.0), $MachinePrecision] * t), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(z * c), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[(N[(z * 4.0), $MachinePrecision] * N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + b), $MachinePrecision] / N[(z * c), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$5, -1.100156740804105e-171], t$95$6, If[Less[t$95$5, 0.0], N[(N[(t$95$4 / z), $MachinePrecision] / c), $MachinePrecision], If[Less[t$95$5, 1.1708877911747488e-53], t$95$6, If[Less[t$95$5, 2.876823679546137e+130], N[(N[(N[(N[(9.0 * N[(y / c), $MachinePrecision]), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[t$95$5, 1.3838515042456319e+158], t$95$6, N[(N[(N[(9.0 * N[(N[(y / N[(c * z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{b}{c \cdot z}\\
t_2 := 4 \cdot \frac{a \cdot t}{c}\\
t_3 := \left(x \cdot 9\right) \cdot y\\
t_4 := \left(t_3 - \left(\left(z \cdot 4\right) \cdot t\right) \cdot a\right) + b\\
t_5 := \frac{t_4}{z \cdot c}\\
t_6 := \frac{\left(t_3 - \left(z \cdot 4\right) \cdot \left(t \cdot a\right)\right) + b}{z \cdot c}\\
\mathbf{if}\;t_5 < -1.100156740804105 \cdot 10^{-171}:\\
\;\;\;\;t_6\\
\mathbf{elif}\;t_5 < 0:\\
\;\;\;\;\frac{\frac{t_4}{z}}{c}\\
\mathbf{elif}\;t_5 < 1.1708877911747488 \cdot 10^{-53}:\\
\;\;\;\;t_6\\
\mathbf{elif}\;t_5 < 2.876823679546137 \cdot 10^{+130}:\\
\;\;\;\;\left(\left(9 \cdot \frac{y}{c}\right) \cdot \frac{x}{z} + t_1\right) - t_2\\
\mathbf{elif}\;t_5 < 1.3838515042456319 \cdot 10^{+158}:\\
\;\;\;\;t_6\\
\mathbf{else}:\\
\;\;\;\;\left(9 \cdot \left(\frac{y}{c \cdot z} \cdot x\right) + t_1\right) - t_2\\
\end{array}
\end{array}
herbie shell --seed 2023279
(FPCore (x y z t a b c)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, J"
:precision binary64
:herbie-target
(if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) -1.100156740804105e-171) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 0.0) (/ (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) z) c) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.1708877911747488e-53) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 2.876823679546137e+130) (- (+ (* (* 9.0 (/ y c)) (/ x z)) (/ b (* c z))) (* 4.0 (/ (* a t) c))) (if (< (/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)) 1.3838515042456319e+158) (/ (+ (- (* (* x 9.0) y) (* (* z 4.0) (* t a))) b) (* z c)) (- (+ (* 9.0 (* (/ y (* c z)) x)) (/ b (* c z))) (* 4.0 (/ (* a t) c))))))))
(/ (+ (- (* (* x 9.0) y) (* (* (* z 4.0) t) a)) b) (* z c)))