
(FPCore (x y z t a b c i) :precision binary64 (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = 2.0d0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}
def code(x, y, z, t, a, b, c, i): return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))
function code(x, y, z, t, a, b, c, i) return Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(Float64(a + Float64(b * c)) * c) * i))) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i)); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 16 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b c i) :precision binary64 (* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = 2.0d0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i));
}
def code(x, y, z, t, a, b, c, i): return 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i))
function code(x, y, z, t, a, b, c, i) return Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(Float64(a + Float64(b * c)) * c) * i))) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = 2.0 * (((x * y) + (z * t)) - (((a + (b * c)) * c) * i)); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(\left(a + b \cdot c\right) \cdot c\right) \cdot i\right)
\end{array}
(FPCore (x y z t a b c i) :precision binary64 (if (<= (* x y) 5e+234) (* 2.0 (fma z t (- (* x y) (* (+ a (* c b)) (* c i))))) (* 2.0 (* y (- x (* a (/ (* c i) y)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if ((x * y) <= 5e+234) {
tmp = 2.0 * fma(z, t, ((x * y) - ((a + (c * b)) * (c * i))));
} else {
tmp = 2.0 * (y * (x - (a * ((c * i) / y))));
}
return tmp;
}
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (Float64(x * y) <= 5e+234) tmp = Float64(2.0 * fma(z, t, Float64(Float64(x * y) - Float64(Float64(a + Float64(c * b)) * Float64(c * i))))); else tmp = Float64(2.0 * Float64(y * Float64(x - Float64(a * Float64(Float64(c * i) / y))))); end return tmp end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[N[(x * y), $MachinePrecision], 5e+234], N[(2.0 * N[(z * t + N[(N[(x * y), $MachinePrecision] - N[(N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision] * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(y * N[(x - N[(a * N[(N[(c * i), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;x \cdot y \leq 5 \cdot 10^{+234}:\\
\;\;\;\;2 \cdot \mathsf{fma}\left(z, t, x \cdot y - \left(a + c \cdot b\right) \cdot \left(c \cdot i\right)\right)\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(y \cdot \left(x - a \cdot \frac{c \cdot i}{y}\right)\right)\\
\end{array}
\end{array}
if (*.f64 x y) < 5.0000000000000003e234Initial program 94.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.3%
Simplified94.3%
associate--r-N/A
fmm-defN/A
*-commutativeN/A
+-commutativeN/A
fma-defineN/A
fma-lowering-fma.f64N/A
*-commutativeN/A
fmm-defN/A
--lowering--.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6498.3%
Applied egg-rr98.3%
if 5.0000000000000003e234 < (*.f64 x y) Initial program 71.4%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6466.7%
Simplified66.7%
Taylor expanded in a around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6476.2%
Simplified76.2%
Taylor expanded in y around inf
*-lowering-*.f64N/A
mul-1-negN/A
unsub-negN/A
--lowering--.f64N/A
associate-/l*N/A
*-lowering-*.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f6495.2%
Simplified95.2%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ a (* c b))) (t_2 (* i (* c t_1))))
(if (<= t_2 (- INFINITY))
(* 2.0 (- (* z t) (* c (* t_1 i))))
(if (<= t_2 5e+287)
(* 2.0 (- (+ (* x y) (* z t)) t_2))
(* c (* i (* t_1 -2.0)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double t_2 = i * (c * t_1);
double tmp;
if (t_2 <= -((double) INFINITY)) {
tmp = 2.0 * ((z * t) - (c * (t_1 * i)));
} else if (t_2 <= 5e+287) {
tmp = 2.0 * (((x * y) + (z * t)) - t_2);
} else {
tmp = c * (i * (t_1 * -2.0));
}
return tmp;
}
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double t_2 = i * (c * t_1);
double tmp;
if (t_2 <= -Double.POSITIVE_INFINITY) {
tmp = 2.0 * ((z * t) - (c * (t_1 * i)));
} else if (t_2 <= 5e+287) {
tmp = 2.0 * (((x * y) + (z * t)) - t_2);
} else {
tmp = c * (i * (t_1 * -2.0));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = a + (c * b) t_2 = i * (c * t_1) tmp = 0 if t_2 <= -math.inf: tmp = 2.0 * ((z * t) - (c * (t_1 * i))) elif t_2 <= 5e+287: tmp = 2.0 * (((x * y) + (z * t)) - t_2) else: tmp = c * (i * (t_1 * -2.0)) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(a + Float64(c * b)) t_2 = Float64(i * Float64(c * t_1)) tmp = 0.0 if (t_2 <= Float64(-Inf)) tmp = Float64(2.0 * Float64(Float64(z * t) - Float64(c * Float64(t_1 * i)))); elseif (t_2 <= 5e+287) tmp = Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - t_2)); else tmp = Float64(c * Float64(i * Float64(t_1 * -2.0))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = a + (c * b); t_2 = i * (c * t_1); tmp = 0.0; if (t_2 <= -Inf) tmp = 2.0 * ((z * t) - (c * (t_1 * i))); elseif (t_2 <= 5e+287) tmp = 2.0 * (((x * y) + (z * t)) - t_2); else tmp = c * (i * (t_1 * -2.0)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(c * t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], N[(2.0 * N[(N[(z * t), $MachinePrecision] - N[(c * N[(t$95$1 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 5e+287], N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision]), $MachinePrecision], N[(c * N[(i * N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a + c \cdot b\\
t_2 := i \cdot \left(c \cdot t\_1\right)\\
\mathbf{if}\;t\_2 \leq -\infty:\\
\;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(t\_1 \cdot i\right)\right)\\
\mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+287}:\\
\;\;\;\;2 \cdot \left(\left(x \cdot y + z \cdot t\right) - t\_2\right)\\
\mathbf{else}:\\
\;\;\;\;c \cdot \left(i \cdot \left(t\_1 \cdot -2\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -inf.0Initial program 84.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.4%
Simplified97.4%
Taylor expanded in x around 0
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6497.4%
Simplified97.4%
if -inf.0 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 5e287Initial program 99.9%
if 5e287 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) Initial program 73.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.1%
Simplified83.1%
Taylor expanded in i around inf
*-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
associate-*r*N/A
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
associate-*r*N/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6491.7%
Simplified91.7%
Final simplification98.0%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ a (* c b)))
(t_2 (* 2.0 (- (* z t) (* t_1 (* c i)))))
(t_3 (* i (* c t_1))))
(if (<= t_3 -1e+41)
t_2
(if (<= t_3 2e+127) (* 2.0 (+ (* x y) (* z t))) t_2))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double t_2 = 2.0 * ((z * t) - (t_1 * (c * i)));
double t_3 = i * (c * t_1);
double tmp;
if (t_3 <= -1e+41) {
tmp = t_2;
} else if (t_3 <= 2e+127) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_2;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = a + (c * b)
t_2 = 2.0d0 * ((z * t) - (t_1 * (c * i)))
t_3 = i * (c * t_1)
if (t_3 <= (-1d+41)) then
tmp = t_2
else if (t_3 <= 2d+127) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = t_2
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double t_2 = 2.0 * ((z * t) - (t_1 * (c * i)));
double t_3 = i * (c * t_1);
double tmp;
if (t_3 <= -1e+41) {
tmp = t_2;
} else if (t_3 <= 2e+127) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_2;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = a + (c * b) t_2 = 2.0 * ((z * t) - (t_1 * (c * i))) t_3 = i * (c * t_1) tmp = 0 if t_3 <= -1e+41: tmp = t_2 elif t_3 <= 2e+127: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = t_2 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(a + Float64(c * b)) t_2 = Float64(2.0 * Float64(Float64(z * t) - Float64(t_1 * Float64(c * i)))) t_3 = Float64(i * Float64(c * t_1)) tmp = 0.0 if (t_3 <= -1e+41) tmp = t_2; elseif (t_3 <= 2e+127) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = t_2; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = a + (c * b); t_2 = 2.0 * ((z * t) - (t_1 * (c * i))); t_3 = i * (c * t_1); tmp = 0.0; if (t_3 <= -1e+41) tmp = t_2; elseif (t_3 <= 2e+127) tmp = 2.0 * ((x * y) + (z * t)); else tmp = t_2; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(2.0 * N[(N[(z * t), $MachinePrecision] - N[(t$95$1 * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(i * N[(c * t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+41], t$95$2, If[LessEqual[t$95$3, 2e+127], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a + c \cdot b\\
t_2 := 2 \cdot \left(z \cdot t - t\_1 \cdot \left(c \cdot i\right)\right)\\
t_3 := i \cdot \left(c \cdot t\_1\right)\\
\mathbf{if}\;t\_3 \leq -1 \cdot 10^{+41}:\\
\;\;\;\;t\_2\\
\mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+127}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t\_2\\
\end{array}
\end{array}
if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -1.00000000000000001e41 or 1.99999999999999991e127 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) Initial program 84.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6484.6%
Simplified84.6%
*-commutativeN/A
associate--r-N/A
fmm-defN/A
*-commutativeN/A
+-commutativeN/A
*-commutativeN/A
fmm-defN/A
associate--l+N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied egg-rr92.5%
Taylor expanded in x around 0
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6484.0%
Simplified84.0%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.0%
Applied egg-rr91.0%
if -1.00000000000000001e41 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 1.99999999999999991e127Initial program 99.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6498.5%
Simplified98.5%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.4%
Simplified90.4%
Final simplification90.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ a (* c b))) (t_2 (* i (* c t_1))))
(if (<= t_2 -1e+41)
(* 2.0 (- (* z t) (* c (* t_1 i))))
(if (<= t_2 1e+189)
(* 2.0 (+ (* x y) (* z t)))
(* (* t_1 (* c i)) -2.0)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double t_2 = i * (c * t_1);
double tmp;
if (t_2 <= -1e+41) {
tmp = 2.0 * ((z * t) - (c * (t_1 * i)));
} else if (t_2 <= 1e+189) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = (t_1 * (c * i)) * -2.0;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = a + (c * b)
t_2 = i * (c * t_1)
if (t_2 <= (-1d+41)) then
tmp = 2.0d0 * ((z * t) - (c * (t_1 * i)))
else if (t_2 <= 1d+189) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = (t_1 * (c * i)) * (-2.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double t_2 = i * (c * t_1);
double tmp;
if (t_2 <= -1e+41) {
tmp = 2.0 * ((z * t) - (c * (t_1 * i)));
} else if (t_2 <= 1e+189) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = (t_1 * (c * i)) * -2.0;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = a + (c * b) t_2 = i * (c * t_1) tmp = 0 if t_2 <= -1e+41: tmp = 2.0 * ((z * t) - (c * (t_1 * i))) elif t_2 <= 1e+189: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = (t_1 * (c * i)) * -2.0 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(a + Float64(c * b)) t_2 = Float64(i * Float64(c * t_1)) tmp = 0.0 if (t_2 <= -1e+41) tmp = Float64(2.0 * Float64(Float64(z * t) - Float64(c * Float64(t_1 * i)))); elseif (t_2 <= 1e+189) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = Float64(Float64(t_1 * Float64(c * i)) * -2.0); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = a + (c * b); t_2 = i * (c * t_1); tmp = 0.0; if (t_2 <= -1e+41) tmp = 2.0 * ((z * t) - (c * (t_1 * i))); elseif (t_2 <= 1e+189) tmp = 2.0 * ((x * y) + (z * t)); else tmp = (t_1 * (c * i)) * -2.0; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(i * N[(c * t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, -1e+41], N[(2.0 * N[(N[(z * t), $MachinePrecision] - N[(c * N[(t$95$1 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 1e+189], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[(c * i), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a + c \cdot b\\
t_2 := i \cdot \left(c \cdot t\_1\right)\\
\mathbf{if}\;t\_2 \leq -1 \cdot 10^{+41}:\\
\;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(t\_1 \cdot i\right)\right)\\
\mathbf{elif}\;t\_2 \leq 10^{+189}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot \left(c \cdot i\right)\right) \cdot -2\\
\end{array}
\end{array}
if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < -1.00000000000000001e41Initial program 89.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.8%
Simplified94.8%
Taylor expanded in x around 0
*-lowering-*.f64N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6489.8%
Simplified89.8%
if -1.00000000000000001e41 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 1e189Initial program 99.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.2%
Simplified97.2%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6490.1%
Simplified90.1%
if 1e189 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) Initial program 78.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.6%
Simplified76.6%
Applied egg-rr86.1%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6488.3%
Simplified88.3%
Final simplification89.6%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ a (* c b))))
(if (<= (* i (* c t_1)) 5e+287)
(* 2.0 (+ (* x y) (- (* z t) (* t_1 (* c i)))))
(* c (* i (* t_1 -2.0))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double tmp;
if ((i * (c * t_1)) <= 5e+287) {
tmp = 2.0 * ((x * y) + ((z * t) - (t_1 * (c * i))));
} else {
tmp = c * (i * (t_1 * -2.0));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = a + (c * b)
if ((i * (c * t_1)) <= 5d+287) then
tmp = 2.0d0 * ((x * y) + ((z * t) - (t_1 * (c * i))))
else
tmp = c * (i * (t_1 * (-2.0d0)))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double tmp;
if ((i * (c * t_1)) <= 5e+287) {
tmp = 2.0 * ((x * y) + ((z * t) - (t_1 * (c * i))));
} else {
tmp = c * (i * (t_1 * -2.0));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = a + (c * b) tmp = 0 if (i * (c * t_1)) <= 5e+287: tmp = 2.0 * ((x * y) + ((z * t) - (t_1 * (c * i)))) else: tmp = c * (i * (t_1 * -2.0)) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(a + Float64(c * b)) tmp = 0.0 if (Float64(i * Float64(c * t_1)) <= 5e+287) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(Float64(z * t) - Float64(t_1 * Float64(c * i))))); else tmp = Float64(c * Float64(i * Float64(t_1 * -2.0))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = a + (c * b); tmp = 0.0; if ((i * (c * t_1)) <= 5e+287) tmp = 2.0 * ((x * y) + ((z * t) - (t_1 * (c * i)))); else tmp = c * (i * (t_1 * -2.0)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(i * N[(c * t$95$1), $MachinePrecision]), $MachinePrecision], 5e+287], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] - N[(t$95$1 * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(c * N[(i * N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a + c \cdot b\\
\mathbf{if}\;i \cdot \left(c \cdot t\_1\right) \leq 5 \cdot 10^{+287}:\\
\;\;\;\;2 \cdot \left(x \cdot y + \left(z \cdot t - t\_1 \cdot \left(c \cdot i\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;c \cdot \left(i \cdot \left(t\_1 \cdot -2\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 5e287Initial program 97.1%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.0%
Simplified94.0%
*-commutativeN/A
associate--r-N/A
fmm-defN/A
*-commutativeN/A
+-commutativeN/A
*-commutativeN/A
fmm-defN/A
associate--l+N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied egg-rr98.5%
if 5e287 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) Initial program 73.2%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6483.1%
Simplified83.1%
Taylor expanded in i around inf
*-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
associate-*r*N/A
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
associate-*r*N/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6491.7%
Simplified91.7%
Final simplification97.3%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ a (* c b))))
(if (<= (* i (* c t_1)) 2e+127)
(* 2.0 (+ (* x y) (- (* z t) (* c (* t_1 i)))))
(* 2.0 (- (* z t) (* t_1 (* c i)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double tmp;
if ((i * (c * t_1)) <= 2e+127) {
tmp = 2.0 * ((x * y) + ((z * t) - (c * (t_1 * i))));
} else {
tmp = 2.0 * ((z * t) - (t_1 * (c * i)));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = a + (c * b)
if ((i * (c * t_1)) <= 2d+127) then
tmp = 2.0d0 * ((x * y) + ((z * t) - (c * (t_1 * i))))
else
tmp = 2.0d0 * ((z * t) - (t_1 * (c * i)))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double tmp;
if ((i * (c * t_1)) <= 2e+127) {
tmp = 2.0 * ((x * y) + ((z * t) - (c * (t_1 * i))));
} else {
tmp = 2.0 * ((z * t) - (t_1 * (c * i)));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = a + (c * b) tmp = 0 if (i * (c * t_1)) <= 2e+127: tmp = 2.0 * ((x * y) + ((z * t) - (c * (t_1 * i)))) else: tmp = 2.0 * ((z * t) - (t_1 * (c * i))) return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(a + Float64(c * b)) tmp = 0.0 if (Float64(i * Float64(c * t_1)) <= 2e+127) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(Float64(z * t) - Float64(c * Float64(t_1 * i))))); else tmp = Float64(2.0 * Float64(Float64(z * t) - Float64(t_1 * Float64(c * i)))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = a + (c * b); tmp = 0.0; if ((i * (c * t_1)) <= 2e+127) tmp = 2.0 * ((x * y) + ((z * t) - (c * (t_1 * i)))); else tmp = 2.0 * ((z * t) - (t_1 * (c * i))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(i * N[(c * t$95$1), $MachinePrecision]), $MachinePrecision], 2e+127], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] - N[(c * N[(t$95$1 * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[(z * t), $MachinePrecision] - N[(t$95$1 * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a + c \cdot b\\
\mathbf{if}\;i \cdot \left(c \cdot t\_1\right) \leq 2 \cdot 10^{+127}:\\
\;\;\;\;2 \cdot \left(x \cdot y + \left(z \cdot t - c \cdot \left(t\_1 \cdot i\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(z \cdot t - t\_1 \cdot \left(c \cdot i\right)\right)\\
\end{array}
\end{array}
if (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) < 1.99999999999999991e127Initial program 96.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6497.4%
Simplified97.4%
if 1.99999999999999991e127 < (*.f64 (*.f64 (+.f64 a (*.f64 b c)) c) i) Initial program 80.0%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.4%
Simplified75.4%
*-commutativeN/A
associate--r-N/A
fmm-defN/A
*-commutativeN/A
+-commutativeN/A
*-commutativeN/A
fmm-defN/A
associate--l+N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied egg-rr87.3%
Taylor expanded in x around 0
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6478.7%
Simplified78.7%
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6489.0%
Applied egg-rr89.0%
Final simplification95.4%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* c (* i (* (+ a (* c b)) -2.0)))))
(if (<= c -6.5e+100)
t_1
(if (<= c 5e+70)
(* 2.0 (+ (* x y) (* z t)))
(if (<= c 6.2e+212) (* 2.0 (- (* z t) (* c (* (* c b) i)))) t_1)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = c * (i * ((a + (c * b)) * -2.0));
double tmp;
if (c <= -6.5e+100) {
tmp = t_1;
} else if (c <= 5e+70) {
tmp = 2.0 * ((x * y) + (z * t));
} else if (c <= 6.2e+212) {
tmp = 2.0 * ((z * t) - (c * ((c * b) * i)));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = c * (i * ((a + (c * b)) * (-2.0d0)))
if (c <= (-6.5d+100)) then
tmp = t_1
else if (c <= 5d+70) then
tmp = 2.0d0 * ((x * y) + (z * t))
else if (c <= 6.2d+212) then
tmp = 2.0d0 * ((z * t) - (c * ((c * b) * i)))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = c * (i * ((a + (c * b)) * -2.0));
double tmp;
if (c <= -6.5e+100) {
tmp = t_1;
} else if (c <= 5e+70) {
tmp = 2.0 * ((x * y) + (z * t));
} else if (c <= 6.2e+212) {
tmp = 2.0 * ((z * t) - (c * ((c * b) * i)));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = c * (i * ((a + (c * b)) * -2.0)) tmp = 0 if c <= -6.5e+100: tmp = t_1 elif c <= 5e+70: tmp = 2.0 * ((x * y) + (z * t)) elif c <= 6.2e+212: tmp = 2.0 * ((z * t) - (c * ((c * b) * i))) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(c * Float64(i * Float64(Float64(a + Float64(c * b)) * -2.0))) tmp = 0.0 if (c <= -6.5e+100) tmp = t_1; elseif (c <= 5e+70) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); elseif (c <= 6.2e+212) tmp = Float64(2.0 * Float64(Float64(z * t) - Float64(c * Float64(Float64(c * b) * i)))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = c * (i * ((a + (c * b)) * -2.0)); tmp = 0.0; if (c <= -6.5e+100) tmp = t_1; elseif (c <= 5e+70) tmp = 2.0 * ((x * y) + (z * t)); elseif (c <= 6.2e+212) tmp = 2.0 * ((z * t) - (c * ((c * b) * i))); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(c * N[(i * N[(N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -6.5e+100], t$95$1, If[LessEqual[c, 5e+70], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 6.2e+212], N[(2.0 * N[(N[(z * t), $MachinePrecision] - N[(c * N[(N[(c * b), $MachinePrecision] * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := c \cdot \left(i \cdot \left(\left(a + c \cdot b\right) \cdot -2\right)\right)\\
\mathbf{if}\;c \leq -6.5 \cdot 10^{+100}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;c \leq 5 \cdot 10^{+70}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{elif}\;c \leq 6.2 \cdot 10^{+212}:\\
\;\;\;\;2 \cdot \left(z \cdot t - c \cdot \left(\left(c \cdot b\right) \cdot i\right)\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if c < -6.50000000000000001e100 or 6.19999999999999996e212 < c Initial program 83.1%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6489.0%
Simplified89.0%
Taylor expanded in i around inf
*-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
associate-*r*N/A
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
associate-*r*N/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6484.5%
Simplified84.5%
if -6.50000000000000001e100 < c < 5.0000000000000002e70Initial program 97.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.8%
Simplified91.8%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.3%
Simplified76.3%
if 5.0000000000000002e70 < c < 6.19999999999999996e212Initial program 85.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6499.9%
Simplified99.9%
*-commutativeN/A
associate--r-N/A
fmm-defN/A
*-commutativeN/A
+-commutativeN/A
*-commutativeN/A
fmm-defN/A
associate--l+N/A
+-commutativeN/A
associate-*r*N/A
*-commutativeN/A
Applied egg-rr99.9%
Taylor expanded in x around 0
--lowering--.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6493.3%
Simplified93.3%
Taylor expanded in a around 0
*-commutativeN/A
*-lowering-*.f6482.3%
Simplified82.3%
Final simplification79.0%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (+ a (* c b))))
(if (<= c -1.1e+101)
(* c (* i (* t_1 -2.0)))
(if (<= c 3.7e+68)
(* 2.0 (+ (* x y) (* z t)))
(* (* t_1 (* c i)) -2.0)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double tmp;
if (c <= -1.1e+101) {
tmp = c * (i * (t_1 * -2.0));
} else if (c <= 3.7e+68) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = (t_1 * (c * i)) * -2.0;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = a + (c * b)
if (c <= (-1.1d+101)) then
tmp = c * (i * (t_1 * (-2.0d0)))
else if (c <= 3.7d+68) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = (t_1 * (c * i)) * (-2.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = a + (c * b);
double tmp;
if (c <= -1.1e+101) {
tmp = c * (i * (t_1 * -2.0));
} else if (c <= 3.7e+68) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = (t_1 * (c * i)) * -2.0;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = a + (c * b) tmp = 0 if c <= -1.1e+101: tmp = c * (i * (t_1 * -2.0)) elif c <= 3.7e+68: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = (t_1 * (c * i)) * -2.0 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(a + Float64(c * b)) tmp = 0.0 if (c <= -1.1e+101) tmp = Float64(c * Float64(i * Float64(t_1 * -2.0))); elseif (c <= 3.7e+68) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = Float64(Float64(t_1 * Float64(c * i)) * -2.0); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = a + (c * b); tmp = 0.0; if (c <= -1.1e+101) tmp = c * (i * (t_1 * -2.0)); elseif (c <= 3.7e+68) tmp = 2.0 * ((x * y) + (z * t)); else tmp = (t_1 * (c * i)) * -2.0; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -1.1e+101], N[(c * N[(i * N[(t$95$1 * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 3.7e+68], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 * N[(c * i), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := a + c \cdot b\\
\mathbf{if}\;c \leq -1.1 \cdot 10^{+101}:\\
\;\;\;\;c \cdot \left(i \cdot \left(t\_1 \cdot -2\right)\right)\\
\mathbf{elif}\;c \leq 3.7 \cdot 10^{+68}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 \cdot \left(c \cdot i\right)\right) \cdot -2\\
\end{array}
\end{array}
if c < -1.1e101Initial program 84.7%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.1%
Simplified92.1%
Taylor expanded in i around inf
*-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
associate-*r*N/A
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
associate-*r*N/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6482.4%
Simplified82.4%
if -1.1e101 < c < 3.69999999999999998e68Initial program 97.5%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.8%
Simplified91.8%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.8%
Simplified76.8%
if 3.69999999999999998e68 < c Initial program 83.5%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.8%
Simplified92.8%
Applied egg-rr92.7%
Taylor expanded in i around inf
*-commutativeN/A
*-lowering-*.f64N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6472.4%
Simplified72.4%
Final simplification77.2%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* c (* i (* (+ a (* c b)) -2.0)))))
(if (<= c -6.2e+100)
t_1
(if (<= c 6.6e+66) (* 2.0 (+ (* x y) (* z t))) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = c * (i * ((a + (c * b)) * -2.0));
double tmp;
if (c <= -6.2e+100) {
tmp = t_1;
} else if (c <= 6.6e+66) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = c * (i * ((a + (c * b)) * (-2.0d0)))
if (c <= (-6.2d+100)) then
tmp = t_1
else if (c <= 6.6d+66) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = c * (i * ((a + (c * b)) * -2.0));
double tmp;
if (c <= -6.2e+100) {
tmp = t_1;
} else if (c <= 6.6e+66) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = c * (i * ((a + (c * b)) * -2.0)) tmp = 0 if c <= -6.2e+100: tmp = t_1 elif c <= 6.6e+66: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(c * Float64(i * Float64(Float64(a + Float64(c * b)) * -2.0))) tmp = 0.0 if (c <= -6.2e+100) tmp = t_1; elseif (c <= 6.6e+66) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = c * (i * ((a + (c * b)) * -2.0)); tmp = 0.0; if (c <= -6.2e+100) tmp = t_1; elseif (c <= 6.6e+66) tmp = 2.0 * ((x * y) + (z * t)); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(c * N[(i * N[(N[(a + N[(c * b), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -6.2e+100], t$95$1, If[LessEqual[c, 6.6e+66], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := c \cdot \left(i \cdot \left(\left(a + c \cdot b\right) \cdot -2\right)\right)\\
\mathbf{if}\;c \leq -6.2 \cdot 10^{+100}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;c \leq 6.6 \cdot 10^{+66}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if c < -6.20000000000000014e100 or 6.6000000000000003e66 < c Initial program 84.1%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.4%
Simplified92.4%
Taylor expanded in i around inf
*-commutativeN/A
associate-*r*N/A
distribute-rgt-inN/A
associate-*r*N/A
distribute-lft-outN/A
*-commutativeN/A
*-lowering-*.f64N/A
distribute-lft-outN/A
associate-*r*N/A
distribute-rgt-inN/A
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-commutativeN/A
*-lowering-*.f6477.8%
Simplified77.8%
if -6.20000000000000014e100 < c < 6.6000000000000003e66Initial program 97.5%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.8%
Simplified91.8%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6476.8%
Simplified76.8%
Final simplification77.2%
(FPCore (x y z t a b c i)
:precision binary64
(if (<= c -1.2e+110)
(* b (* (* c i) (* c -2.0)))
(if (<= c 3.5e+71)
(* 2.0 (+ (* x y) (* z t)))
(* -2.0 (* i (* c (* c b)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (c <= -1.2e+110) {
tmp = b * ((c * i) * (c * -2.0));
} else if (c <= 3.5e+71) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = -2.0 * (i * (c * (c * b)));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: tmp
if (c <= (-1.2d+110)) then
tmp = b * ((c * i) * (c * (-2.0d0)))
else if (c <= 3.5d+71) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = (-2.0d0) * (i * (c * (c * b)))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (c <= -1.2e+110) {
tmp = b * ((c * i) * (c * -2.0));
} else if (c <= 3.5e+71) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = -2.0 * (i * (c * (c * b)));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if c <= -1.2e+110: tmp = b * ((c * i) * (c * -2.0)) elif c <= 3.5e+71: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = -2.0 * (i * (c * (c * b))) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (c <= -1.2e+110) tmp = Float64(b * Float64(Float64(c * i) * Float64(c * -2.0))); elseif (c <= 3.5e+71) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = Float64(-2.0 * Float64(i * Float64(c * Float64(c * b)))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (c <= -1.2e+110) tmp = b * ((c * i) * (c * -2.0)); elseif (c <= 3.5e+71) tmp = 2.0 * ((x * y) + (z * t)); else tmp = -2.0 * (i * (c * (c * b))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[c, -1.2e+110], N[(b * N[(N[(c * i), $MachinePrecision] * N[(c * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 3.5e+71], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(i * N[(c * N[(c * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq -1.2 \cdot 10^{+110}:\\
\;\;\;\;b \cdot \left(\left(c \cdot i\right) \cdot \left(c \cdot -2\right)\right)\\
\mathbf{elif}\;c \leq 3.5 \cdot 10^{+71}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(i \cdot \left(c \cdot \left(c \cdot b\right)\right)\right)\\
\end{array}
\end{array}
if c < -1.20000000000000006e110Initial program 83.3%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.4%
Simplified91.4%
Taylor expanded in c around inf
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.2%
Simplified70.2%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6474.5%
Applied egg-rr74.5%
if -1.20000000000000006e110 < c < 3.4999999999999999e71Initial program 97.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.0%
Simplified92.0%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.7%
Simplified75.7%
if 3.4999999999999999e71 < c Initial program 83.1%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.6%
Simplified92.6%
Taylor expanded in c around inf
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6454.6%
Simplified54.6%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6457.2%
Applied egg-rr57.2%
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6459.5%
Applied egg-rr59.5%
Final simplification72.9%
(FPCore (x y z t a b c i)
:precision binary64
(if (<= c -1.9e+110)
(* b (* (* c i) (* c -2.0)))
(if (<= c 1.6e+71)
(* 2.0 (+ (* x y) (* z t)))
(* -2.0 (* c (* b (* c i)))))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (c <= -1.9e+110) {
tmp = b * ((c * i) * (c * -2.0));
} else if (c <= 1.6e+71) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = -2.0 * (c * (b * (c * i)));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: tmp
if (c <= (-1.9d+110)) then
tmp = b * ((c * i) * (c * (-2.0d0)))
else if (c <= 1.6d+71) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = (-2.0d0) * (c * (b * (c * i)))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (c <= -1.9e+110) {
tmp = b * ((c * i) * (c * -2.0));
} else if (c <= 1.6e+71) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = -2.0 * (c * (b * (c * i)));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if c <= -1.9e+110: tmp = b * ((c * i) * (c * -2.0)) elif c <= 1.6e+71: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = -2.0 * (c * (b * (c * i))) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (c <= -1.9e+110) tmp = Float64(b * Float64(Float64(c * i) * Float64(c * -2.0))); elseif (c <= 1.6e+71) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = Float64(-2.0 * Float64(c * Float64(b * Float64(c * i)))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (c <= -1.9e+110) tmp = b * ((c * i) * (c * -2.0)); elseif (c <= 1.6e+71) tmp = 2.0 * ((x * y) + (z * t)); else tmp = -2.0 * (c * (b * (c * i))); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[c, -1.9e+110], N[(b * N[(N[(c * i), $MachinePrecision] * N[(c * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 1.6e+71], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-2.0 * N[(c * N[(b * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq -1.9 \cdot 10^{+110}:\\
\;\;\;\;b \cdot \left(\left(c \cdot i\right) \cdot \left(c \cdot -2\right)\right)\\
\mathbf{elif}\;c \leq 1.6 \cdot 10^{+71}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;-2 \cdot \left(c \cdot \left(b \cdot \left(c \cdot i\right)\right)\right)\\
\end{array}
\end{array}
if c < -1.89999999999999994e110Initial program 83.3%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.4%
Simplified91.4%
Taylor expanded in c around inf
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6470.2%
Simplified70.2%
associate-*r*N/A
associate-*r*N/A
associate-*r*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6474.5%
Applied egg-rr74.5%
if -1.89999999999999994e110 < c < 1.60000000000000012e71Initial program 97.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.0%
Simplified92.0%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.7%
Simplified75.7%
if 1.60000000000000012e71 < c Initial program 83.1%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.6%
Simplified92.6%
Taylor expanded in c around inf
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6454.6%
Simplified54.6%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6457.2%
Applied egg-rr57.2%
Final simplification72.5%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* -2.0 (* c (* b (* c i))))))
(if (<= c -2e+114)
t_1
(if (<= c 9.2e+70) (* 2.0 (+ (* x y) (* z t))) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = -2.0 * (c * (b * (c * i)));
double tmp;
if (c <= -2e+114) {
tmp = t_1;
} else if (c <= 9.2e+70) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = (-2.0d0) * (c * (b * (c * i)))
if (c <= (-2d+114)) then
tmp = t_1
else if (c <= 9.2d+70) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = -2.0 * (c * (b * (c * i)));
double tmp;
if (c <= -2e+114) {
tmp = t_1;
} else if (c <= 9.2e+70) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = -2.0 * (c * (b * (c * i))) tmp = 0 if c <= -2e+114: tmp = t_1 elif c <= 9.2e+70: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(-2.0 * Float64(c * Float64(b * Float64(c * i)))) tmp = 0.0 if (c <= -2e+114) tmp = t_1; elseif (c <= 9.2e+70) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = -2.0 * (c * (b * (c * i))); tmp = 0.0; if (c <= -2e+114) tmp = t_1; elseif (c <= 9.2e+70) tmp = 2.0 * ((x * y) + (z * t)); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(-2.0 * N[(c * N[(b * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -2e+114], t$95$1, If[LessEqual[c, 9.2e+70], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := -2 \cdot \left(c \cdot \left(b \cdot \left(c \cdot i\right)\right)\right)\\
\mathbf{if}\;c \leq -2 \cdot 10^{+114}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;c \leq 9.2 \cdot 10^{+70}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if c < -2e114 or 9.19999999999999975e70 < c Initial program 82.8%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.8%
Simplified91.8%
Taylor expanded in c around inf
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6464.3%
Simplified64.3%
*-commutativeN/A
associate-*r*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f6466.7%
Applied egg-rr66.7%
if -2e114 < c < 9.19999999999999975e70Initial program 97.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.1%
Simplified92.1%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.4%
Simplified75.4%
Final simplification72.5%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* c (* -2.0 (* c (* b i))))))
(if (<= c -3.5e+114)
t_1
(if (<= c 2.05e+71) (* 2.0 (+ (* x y) (* z t))) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = c * (-2.0 * (c * (b * i)));
double tmp;
if (c <= -3.5e+114) {
tmp = t_1;
} else if (c <= 2.05e+71) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = c * ((-2.0d0) * (c * (b * i)))
if (c <= (-3.5d+114)) then
tmp = t_1
else if (c <= 2.05d+71) then
tmp = 2.0d0 * ((x * y) + (z * t))
else
tmp = t_1
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = c * (-2.0 * (c * (b * i)));
double tmp;
if (c <= -3.5e+114) {
tmp = t_1;
} else if (c <= 2.05e+71) {
tmp = 2.0 * ((x * y) + (z * t));
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = c * (-2.0 * (c * (b * i))) tmp = 0 if c <= -3.5e+114: tmp = t_1 elif c <= 2.05e+71: tmp = 2.0 * ((x * y) + (z * t)) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(c * Float64(-2.0 * Float64(c * Float64(b * i)))) tmp = 0.0 if (c <= -3.5e+114) tmp = t_1; elseif (c <= 2.05e+71) tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = c * (-2.0 * (c * (b * i))); tmp = 0.0; if (c <= -3.5e+114) tmp = t_1; elseif (c <= 2.05e+71) tmp = 2.0 * ((x * y) + (z * t)); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(c * N[(-2.0 * N[(c * N[(b * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[c, -3.5e+114], t$95$1, If[LessEqual[c, 2.05e+71], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := c \cdot \left(-2 \cdot \left(c \cdot \left(b \cdot i\right)\right)\right)\\
\mathbf{if}\;c \leq -3.5 \cdot 10^{+114}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;c \leq 2.05 \cdot 10^{+71}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if c < -3.5000000000000001e114 or 2.0500000000000001e71 < c Initial program 82.8%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.8%
Simplified91.8%
Taylor expanded in c around inf
associate-*r*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
*-commutativeN/A
associate-*l*N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f6464.3%
Simplified64.3%
if -3.5000000000000001e114 < c < 2.0500000000000001e71Initial program 97.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.1%
Simplified92.1%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6475.4%
Simplified75.4%
Final simplification71.7%
(FPCore (x y z t a b c i)
:precision binary64
(let* ((t_1 (* (* x y) 2.0)))
(if (<= (* x y) -1.75e+75)
t_1
(if (<= (* x y) 6.2e+36) (* 2.0 (* z t)) t_1))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = (x * y) * 2.0;
double tmp;
if ((x * y) <= -1.75e+75) {
tmp = t_1;
} else if ((x * y) <= 6.2e+36) {
tmp = 2.0 * (z * t);
} else {
tmp = t_1;
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: t_1
real(8) :: tmp
t_1 = (x * y) * 2.0d0
if ((x * y) <= (-1.75d+75)) then
tmp = t_1
else if ((x * y) <= 6.2d+36) then
tmp = 2.0d0 * (z * t)
else
tmp = t_1
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double t_1 = (x * y) * 2.0;
double tmp;
if ((x * y) <= -1.75e+75) {
tmp = t_1;
} else if ((x * y) <= 6.2e+36) {
tmp = 2.0 * (z * t);
} else {
tmp = t_1;
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): t_1 = (x * y) * 2.0 tmp = 0 if (x * y) <= -1.75e+75: tmp = t_1 elif (x * y) <= 6.2e+36: tmp = 2.0 * (z * t) else: tmp = t_1 return tmp
function code(x, y, z, t, a, b, c, i) t_1 = Float64(Float64(x * y) * 2.0) tmp = 0.0 if (Float64(x * y) <= -1.75e+75) tmp = t_1; elseif (Float64(x * y) <= 6.2e+36) tmp = Float64(2.0 * Float64(z * t)); else tmp = t_1; end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) t_1 = (x * y) * 2.0; tmp = 0.0; if ((x * y) <= -1.75e+75) tmp = t_1; elseif ((x * y) <= 6.2e+36) tmp = 2.0 * (z * t); else tmp = t_1; end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] * 2.0), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -1.75e+75], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 6.2e+36], N[(2.0 * N[(z * t), $MachinePrecision]), $MachinePrecision], t$95$1]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \left(x \cdot y\right) \cdot 2\\
\mathbf{if}\;x \cdot y \leq -1.75 \cdot 10^{+75}:\\
\;\;\;\;t\_1\\
\mathbf{elif}\;x \cdot y \leq 6.2 \cdot 10^{+36}:\\
\;\;\;\;2 \cdot \left(z \cdot t\right)\\
\mathbf{else}:\\
\;\;\;\;t\_1\\
\end{array}
\end{array}
if (*.f64 x y) < -1.7499999999999999e75 or 6.1999999999999999e36 < (*.f64 x y) Initial program 90.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6488.6%
Simplified88.6%
Taylor expanded in x around inf
*-lowering-*.f64N/A
*-lowering-*.f6460.2%
Simplified60.2%
if -1.7499999999999999e75 < (*.f64 x y) < 6.1999999999999999e36Initial program 93.9%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6494.0%
Simplified94.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
*-lowering-*.f6447.7%
Simplified47.7%
Final simplification52.3%
(FPCore (x y z t a b c i) :precision binary64 (if (<= c -1.95e+152) (* a (* c (* i -2.0))) (* 2.0 (+ (* x y) (* z t)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (c <= -1.95e+152) {
tmp = a * (c * (i * -2.0));
} else {
tmp = 2.0 * ((x * y) + (z * t));
}
return tmp;
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
real(8) :: tmp
if (c <= (-1.95d+152)) then
tmp = a * (c * (i * (-2.0d0)))
else
tmp = 2.0d0 * ((x * y) + (z * t))
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
double tmp;
if (c <= -1.95e+152) {
tmp = a * (c * (i * -2.0));
} else {
tmp = 2.0 * ((x * y) + (z * t));
}
return tmp;
}
def code(x, y, z, t, a, b, c, i): tmp = 0 if c <= -1.95e+152: tmp = a * (c * (i * -2.0)) else: tmp = 2.0 * ((x * y) + (z * t)) return tmp
function code(x, y, z, t, a, b, c, i) tmp = 0.0 if (c <= -1.95e+152) tmp = Float64(a * Float64(c * Float64(i * -2.0))); else tmp = Float64(2.0 * Float64(Float64(x * y) + Float64(z * t))); end return tmp end
function tmp_2 = code(x, y, z, t, a, b, c, i) tmp = 0.0; if (c <= -1.95e+152) tmp = a * (c * (i * -2.0)); else tmp = 2.0 * ((x * y) + (z * t)); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_, c_, i_] := If[LessEqual[c, -1.95e+152], N[(a * N[(c * N[(i * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;c \leq -1.95 \cdot 10^{+152}:\\
\;\;\;\;a \cdot \left(c \cdot \left(i \cdot -2\right)\right)\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \left(x \cdot y + z \cdot t\right)\\
\end{array}
\end{array}
if c < -1.95000000000000006e152Initial program 81.8%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6491.8%
Simplified91.8%
Taylor expanded in a around inf
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f6454.8%
Simplified54.8%
if -1.95000000000000006e152 < c Initial program 94.6%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.0%
Simplified92.0%
Taylor expanded in c around 0
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6466.9%
Simplified66.9%
Final simplification65.2%
(FPCore (x y z t a b c i) :precision binary64 (* 2.0 (* z t)))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (z * t);
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = 2.0d0 * (z * t)
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (z * t);
}
def code(x, y, z, t, a, b, c, i): return 2.0 * (z * t)
function code(x, y, z, t, a, b, c, i) return Float64(2.0 * Float64(z * t)) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = 2.0 * (z * t); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(z * t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \left(z \cdot t\right)
\end{array}
Initial program 92.7%
*-lowering-*.f64N/A
sub-negN/A
+-commutativeN/A
associate-+r+N/A
+-commutativeN/A
sub-negN/A
associate-+l-N/A
--lowering--.f64N/A
*-lowering-*.f64N/A
--lowering--.f64N/A
associate-*l*N/A
*-commutativeN/A
associate-*l*N/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f6492.0%
Simplified92.0%
Taylor expanded in z around inf
*-lowering-*.f64N/A
*-lowering-*.f6437.1%
Simplified37.1%
Final simplification37.1%
(FPCore (x y z t a b c i) :precision binary64 (* 2.0 (- (+ (* x y) (* z t)) (* (+ a (* b c)) (* c i)))))
double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (((x * y) + (z * t)) - ((a + (b * c)) * (c * i)));
}
real(8) function code(x, y, z, t, a, b, c, i)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8), intent (in) :: c
real(8), intent (in) :: i
code = 2.0d0 * (((x * y) + (z * t)) - ((a + (b * c)) * (c * i)))
end function
public static double code(double x, double y, double z, double t, double a, double b, double c, double i) {
return 2.0 * (((x * y) + (z * t)) - ((a + (b * c)) * (c * i)));
}
def code(x, y, z, t, a, b, c, i): return 2.0 * (((x * y) + (z * t)) - ((a + (b * c)) * (c * i)))
function code(x, y, z, t, a, b, c, i) return Float64(2.0 * Float64(Float64(Float64(x * y) + Float64(z * t)) - Float64(Float64(a + Float64(b * c)) * Float64(c * i)))) end
function tmp = code(x, y, z, t, a, b, c, i) tmp = 2.0 * (((x * y) + (z * t)) - ((a + (b * c)) * (c * i))); end
code[x_, y_, z_, t_, a_, b_, c_, i_] := N[(2.0 * N[(N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision] - N[(N[(a + N[(b * c), $MachinePrecision]), $MachinePrecision] * N[(c * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
2 \cdot \left(\left(x \cdot y + z \cdot t\right) - \left(a + b \cdot c\right) \cdot \left(c \cdot i\right)\right)
\end{array}
herbie shell --seed 2024150
(FPCore (x y z t a b c i)
:name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, A"
:precision binary64
:alt
(! :herbie-platform default (* 2 (- (+ (* x y) (* z t)) (* (+ a (* b c)) (* c i)))))
(* 2.0 (- (+ (* x y) (* z t)) (* (* (+ a (* b c)) c) i))))