
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 10 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))
double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
real(8) function code(x, y, z, t, a)
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
code = ((x * y) - ((z * 9.0d0) * t)) / (a * 2.0d0)
end function
public static double code(double x, double y, double z, double t, double a) {
return ((x * y) - ((z * 9.0) * t)) / (a * 2.0);
}
def code(x, y, z, t, a): return ((x * y) - ((z * 9.0) * t)) / (a * 2.0)
function code(x, y, z, t, a) return Float64(Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) / Float64(a * 2.0)) end
function tmp = code(x, y, z, t, a) tmp = ((x * y) - ((z * 9.0) * t)) / (a * 2.0); end
code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\frac{x \cdot y - \left(z \cdot 9\right) \cdot t}{a \cdot 2}
\end{array}
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (- (* x y) (* (* z 9.0) t))))
(if (or (<= t_1 -4e+214) (not (<= t_1 5e+274)))
(- (/ (* x (/ y a)) 2.0) (* t (/ z (/ a 4.5))))
(/ (- (* x y) (* 9.0 (* z t))) (* a 2.0)))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -4e+214) || !(t_1 <= 5e+274)) {
tmp = ((x * (y / a)) / 2.0) - (t * (z / (a / 4.5)));
} else {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: t_1
real(8) :: tmp
t_1 = (x * y) - ((z * 9.0d0) * t)
if ((t_1 <= (-4d+214)) .or. (.not. (t_1 <= 5d+274))) then
tmp = ((x * (y / a)) / 2.0d0) - (t * (z / (a / 4.5d0)))
else
tmp = ((x * y) - (9.0d0 * (z * t))) / (a * 2.0d0)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (x * y) - ((z * 9.0) * t);
double tmp;
if ((t_1 <= -4e+214) || !(t_1 <= 5e+274)) {
tmp = ((x * (y / a)) / 2.0) - (t * (z / (a / 4.5)));
} else {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): t_1 = (x * y) - ((z * 9.0) * t) tmp = 0 if (t_1 <= -4e+214) or not (t_1 <= 5e+274): tmp = ((x * (y / a)) / 2.0) - (t * (z / (a / 4.5))) else: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) t_1 = Float64(Float64(x * y) - Float64(Float64(z * 9.0) * t)) tmp = 0.0 if ((t_1 <= -4e+214) || !(t_1 <= 5e+274)) tmp = Float64(Float64(Float64(x * Float64(y / a)) / 2.0) - Float64(t * Float64(z / Float64(a / 4.5)))); else tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (x * y) - ((z * 9.0) * t);
tmp = 0.0;
if ((t_1 <= -4e+214) || ~((t_1 <= 5e+274)))
tmp = ((x * (y / a)) / 2.0) - (t * (z / (a / 4.5)));
else
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] - N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -4e+214], N[Not[LessEqual[t$95$1, 5e+274]], $MachinePrecision]], N[(N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] / 2.0), $MachinePrecision] - N[(t * N[(z / N[(a / 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := x \cdot y - \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -4 \cdot 10^{+214} \lor \neg \left(t_1 \leq 5 \cdot 10^{+274}\right):\\
\;\;\;\;\frac{x \cdot \frac{y}{a}}{2} - t \cdot \frac{z}{\frac{a}{4.5}}\\
\mathbf{else}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\end{array}
\end{array}
if (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < -3.9999999999999998e214 or 4.9999999999999998e274 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) Initial program 74.0%
*-commutative74.0%
*-commutative74.0%
associate-*l*74.0%
Simplified74.0%
div-sub69.4%
sub-neg69.4%
*-commutative69.4%
times-frac77.1%
div-inv77.1%
associate-*r*77.2%
*-commutative77.2%
associate-*l*77.1%
*-commutative77.1%
associate-/r*77.1%
metadata-eval77.1%
Applied egg-rr77.1%
sub-neg77.1%
associate-*l/77.1%
associate-*r/77.1%
*-commutative77.1%
associate-*l*77.1%
*-commutative77.1%
metadata-eval77.1%
Simplified77.1%
Taylor expanded in t around 0 77.2%
*-commutative77.2%
*-commutative77.2%
associate-*l/77.1%
*-commutative77.1%
associate-*r*77.1%
associate-*r/92.0%
associate-/l*92.0%
Simplified92.0%
if -3.9999999999999998e214 < (-.f64 (*.f64 x y) (*.f64 (*.f64 z 9) t)) < 4.9999999999999998e274Initial program 99.1%
fma-neg99.1%
associate-*l*99.1%
distribute-rgt-neg-in99.1%
*-commutative99.1%
distribute-rgt-neg-in99.1%
metadata-eval99.1%
Simplified99.1%
*-commutative99.1%
metadata-eval99.1%
distribute-lft-neg-in99.1%
distribute-rgt-neg-in99.1%
fma-neg99.0%
associate-*r*99.1%
*-commutative99.1%
associate-*l*99.2%
Applied egg-rr99.2%
Final simplification96.7%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(let* ((t_1 (* (* z 9.0) t)))
(if (<= t_1 -1e+281)
(/ (* t -4.5) (/ a z))
(if (<= t_1 1e+291)
(/ (- (* x y) (* 9.0 (* z t))) (* a 2.0))
(/ z (/ a (* t -4.5)))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -1e+281) {
tmp = (t * -4.5) / (a / z);
} else if (t_1 <= 1e+291) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = z / (a / (t * -4.5));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: t_1
real(8) :: tmp
t_1 = (z * 9.0d0) * t
if (t_1 <= (-1d+281)) then
tmp = (t * (-4.5d0)) / (a / z)
else if (t_1 <= 1d+291) then
tmp = ((x * y) - (9.0d0 * (z * t))) / (a * 2.0d0)
else
tmp = z / (a / (t * (-4.5d0)))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double t_1 = (z * 9.0) * t;
double tmp;
if (t_1 <= -1e+281) {
tmp = (t * -4.5) / (a / z);
} else if (t_1 <= 1e+291) {
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
} else {
tmp = z / (a / (t * -4.5));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): t_1 = (z * 9.0) * t tmp = 0 if t_1 <= -1e+281: tmp = (t * -4.5) / (a / z) elif t_1 <= 1e+291: tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0) else: tmp = z / (a / (t * -4.5)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) t_1 = Float64(Float64(z * 9.0) * t) tmp = 0.0 if (t_1 <= -1e+281) tmp = Float64(Float64(t * -4.5) / Float64(a / z)); elseif (t_1 <= 1e+291) tmp = Float64(Float64(Float64(x * y) - Float64(9.0 * Float64(z * t))) / Float64(a * 2.0)); else tmp = Float64(z / Float64(a / Float64(t * -4.5))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
t_1 = (z * 9.0) * t;
tmp = 0.0;
if (t_1 <= -1e+281)
tmp = (t * -4.5) / (a / z);
elseif (t_1 <= 1e+291)
tmp = ((x * y) - (9.0 * (z * t))) / (a * 2.0);
else
tmp = z / (a / (t * -4.5));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z * 9.0), $MachinePrecision] * t), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+281], N[(N[(t * -4.5), $MachinePrecision] / N[(a / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 1e+291], N[(N[(N[(x * y), $MachinePrecision] - N[(9.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(z / N[(a / N[(t * -4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := \left(z \cdot 9\right) \cdot t\\
\mathbf{if}\;t_1 \leq -1 \cdot 10^{+281}:\\
\;\;\;\;\frac{t \cdot -4.5}{\frac{a}{z}}\\
\mathbf{elif}\;t_1 \leq 10^{+291}:\\
\;\;\;\;\frac{x \cdot y - 9 \cdot \left(z \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{z}{\frac{a}{t \cdot -4.5}}\\
\end{array}
\end{array}
if (*.f64 (*.f64 z 9) t) < -1e281Initial program 56.9%
*-commutative56.9%
*-commutative56.9%
associate-*l*56.9%
Simplified56.9%
Taylor expanded in x around 0 62.0%
*-commutative62.0%
associate-/l*93.5%
associate-*l/93.7%
Simplified93.7%
if -1e281 < (*.f64 (*.f64 z 9) t) < 9.9999999999999996e290Initial program 95.7%
fma-neg95.7%
associate-*l*95.7%
distribute-rgt-neg-in95.7%
*-commutative95.7%
distribute-rgt-neg-in95.7%
metadata-eval95.7%
Simplified95.7%
*-commutative95.7%
metadata-eval95.7%
distribute-lft-neg-in95.7%
distribute-rgt-neg-in95.7%
fma-neg95.7%
associate-*r*95.7%
*-commutative95.7%
associate-*l*95.8%
Applied egg-rr95.8%
if 9.9999999999999996e290 < (*.f64 (*.f64 z 9) t) Initial program 65.4%
*-commutative65.4%
*-commutative65.4%
associate-*l*65.4%
Simplified65.4%
div-sub60.2%
sub-neg60.2%
*-commutative60.2%
times-frac60.2%
div-inv60.2%
associate-*r*60.2%
*-commutative60.2%
associate-*l*60.2%
*-commutative60.2%
associate-/r*60.2%
metadata-eval60.2%
Applied egg-rr60.2%
sub-neg60.2%
associate-*l/60.2%
associate-*r/60.2%
*-commutative60.2%
associate-*l*60.2%
*-commutative60.2%
metadata-eval60.2%
Simplified60.2%
Taylor expanded in t around 0 60.2%
*-commutative60.2%
*-commutative60.2%
associate-*l/60.2%
*-commutative60.2%
associate-*r*60.2%
associate-*r/94.3%
associate-/l*94.4%
Simplified94.4%
Taylor expanded in x around 0 65.4%
associate-*r/65.4%
associate-*r*65.4%
*-commutative65.4%
*-commutative65.4%
associate-/l*95.0%
Simplified95.0%
Final simplification95.6%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= t -3.55e-88)
(* -4.5 (/ t (/ a z)))
(if (or (<= t 4.1e+122) (and (not (<= t 1.45e+140)) (<= t 5.5e+148)))
(* (* x (/ y a)) 0.5)
(* -4.5 (* z (/ t a))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -3.55e-88) {
tmp = -4.5 * (t / (a / z));
} else if ((t <= 4.1e+122) || (!(t <= 1.45e+140) && (t <= 5.5e+148))) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-3.55d-88)) then
tmp = (-4.5d0) * (t / (a / z))
else if ((t <= 4.1d+122) .or. (.not. (t <= 1.45d+140)) .and. (t <= 5.5d+148)) then
tmp = (x * (y / a)) * 0.5d0
else
tmp = (-4.5d0) * (z * (t / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -3.55e-88) {
tmp = -4.5 * (t / (a / z));
} else if ((t <= 4.1e+122) || (!(t <= 1.45e+140) && (t <= 5.5e+148))) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z * (t / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -3.55e-88: tmp = -4.5 * (t / (a / z)) elif (t <= 4.1e+122) or (not (t <= 1.45e+140) and (t <= 5.5e+148)): tmp = (x * (y / a)) * 0.5 else: tmp = -4.5 * (z * (t / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -3.55e-88) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif ((t <= 4.1e+122) || (!(t <= 1.45e+140) && (t <= 5.5e+148))) tmp = Float64(Float64(x * Float64(y / a)) * 0.5); else tmp = Float64(-4.5 * Float64(z * Float64(t / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -3.55e-88)
tmp = -4.5 * (t / (a / z));
elseif ((t <= 4.1e+122) || (~((t <= 1.45e+140)) && (t <= 5.5e+148)))
tmp = (x * (y / a)) * 0.5;
else
tmp = -4.5 * (z * (t / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -3.55e-88], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t, 4.1e+122], And[N[Not[LessEqual[t, 1.45e+140]], $MachinePrecision], LessEqual[t, 5.5e+148]]], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -3.55 \cdot 10^{-88}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;t \leq 4.1 \cdot 10^{+122} \lor \neg \left(t \leq 1.45 \cdot 10^{+140}\right) \land t \leq 5.5 \cdot 10^{+148}:\\
\;\;\;\;\left(x \cdot \frac{y}{a}\right) \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\end{array}
\end{array}
if t < -3.55e-88Initial program 83.4%
*-commutative83.4%
*-commutative83.4%
associate-*l*83.4%
Simplified83.4%
Taylor expanded in x around 0 51.0%
associate-/l*59.7%
Simplified59.7%
if -3.55e-88 < t < 4.1000000000000002e122 or 1.4499999999999999e140 < t < 5.5e148Initial program 94.7%
*-commutative94.7%
*-commutative94.7%
associate-*l*94.6%
Simplified94.6%
Taylor expanded in x around inf 69.3%
associate-*r/66.3%
Simplified66.3%
if 4.1000000000000002e122 < t < 1.4499999999999999e140 or 5.5e148 < t Initial program 86.0%
*-commutative86.0%
*-commutative86.0%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in x around 0 74.8%
associate-/l*77.1%
Simplified77.1%
associate-/r/79.2%
Applied egg-rr79.2%
Final simplification66.8%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= t -1.2e-85)
(* -4.5 (/ t (/ a z)))
(if (<= t 7.8e+121)
(* 0.5 (/ x (/ a y)))
(if (or (<= t 1.35e+140) (not (<= t 5.2e+148)))
(* -4.5 (* z (/ t a)))
(* (* x (/ y a)) 0.5)))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-85) {
tmp = -4.5 * (t / (a / z));
} else if (t <= 7.8e+121) {
tmp = 0.5 * (x / (a / y));
} else if ((t <= 1.35e+140) || !(t <= 5.2e+148)) {
tmp = -4.5 * (z * (t / a));
} else {
tmp = (x * (y / a)) * 0.5;
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-1.2d-85)) then
tmp = (-4.5d0) * (t / (a / z))
else if (t <= 7.8d+121) then
tmp = 0.5d0 * (x / (a / y))
else if ((t <= 1.35d+140) .or. (.not. (t <= 5.2d+148))) then
tmp = (-4.5d0) * (z * (t / a))
else
tmp = (x * (y / a)) * 0.5d0
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.2e-85) {
tmp = -4.5 * (t / (a / z));
} else if (t <= 7.8e+121) {
tmp = 0.5 * (x / (a / y));
} else if ((t <= 1.35e+140) || !(t <= 5.2e+148)) {
tmp = -4.5 * (z * (t / a));
} else {
tmp = (x * (y / a)) * 0.5;
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -1.2e-85: tmp = -4.5 * (t / (a / z)) elif t <= 7.8e+121: tmp = 0.5 * (x / (a / y)) elif (t <= 1.35e+140) or not (t <= 5.2e+148): tmp = -4.5 * (z * (t / a)) else: tmp = (x * (y / a)) * 0.5 return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.2e-85) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif (t <= 7.8e+121) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif ((t <= 1.35e+140) || !(t <= 5.2e+148)) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); else tmp = Float64(Float64(x * Float64(y / a)) * 0.5); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.2e-85)
tmp = -4.5 * (t / (a / z));
elseif (t <= 7.8e+121)
tmp = 0.5 * (x / (a / y));
elseif ((t <= 1.35e+140) || ~((t <= 5.2e+148)))
tmp = -4.5 * (z * (t / a));
else
tmp = (x * (y / a)) * 0.5;
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.2e-85], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 7.8e+121], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t, 1.35e+140], N[Not[LessEqual[t, 5.2e+148]], $MachinePrecision]], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.2 \cdot 10^{-85}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;t \leq 7.8 \cdot 10^{+121}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;t \leq 1.35 \cdot 10^{+140} \lor \neg \left(t \leq 5.2 \cdot 10^{+148}\right):\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(x \cdot \frac{y}{a}\right) \cdot 0.5\\
\end{array}
\end{array}
if t < -1.2e-85Initial program 83.4%
*-commutative83.4%
*-commutative83.4%
associate-*l*83.4%
Simplified83.4%
Taylor expanded in x around 0 51.0%
associate-/l*59.7%
Simplified59.7%
if -1.2e-85 < t < 7.79999999999999967e121Initial program 95.7%
*-commutative95.7%
*-commutative95.7%
associate-*l*95.7%
Simplified95.7%
Taylor expanded in x around inf 69.6%
associate-/l*67.0%
Simplified67.0%
if 7.79999999999999967e121 < t < 1.35000000000000009e140 or 5.2e148 < t Initial program 86.0%
*-commutative86.0%
*-commutative86.0%
associate-*l*86.1%
Simplified86.1%
Taylor expanded in x around 0 74.8%
associate-/l*77.1%
Simplified77.1%
associate-/r/79.2%
Applied egg-rr79.2%
if 1.35000000000000009e140 < t < 5.2e148Initial program 76.5%
*-commutative76.5%
*-commutative76.5%
associate-*l*76.5%
Simplified76.5%
Taylor expanded in x around inf 63.1%
associate-*r/64.1%
Simplified64.1%
Final simplification67.1%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= t -2.3e-107)
(* -4.5 (/ t (/ a z)))
(if (<= t 5e+122)
(* 0.5 (/ x (/ a y)))
(if (<= t 1.5e+140)
(* -4.5 (* z (/ t a)))
(if (<= t 5.2e+148) (* (* x (/ y a)) 0.5) (* z (* t (/ -4.5 a))))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.3e-107) {
tmp = -4.5 * (t / (a / z));
} else if (t <= 5e+122) {
tmp = 0.5 * (x / (a / y));
} else if (t <= 1.5e+140) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 5.2e+148) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = z * (t * (-4.5 / a));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-2.3d-107)) then
tmp = (-4.5d0) * (t / (a / z))
else if (t <= 5d+122) then
tmp = 0.5d0 * (x / (a / y))
else if (t <= 1.5d+140) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 5.2d+148) then
tmp = (x * (y / a)) * 0.5d0
else
tmp = z * (t * ((-4.5d0) / a))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.3e-107) {
tmp = -4.5 * (t / (a / z));
} else if (t <= 5e+122) {
tmp = 0.5 * (x / (a / y));
} else if (t <= 1.5e+140) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 5.2e+148) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = z * (t * (-4.5 / a));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -2.3e-107: tmp = -4.5 * (t / (a / z)) elif t <= 5e+122: tmp = 0.5 * (x / (a / y)) elif t <= 1.5e+140: tmp = -4.5 * (z * (t / a)) elif t <= 5.2e+148: tmp = (x * (y / a)) * 0.5 else: tmp = z * (t * (-4.5 / a)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.3e-107) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif (t <= 5e+122) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (t <= 1.5e+140) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 5.2e+148) tmp = Float64(Float64(x * Float64(y / a)) * 0.5); else tmp = Float64(z * Float64(t * Float64(-4.5 / a))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.3e-107)
tmp = -4.5 * (t / (a / z));
elseif (t <= 5e+122)
tmp = 0.5 * (x / (a / y));
elseif (t <= 1.5e+140)
tmp = -4.5 * (z * (t / a));
elseif (t <= 5.2e+148)
tmp = (x * (y / a)) * 0.5;
else
tmp = z * (t * (-4.5 / a));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.3e-107], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5e+122], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.5e+140], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5.2e+148], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(z * N[(t * N[(-4.5 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.3 \cdot 10^{-107}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;t \leq 5 \cdot 10^{+122}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;t \leq 1.5 \cdot 10^{+140}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 5.2 \cdot 10^{+148}:\\
\;\;\;\;\left(x \cdot \frac{y}{a}\right) \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;z \cdot \left(t \cdot \frac{-4.5}{a}\right)\\
\end{array}
\end{array}
if t < -2.30000000000000003e-107Initial program 84.1%
*-commutative84.1%
*-commutative84.1%
associate-*l*84.1%
Simplified84.1%
Taylor expanded in x around 0 50.3%
associate-/l*58.6%
Simplified58.6%
if -2.30000000000000003e-107 < t < 4.99999999999999989e122Initial program 95.6%
*-commutative95.6%
*-commutative95.6%
associate-*l*95.6%
Simplified95.6%
Taylor expanded in x around inf 69.7%
associate-/l*67.7%
Simplified67.7%
if 4.99999999999999989e122 < t < 1.49999999999999998e140Initial program 75.7%
*-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in x around 0 51.7%
associate-/l*52.4%
Simplified52.4%
associate-/r/75.9%
Applied egg-rr75.9%
if 1.49999999999999998e140 < t < 5.2e148Initial program 76.5%
*-commutative76.5%
*-commutative76.5%
associate-*l*76.5%
Simplified76.5%
Taylor expanded in x around inf 63.1%
associate-*r/64.1%
Simplified64.1%
if 5.2e148 < t Initial program 87.1%
*-commutative87.1%
*-commutative87.1%
associate-*l*87.2%
Simplified87.2%
Taylor expanded in x around 0 77.2%
*-commutative77.2%
associate-/l*79.7%
associate-*l/79.6%
Simplified79.6%
associate-/r/79.6%
Applied egg-rr79.6%
Taylor expanded in t around 0 79.6%
associate-*r/79.6%
*-commutative79.6%
*-rgt-identity79.6%
associate-*r/79.6%
associate-*l*79.6%
associate-*r/79.6%
metadata-eval79.6%
Simplified79.6%
Final simplification67.1%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= t -1.6e-104)
(* -4.5 (/ t (/ a z)))
(if (<= t 2.8e+122)
(* 0.5 (/ x (/ a y)))
(if (<= t 1.5e+140)
(* -4.5 (* z (/ t a)))
(if (<= t 5.2e+148) (* (* x (/ y a)) 0.5) (* -4.5 (/ z (/ a t))))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.6e-104) {
tmp = -4.5 * (t / (a / z));
} else if (t <= 2.8e+122) {
tmp = 0.5 * (x / (a / y));
} else if (t <= 1.5e+140) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 5.2e+148) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-1.6d-104)) then
tmp = (-4.5d0) * (t / (a / z))
else if (t <= 2.8d+122) then
tmp = 0.5d0 * (x / (a / y))
else if (t <= 1.5d+140) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 5.2d+148) then
tmp = (x * (y / a)) * 0.5d0
else
tmp = (-4.5d0) * (z / (a / t))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.6e-104) {
tmp = -4.5 * (t / (a / z));
} else if (t <= 2.8e+122) {
tmp = 0.5 * (x / (a / y));
} else if (t <= 1.5e+140) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 5.2e+148) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -1.6e-104: tmp = -4.5 * (t / (a / z)) elif t <= 2.8e+122: tmp = 0.5 * (x / (a / y)) elif t <= 1.5e+140: tmp = -4.5 * (z * (t / a)) elif t <= 5.2e+148: tmp = (x * (y / a)) * 0.5 else: tmp = -4.5 * (z / (a / t)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.6e-104) tmp = Float64(-4.5 * Float64(t / Float64(a / z))); elseif (t <= 2.8e+122) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (t <= 1.5e+140) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 5.2e+148) tmp = Float64(Float64(x * Float64(y / a)) * 0.5); else tmp = Float64(-4.5 * Float64(z / Float64(a / t))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.6e-104)
tmp = -4.5 * (t / (a / z));
elseif (t <= 2.8e+122)
tmp = 0.5 * (x / (a / y));
elseif (t <= 1.5e+140)
tmp = -4.5 * (z * (t / a));
elseif (t <= 5.2e+148)
tmp = (x * (y / a)) * 0.5;
else
tmp = -4.5 * (z / (a / t));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.6e-104], N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.8e+122], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.5e+140], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5.2e+148], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.6 \cdot 10^{-104}:\\
\;\;\;\;-4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;t \leq 2.8 \cdot 10^{+122}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;t \leq 1.5 \cdot 10^{+140}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 5.2 \cdot 10^{+148}:\\
\;\;\;\;\left(x \cdot \frac{y}{a}\right) \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\end{array}
\end{array}
if t < -1.59999999999999994e-104Initial program 84.1%
*-commutative84.1%
*-commutative84.1%
associate-*l*84.1%
Simplified84.1%
Taylor expanded in x around 0 50.3%
associate-/l*58.6%
Simplified58.6%
if -1.59999999999999994e-104 < t < 2.8e122Initial program 95.6%
*-commutative95.6%
*-commutative95.6%
associate-*l*95.6%
Simplified95.6%
Taylor expanded in x around inf 69.7%
associate-/l*67.7%
Simplified67.7%
if 2.8e122 < t < 1.49999999999999998e140Initial program 75.7%
*-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in x around 0 51.7%
associate-/l*52.4%
Simplified52.4%
associate-/r/75.9%
Applied egg-rr75.9%
if 1.49999999999999998e140 < t < 5.2e148Initial program 76.5%
*-commutative76.5%
*-commutative76.5%
associate-*l*76.5%
Simplified76.5%
Taylor expanded in x around inf 63.1%
associate-*r/64.1%
Simplified64.1%
if 5.2e148 < t Initial program 87.1%
*-commutative87.1%
*-commutative87.1%
associate-*l*87.2%
Simplified87.2%
div-sub76.6%
sub-neg76.6%
*-commutative76.6%
times-frac79.1%
div-inv79.1%
associate-*r*79.2%
*-commutative79.2%
associate-*l*79.1%
*-commutative79.1%
associate-/r*79.1%
metadata-eval79.1%
Applied egg-rr79.1%
sub-neg79.1%
associate-*l/79.1%
associate-*r/79.1%
*-commutative79.1%
associate-*l*79.1%
*-commutative79.1%
metadata-eval79.1%
Simplified79.1%
Taylor expanded in t around 0 79.2%
*-commutative79.2%
*-commutative79.2%
associate-*l/79.1%
*-commutative79.1%
associate-*r*79.1%
associate-*r/83.9%
associate-/l*83.9%
Simplified83.9%
Taylor expanded in x around 0 77.2%
associate-*r/77.1%
associate-*r*77.1%
*-commutative77.1%
*-commutative77.1%
associate-/l*80.9%
Simplified80.9%
associate-/r*81.0%
associate-/r/81.1%
Applied egg-rr81.1%
Final simplification67.3%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= t -1.8e-104)
(/ t (/ (/ a z) -4.5))
(if (<= t 2.7e+122)
(* 0.5 (/ x (/ a y)))
(if (<= t 1.15e+140)
(* -4.5 (* z (/ t a)))
(if (<= t 5.2e+148) (* (* x (/ y a)) 0.5) (* -4.5 (/ z (/ a t))))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.8e-104) {
tmp = t / ((a / z) / -4.5);
} else if (t <= 2.7e+122) {
tmp = 0.5 * (x / (a / y));
} else if (t <= 1.15e+140) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 5.2e+148) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-1.8d-104)) then
tmp = t / ((a / z) / (-4.5d0))
else if (t <= 2.7d+122) then
tmp = 0.5d0 * (x / (a / y))
else if (t <= 1.15d+140) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 5.2d+148) then
tmp = (x * (y / a)) * 0.5d0
else
tmp = (-4.5d0) * (z / (a / t))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -1.8e-104) {
tmp = t / ((a / z) / -4.5);
} else if (t <= 2.7e+122) {
tmp = 0.5 * (x / (a / y));
} else if (t <= 1.15e+140) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 5.2e+148) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -1.8e-104: tmp = t / ((a / z) / -4.5) elif t <= 2.7e+122: tmp = 0.5 * (x / (a / y)) elif t <= 1.15e+140: tmp = -4.5 * (z * (t / a)) elif t <= 5.2e+148: tmp = (x * (y / a)) * 0.5 else: tmp = -4.5 * (z / (a / t)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -1.8e-104) tmp = Float64(t / Float64(Float64(a / z) / -4.5)); elseif (t <= 2.7e+122) tmp = Float64(0.5 * Float64(x / Float64(a / y))); elseif (t <= 1.15e+140) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 5.2e+148) tmp = Float64(Float64(x * Float64(y / a)) * 0.5); else tmp = Float64(-4.5 * Float64(z / Float64(a / t))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -1.8e-104)
tmp = t / ((a / z) / -4.5);
elseif (t <= 2.7e+122)
tmp = 0.5 * (x / (a / y));
elseif (t <= 1.15e+140)
tmp = -4.5 * (z * (t / a));
elseif (t <= 5.2e+148)
tmp = (x * (y / a)) * 0.5;
else
tmp = -4.5 * (z / (a / t));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.8e-104], N[(t / N[(N[(a / z), $MachinePrecision] / -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.7e+122], N[(0.5 * N[(x / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.15e+140], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 5.2e+148], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.8 \cdot 10^{-104}:\\
\;\;\;\;\frac{t}{\frac{\frac{a}{z}}{-4.5}}\\
\mathbf{elif}\;t \leq 2.7 \cdot 10^{+122}:\\
\;\;\;\;0.5 \cdot \frac{x}{\frac{a}{y}}\\
\mathbf{elif}\;t \leq 1.15 \cdot 10^{+140}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 5.2 \cdot 10^{+148}:\\
\;\;\;\;\left(x \cdot \frac{y}{a}\right) \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\end{array}
\end{array}
if t < -1.7999999999999999e-104Initial program 84.1%
*-commutative84.1%
*-commutative84.1%
associate-*l*84.1%
Simplified84.1%
Taylor expanded in x around 0 50.3%
associate-/l*58.6%
Simplified58.6%
associate-*r/58.7%
*-commutative58.7%
associate-/l*58.6%
Applied egg-rr58.6%
if -1.7999999999999999e-104 < t < 2.6999999999999998e122Initial program 95.6%
*-commutative95.6%
*-commutative95.6%
associate-*l*95.6%
Simplified95.6%
Taylor expanded in x around inf 69.7%
associate-/l*67.7%
Simplified67.7%
if 2.6999999999999998e122 < t < 1.14999999999999995e140Initial program 75.7%
*-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in x around 0 51.7%
associate-/l*52.4%
Simplified52.4%
associate-/r/75.9%
Applied egg-rr75.9%
if 1.14999999999999995e140 < t < 5.2e148Initial program 76.5%
*-commutative76.5%
*-commutative76.5%
associate-*l*76.5%
Simplified76.5%
Taylor expanded in x around inf 63.1%
associate-*r/64.1%
Simplified64.1%
if 5.2e148 < t Initial program 87.1%
*-commutative87.1%
*-commutative87.1%
associate-*l*87.2%
Simplified87.2%
div-sub76.6%
sub-neg76.6%
*-commutative76.6%
times-frac79.1%
div-inv79.1%
associate-*r*79.2%
*-commutative79.2%
associate-*l*79.1%
*-commutative79.1%
associate-/r*79.1%
metadata-eval79.1%
Applied egg-rr79.1%
sub-neg79.1%
associate-*l/79.1%
associate-*r/79.1%
*-commutative79.1%
associate-*l*79.1%
*-commutative79.1%
metadata-eval79.1%
Simplified79.1%
Taylor expanded in t around 0 79.2%
*-commutative79.2%
*-commutative79.2%
associate-*l/79.1%
*-commutative79.1%
associate-*r*79.1%
associate-*r/83.9%
associate-/l*83.9%
Simplified83.9%
Taylor expanded in x around 0 77.2%
associate-*r/77.1%
associate-*r*77.1%
*-commutative77.1%
*-commutative77.1%
associate-/l*80.9%
Simplified80.9%
associate-/r*81.0%
associate-/r/81.1%
Applied egg-rr81.1%
Final simplification67.3%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a)
:precision binary64
(if (<= t -2.4e-88)
(/ t (/ (/ a z) -4.5))
(if (<= t 1.7e+122)
(/ (* x (* y 0.5)) a)
(if (<= t 1.9e+139)
(* -4.5 (* z (/ t a)))
(if (<= t 1e+149) (* (* x (/ y a)) 0.5) (* -4.5 (/ z (/ a t))))))))assert(z < t);
double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.4e-88) {
tmp = t / ((a / z) / -4.5);
} else if (t <= 1.7e+122) {
tmp = (x * (y * 0.5)) / a;
} else if (t <= 1.9e+139) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 1e+149) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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) :: tmp
if (t <= (-2.4d-88)) then
tmp = t / ((a / z) / (-4.5d0))
else if (t <= 1.7d+122) then
tmp = (x * (y * 0.5d0)) / a
else if (t <= 1.9d+139) then
tmp = (-4.5d0) * (z * (t / a))
else if (t <= 1d+149) then
tmp = (x * (y / a)) * 0.5d0
else
tmp = (-4.5d0) * (z / (a / t))
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (t <= -2.4e-88) {
tmp = t / ((a / z) / -4.5);
} else if (t <= 1.7e+122) {
tmp = (x * (y * 0.5)) / a;
} else if (t <= 1.9e+139) {
tmp = -4.5 * (z * (t / a));
} else if (t <= 1e+149) {
tmp = (x * (y / a)) * 0.5;
} else {
tmp = -4.5 * (z / (a / t));
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): tmp = 0 if t <= -2.4e-88: tmp = t / ((a / z) / -4.5) elif t <= 1.7e+122: tmp = (x * (y * 0.5)) / a elif t <= 1.9e+139: tmp = -4.5 * (z * (t / a)) elif t <= 1e+149: tmp = (x * (y / a)) * 0.5 else: tmp = -4.5 * (z / (a / t)) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a) tmp = 0.0 if (t <= -2.4e-88) tmp = Float64(t / Float64(Float64(a / z) / -4.5)); elseif (t <= 1.7e+122) tmp = Float64(Float64(x * Float64(y * 0.5)) / a); elseif (t <= 1.9e+139) tmp = Float64(-4.5 * Float64(z * Float64(t / a))); elseif (t <= 1e+149) tmp = Float64(Float64(x * Float64(y / a)) * 0.5); else tmp = Float64(-4.5 * Float64(z / Float64(a / t))); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a)
tmp = 0.0;
if (t <= -2.4e-88)
tmp = t / ((a / z) / -4.5);
elseif (t <= 1.7e+122)
tmp = (x * (y * 0.5)) / a;
elseif (t <= 1.9e+139)
tmp = -4.5 * (z * (t / a));
elseif (t <= 1e+149)
tmp = (x * (y / a)) * 0.5;
else
tmp = -4.5 * (z / (a / t));
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.4e-88], N[(t / N[(N[(a / z), $MachinePrecision] / -4.5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.7e+122], N[(N[(x * N[(y * 0.5), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[t, 1.9e+139], N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1e+149], N[(N[(x * N[(y / a), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(-4.5 * N[(z / N[(a / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq -2.4 \cdot 10^{-88}:\\
\;\;\;\;\frac{t}{\frac{\frac{a}{z}}{-4.5}}\\
\mathbf{elif}\;t \leq 1.7 \cdot 10^{+122}:\\
\;\;\;\;\frac{x \cdot \left(y \cdot 0.5\right)}{a}\\
\mathbf{elif}\;t \leq 1.9 \cdot 10^{+139}:\\
\;\;\;\;-4.5 \cdot \left(z \cdot \frac{t}{a}\right)\\
\mathbf{elif}\;t \leq 10^{+149}:\\
\;\;\;\;\left(x \cdot \frac{y}{a}\right) \cdot 0.5\\
\mathbf{else}:\\
\;\;\;\;-4.5 \cdot \frac{z}{\frac{a}{t}}\\
\end{array}
\end{array}
if t < -2.4e-88Initial program 83.4%
*-commutative83.4%
*-commutative83.4%
associate-*l*83.4%
Simplified83.4%
Taylor expanded in x around 0 51.0%
associate-/l*59.7%
Simplified59.7%
associate-*r/59.8%
*-commutative59.8%
associate-/l*59.7%
Applied egg-rr59.7%
if -2.4e-88 < t < 1.7e122Initial program 95.7%
*-commutative95.7%
*-commutative95.7%
associate-*l*95.7%
Simplified95.7%
Taylor expanded in x around inf 69.6%
associate-*r/69.6%
*-commutative69.6%
associate-*r*69.6%
Simplified69.6%
if 1.7e122 < t < 1.9e139Initial program 75.7%
*-commutative75.7%
*-commutative75.7%
associate-*l*75.7%
Simplified75.7%
Taylor expanded in x around 0 51.7%
associate-/l*52.4%
Simplified52.4%
associate-/r/75.9%
Applied egg-rr75.9%
if 1.9e139 < t < 1.00000000000000005e149Initial program 76.5%
*-commutative76.5%
*-commutative76.5%
associate-*l*76.5%
Simplified76.5%
Taylor expanded in x around inf 63.1%
associate-*r/64.1%
Simplified64.1%
if 1.00000000000000005e149 < t Initial program 87.1%
*-commutative87.1%
*-commutative87.1%
associate-*l*87.2%
Simplified87.2%
div-sub76.6%
sub-neg76.6%
*-commutative76.6%
times-frac79.1%
div-inv79.1%
associate-*r*79.2%
*-commutative79.2%
associate-*l*79.1%
*-commutative79.1%
associate-/r*79.1%
metadata-eval79.1%
Applied egg-rr79.1%
sub-neg79.1%
associate-*l/79.1%
associate-*r/79.1%
*-commutative79.1%
associate-*l*79.1%
*-commutative79.1%
metadata-eval79.1%
Simplified79.1%
Taylor expanded in t around 0 79.2%
*-commutative79.2%
*-commutative79.2%
associate-*l/79.1%
*-commutative79.1%
associate-*r*79.1%
associate-*r/83.9%
associate-/l*83.9%
Simplified83.9%
Taylor expanded in x around 0 77.2%
associate-*r/77.1%
associate-*r*77.1%
*-commutative77.1%
*-commutative77.1%
associate-/l*80.9%
Simplified80.9%
associate-/r*81.0%
associate-/r/81.1%
Applied egg-rr81.1%
Final simplification68.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (* z (/ t a))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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
code = (-4.5d0) * (z * (t / a))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (z * (t / a));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (z * (t / a))
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(z * Float64(t / a))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (z * (t / a));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(z * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \left(z \cdot \frac{t}{a}\right)
\end{array}
Initial program 90.4%
*-commutative90.4%
*-commutative90.4%
associate-*l*90.4%
Simplified90.4%
Taylor expanded in x around 0 46.0%
associate-/l*50.0%
Simplified50.0%
associate-/r/48.9%
Applied egg-rr48.9%
Final simplification48.9%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a) :precision binary64 (* -4.5 (/ t (/ a z))))
assert(z < t);
double code(double x, double y, double z, double t, double a) {
return -4.5 * (t / (a / z));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a)
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
code = (-4.5d0) * (t / (a / z))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a) {
return -4.5 * (t / (a / z));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a): return -4.5 * (t / (a / z))
z, t = sort([z, t]) function code(x, y, z, t, a) return Float64(-4.5 * Float64(t / Float64(a / z))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a)
tmp = -4.5 * (t / (a / z));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_] := N[(-4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-4.5 \cdot \frac{t}{\frac{a}{z}}
\end{array}
Initial program 90.4%
*-commutative90.4%
*-commutative90.4%
associate-*l*90.4%
Simplified90.4%
Taylor expanded in x around 0 46.0%
associate-/l*50.0%
Simplified50.0%
Final simplification50.0%
(FPCore (x y z t a)
:precision binary64
(if (< a -2.090464557976709e+86)
(- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z))))
(if (< a 2.144030707833976e+99)
(/ (- (* x y) (* z (* 9.0 t))) (* a 2.0))
(- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5))))))
double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
real(8) function code(x, y, z, t, a)
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) :: tmp
if (a < (-2.090464557976709d+86)) then
tmp = (0.5d0 * ((y * x) / a)) - (4.5d0 * (t / (a / z)))
else if (a < 2.144030707833976d+99) then
tmp = ((x * y) - (z * (9.0d0 * t))) / (a * 2.0d0)
else
tmp = ((y / a) * (x * 0.5d0)) - ((t / a) * (z * 4.5d0))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a) {
double tmp;
if (a < -2.090464557976709e+86) {
tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z)));
} else if (a < 2.144030707833976e+99) {
tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0);
} else {
tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5));
}
return tmp;
}
def code(x, y, z, t, a): tmp = 0 if a < -2.090464557976709e+86: tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))) elif a < 2.144030707833976e+99: tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0) else: tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)) return tmp
function code(x, y, z, t, a) tmp = 0.0 if (a < -2.090464557976709e+86) tmp = Float64(Float64(0.5 * Float64(Float64(y * x) / a)) - Float64(4.5 * Float64(t / Float64(a / z)))); elseif (a < 2.144030707833976e+99) tmp = Float64(Float64(Float64(x * y) - Float64(z * Float64(9.0 * t))) / Float64(a * 2.0)); else tmp = Float64(Float64(Float64(y / a) * Float64(x * 0.5)) - Float64(Float64(t / a) * Float64(z * 4.5))); end return tmp end
function tmp_2 = code(x, y, z, t, a) tmp = 0.0; if (a < -2.090464557976709e+86) tmp = (0.5 * ((y * x) / a)) - (4.5 * (t / (a / z))); elseif (a < 2.144030707833976e+99) tmp = ((x * y) - (z * (9.0 * t))) / (a * 2.0); else tmp = ((y / a) * (x * 0.5)) - ((t / a) * (z * 4.5)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_] := If[Less[a, -2.090464557976709e+86], N[(N[(0.5 * N[(N[(y * x), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision] - N[(4.5 * N[(t / N[(a / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[a, 2.144030707833976e+99], N[(N[(N[(x * y), $MachinePrecision] - N[(z * N[(9.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y / a), $MachinePrecision] * N[(x * 0.5), $MachinePrecision]), $MachinePrecision] - N[(N[(t / a), $MachinePrecision] * N[(z * 4.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a < -2.090464557976709 \cdot 10^{+86}:\\
\;\;\;\;0.5 \cdot \frac{y \cdot x}{a} - 4.5 \cdot \frac{t}{\frac{a}{z}}\\
\mathbf{elif}\;a < 2.144030707833976 \cdot 10^{+99}:\\
\;\;\;\;\frac{x \cdot y - z \cdot \left(9 \cdot t\right)}{a \cdot 2}\\
\mathbf{else}:\\
\;\;\;\;\frac{y}{a} \cdot \left(x \cdot 0.5\right) - \frac{t}{a} \cdot \left(z \cdot 4.5\right)\\
\end{array}
\end{array}
herbie shell --seed 2023305
(FPCore (x y z t a)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, I"
:precision binary64
:herbie-target
(if (< a -2.090464557976709e+86) (- (* 0.5 (/ (* y x) a)) (* 4.5 (/ t (/ a z)))) (if (< a 2.144030707833976e+99) (/ (- (* x y) (* z (* 9.0 t))) (* a 2.0)) (- (* (/ y a) (* x 0.5)) (* (/ t a) (* z 4.5)))))
(/ (- (* x y) (* (* z 9.0) t)) (* a 2.0)))