
(FPCore (x y z t) :precision binary64 (+ (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z))) (- (sqrt (+ t 1.0)) (sqrt t))))
double code(double x, double y, double z, double t) {
return (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function
public static double code(double x, double y, double z, double t) {
return (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}
def code(x, y, z, t): return (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))) end
function tmp = code(x, y, z, t) tmp = (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 18 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t) :precision binary64 (+ (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z))) (- (sqrt (+ t 1.0)) (sqrt t))))
double code(double x, double y, double z, double t) {
return (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function
public static double code(double x, double y, double z, double t) {
return (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}
def code(x, y, z, t): return (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))) end
function tmp = code(x, y, z, t) tmp = (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)
\end{array}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 y)))
(t_2 (sqrt (+ x 1.0)))
(t_3 (- t_2 (sqrt x)))
(t_4 (sqrt (+ 1.0 z)))
(t_5 (- t_4 (sqrt z)))
(t_6 (+ t_5 (+ t_3 (- t_1 (sqrt y)))))
(t_7 (+ y (+ 1.0 y))))
(if (<= t_6 1e-6)
(+ (* 0.5 (sqrt (/ 1.0 x))) (+ t_5 (* 0.5 (sqrt (/ 1.0 y)))))
(if (<= t_6 2.99999999999)
(+ t_3 (+ t_5 (/ t_7 (* (+ (sqrt y) t_1) t_7))))
(+
1.0
(-
(+ (+ t_4 t_2) (/ 1.0 (+ (sqrt t) (sqrt (+ 1.0 t)))))
(+ (sqrt x) (+ (sqrt y) (sqrt z)))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + y));
double t_2 = sqrt((x + 1.0));
double t_3 = t_2 - sqrt(x);
double t_4 = sqrt((1.0 + z));
double t_5 = t_4 - sqrt(z);
double t_6 = t_5 + (t_3 + (t_1 - sqrt(y)));
double t_7 = y + (1.0 + y);
double tmp;
if (t_6 <= 1e-6) {
tmp = (0.5 * sqrt((1.0 / x))) + (t_5 + (0.5 * sqrt((1.0 / y))));
} else if (t_6 <= 2.99999999999) {
tmp = t_3 + (t_5 + (t_7 / ((sqrt(y) + t_1) * t_7)));
} else {
tmp = 1.0 + (((t_4 + t_2) + (1.0 / (sqrt(t) + sqrt((1.0 + t))))) - (sqrt(x) + (sqrt(y) + sqrt(z))));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: t_5
real(8) :: t_6
real(8) :: t_7
real(8) :: tmp
t_1 = sqrt((1.0d0 + y))
t_2 = sqrt((x + 1.0d0))
t_3 = t_2 - sqrt(x)
t_4 = sqrt((1.0d0 + z))
t_5 = t_4 - sqrt(z)
t_6 = t_5 + (t_3 + (t_1 - sqrt(y)))
t_7 = y + (1.0d0 + y)
if (t_6 <= 1d-6) then
tmp = (0.5d0 * sqrt((1.0d0 / x))) + (t_5 + (0.5d0 * sqrt((1.0d0 / y))))
else if (t_6 <= 2.99999999999d0) then
tmp = t_3 + (t_5 + (t_7 / ((sqrt(y) + t_1) * t_7)))
else
tmp = 1.0d0 + (((t_4 + t_2) + (1.0d0 / (sqrt(t) + sqrt((1.0d0 + t))))) - (sqrt(x) + (sqrt(y) + sqrt(z))))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + y));
double t_2 = Math.sqrt((x + 1.0));
double t_3 = t_2 - Math.sqrt(x);
double t_4 = Math.sqrt((1.0 + z));
double t_5 = t_4 - Math.sqrt(z);
double t_6 = t_5 + (t_3 + (t_1 - Math.sqrt(y)));
double t_7 = y + (1.0 + y);
double tmp;
if (t_6 <= 1e-6) {
tmp = (0.5 * Math.sqrt((1.0 / x))) + (t_5 + (0.5 * Math.sqrt((1.0 / y))));
} else if (t_6 <= 2.99999999999) {
tmp = t_3 + (t_5 + (t_7 / ((Math.sqrt(y) + t_1) * t_7)));
} else {
tmp = 1.0 + (((t_4 + t_2) + (1.0 / (Math.sqrt(t) + Math.sqrt((1.0 + t))))) - (Math.sqrt(x) + (Math.sqrt(y) + Math.sqrt(z))));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + y)) t_2 = math.sqrt((x + 1.0)) t_3 = t_2 - math.sqrt(x) t_4 = math.sqrt((1.0 + z)) t_5 = t_4 - math.sqrt(z) t_6 = t_5 + (t_3 + (t_1 - math.sqrt(y))) t_7 = y + (1.0 + y) tmp = 0 if t_6 <= 1e-6: tmp = (0.5 * math.sqrt((1.0 / x))) + (t_5 + (0.5 * math.sqrt((1.0 / y)))) elif t_6 <= 2.99999999999: tmp = t_3 + (t_5 + (t_7 / ((math.sqrt(y) + t_1) * t_7))) else: tmp = 1.0 + (((t_4 + t_2) + (1.0 / (math.sqrt(t) + math.sqrt((1.0 + t))))) - (math.sqrt(x) + (math.sqrt(y) + math.sqrt(z)))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + y)) t_2 = sqrt(Float64(x + 1.0)) t_3 = Float64(t_2 - sqrt(x)) t_4 = sqrt(Float64(1.0 + z)) t_5 = Float64(t_4 - sqrt(z)) t_6 = Float64(t_5 + Float64(t_3 + Float64(t_1 - sqrt(y)))) t_7 = Float64(y + Float64(1.0 + y)) tmp = 0.0 if (t_6 <= 1e-6) tmp = Float64(Float64(0.5 * sqrt(Float64(1.0 / x))) + Float64(t_5 + Float64(0.5 * sqrt(Float64(1.0 / y))))); elseif (t_6 <= 2.99999999999) tmp = Float64(t_3 + Float64(t_5 + Float64(t_7 / Float64(Float64(sqrt(y) + t_1) * t_7)))); else tmp = Float64(1.0 + Float64(Float64(Float64(t_4 + t_2) + Float64(1.0 / Float64(sqrt(t) + sqrt(Float64(1.0 + t))))) - Float64(sqrt(x) + Float64(sqrt(y) + sqrt(z))))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + y));
t_2 = sqrt((x + 1.0));
t_3 = t_2 - sqrt(x);
t_4 = sqrt((1.0 + z));
t_5 = t_4 - sqrt(z);
t_6 = t_5 + (t_3 + (t_1 - sqrt(y)));
t_7 = y + (1.0 + y);
tmp = 0.0;
if (t_6 <= 1e-6)
tmp = (0.5 * sqrt((1.0 / x))) + (t_5 + (0.5 * sqrt((1.0 / y))));
elseif (t_6 <= 2.99999999999)
tmp = t_3 + (t_5 + (t_7 / ((sqrt(y) + t_1) * t_7)));
else
tmp = 1.0 + (((t_4 + t_2) + (1.0 / (sqrt(t) + sqrt((1.0 + t))))) - (sqrt(x) + (sqrt(y) + sqrt(z))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(t$95$5 + N[(t$95$3 + N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$7 = N[(y + N[(1.0 + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$6, 1e-6], N[(N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(t$95$5 + N[(0.5 * N[Sqrt[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$6, 2.99999999999], N[(t$95$3 + N[(t$95$5 + N[(t$95$7 / N[(N[(N[Sqrt[y], $MachinePrecision] + t$95$1), $MachinePrecision] * t$95$7), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(N[(N[(t$95$4 + t$95$2), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[t], $MachinePrecision] + N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + y}\\
t_2 := \sqrt{x + 1}\\
t_3 := t\_2 - \sqrt{x}\\
t_4 := \sqrt{1 + z}\\
t_5 := t\_4 - \sqrt{z}\\
t_6 := t\_5 + \left(t\_3 + \left(t\_1 - \sqrt{y}\right)\right)\\
t_7 := y + \left(1 + y\right)\\
\mathbf{if}\;t\_6 \leq 10^{-6}:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}} + \left(t\_5 + 0.5 \cdot \sqrt{\frac{1}{y}}\right)\\
\mathbf{elif}\;t\_6 \leq 2.99999999999:\\
\;\;\;\;t\_3 + \left(t\_5 + \frac{t\_7}{\left(\sqrt{y} + t\_1\right) \cdot t\_7}\right)\\
\mathbf{else}:\\
\;\;\;\;1 + \left(\left(\left(t\_4 + t\_2\right) + \frac{1}{\sqrt{t} + \sqrt{1 + t}}\right) - \left(\sqrt{x} + \left(\sqrt{y} + \sqrt{z}\right)\right)\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 9.99999999999999955e-7Initial program 60.0%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified5.2%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f644.8%
Simplified4.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.7%
Simplified17.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6423.2%
Simplified23.2%
if 9.99999999999999955e-7 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 2.99999999999Initial program 96.5%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified69.3%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6458.0%
Simplified58.0%
+-commutativeN/A
flip--N/A
+-commutativeN/A
+-commutativeN/A
rem-square-sqrtN/A
rem-square-sqrtN/A
flip--N/A
+-commutativeN/A
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr58.4%
if 2.99999999999 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) Initial program 98.2%
flip--N/A
/-lowering-/.f64N/A
+-commutativeN/A
+-commutativeN/A
rem-square-sqrtN/A
rem-square-sqrtN/A
--lowering--.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
+-lowering-+.f6498.3%
Applied egg-rr98.3%
Taylor expanded in y around 0
associate--l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
Simplified99.9%
Final simplification59.5%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 y)))
(t_2 (- (sqrt (+ 1.0 z)) (sqrt z)))
(t_3 (- (sqrt (+ x 1.0)) (sqrt x))))
(if (<= (+ t_2 (+ t_3 (- t_1 (sqrt y)))) 1e-6)
(+ (* 0.5 (sqrt (/ 1.0 x))) (+ t_2 (* 0.5 (sqrt (/ 1.0 y)))))
(+
(- (sqrt (+ 1.0 t)) (sqrt t))
(+ t_2 (+ t_3 (/ (- (+ 1.0 y) y) (+ (sqrt y) t_1))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + y));
double t_2 = sqrt((1.0 + z)) - sqrt(z);
double t_3 = sqrt((x + 1.0)) - sqrt(x);
double tmp;
if ((t_2 + (t_3 + (t_1 - sqrt(y)))) <= 1e-6) {
tmp = (0.5 * sqrt((1.0 / x))) + (t_2 + (0.5 * sqrt((1.0 / y))));
} else {
tmp = (sqrt((1.0 + t)) - sqrt(t)) + (t_2 + (t_3 + (((1.0 + y) - y) / (sqrt(y) + t_1))));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = sqrt((1.0d0 + y))
t_2 = sqrt((1.0d0 + z)) - sqrt(z)
t_3 = sqrt((x + 1.0d0)) - sqrt(x)
if ((t_2 + (t_3 + (t_1 - sqrt(y)))) <= 1d-6) then
tmp = (0.5d0 * sqrt((1.0d0 / x))) + (t_2 + (0.5d0 * sqrt((1.0d0 / y))))
else
tmp = (sqrt((1.0d0 + t)) - sqrt(t)) + (t_2 + (t_3 + (((1.0d0 + y) - y) / (sqrt(y) + t_1))))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + y));
double t_2 = Math.sqrt((1.0 + z)) - Math.sqrt(z);
double t_3 = Math.sqrt((x + 1.0)) - Math.sqrt(x);
double tmp;
if ((t_2 + (t_3 + (t_1 - Math.sqrt(y)))) <= 1e-6) {
tmp = (0.5 * Math.sqrt((1.0 / x))) + (t_2 + (0.5 * Math.sqrt((1.0 / y))));
} else {
tmp = (Math.sqrt((1.0 + t)) - Math.sqrt(t)) + (t_2 + (t_3 + (((1.0 + y) - y) / (Math.sqrt(y) + t_1))));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + y)) t_2 = math.sqrt((1.0 + z)) - math.sqrt(z) t_3 = math.sqrt((x + 1.0)) - math.sqrt(x) tmp = 0 if (t_2 + (t_3 + (t_1 - math.sqrt(y)))) <= 1e-6: tmp = (0.5 * math.sqrt((1.0 / x))) + (t_2 + (0.5 * math.sqrt((1.0 / y)))) else: tmp = (math.sqrt((1.0 + t)) - math.sqrt(t)) + (t_2 + (t_3 + (((1.0 + y) - y) / (math.sqrt(y) + t_1)))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + y)) t_2 = Float64(sqrt(Float64(1.0 + z)) - sqrt(z)) t_3 = Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) tmp = 0.0 if (Float64(t_2 + Float64(t_3 + Float64(t_1 - sqrt(y)))) <= 1e-6) tmp = Float64(Float64(0.5 * sqrt(Float64(1.0 / x))) + Float64(t_2 + Float64(0.5 * sqrt(Float64(1.0 / y))))); else tmp = Float64(Float64(sqrt(Float64(1.0 + t)) - sqrt(t)) + Float64(t_2 + Float64(t_3 + Float64(Float64(Float64(1.0 + y) - y) / Float64(sqrt(y) + t_1))))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + y));
t_2 = sqrt((1.0 + z)) - sqrt(z);
t_3 = sqrt((x + 1.0)) - sqrt(x);
tmp = 0.0;
if ((t_2 + (t_3 + (t_1 - sqrt(y)))) <= 1e-6)
tmp = (0.5 * sqrt((1.0 / x))) + (t_2 + (0.5 * sqrt((1.0 / y))));
else
tmp = (sqrt((1.0 + t)) - sqrt(t)) + (t_2 + (t_3 + (((1.0 + y) - y) / (sqrt(y) + t_1))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$2 + N[(t$95$3 + N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-6], N[(N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(0.5 * N[Sqrt[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(t$95$3 + N[(N[(N[(1.0 + y), $MachinePrecision] - y), $MachinePrecision] / N[(N[Sqrt[y], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + y}\\
t_2 := \sqrt{1 + z} - \sqrt{z}\\
t_3 := \sqrt{x + 1} - \sqrt{x}\\
\mathbf{if}\;t\_2 + \left(t\_3 + \left(t\_1 - \sqrt{y}\right)\right) \leq 10^{-6}:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}} + \left(t\_2 + 0.5 \cdot \sqrt{\frac{1}{y}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{1 + t} - \sqrt{t}\right) + \left(t\_2 + \left(t\_3 + \frac{\left(1 + y\right) - y}{\sqrt{y} + t\_1}\right)\right)\\
\end{array}
\end{array}
if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 9.99999999999999955e-7Initial program 60.0%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified5.2%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f644.8%
Simplified4.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6417.7%
Simplified17.7%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6423.2%
Simplified23.2%
if 9.99999999999999955e-7 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) Initial program 96.7%
flip--N/A
/-lowering-/.f64N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6496.9%
Applied egg-rr96.9%
Final simplification88.6%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (- (sqrt (+ 1.0 z)) (sqrt z)))
(t_2 (+ (sqrt y) (sqrt (+ 1.0 y))))
(t_3 (- (sqrt (+ 1.0 t)) (sqrt t)))
(t_4 (- (sqrt (+ x 1.0)) (sqrt x))))
(if (<= t_4 1e-6)
(+
(+
(+
(+ (/ 1.0 t_2) (* 0.5 (sqrt (/ 1.0 x))))
(* -0.125 (sqrt (/ (/ 1.0 x) (* x x)))))
t_1)
t_3)
(+ t_3 (+ t_1 (+ t_4 (/ (- (+ 1.0 y) y) t_2)))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + z)) - sqrt(z);
double t_2 = sqrt(y) + sqrt((1.0 + y));
double t_3 = sqrt((1.0 + t)) - sqrt(t);
double t_4 = sqrt((x + 1.0)) - sqrt(x);
double tmp;
if (t_4 <= 1e-6) {
tmp = ((((1.0 / t_2) + (0.5 * sqrt((1.0 / x)))) + (-0.125 * sqrt(((1.0 / x) / (x * x))))) + t_1) + t_3;
} else {
tmp = t_3 + (t_1 + (t_4 + (((1.0 + y) - y) / t_2)));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_1 = sqrt((1.0d0 + z)) - sqrt(z)
t_2 = sqrt(y) + sqrt((1.0d0 + y))
t_3 = sqrt((1.0d0 + t)) - sqrt(t)
t_4 = sqrt((x + 1.0d0)) - sqrt(x)
if (t_4 <= 1d-6) then
tmp = ((((1.0d0 / t_2) + (0.5d0 * sqrt((1.0d0 / x)))) + ((-0.125d0) * sqrt(((1.0d0 / x) / (x * x))))) + t_1) + t_3
else
tmp = t_3 + (t_1 + (t_4 + (((1.0d0 + y) - y) / t_2)))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + z)) - Math.sqrt(z);
double t_2 = Math.sqrt(y) + Math.sqrt((1.0 + y));
double t_3 = Math.sqrt((1.0 + t)) - Math.sqrt(t);
double t_4 = Math.sqrt((x + 1.0)) - Math.sqrt(x);
double tmp;
if (t_4 <= 1e-6) {
tmp = ((((1.0 / t_2) + (0.5 * Math.sqrt((1.0 / x)))) + (-0.125 * Math.sqrt(((1.0 / x) / (x * x))))) + t_1) + t_3;
} else {
tmp = t_3 + (t_1 + (t_4 + (((1.0 + y) - y) / t_2)));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + z)) - math.sqrt(z) t_2 = math.sqrt(y) + math.sqrt((1.0 + y)) t_3 = math.sqrt((1.0 + t)) - math.sqrt(t) t_4 = math.sqrt((x + 1.0)) - math.sqrt(x) tmp = 0 if t_4 <= 1e-6: tmp = ((((1.0 / t_2) + (0.5 * math.sqrt((1.0 / x)))) + (-0.125 * math.sqrt(((1.0 / x) / (x * x))))) + t_1) + t_3 else: tmp = t_3 + (t_1 + (t_4 + (((1.0 + y) - y) / t_2))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(1.0 + z)) - sqrt(z)) t_2 = Float64(sqrt(y) + sqrt(Float64(1.0 + y))) t_3 = Float64(sqrt(Float64(1.0 + t)) - sqrt(t)) t_4 = Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) tmp = 0.0 if (t_4 <= 1e-6) tmp = Float64(Float64(Float64(Float64(Float64(1.0 / t_2) + Float64(0.5 * sqrt(Float64(1.0 / x)))) + Float64(-0.125 * sqrt(Float64(Float64(1.0 / x) / Float64(x * x))))) + t_1) + t_3); else tmp = Float64(t_3 + Float64(t_1 + Float64(t_4 + Float64(Float64(Float64(1.0 + y) - y) / t_2)))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + z)) - sqrt(z);
t_2 = sqrt(y) + sqrt((1.0 + y));
t_3 = sqrt((1.0 + t)) - sqrt(t);
t_4 = sqrt((x + 1.0)) - sqrt(x);
tmp = 0.0;
if (t_4 <= 1e-6)
tmp = ((((1.0 / t_2) + (0.5 * sqrt((1.0 / x)))) + (-0.125 * sqrt(((1.0 / x) / (x * x))))) + t_1) + t_3;
else
tmp = t_3 + (t_1 + (t_4 + (((1.0 + y) - y) / t_2)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 1e-6], N[(N[(N[(N[(N[(1.0 / t$95$2), $MachinePrecision] + N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-0.125 * N[Sqrt[N[(N[(1.0 / x), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision], N[(t$95$3 + N[(t$95$1 + N[(t$95$4 + N[(N[(N[(1.0 + y), $MachinePrecision] - y), $MachinePrecision] / t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + z} - \sqrt{z}\\
t_2 := \sqrt{y} + \sqrt{1 + y}\\
t_3 := \sqrt{1 + t} - \sqrt{t}\\
t_4 := \sqrt{x + 1} - \sqrt{x}\\
\mathbf{if}\;t\_4 \leq 10^{-6}:\\
\;\;\;\;\left(\left(\left(\frac{1}{t\_2} + 0.5 \cdot \sqrt{\frac{1}{x}}\right) + -0.125 \cdot \sqrt{\frac{\frac{1}{x}}{x \cdot x}}\right) + t\_1\right) + t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_3 + \left(t\_1 + \left(t\_4 + \frac{\left(1 + y\right) - y}{t\_2}\right)\right)\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 9.99999999999999955e-7Initial program 87.7%
flip--N/A
/-lowering-/.f64N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6488.0%
Applied egg-rr88.0%
Taylor expanded in x around inf
+-commutativeN/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
cube-multN/A
associate-/r*N/A
Simplified93.4%
if 9.99999999999999955e-7 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) Initial program 97.6%
flip--N/A
/-lowering-/.f64N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6497.6%
Applied egg-rr97.6%
Final simplification95.5%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (- (sqrt (+ 1.0 z)) (sqrt z))))
(if (<= (- (sqrt (+ x 1.0)) (sqrt x)) 0.04)
(+ (* 0.5 (sqrt (/ 1.0 x))) (+ t_1 (* 0.5 (sqrt (/ 1.0 y)))))
(+
(- (sqrt (+ 1.0 t)) (sqrt t))
(+ t_1 (+ (- 1.0 (sqrt x)) (- (sqrt (+ 1.0 y)) (sqrt y))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + z)) - sqrt(z);
double tmp;
if ((sqrt((x + 1.0)) - sqrt(x)) <= 0.04) {
tmp = (0.5 * sqrt((1.0 / x))) + (t_1 + (0.5 * sqrt((1.0 / y))));
} else {
tmp = (sqrt((1.0 + t)) - sqrt(t)) + (t_1 + ((1.0 - sqrt(x)) + (sqrt((1.0 + y)) - sqrt(y))));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((1.0d0 + z)) - sqrt(z)
if ((sqrt((x + 1.0d0)) - sqrt(x)) <= 0.04d0) then
tmp = (0.5d0 * sqrt((1.0d0 / x))) + (t_1 + (0.5d0 * sqrt((1.0d0 / y))))
else
tmp = (sqrt((1.0d0 + t)) - sqrt(t)) + (t_1 + ((1.0d0 - sqrt(x)) + (sqrt((1.0d0 + y)) - sqrt(y))))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + z)) - Math.sqrt(z);
double tmp;
if ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) <= 0.04) {
tmp = (0.5 * Math.sqrt((1.0 / x))) + (t_1 + (0.5 * Math.sqrt((1.0 / y))));
} else {
tmp = (Math.sqrt((1.0 + t)) - Math.sqrt(t)) + (t_1 + ((1.0 - Math.sqrt(x)) + (Math.sqrt((1.0 + y)) - Math.sqrt(y))));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + z)) - math.sqrt(z) tmp = 0 if (math.sqrt((x + 1.0)) - math.sqrt(x)) <= 0.04: tmp = (0.5 * math.sqrt((1.0 / x))) + (t_1 + (0.5 * math.sqrt((1.0 / y)))) else: tmp = (math.sqrt((1.0 + t)) - math.sqrt(t)) + (t_1 + ((1.0 - math.sqrt(x)) + (math.sqrt((1.0 + y)) - math.sqrt(y)))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(1.0 + z)) - sqrt(z)) tmp = 0.0 if (Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) <= 0.04) tmp = Float64(Float64(0.5 * sqrt(Float64(1.0 / x))) + Float64(t_1 + Float64(0.5 * sqrt(Float64(1.0 / y))))); else tmp = Float64(Float64(sqrt(Float64(1.0 + t)) - sqrt(t)) + Float64(t_1 + Float64(Float64(1.0 - sqrt(x)) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y))))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + z)) - sqrt(z);
tmp = 0.0;
if ((sqrt((x + 1.0)) - sqrt(x)) <= 0.04)
tmp = (0.5 * sqrt((1.0 / x))) + (t_1 + (0.5 * sqrt((1.0 / y))));
else
tmp = (sqrt((1.0 + t)) - sqrt(t)) + (t_1 + ((1.0 - sqrt(x)) + (sqrt((1.0 + y)) - sqrt(y))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.04], N[(N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 + N[(0.5 * N[Sqrt[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 + N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + z} - \sqrt{z}\\
\mathbf{if}\;\sqrt{x + 1} - \sqrt{x} \leq 0.04:\\
\;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}} + \left(t\_1 + 0.5 \cdot \sqrt{\frac{1}{y}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{1 + t} - \sqrt{t}\right) + \left(t\_1 + \left(\left(1 - \sqrt{x}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right)\right)\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.0400000000000000008Initial program 87.9%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified56.0%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6442.7%
Simplified42.7%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6421.0%
Simplified21.0%
Taylor expanded in x around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6422.5%
Simplified22.5%
if 0.0400000000000000008 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) Initial program 97.7%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6495.9%
Simplified95.9%
Final simplification57.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 z))) (t_2 (sqrt (+ 1.0 t))) (t_3 (+ y (+ 1.0 y))))
(if (<= (- t_2 (sqrt t)) 2e-8)
(+
(- (sqrt (+ x 1.0)) (sqrt x))
(+ (- t_1 (sqrt z)) (/ t_3 (* (+ (sqrt y) (sqrt (+ 1.0 y))) t_3))))
(- (+ t_1 (+ t_2 2.0)) (sqrt t)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + z));
double t_2 = sqrt((1.0 + t));
double t_3 = y + (1.0 + y);
double tmp;
if ((t_2 - sqrt(t)) <= 2e-8) {
tmp = (sqrt((x + 1.0)) - sqrt(x)) + ((t_1 - sqrt(z)) + (t_3 / ((sqrt(y) + sqrt((1.0 + y))) * t_3)));
} else {
tmp = (t_1 + (t_2 + 2.0)) - sqrt(t);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = sqrt((1.0d0 + z))
t_2 = sqrt((1.0d0 + t))
t_3 = y + (1.0d0 + y)
if ((t_2 - sqrt(t)) <= 2d-8) then
tmp = (sqrt((x + 1.0d0)) - sqrt(x)) + ((t_1 - sqrt(z)) + (t_3 / ((sqrt(y) + sqrt((1.0d0 + y))) * t_3)))
else
tmp = (t_1 + (t_2 + 2.0d0)) - sqrt(t)
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + z));
double t_2 = Math.sqrt((1.0 + t));
double t_3 = y + (1.0 + y);
double tmp;
if ((t_2 - Math.sqrt(t)) <= 2e-8) {
tmp = (Math.sqrt((x + 1.0)) - Math.sqrt(x)) + ((t_1 - Math.sqrt(z)) + (t_3 / ((Math.sqrt(y) + Math.sqrt((1.0 + y))) * t_3)));
} else {
tmp = (t_1 + (t_2 + 2.0)) - Math.sqrt(t);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + z)) t_2 = math.sqrt((1.0 + t)) t_3 = y + (1.0 + y) tmp = 0 if (t_2 - math.sqrt(t)) <= 2e-8: tmp = (math.sqrt((x + 1.0)) - math.sqrt(x)) + ((t_1 - math.sqrt(z)) + (t_3 / ((math.sqrt(y) + math.sqrt((1.0 + y))) * t_3))) else: tmp = (t_1 + (t_2 + 2.0)) - math.sqrt(t) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + z)) t_2 = sqrt(Float64(1.0 + t)) t_3 = Float64(y + Float64(1.0 + y)) tmp = 0.0 if (Float64(t_2 - sqrt(t)) <= 2e-8) tmp = Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(Float64(t_1 - sqrt(z)) + Float64(t_3 / Float64(Float64(sqrt(y) + sqrt(Float64(1.0 + y))) * t_3)))); else tmp = Float64(Float64(t_1 + Float64(t_2 + 2.0)) - sqrt(t)); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + z));
t_2 = sqrt((1.0 + t));
t_3 = y + (1.0 + y);
tmp = 0.0;
if ((t_2 - sqrt(t)) <= 2e-8)
tmp = (sqrt((x + 1.0)) - sqrt(x)) + ((t_1 - sqrt(z)) + (t_3 / ((sqrt(y) + sqrt((1.0 + y))) * t_3)));
else
tmp = (t_1 + (t_2 + 2.0)) - sqrt(t);
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(y + N[(1.0 + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$2 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], 2e-8], N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(t$95$3 / N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 + N[(t$95$2 + 2.0), $MachinePrecision]), $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + z}\\
t_2 := \sqrt{1 + t}\\
t_3 := y + \left(1 + y\right)\\
\mathbf{if}\;t\_2 - \sqrt{t} \leq 2 \cdot 10^{-8}:\\
\;\;\;\;\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\left(t\_1 - \sqrt{z}\right) + \frac{t\_3}{\left(\sqrt{y} + \sqrt{1 + y}\right) \cdot t\_3}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 + \left(t\_2 + 2\right)\right) - \sqrt{t}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) < 2e-8Initial program 87.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified72.3%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6487.9%
Simplified87.9%
+-commutativeN/A
flip--N/A
+-commutativeN/A
+-commutativeN/A
rem-square-sqrtN/A
rem-square-sqrtN/A
flip--N/A
+-commutativeN/A
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr90.9%
if 2e-8 < (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) Initial program 97.3%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified58.9%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6427.8%
Simplified27.8%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in t around inf
sqrt-lowering-sqrt.f6421.9%
Simplified21.9%
Final simplification56.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 t))) (t_2 (sqrt (+ 1.0 z))))
(if (<= (- t_1 (sqrt t)) 2e-8)
(+
(/ (- (+ x 1.0) x) (+ (sqrt x) (sqrt (+ x 1.0))))
(+ (- t_2 (sqrt z)) (- (sqrt (+ 1.0 y)) (sqrt y))))
(- (+ t_2 (+ t_1 2.0)) (sqrt t)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + t));
double t_2 = sqrt((1.0 + z));
double tmp;
if ((t_1 - sqrt(t)) <= 2e-8) {
tmp = (((x + 1.0) - x) / (sqrt(x) + sqrt((x + 1.0)))) + ((t_2 - sqrt(z)) + (sqrt((1.0 + y)) - sqrt(y)));
} else {
tmp = (t_2 + (t_1 + 2.0)) - sqrt(t);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = sqrt((1.0d0 + t))
t_2 = sqrt((1.0d0 + z))
if ((t_1 - sqrt(t)) <= 2d-8) then
tmp = (((x + 1.0d0) - x) / (sqrt(x) + sqrt((x + 1.0d0)))) + ((t_2 - sqrt(z)) + (sqrt((1.0d0 + y)) - sqrt(y)))
else
tmp = (t_2 + (t_1 + 2.0d0)) - sqrt(t)
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + t));
double t_2 = Math.sqrt((1.0 + z));
double tmp;
if ((t_1 - Math.sqrt(t)) <= 2e-8) {
tmp = (((x + 1.0) - x) / (Math.sqrt(x) + Math.sqrt((x + 1.0)))) + ((t_2 - Math.sqrt(z)) + (Math.sqrt((1.0 + y)) - Math.sqrt(y)));
} else {
tmp = (t_2 + (t_1 + 2.0)) - Math.sqrt(t);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + t)) t_2 = math.sqrt((1.0 + z)) tmp = 0 if (t_1 - math.sqrt(t)) <= 2e-8: tmp = (((x + 1.0) - x) / (math.sqrt(x) + math.sqrt((x + 1.0)))) + ((t_2 - math.sqrt(z)) + (math.sqrt((1.0 + y)) - math.sqrt(y))) else: tmp = (t_2 + (t_1 + 2.0)) - math.sqrt(t) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + t)) t_2 = sqrt(Float64(1.0 + z)) tmp = 0.0 if (Float64(t_1 - sqrt(t)) <= 2e-8) tmp = Float64(Float64(Float64(Float64(x + 1.0) - x) / Float64(sqrt(x) + sqrt(Float64(x + 1.0)))) + Float64(Float64(t_2 - sqrt(z)) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y)))); else tmp = Float64(Float64(t_2 + Float64(t_1 + 2.0)) - sqrt(t)); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + t));
t_2 = sqrt((1.0 + z));
tmp = 0.0;
if ((t_1 - sqrt(t)) <= 2e-8)
tmp = (((x + 1.0) - x) / (sqrt(x) + sqrt((x + 1.0)))) + ((t_2 - sqrt(z)) + (sqrt((1.0 + y)) - sqrt(y)));
else
tmp = (t_2 + (t_1 + 2.0)) - sqrt(t);
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$1 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], 2e-8], N[(N[(N[(N[(x + 1.0), $MachinePrecision] - x), $MachinePrecision] / N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$2 + N[(t$95$1 + 2.0), $MachinePrecision]), $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + t}\\
t_2 := \sqrt{1 + z}\\
\mathbf{if}\;t\_1 - \sqrt{t} \leq 2 \cdot 10^{-8}:\\
\;\;\;\;\frac{\left(x + 1\right) - x}{\sqrt{x} + \sqrt{x + 1}} + \left(\left(t\_2 - \sqrt{z}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_2 + \left(t\_1 + 2\right)\right) - \sqrt{t}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) < 2e-8Initial program 87.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified72.3%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6487.9%
Simplified87.9%
flip--N/A
/-lowering-/.f64N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
--lowering--.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6488.6%
Applied egg-rr88.6%
if 2e-8 < (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) Initial program 97.3%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified58.9%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6427.8%
Simplified27.8%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in t around inf
sqrt-lowering-sqrt.f6421.9%
Simplified21.9%
Final simplification55.0%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 z))) (t_2 (sqrt (+ 1.0 t))))
(if (<= (- t_2 (sqrt t)) 2e-8)
(+
(- (sqrt (+ x 1.0)) (sqrt x))
(+ (- t_1 (sqrt z)) (- (sqrt (+ 1.0 y)) (sqrt y))))
(- (+ t_1 (+ t_2 2.0)) (sqrt t)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + z));
double t_2 = sqrt((1.0 + t));
double tmp;
if ((t_2 - sqrt(t)) <= 2e-8) {
tmp = (sqrt((x + 1.0)) - sqrt(x)) + ((t_1 - sqrt(z)) + (sqrt((1.0 + y)) - sqrt(y)));
} else {
tmp = (t_1 + (t_2 + 2.0)) - sqrt(t);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = sqrt((1.0d0 + z))
t_2 = sqrt((1.0d0 + t))
if ((t_2 - sqrt(t)) <= 2d-8) then
tmp = (sqrt((x + 1.0d0)) - sqrt(x)) + ((t_1 - sqrt(z)) + (sqrt((1.0d0 + y)) - sqrt(y)))
else
tmp = (t_1 + (t_2 + 2.0d0)) - sqrt(t)
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + z));
double t_2 = Math.sqrt((1.0 + t));
double tmp;
if ((t_2 - Math.sqrt(t)) <= 2e-8) {
tmp = (Math.sqrt((x + 1.0)) - Math.sqrt(x)) + ((t_1 - Math.sqrt(z)) + (Math.sqrt((1.0 + y)) - Math.sqrt(y)));
} else {
tmp = (t_1 + (t_2 + 2.0)) - Math.sqrt(t);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + z)) t_2 = math.sqrt((1.0 + t)) tmp = 0 if (t_2 - math.sqrt(t)) <= 2e-8: tmp = (math.sqrt((x + 1.0)) - math.sqrt(x)) + ((t_1 - math.sqrt(z)) + (math.sqrt((1.0 + y)) - math.sqrt(y))) else: tmp = (t_1 + (t_2 + 2.0)) - math.sqrt(t) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + z)) t_2 = sqrt(Float64(1.0 + t)) tmp = 0.0 if (Float64(t_2 - sqrt(t)) <= 2e-8) tmp = Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(Float64(t_1 - sqrt(z)) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y)))); else tmp = Float64(Float64(t_1 + Float64(t_2 + 2.0)) - sqrt(t)); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + z));
t_2 = sqrt((1.0 + t));
tmp = 0.0;
if ((t_2 - sqrt(t)) <= 2e-8)
tmp = (sqrt((x + 1.0)) - sqrt(x)) + ((t_1 - sqrt(z)) + (sqrt((1.0 + y)) - sqrt(y)));
else
tmp = (t_1 + (t_2 + 2.0)) - sqrt(t);
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$2 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], 2e-8], N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 + N[(t$95$2 + 2.0), $MachinePrecision]), $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + z}\\
t_2 := \sqrt{1 + t}\\
\mathbf{if}\;t\_2 - \sqrt{t} \leq 2 \cdot 10^{-8}:\\
\;\;\;\;\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\left(t\_1 - \sqrt{z}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 + \left(t\_2 + 2\right)\right) - \sqrt{t}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) < 2e-8Initial program 87.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified72.3%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6487.9%
Simplified87.9%
if 2e-8 < (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) Initial program 97.3%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified58.9%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6427.8%
Simplified27.8%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in t around inf
sqrt-lowering-sqrt.f6421.9%
Simplified21.9%
Final simplification54.6%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (- (sqrt (+ 1.0 y)) (sqrt y))))
(if (<= z 7e-22)
(+
(- 1.0 (sqrt x))
(+ t_1 (+ 1.0 (- (- (sqrt (+ 1.0 t)) (sqrt t)) (sqrt z)))))
(+
(- (sqrt (+ x 1.0)) (sqrt x))
(+ t_1 (/ (- (+ 1.0 z) z) (+ (sqrt z) (pow (+ 1.0 z) 0.5))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + y)) - sqrt(y);
double tmp;
if (z <= 7e-22) {
tmp = (1.0 - sqrt(x)) + (t_1 + (1.0 + ((sqrt((1.0 + t)) - sqrt(t)) - sqrt(z))));
} else {
tmp = (sqrt((x + 1.0)) - sqrt(x)) + (t_1 + (((1.0 + z) - z) / (sqrt(z) + pow((1.0 + z), 0.5))));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((1.0d0 + y)) - sqrt(y)
if (z <= 7d-22) then
tmp = (1.0d0 - sqrt(x)) + (t_1 + (1.0d0 + ((sqrt((1.0d0 + t)) - sqrt(t)) - sqrt(z))))
else
tmp = (sqrt((x + 1.0d0)) - sqrt(x)) + (t_1 + (((1.0d0 + z) - z) / (sqrt(z) + ((1.0d0 + z) ** 0.5d0))))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + y)) - Math.sqrt(y);
double tmp;
if (z <= 7e-22) {
tmp = (1.0 - Math.sqrt(x)) + (t_1 + (1.0 + ((Math.sqrt((1.0 + t)) - Math.sqrt(t)) - Math.sqrt(z))));
} else {
tmp = (Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (t_1 + (((1.0 + z) - z) / (Math.sqrt(z) + Math.pow((1.0 + z), 0.5))));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + y)) - math.sqrt(y) tmp = 0 if z <= 7e-22: tmp = (1.0 - math.sqrt(x)) + (t_1 + (1.0 + ((math.sqrt((1.0 + t)) - math.sqrt(t)) - math.sqrt(z)))) else: tmp = (math.sqrt((x + 1.0)) - math.sqrt(x)) + (t_1 + (((1.0 + z) - z) / (math.sqrt(z) + math.pow((1.0 + z), 0.5)))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) tmp = 0.0 if (z <= 7e-22) tmp = Float64(Float64(1.0 - sqrt(x)) + Float64(t_1 + Float64(1.0 + Float64(Float64(sqrt(Float64(1.0 + t)) - sqrt(t)) - sqrt(z))))); else tmp = Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(t_1 + Float64(Float64(Float64(1.0 + z) - z) / Float64(sqrt(z) + (Float64(1.0 + z) ^ 0.5))))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + y)) - sqrt(y);
tmp = 0.0;
if (z <= 7e-22)
tmp = (1.0 - sqrt(x)) + (t_1 + (1.0 + ((sqrt((1.0 + t)) - sqrt(t)) - sqrt(z))));
else
tmp = (sqrt((x + 1.0)) - sqrt(x)) + (t_1 + (((1.0 + z) - z) / (sqrt(z) + ((1.0 + z) ^ 0.5))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, 7e-22], N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 + N[(1.0 + N[(N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 + N[(N[(N[(1.0 + z), $MachinePrecision] - z), $MachinePrecision] / N[(N[Sqrt[z], $MachinePrecision] + N[Power[N[(1.0 + z), $MachinePrecision], 0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + y} - \sqrt{y}\\
\mathbf{if}\;z \leq 7 \cdot 10^{-22}:\\
\;\;\;\;\left(1 - \sqrt{x}\right) + \left(t\_1 + \left(1 + \left(\left(\sqrt{1 + t} - \sqrt{t}\right) - \sqrt{z}\right)\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(t\_1 + \frac{\left(1 + z\right) - z}{\sqrt{z} + {\left(1 + z\right)}^{0.5}}\right)\\
\end{array}
\end{array}
if z < 7.00000000000000011e-22Initial program 96.9%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified96.6%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6450.6%
Simplified50.6%
Taylor expanded in z around 0
associate--l+N/A
+-lowering-+.f64N/A
associate--r+N/A
--lowering--.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6450.8%
Simplified50.8%
if 7.00000000000000011e-22 < z Initial program 88.3%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified35.0%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6445.0%
Simplified45.0%
flip--N/A
/-lowering-/.f64N/A
rem-square-sqrtN/A
rem-square-sqrtN/A
--lowering--.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
pow1/2N/A
pow-lowering-pow.f64N/A
+-lowering-+.f6445.1%
Applied egg-rr45.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 z))))
(if (<= t 53000000000.0)
(- (+ t_1 (+ (sqrt (+ 1.0 t)) 2.0)) (sqrt t))
(+ (- 1.0 (sqrt x)) (+ (- t_1 (sqrt z)) (- (sqrt (+ 1.0 y)) (sqrt y)))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + z));
double tmp;
if (t <= 53000000000.0) {
tmp = (t_1 + (sqrt((1.0 + t)) + 2.0)) - sqrt(t);
} else {
tmp = (1.0 - sqrt(x)) + ((t_1 - sqrt(z)) + (sqrt((1.0 + y)) - sqrt(y)));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((1.0d0 + z))
if (t <= 53000000000.0d0) then
tmp = (t_1 + (sqrt((1.0d0 + t)) + 2.0d0)) - sqrt(t)
else
tmp = (1.0d0 - sqrt(x)) + ((t_1 - sqrt(z)) + (sqrt((1.0d0 + y)) - sqrt(y)))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + z));
double tmp;
if (t <= 53000000000.0) {
tmp = (t_1 + (Math.sqrt((1.0 + t)) + 2.0)) - Math.sqrt(t);
} else {
tmp = (1.0 - Math.sqrt(x)) + ((t_1 - Math.sqrt(z)) + (Math.sqrt((1.0 + y)) - Math.sqrt(y)));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + z)) tmp = 0 if t <= 53000000000.0: tmp = (t_1 + (math.sqrt((1.0 + t)) + 2.0)) - math.sqrt(t) else: tmp = (1.0 - math.sqrt(x)) + ((t_1 - math.sqrt(z)) + (math.sqrt((1.0 + y)) - math.sqrt(y))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + z)) tmp = 0.0 if (t <= 53000000000.0) tmp = Float64(Float64(t_1 + Float64(sqrt(Float64(1.0 + t)) + 2.0)) - sqrt(t)); else tmp = Float64(Float64(1.0 - sqrt(x)) + Float64(Float64(t_1 - sqrt(z)) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y)))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + z));
tmp = 0.0;
if (t <= 53000000000.0)
tmp = (t_1 + (sqrt((1.0 + t)) + 2.0)) - sqrt(t);
else
tmp = (1.0 - sqrt(x)) + ((t_1 - sqrt(z)) + (sqrt((1.0 + y)) - sqrt(y)));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t, 53000000000.0], N[(N[(t$95$1 + N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + z}\\
\mathbf{if}\;t \leq 53000000000:\\
\;\;\;\;\left(t\_1 + \left(\sqrt{1 + t} + 2\right)\right) - \sqrt{t}\\
\mathbf{else}:\\
\;\;\;\;\left(1 - \sqrt{x}\right) + \left(\left(t\_1 - \sqrt{z}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right)\\
\end{array}
\end{array}
if t < 5.3e10Initial program 97.7%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified58.7%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6428.2%
Simplified28.2%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.9%
Simplified14.9%
Taylor expanded in t around inf
sqrt-lowering-sqrt.f6421.9%
Simplified21.9%
if 5.3e10 < t Initial program 87.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified72.3%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6487.4%
Simplified87.4%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6452.3%
Simplified52.3%
Final simplification37.2%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (if (<= z 1.4e+14) (- (+ (sqrt (+ 1.0 z)) 2.0) (+ (sqrt x) (+ (sqrt y) (sqrt z)))) (+ (- (sqrt (+ x 1.0)) (sqrt x)) (/ 1.0 (+ (sqrt y) (sqrt (+ 1.0 y)))))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (z <= 1.4e+14) {
tmp = (sqrt((1.0 + z)) + 2.0) - (sqrt(x) + (sqrt(y) + sqrt(z)));
} else {
tmp = (sqrt((x + 1.0)) - sqrt(x)) + (1.0 / (sqrt(y) + sqrt((1.0 + y))));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: tmp
if (z <= 1.4d+14) then
tmp = (sqrt((1.0d0 + z)) + 2.0d0) - (sqrt(x) + (sqrt(y) + sqrt(z)))
else
tmp = (sqrt((x + 1.0d0)) - sqrt(x)) + (1.0d0 / (sqrt(y) + sqrt((1.0d0 + y))))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double tmp;
if (z <= 1.4e+14) {
tmp = (Math.sqrt((1.0 + z)) + 2.0) - (Math.sqrt(x) + (Math.sqrt(y) + Math.sqrt(z)));
} else {
tmp = (Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (1.0 / (Math.sqrt(y) + Math.sqrt((1.0 + y))));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if z <= 1.4e+14: tmp = (math.sqrt((1.0 + z)) + 2.0) - (math.sqrt(x) + (math.sqrt(y) + math.sqrt(z))) else: tmp = (math.sqrt((x + 1.0)) - math.sqrt(x)) + (1.0 / (math.sqrt(y) + math.sqrt((1.0 + y)))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (z <= 1.4e+14) tmp = Float64(Float64(sqrt(Float64(1.0 + z)) + 2.0) - Float64(sqrt(x) + Float64(sqrt(y) + sqrt(z)))); else tmp = Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(1.0 / Float64(sqrt(y) + sqrt(Float64(1.0 + y))))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
tmp = 0.0;
if (z <= 1.4e+14)
tmp = (sqrt((1.0 + z)) + 2.0) - (sqrt(x) + (sqrt(y) + sqrt(z)));
else
tmp = (sqrt((x + 1.0)) - sqrt(x)) + (1.0 / (sqrt(y) + sqrt((1.0 + y))));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := If[LessEqual[z, 1.4e+14], N[(N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + 2.0), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 1.4 \cdot 10^{+14}:\\
\;\;\;\;\left(\sqrt{1 + z} + 2\right) - \left(\sqrt{x} + \left(\sqrt{y} + \sqrt{z}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{x + 1} - \sqrt{x}\right) + \frac{1}{\sqrt{y} + \sqrt{1 + y}}\\
\end{array}
\end{array}
if z < 1.4e14Initial program 96.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified95.5%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6450.6%
Simplified50.6%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in t around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6420.4%
Simplified20.4%
if 1.4e14 < z Initial program 87.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified31.7%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6445.0%
Simplified45.0%
+-commutativeN/A
flip--N/A
+-commutativeN/A
+-commutativeN/A
rem-square-sqrtN/A
rem-square-sqrtN/A
flip--N/A
+-commutativeN/A
associate-/l/N/A
/-lowering-/.f64N/A
Applied egg-rr48.2%
Taylor expanded in z around inf
/-lowering-/.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f6448.4%
Simplified48.4%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (if (<= z 1.26e+14) (- (+ (sqrt (+ 1.0 z)) 2.0) (+ (sqrt x) (+ (sqrt y) (sqrt z)))) (+ 1.0 (- (- (sqrt (+ 1.0 y)) (sqrt x)) (sqrt y)))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (z <= 1.26e+14) {
tmp = (sqrt((1.0 + z)) + 2.0) - (sqrt(x) + (sqrt(y) + sqrt(z)));
} else {
tmp = 1.0 + ((sqrt((1.0 + y)) - sqrt(x)) - sqrt(y));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: tmp
if (z <= 1.26d+14) then
tmp = (sqrt((1.0d0 + z)) + 2.0d0) - (sqrt(x) + (sqrt(y) + sqrt(z)))
else
tmp = 1.0d0 + ((sqrt((1.0d0 + y)) - sqrt(x)) - sqrt(y))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double tmp;
if (z <= 1.26e+14) {
tmp = (Math.sqrt((1.0 + z)) + 2.0) - (Math.sqrt(x) + (Math.sqrt(y) + Math.sqrt(z)));
} else {
tmp = 1.0 + ((Math.sqrt((1.0 + y)) - Math.sqrt(x)) - Math.sqrt(y));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if z <= 1.26e+14: tmp = (math.sqrt((1.0 + z)) + 2.0) - (math.sqrt(x) + (math.sqrt(y) + math.sqrt(z))) else: tmp = 1.0 + ((math.sqrt((1.0 + y)) - math.sqrt(x)) - math.sqrt(y)) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (z <= 1.26e+14) tmp = Float64(Float64(sqrt(Float64(1.0 + z)) + 2.0) - Float64(sqrt(x) + Float64(sqrt(y) + sqrt(z)))); else tmp = Float64(1.0 + Float64(Float64(sqrt(Float64(1.0 + y)) - sqrt(x)) - sqrt(y))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
tmp = 0.0;
if (z <= 1.26e+14)
tmp = (sqrt((1.0 + z)) + 2.0) - (sqrt(x) + (sqrt(y) + sqrt(z)));
else
tmp = 1.0 + ((sqrt((1.0 + y)) - sqrt(x)) - sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := If[LessEqual[z, 1.26e+14], N[(N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + 2.0), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;z \leq 1.26 \cdot 10^{+14}:\\
\;\;\;\;\left(\sqrt{1 + z} + 2\right) - \left(\sqrt{x} + \left(\sqrt{y} + \sqrt{z}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;1 + \left(\left(\sqrt{1 + y} - \sqrt{x}\right) - \sqrt{y}\right)\\
\end{array}
\end{array}
if z < 1.26e14Initial program 96.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified95.5%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6450.6%
Simplified50.6%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in t around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6420.4%
Simplified20.4%
if 1.26e14 < z Initial program 87.8%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified31.7%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6445.0%
Simplified45.0%
Taylor expanded in z around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6420.5%
Simplified20.5%
Taylor expanded in x around 0
associate--l+N/A
+-lowering-+.f64N/A
associate--r+N/A
--lowering--.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6431.5%
Simplified31.5%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (if (<= t 2.45e+30) (- (+ (sqrt (+ 1.0 z)) (+ (sqrt (+ 1.0 t)) 2.0)) (sqrt t)) (+ 1.0 (- (- (sqrt (+ 1.0 y)) (sqrt x)) (sqrt y)))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (t <= 2.45e+30) {
tmp = (sqrt((1.0 + z)) + (sqrt((1.0 + t)) + 2.0)) - sqrt(t);
} else {
tmp = 1.0 + ((sqrt((1.0 + y)) - sqrt(x)) - sqrt(y));
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: tmp
if (t <= 2.45d+30) then
tmp = (sqrt((1.0d0 + z)) + (sqrt((1.0d0 + t)) + 2.0d0)) - sqrt(t)
else
tmp = 1.0d0 + ((sqrt((1.0d0 + y)) - sqrt(x)) - sqrt(y))
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double tmp;
if (t <= 2.45e+30) {
tmp = (Math.sqrt((1.0 + z)) + (Math.sqrt((1.0 + t)) + 2.0)) - Math.sqrt(t);
} else {
tmp = 1.0 + ((Math.sqrt((1.0 + y)) - Math.sqrt(x)) - Math.sqrt(y));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if t <= 2.45e+30: tmp = (math.sqrt((1.0 + z)) + (math.sqrt((1.0 + t)) + 2.0)) - math.sqrt(t) else: tmp = 1.0 + ((math.sqrt((1.0 + y)) - math.sqrt(x)) - math.sqrt(y)) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (t <= 2.45e+30) tmp = Float64(Float64(sqrt(Float64(1.0 + z)) + Float64(sqrt(Float64(1.0 + t)) + 2.0)) - sqrt(t)); else tmp = Float64(1.0 + Float64(Float64(sqrt(Float64(1.0 + y)) - sqrt(x)) - sqrt(y))); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
tmp = 0.0;
if (t <= 2.45e+30)
tmp = (sqrt((1.0 + z)) + (sqrt((1.0 + t)) + 2.0)) - sqrt(t);
else
tmp = 1.0 + ((sqrt((1.0 + y)) - sqrt(x)) - sqrt(y));
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := If[LessEqual[t, 2.45e+30], N[(N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;t \leq 2.45 \cdot 10^{+30}:\\
\;\;\;\;\left(\sqrt{1 + z} + \left(\sqrt{1 + t} + 2\right)\right) - \sqrt{t}\\
\mathbf{else}:\\
\;\;\;\;1 + \left(\left(\sqrt{1 + y} - \sqrt{x}\right) - \sqrt{y}\right)\\
\end{array}
\end{array}
if t < 2.44999999999999992e30Initial program 95.2%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified59.1%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6429.2%
Simplified29.2%
Taylor expanded in y around 0
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6415.0%
Simplified15.0%
Taylor expanded in t around inf
sqrt-lowering-sqrt.f6422.1%
Simplified22.1%
if 2.44999999999999992e30 < t Initial program 89.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified73.1%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6489.6%
Simplified89.6%
Taylor expanded in z around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6422.4%
Simplified22.4%
Taylor expanded in x around 0
associate--l+N/A
+-lowering-+.f64N/A
associate--r+N/A
--lowering--.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6430.7%
Simplified30.7%
Final simplification26.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (if (<= y 35000000.0) (- (+ 1.0 (sqrt (+ 1.0 y))) (+ (sqrt x) (sqrt y))) (- (+ (* 0.5 (sqrt (/ 1.0 y))) (sqrt (+ x 1.0))) (sqrt x))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (y <= 35000000.0) {
tmp = (1.0 + sqrt((1.0 + y))) - (sqrt(x) + sqrt(y));
} else {
tmp = ((0.5 * sqrt((1.0 / y))) + sqrt((x + 1.0))) - sqrt(x);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: tmp
if (y <= 35000000.0d0) then
tmp = (1.0d0 + sqrt((1.0d0 + y))) - (sqrt(x) + sqrt(y))
else
tmp = ((0.5d0 * sqrt((1.0d0 / y))) + sqrt((x + 1.0d0))) - sqrt(x)
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double tmp;
if (y <= 35000000.0) {
tmp = (1.0 + Math.sqrt((1.0 + y))) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = ((0.5 * Math.sqrt((1.0 / y))) + Math.sqrt((x + 1.0))) - Math.sqrt(x);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if y <= 35000000.0: tmp = (1.0 + math.sqrt((1.0 + y))) - (math.sqrt(x) + math.sqrt(y)) else: tmp = ((0.5 * math.sqrt((1.0 / y))) + math.sqrt((x + 1.0))) - math.sqrt(x) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (y <= 35000000.0) tmp = Float64(Float64(1.0 + sqrt(Float64(1.0 + y))) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(0.5 * sqrt(Float64(1.0 / y))) + sqrt(Float64(x + 1.0))) - sqrt(x)); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
tmp = 0.0;
if (y <= 35000000.0)
tmp = (1.0 + sqrt((1.0 + y))) - (sqrt(x) + sqrt(y));
else
tmp = ((0.5 * sqrt((1.0 / y))) + sqrt((x + 1.0))) - sqrt(x);
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := If[LessEqual[y, 35000000.0], N[(N[(1.0 + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(0.5 * N[Sqrt[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 35000000:\\
\;\;\;\;\left(1 + \sqrt{1 + y}\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(0.5 \cdot \sqrt{\frac{1}{y}} + \sqrt{x + 1}\right) - \sqrt{x}\\
\end{array}
\end{array}
if y < 3.5e7Initial program 96.9%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified68.7%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6460.5%
Simplified60.5%
Taylor expanded in z around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6423.1%
Simplified23.1%
Taylor expanded in x around 0
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f6419.4%
Simplified19.4%
if 3.5e7 < y Initial program 87.4%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified61.8%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6443.6%
Simplified43.6%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6447.3%
Simplified47.3%
Taylor expanded in z around inf
--lowering--.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
sqrt-lowering-sqrt.f6418.9%
Simplified18.9%
Final simplification19.2%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ 1.0 (- (- (sqrt (+ 1.0 y)) (sqrt x)) (sqrt y))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return 1.0 + ((sqrt((1.0 + y)) - sqrt(x)) - sqrt(y));
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = 1.0d0 + ((sqrt((1.0d0 + y)) - sqrt(x)) - sqrt(y))
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return 1.0 + ((Math.sqrt((1.0 + y)) - Math.sqrt(x)) - Math.sqrt(y));
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return 1.0 + ((math.sqrt((1.0 + y)) - math.sqrt(x)) - math.sqrt(y))
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(1.0 + Float64(Float64(sqrt(Float64(1.0 + y)) - sqrt(x)) - sqrt(y))) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = 1.0 + ((sqrt((1.0 + y)) - sqrt(x)) - sqrt(y));
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(1.0 + N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
1 + \left(\left(\sqrt{1 + y} - \sqrt{x}\right) - \sqrt{y}\right)
\end{array}
Initial program 92.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified65.6%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6452.8%
Simplified52.8%
Taylor expanded in z around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in x around 0
associate--l+N/A
+-lowering-+.f64N/A
associate--r+N/A
--lowering--.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6422.6%
Simplified22.6%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return sqrt((x + 1.0)) - sqrt(x);
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = sqrt((x + 1.0d0)) - sqrt(x)
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return math.sqrt((x + 1.0)) - math.sqrt(x)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = sqrt((x + 1.0)) - sqrt(x);
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\sqrt{x + 1} - \sqrt{x}
\end{array}
Initial program 92.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified65.6%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6452.8%
Simplified52.8%
Taylor expanded in z around inf
--lowering--.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
sqrt-lowering-sqrt.f6414.7%
Simplified14.7%
Taylor expanded in y around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6414.2%
Simplified14.2%
Final simplification14.2%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (* 0.5 (sqrt (/ 1.0 y))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return 0.5 * sqrt((1.0 / y));
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = 0.5d0 * sqrt((1.0d0 / y))
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return 0.5 * Math.sqrt((1.0 / y));
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return 0.5 * math.sqrt((1.0 / y))
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(0.5 * sqrt(Float64(1.0 / y))) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = 0.5 * sqrt((1.0 / y));
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(0.5 * N[Sqrt[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
0.5 \cdot \sqrt{\frac{1}{y}}
\end{array}
Initial program 92.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified65.6%
Taylor expanded in t around inf
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f6452.8%
Simplified52.8%
Taylor expanded in y around inf
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f6425.7%
Simplified25.7%
Taylor expanded in y around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f648.2%
Simplified8.2%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (* 0.5 (sqrt (/ 1.0 t))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return 0.5 * sqrt((1.0 / t));
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = 0.5d0 * sqrt((1.0d0 / t))
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return 0.5 * Math.sqrt((1.0 / t));
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return 0.5 * math.sqrt((1.0 / t))
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(0.5 * sqrt(Float64(1.0 / t))) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = 0.5 * sqrt((1.0 / t));
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(0.5 * N[Sqrt[N[(1.0 / t), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
0.5 \cdot \sqrt{\frac{1}{t}}
\end{array}
Initial program 92.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified65.6%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6436.7%
Simplified36.7%
Taylor expanded in t around inf
--lowering--.f64N/A
associate-+r+N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
Simplified13.4%
Taylor expanded in t around 0
*-lowering-*.f64N/A
sqrt-lowering-sqrt.f64N/A
/-lowering-/.f648.2%
Simplified8.2%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (- 0.0 (sqrt x)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return 0.0 - sqrt(x);
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = 0.0d0 - sqrt(x)
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return 0.0 - Math.sqrt(x);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return 0.0 - math.sqrt(x)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(0.0 - sqrt(x)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = 0.0 - sqrt(x);
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(0.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
0 - \sqrt{x}
\end{array}
Initial program 92.6%
associate-+l+N/A
associate-+l+N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
+-lowering-+.f64N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
sqrt-lowering-sqrt.f64N/A
Simplified65.6%
Taylor expanded in x around 0
--lowering--.f64N/A
sqrt-lowering-sqrt.f6436.7%
Simplified36.7%
Taylor expanded in x around inf
mul-1-negN/A
neg-sub0N/A
--lowering--.f64N/A
sqrt-lowering-sqrt.f641.6%
Simplified1.6%
sub0-negN/A
neg-lowering-neg.f64N/A
sqrt-lowering-sqrt.f641.6%
Applied egg-rr1.6%
Final simplification1.6%
(FPCore (x y z t)
:precision binary64
(+
(+
(+
(/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x)))
(/ 1.0 (+ (sqrt (+ y 1.0)) (sqrt y))))
(/ 1.0 (+ (sqrt (+ z 1.0)) (sqrt z))))
(- (sqrt (+ t 1.0)) (sqrt t))))
double code(double x, double y, double z, double t) {
return (((1.0 / (sqrt((x + 1.0)) + sqrt(x))) + (1.0 / (sqrt((y + 1.0)) + sqrt(y)))) + (1.0 / (sqrt((z + 1.0)) + sqrt(z)))) + (sqrt((t + 1.0)) - sqrt(t));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((1.0d0 / (sqrt((x + 1.0d0)) + sqrt(x))) + (1.0d0 / (sqrt((y + 1.0d0)) + sqrt(y)))) + (1.0d0 / (sqrt((z + 1.0d0)) + sqrt(z)))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function
public static double code(double x, double y, double z, double t) {
return (((1.0 / (Math.sqrt((x + 1.0)) + Math.sqrt(x))) + (1.0 / (Math.sqrt((y + 1.0)) + Math.sqrt(y)))) + (1.0 / (Math.sqrt((z + 1.0)) + Math.sqrt(z)))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}
def code(x, y, z, t): return (((1.0 / (math.sqrt((x + 1.0)) + math.sqrt(x))) + (1.0 / (math.sqrt((y + 1.0)) + math.sqrt(y)))) + (1.0 / (math.sqrt((z + 1.0)) + math.sqrt(z)))) + (math.sqrt((t + 1.0)) - math.sqrt(t))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(1.0 / Float64(sqrt(Float64(x + 1.0)) + sqrt(x))) + Float64(1.0 / Float64(sqrt(Float64(y + 1.0)) + sqrt(y)))) + Float64(1.0 / Float64(sqrt(Float64(z + 1.0)) + sqrt(z)))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))) end
function tmp = code(x, y, z, t) tmp = (((1.0 / (sqrt((x + 1.0)) + sqrt(x))) + (1.0 / (sqrt((y + 1.0)) + sqrt(y)))) + (1.0 / (sqrt((z + 1.0)) + sqrt(z)))) + (sqrt((t + 1.0)) - sqrt(t)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(1.0 / N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\frac{1}{\sqrt{x + 1} + \sqrt{x}} + \frac{1}{\sqrt{y + 1} + \sqrt{y}}\right) + \frac{1}{\sqrt{z + 1} + \sqrt{z}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)
\end{array}
herbie shell --seed 2024145
(FPCore (x y z t)
:name "Main:z from "
:precision binary64
:alt
(! :herbie-platform default (+ (+ (+ (/ 1 (+ (sqrt (+ x 1)) (sqrt x))) (/ 1 (+ (sqrt (+ y 1)) (sqrt y)))) (/ 1 (+ (sqrt (+ z 1)) (sqrt z)))) (- (sqrt (+ t 1)) (sqrt t))))
(+ (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z))) (- (sqrt (+ t 1.0)) (sqrt t))))