
(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 25 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 (+ x 1.0)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (- (sqrt (+ 1.0 y)) (sqrt y)))
(t_4 (sqrt (+ t 1.0))))
(if (<= t_3 1e-6)
(+
(- t_4 (sqrt t))
(+
(- t_2 (sqrt z))
(fma (sqrt (pow y -1.0)) 0.5 (pow (+ (sqrt x) t_1) -1.0))))
(+
(/ (- (+ t 1.0) t) (+ (sqrt t) t_4))
(+ (/ (- (+ z 1.0) z) (+ (sqrt z) t_2)) (+ (- t_1 (sqrt x)) t_3))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((x + 1.0));
double t_2 = sqrt((z + 1.0));
double t_3 = sqrt((1.0 + y)) - sqrt(y);
double t_4 = sqrt((t + 1.0));
double tmp;
if (t_3 <= 1e-6) {
tmp = (t_4 - sqrt(t)) + ((t_2 - sqrt(z)) + fma(sqrt(pow(y, -1.0)), 0.5, pow((sqrt(x) + t_1), -1.0)));
} else {
tmp = (((t + 1.0) - t) / (sqrt(t) + t_4)) + ((((z + 1.0) - z) / (sqrt(z) + t_2)) + ((t_1 - sqrt(x)) + t_3));
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(x + 1.0)) t_2 = sqrt(Float64(z + 1.0)) t_3 = Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) t_4 = sqrt(Float64(t + 1.0)) tmp = 0.0 if (t_3 <= 1e-6) tmp = Float64(Float64(t_4 - sqrt(t)) + Float64(Float64(t_2 - sqrt(z)) + fma(sqrt((y ^ -1.0)), 0.5, (Float64(sqrt(x) + t_1) ^ -1.0)))); else tmp = Float64(Float64(Float64(Float64(t + 1.0) - t) / Float64(sqrt(t) + t_4)) + Float64(Float64(Float64(Float64(z + 1.0) - z) / Float64(sqrt(z) + t_2)) + Float64(Float64(t_1 - sqrt(x)) + t_3))); end return 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[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 1e-6], N[(N[(t$95$4 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[Power[y, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(t + 1.0), $MachinePrecision] - t), $MachinePrecision] / N[(N[Sqrt[t], $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision] + N[(N[(N[(N[(z + 1.0), $MachinePrecision] - z), $MachinePrecision] / N[(N[Sqrt[z], $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$1 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{x + 1}\\
t_2 := \sqrt{z + 1}\\
t_3 := \sqrt{1 + y} - \sqrt{y}\\
t_4 := \sqrt{t + 1}\\
\mathbf{if}\;t\_3 \leq 10^{-6}:\\
\;\;\;\;\left(t\_4 - \sqrt{t}\right) + \left(\left(t\_2 - \sqrt{z}\right) + \mathsf{fma}\left(\sqrt{{y}^{-1}}, 0.5, {\left(\sqrt{x} + t\_1\right)}^{-1}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\frac{\left(t + 1\right) - t}{\sqrt{t} + t\_4} + \left(\frac{\left(z + 1\right) - z}{\sqrt{z} + t\_2} + \left(\left(t\_1 - \sqrt{x}\right) + t\_3\right)\right)\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) < 9.99999999999999955e-7Initial program 86.0%
Taylor expanded in y around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
Applied rewrites90.5%
if 9.99999999999999955e-7 < (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) Initial program 98.2%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6498.7
Applied rewrites98.7%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6499.0
Applied rewrites99.0%
Final simplification94.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)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (sqrt (+ x 1.0)))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_5
(+ (+ (+ (- t_3 (sqrt x)) (- t_1 (sqrt y))) (- t_2 (sqrt z))) t_4))
(t_6 (sqrt (pow z -1.0))))
(if (<= t_5 1e-6)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_5 1.0)
(+ (- (fma t_6 0.5 t_3) (sqrt x)) t_4)
(if (<= t_5 2.0005)
(- (+ (fma t_6 0.5 t_1) t_3) (+ (sqrt x) (sqrt y)))
(+ (- (+ t_3 t_1) (+ (+ (sqrt z) (sqrt y)) (sqrt x))) 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 + y));
double t_2 = sqrt((z + 1.0));
double t_3 = sqrt((x + 1.0));
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double t_5 = (((t_3 - sqrt(x)) + (t_1 - sqrt(y))) + (t_2 - sqrt(z))) + t_4;
double t_6 = sqrt(pow(z, -1.0));
double tmp;
if (t_5 <= 1e-6) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_5 <= 1.0) {
tmp = (fma(t_6, 0.5, t_3) - sqrt(x)) + t_4;
} else if (t_5 <= 2.0005) {
tmp = (fma(t_6, 0.5, t_1) + t_3) - (sqrt(x) + sqrt(y));
} else {
tmp = ((t_3 + t_1) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + t_2;
}
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(z + 1.0)) t_3 = sqrt(Float64(x + 1.0)) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_5 = Float64(Float64(Float64(Float64(t_3 - sqrt(x)) + Float64(t_1 - sqrt(y))) + Float64(t_2 - sqrt(z))) + t_4) t_6 = sqrt((z ^ -1.0)) tmp = 0.0 if (t_5 <= 1e-6) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_5 <= 1.0) tmp = Float64(Float64(fma(t_6, 0.5, t_3) - sqrt(x)) + t_4); elseif (t_5 <= 2.0005) tmp = Float64(Float64(fma(t_6, 0.5, t_1) + t_3) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(t_3 + t_1) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))) + t_2); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]}, Block[{t$95$6 = N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$5, 1e-6], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$5, 1.0], N[(N[(N[(t$95$6 * 0.5 + t$95$3), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision], If[LessEqual[t$95$5, 2.0005], N[(N[(N[(t$95$6 * 0.5 + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$3 + t$95$1), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $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{z + 1}\\
t_3 := \sqrt{x + 1}\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
t_5 := \left(\left(\left(t\_3 - \sqrt{x}\right) + \left(t\_1 - \sqrt{y}\right)\right) + \left(t\_2 - \sqrt{z}\right)\right) + t\_4\\
t_6 := \sqrt{{z}^{-1}}\\
\mathbf{if}\;t\_5 \leq 10^{-6}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_5 \leq 1:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_6, 0.5, t\_3\right) - \sqrt{x}\right) + t\_4\\
\mathbf{elif}\;t\_5 \leq 2.0005:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_6, 0.5, t\_1\right) + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_3 + t\_1\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right) + t\_2\\
\end{array}
\end{array}
if (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 9.99999999999999955e-7Initial program 7.7%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.4%
Taylor expanded in x around inf
Applied rewrites3.4%
Taylor expanded in x around 0
Applied rewrites18.1%
if 9.99999999999999955e-7 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 1Initial program 98.6%
Taylor expanded in z around inf
lower--.f64N/A
associate-+r+N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6436.0
Applied rewrites36.0%
Taylor expanded in y around inf
Applied rewrites60.4%
if 1 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 2.00050000000000017Initial program 96.1%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites6.0%
Taylor expanded in z around inf
Applied rewrites21.6%
if 2.00050000000000017 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) Initial program 98.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites26.4%
Applied rewrites31.3%
Final simplification32.9%
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 (+ z 1.0)))
(t_3 (sqrt (+ x 1.0)))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_5
(+ (+ (+ (- t_3 (sqrt x)) (- t_1 (sqrt y))) (- t_2 (sqrt z))) t_4))
(t_6 (sqrt (pow z -1.0))))
(if (<= t_5 1e-6)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_5 1.0)
(+ (- (fma t_6 0.5 t_3) (sqrt x)) t_4)
(if (<= t_5 2.0005)
(- (+ (fma t_6 0.5 t_1) t_3) (+ (sqrt x) (sqrt y)))
(- (+ (+ t_1 1.0) t_2) (+ (+ (sqrt z) (sqrt y)) (sqrt x))))))))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((z + 1.0));
double t_3 = sqrt((x + 1.0));
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double t_5 = (((t_3 - sqrt(x)) + (t_1 - sqrt(y))) + (t_2 - sqrt(z))) + t_4;
double t_6 = sqrt(pow(z, -1.0));
double tmp;
if (t_5 <= 1e-6) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_5 <= 1.0) {
tmp = (fma(t_6, 0.5, t_3) - sqrt(x)) + t_4;
} else if (t_5 <= 2.0005) {
tmp = (fma(t_6, 0.5, t_1) + t_3) - (sqrt(x) + sqrt(y));
} else {
tmp = ((t_1 + 1.0) + t_2) - ((sqrt(z) + sqrt(y)) + sqrt(x));
}
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(z + 1.0)) t_3 = sqrt(Float64(x + 1.0)) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_5 = Float64(Float64(Float64(Float64(t_3 - sqrt(x)) + Float64(t_1 - sqrt(y))) + Float64(t_2 - sqrt(z))) + t_4) t_6 = sqrt((z ^ -1.0)) tmp = 0.0 if (t_5 <= 1e-6) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_5 <= 1.0) tmp = Float64(Float64(fma(t_6, 0.5, t_3) - sqrt(x)) + t_4); elseif (t_5 <= 2.0005) tmp = Float64(Float64(fma(t_6, 0.5, t_1) + t_3) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(t_1 + 1.0) + t_2) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]}, Block[{t$95$6 = N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$5, 1e-6], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$5, 1.0], N[(N[(N[(t$95$6 * 0.5 + t$95$3), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision], If[LessEqual[t$95$5, 2.0005], N[(N[(N[(t$95$6 * 0.5 + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$1 + 1.0), $MachinePrecision] + t$95$2), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $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{z + 1}\\
t_3 := \sqrt{x + 1}\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
t_5 := \left(\left(\left(t\_3 - \sqrt{x}\right) + \left(t\_1 - \sqrt{y}\right)\right) + \left(t\_2 - \sqrt{z}\right)\right) + t\_4\\
t_6 := \sqrt{{z}^{-1}}\\
\mathbf{if}\;t\_5 \leq 10^{-6}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_5 \leq 1:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_6, 0.5, t\_3\right) - \sqrt{x}\right) + t\_4\\
\mathbf{elif}\;t\_5 \leq 2.0005:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_6, 0.5, t\_1\right) + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_1 + 1\right) + t\_2\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\\
\end{array}
\end{array}
if (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 9.99999999999999955e-7Initial program 7.7%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.4%
Taylor expanded in x around inf
Applied rewrites3.4%
Taylor expanded in x around 0
Applied rewrites18.1%
if 9.99999999999999955e-7 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 1Initial program 98.6%
Taylor expanded in z around inf
lower--.f64N/A
associate-+r+N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6436.0
Applied rewrites36.0%
Taylor expanded in y around inf
Applied rewrites60.4%
if 1 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 2.00050000000000017Initial program 96.1%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites6.0%
Taylor expanded in z around inf
Applied rewrites21.6%
if 2.00050000000000017 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) Initial program 98.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites26.4%
Taylor expanded in z around inf
Applied rewrites1.9%
Taylor expanded in x around 0
Applied rewrites25.5%
Final simplification31.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 y)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (+ (+ (sqrt z) (sqrt y)) (sqrt x)))
(t_4 (sqrt (+ x 1.0)))
(t_5
(+
(+ (+ (- t_4 (sqrt x)) (- t_1 (sqrt y))) (- t_2 (sqrt z)))
(- (sqrt (+ t 1.0)) (sqrt t)))))
(if (<= t_5 0.0005)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_5 1.0)
(+ (- (+ t_2 t_1) t_3) 1.0)
(if (<= t_5 2.0005)
(- (+ (fma (sqrt (pow z -1.0)) 0.5 t_1) t_4) (+ (sqrt x) (sqrt y)))
(- (+ (+ t_1 1.0) t_2) t_3))))))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((z + 1.0));
double t_3 = (sqrt(z) + sqrt(y)) + sqrt(x);
double t_4 = sqrt((x + 1.0));
double t_5 = (((t_4 - sqrt(x)) + (t_1 - sqrt(y))) + (t_2 - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
double tmp;
if (t_5 <= 0.0005) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_5 <= 1.0) {
tmp = ((t_2 + t_1) - t_3) + 1.0;
} else if (t_5 <= 2.0005) {
tmp = (fma(sqrt(pow(z, -1.0)), 0.5, t_1) + t_4) - (sqrt(x) + sqrt(y));
} else {
tmp = ((t_1 + 1.0) + t_2) - t_3;
}
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(z + 1.0)) t_3 = Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x)) t_4 = sqrt(Float64(x + 1.0)) t_5 = Float64(Float64(Float64(Float64(t_4 - sqrt(x)) + Float64(t_1 - sqrt(y))) + Float64(t_2 - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))) tmp = 0.0 if (t_5 <= 0.0005) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_5 <= 1.0) tmp = Float64(Float64(Float64(t_2 + t_1) - t_3) + 1.0); elseif (t_5 <= 2.0005) tmp = Float64(Float64(fma(sqrt((z ^ -1.0)), 0.5, t_1) + t_4) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(t_1 + 1.0) + t_2) - t_3); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(N[(t$95$4 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, 0.0005], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$5, 1.0], N[(N[(N[(t$95$2 + t$95$1), $MachinePrecision] - t$95$3), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$5, 2.0005], N[(N[(N[(N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$1 + 1.0), $MachinePrecision] + t$95$2), $MachinePrecision] - t$95$3), $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{z + 1}\\
t_3 := \left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\\
t_4 := \sqrt{x + 1}\\
t_5 := \left(\left(\left(t\_4 - \sqrt{x}\right) + \left(t\_1 - \sqrt{y}\right)\right) + \left(t\_2 - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)\\
\mathbf{if}\;t\_5 \leq 0.0005:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_5 \leq 1:\\
\;\;\;\;\left(\left(t\_2 + t\_1\right) - t\_3\right) + 1\\
\mathbf{elif}\;t\_5 \leq 2.0005:\\
\;\;\;\;\left(\mathsf{fma}\left(\sqrt{{z}^{-1}}, 0.5, t\_1\right) + t\_4\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_1 + 1\right) + t\_2\right) - t\_3\\
\end{array}
\end{array}
if (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 5.0000000000000001e-4Initial program 11.3%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.4%
Taylor expanded in x around inf
Applied rewrites3.4%
Taylor expanded in x around 0
Applied rewrites17.4%
if 5.0000000000000001e-4 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 1Initial program 99.1%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.1%
Taylor expanded in z around inf
Applied rewrites1.7%
Taylor expanded in x around 0
Applied rewrites57.6%
if 1 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 2.00050000000000017Initial program 96.1%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites6.0%
Taylor expanded in z around inf
Applied rewrites21.6%
if 2.00050000000000017 < (+.f64 (+.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))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) Initial program 98.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites26.4%
Taylor expanded in z around inf
Applied rewrites1.9%
Taylor expanded in x around 0
Applied rewrites25.5%
Final simplification30.3%
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 (+ z 1.0)))
(t_2 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_3 (sqrt (+ x 1.0)))
(t_4 (sqrt (+ 1.0 y)))
(t_5 (+ (+ (- t_3 (sqrt x)) (- t_4 (sqrt y))) (- t_1 (sqrt z)))))
(if (<= t_5 1e-6)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_5 1.0)
(+ (- (fma (sqrt (pow z -1.0)) 0.5 t_3) (sqrt x)) t_2)
(if (<= t_5 2.0002)
(- (+ (+ (pow (+ (sqrt z) t_1) -1.0) t_4) t_3) (+ (sqrt x) (sqrt y)))
(+
(- (+ 2.0 (fma 0.5 x t_1)) (+ (+ (sqrt z) (sqrt y)) (sqrt x)))
t_2))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = sqrt((t + 1.0)) - sqrt(t);
double t_3 = sqrt((x + 1.0));
double t_4 = sqrt((1.0 + y));
double t_5 = ((t_3 - sqrt(x)) + (t_4 - sqrt(y))) + (t_1 - sqrt(z));
double tmp;
if (t_5 <= 1e-6) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_5 <= 1.0) {
tmp = (fma(sqrt(pow(z, -1.0)), 0.5, t_3) - sqrt(x)) + t_2;
} else if (t_5 <= 2.0002) {
tmp = ((pow((sqrt(z) + t_1), -1.0) + t_4) + t_3) - (sqrt(x) + sqrt(y));
} else {
tmp = ((2.0 + fma(0.5, x, t_1)) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + t_2;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_3 = sqrt(Float64(x + 1.0)) t_4 = sqrt(Float64(1.0 + y)) t_5 = Float64(Float64(Float64(t_3 - sqrt(x)) + Float64(t_4 - sqrt(y))) + Float64(t_1 - sqrt(z))) tmp = 0.0 if (t_5 <= 1e-6) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_5 <= 1.0) tmp = Float64(Float64(fma(sqrt((z ^ -1.0)), 0.5, t_3) - sqrt(x)) + t_2); elseif (t_5 <= 2.0002) tmp = Float64(Float64(Float64((Float64(sqrt(z) + t_1) ^ -1.0) + t_4) + t_3) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_1)) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))) + t_2); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$4 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, 1e-6], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$5, 1.0], N[(N[(N[(N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + t$95$3), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision], If[LessEqual[t$95$5, 2.0002], N[(N[(N[(N[Power[N[(N[Sqrt[z], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := \sqrt{t + 1} - \sqrt{t}\\
t_3 := \sqrt{x + 1}\\
t_4 := \sqrt{1 + y}\\
t_5 := \left(\left(t\_3 - \sqrt{x}\right) + \left(t\_4 - \sqrt{y}\right)\right) + \left(t\_1 - \sqrt{z}\right)\\
\mathbf{if}\;t\_5 \leq 10^{-6}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_5 \leq 1:\\
\;\;\;\;\left(\mathsf{fma}\left(\sqrt{{z}^{-1}}, 0.5, t\_3\right) - \sqrt{x}\right) + t\_2\\
\mathbf{elif}\;t\_5 \leq 2.0002:\\
\;\;\;\;\left(\left({\left(\sqrt{z} + t\_1\right)}^{-1} + t\_4\right) + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_1\right)\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right) + t\_2\\
\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 57.4%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.3%
Taylor expanded in x around inf
Applied rewrites3.3%
Taylor expanded in x around 0
Applied rewrites12.0%
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))) < 1Initial program 98.8%
Taylor expanded in z around inf
lower--.f64N/A
associate-+r+N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6412.2
Applied rewrites12.2%
Taylor expanded in y around inf
Applied rewrites44.2%
if 1 < (+.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.00019999999999998Initial program 95.6%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6496.6
Applied rewrites96.6%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites25.2%
if 2.00019999999999998 < (+.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.6%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites96.4%
Taylor expanded in y around 0
Applied rewrites89.1%
Final simplification38.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 (pow z -1.0)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_4 (sqrt (+ x 1.0)))
(t_5 (sqrt (+ 1.0 y)))
(t_6 (+ (+ (- t_4 (sqrt x)) (- t_5 (sqrt y))) (- t_2 (sqrt z)))))
(if (<= t_6 1e-6)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_6 1.0)
(+ (- (fma t_1 0.5 t_4) (sqrt x)) t_3)
(if (<= t_6 2.0002)
(- (+ (fma t_1 0.5 t_5) t_4) (+ (sqrt x) (sqrt y)))
(+
(- (+ 2.0 (fma 0.5 x t_2)) (+ (+ (sqrt z) (sqrt y)) (sqrt x)))
t_3))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt(pow(z, -1.0));
double t_2 = sqrt((z + 1.0));
double t_3 = sqrt((t + 1.0)) - sqrt(t);
double t_4 = sqrt((x + 1.0));
double t_5 = sqrt((1.0 + y));
double t_6 = ((t_4 - sqrt(x)) + (t_5 - sqrt(y))) + (t_2 - sqrt(z));
double tmp;
if (t_6 <= 1e-6) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_6 <= 1.0) {
tmp = (fma(t_1, 0.5, t_4) - sqrt(x)) + t_3;
} else if (t_6 <= 2.0002) {
tmp = (fma(t_1, 0.5, t_5) + t_4) - (sqrt(x) + sqrt(y));
} else {
tmp = ((2.0 + fma(0.5, x, t_2)) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + t_3;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt((z ^ -1.0)) t_2 = sqrt(Float64(z + 1.0)) t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_4 = sqrt(Float64(x + 1.0)) t_5 = sqrt(Float64(1.0 + y)) t_6 = Float64(Float64(Float64(t_4 - sqrt(x)) + Float64(t_5 - sqrt(y))) + Float64(t_2 - sqrt(z))) tmp = 0.0 if (t_6 <= 1e-6) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_6 <= 1.0) tmp = Float64(Float64(fma(t_1, 0.5, t_4) - sqrt(x)) + t_3); elseif (t_6 <= 2.0002) tmp = Float64(Float64(fma(t_1, 0.5, t_5) + t_4) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_2)) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))) + t_3); end return 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[Power[z, -1.0], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$4 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$5 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$6, 1e-6], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$6, 1.0], N[(N[(N[(t$95$1 * 0.5 + t$95$4), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision], If[LessEqual[t$95$6, 2.0002], N[(N[(N[(t$95$1 * 0.5 + t$95$5), $MachinePrecision] + t$95$4), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$2), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{{z}^{-1}}\\
t_2 := \sqrt{z + 1}\\
t_3 := \sqrt{t + 1} - \sqrt{t}\\
t_4 := \sqrt{x + 1}\\
t_5 := \sqrt{1 + y}\\
t_6 := \left(\left(t\_4 - \sqrt{x}\right) + \left(t\_5 - \sqrt{y}\right)\right) + \left(t\_2 - \sqrt{z}\right)\\
\mathbf{if}\;t\_6 \leq 10^{-6}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_6 \leq 1:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_1, 0.5, t\_4\right) - \sqrt{x}\right) + t\_3\\
\mathbf{elif}\;t\_6 \leq 2.0002:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_1, 0.5, t\_5\right) + t\_4\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_2\right)\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right) + t\_3\\
\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 57.4%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.3%
Taylor expanded in x around inf
Applied rewrites3.3%
Taylor expanded in x around 0
Applied rewrites12.0%
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))) < 1Initial program 98.8%
Taylor expanded in z around inf
lower--.f64N/A
associate-+r+N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6412.2
Applied rewrites12.2%
Taylor expanded in y around inf
Applied rewrites44.2%
if 1 < (+.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.00019999999999998Initial program 95.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites7.0%
Taylor expanded in z around inf
Applied rewrites24.7%
if 2.00019999999999998 < (+.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.6%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites96.4%
Taylor expanded in y around 0
Applied rewrites89.1%
Final simplification38.3%
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 (+ z 1.0)) (sqrt z)))
(t_2
(+
(+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ 1.0 y)) (sqrt y)))
t_1))
(t_3 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_2 1e-6)
(+ (+ (* (+ (sqrt (pow x -1.0)) (sqrt (pow y -1.0))) 0.5) t_1) t_3)
(+ t_2 t_3))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((1.0 + y)) - sqrt(y))) + t_1;
double t_3 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_2 <= 1e-6) {
tmp = (((sqrt(pow(x, -1.0)) + sqrt(pow(y, -1.0))) * 0.5) + t_1) + t_3;
} else {
tmp = t_2 + t_3;
}
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((z + 1.0d0)) - sqrt(z)
t_2 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((1.0d0 + y)) - sqrt(y))) + t_1
t_3 = sqrt((t + 1.0d0)) - sqrt(t)
if (t_2 <= 1d-6) then
tmp = (((sqrt((x ** (-1.0d0))) + sqrt((y ** (-1.0d0)))) * 0.5d0) + t_1) + t_3
else
tmp = t_2 + t_3
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((z + 1.0)) - Math.sqrt(z);
double t_2 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((1.0 + y)) - Math.sqrt(y))) + t_1;
double t_3 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
double tmp;
if (t_2 <= 1e-6) {
tmp = (((Math.sqrt(Math.pow(x, -1.0)) + Math.sqrt(Math.pow(y, -1.0))) * 0.5) + t_1) + t_3;
} else {
tmp = t_2 + t_3;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((z + 1.0)) - math.sqrt(z) t_2 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((1.0 + y)) - math.sqrt(y))) + t_1 t_3 = math.sqrt((t + 1.0)) - math.sqrt(t) tmp = 0 if t_2 <= 1e-6: tmp = (((math.sqrt(math.pow(x, -1.0)) + math.sqrt(math.pow(y, -1.0))) * 0.5) + t_1) + t_3 else: tmp = t_2 + t_3 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y))) + t_1) t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_2 <= 1e-6) tmp = Float64(Float64(Float64(Float64(sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + t_1) + t_3); else tmp = Float64(t_2 + t_3); 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((z + 1.0)) - sqrt(z);
t_2 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((1.0 + y)) - sqrt(y))) + t_1;
t_3 = sqrt((t + 1.0)) - sqrt(t);
tmp = 0.0;
if (t_2 <= 1e-6)
tmp = (((sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + t_1) + t_3;
else
tmp = t_2 + t_3;
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[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, 1e-6], N[(N[(N[(N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] + N[Sqrt[N[Power[y, -1.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision], N[(t$95$2 + t$95$3), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1} - \sqrt{z}\\
t_2 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right) + t\_1\\
t_3 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_2 \leq 10^{-6}:\\
\;\;\;\;\left(\left(\sqrt{{x}^{-1}} + \sqrt{{y}^{-1}}\right) \cdot 0.5 + t\_1\right) + t\_3\\
\mathbf{else}:\\
\;\;\;\;t\_2 + t\_3\\
\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 57.4%
Taylor expanded in y around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6462.9
Applied rewrites62.9%
Taylor expanded in x around inf
Applied rewrites67.5%
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 97.3%
Final simplification93.3%
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 (+ z 1.0)) (sqrt z)))
(t_2 (sqrt (+ x 1.0)))
(t_3 (- t_2 (sqrt x)))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_5 (sqrt (+ 1.0 y)))
(t_6 (+ (+ t_3 (- t_5 (sqrt y))) t_1)))
(if (<= t_6 1.0)
(+ (+ (pow (+ (sqrt x) t_2) -1.0) t_1) t_4)
(if (<= t_6 2.0002)
(+
(/ 0.5 (sqrt t))
(- (fma (sqrt (pow z -1.0)) 0.5 (+ t_2 t_5)) (+ (sqrt x) (sqrt y))))
(+ (+ (+ (- 1.0 (sqrt y)) t_3) t_1) t_4)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = sqrt((x + 1.0));
double t_3 = t_2 - sqrt(x);
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double t_5 = sqrt((1.0 + y));
double t_6 = (t_3 + (t_5 - sqrt(y))) + t_1;
double tmp;
if (t_6 <= 1.0) {
tmp = (pow((sqrt(x) + t_2), -1.0) + t_1) + t_4;
} else if (t_6 <= 2.0002) {
tmp = (0.5 / sqrt(t)) + (fma(sqrt(pow(z, -1.0)), 0.5, (t_2 + t_5)) - (sqrt(x) + sqrt(y)));
} else {
tmp = (((1.0 - sqrt(y)) + t_3) + t_1) + t_4;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = sqrt(Float64(x + 1.0)) t_3 = Float64(t_2 - sqrt(x)) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_5 = sqrt(Float64(1.0 + y)) t_6 = Float64(Float64(t_3 + Float64(t_5 - sqrt(y))) + t_1) tmp = 0.0 if (t_6 <= 1.0) tmp = Float64(Float64((Float64(sqrt(x) + t_2) ^ -1.0) + t_1) + t_4); elseif (t_6 <= 2.0002) tmp = Float64(Float64(0.5 / sqrt(t)) + Float64(fma(sqrt((z ^ -1.0)), 0.5, Float64(t_2 + t_5)) - Float64(sqrt(x) + sqrt(y)))); else tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(y)) + t_3) + t_1) + t_4); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $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[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$6 = N[(N[(t$95$3 + N[(t$95$5 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$6, 1.0], N[(N[(N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$2), $MachinePrecision], -1.0], $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision], If[LessEqual[t$95$6, 2.0002], N[(N[(0.5 / N[Sqrt[t], $MachinePrecision]), $MachinePrecision] + N[(N[(N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + N[(t$95$2 + t$95$5), $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1} - \sqrt{z}\\
t_2 := \sqrt{x + 1}\\
t_3 := t\_2 - \sqrt{x}\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
t_5 := \sqrt{1 + y}\\
t_6 := \left(t\_3 + \left(t\_5 - \sqrt{y}\right)\right) + t\_1\\
\mathbf{if}\;t\_6 \leq 1:\\
\;\;\;\;\left({\left(\sqrt{x} + t\_2\right)}^{-1} + t\_1\right) + t\_4\\
\mathbf{elif}\;t\_6 \leq 2.0002:\\
\;\;\;\;\frac{0.5}{\sqrt{t}} + \left(\mathsf{fma}\left(\sqrt{{z}^{-1}}, 0.5, t\_2 + t\_5\right) - \left(\sqrt{x} + \sqrt{y}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(1 - \sqrt{y}\right) + t\_3\right) + t\_1\right) + t\_4\\
\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))) < 1Initial program 86.8%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
flip--N/A
lift--.f64N/A
flip--N/A
frac-addN/A
lower-/.f64N/A
Applied rewrites87.2%
Taylor expanded in y around 0
Applied rewrites89.0%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6471.2
Applied rewrites71.2%
if 1 < (+.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.00019999999999998Initial program 95.6%
Taylor expanded in z around inf
lower--.f64N/A
associate-+r+N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6441.9
Applied rewrites41.9%
Taylor expanded in t around inf
*-commutativeN/A
lower-*.f64N/A
lower-sqrt.f64N/A
lower-/.f6423.9
Applied rewrites23.9%
Applied rewrites23.9%
if 2.00019999999999998 < (+.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.6%
Taylor expanded in y around 0
lower--.f64N/A
lower-sqrt.f6491.3
Applied rewrites91.3%
Final simplification55.3%
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 (+ z 1.0)))
(t_2 (- t_1 (sqrt z)))
(t_3 (sqrt (+ x 1.0)))
(t_4 (- t_3 (sqrt x)))
(t_5 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_6 (sqrt (+ 1.0 y)))
(t_7 (+ (+ t_4 (- t_6 (sqrt y))) t_2)))
(if (<= t_7 1.0)
(+ (+ (pow (+ (sqrt x) t_3) -1.0) t_2) t_5)
(if (<= t_7 2.0002)
(- (+ (+ (pow (+ (sqrt z) t_1) -1.0) t_6) t_3) (+ (sqrt x) (sqrt y)))
(+ (+ (+ (- 1.0 (sqrt y)) t_4) t_2) t_5)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = t_1 - sqrt(z);
double t_3 = sqrt((x + 1.0));
double t_4 = t_3 - sqrt(x);
double t_5 = sqrt((t + 1.0)) - sqrt(t);
double t_6 = sqrt((1.0 + y));
double t_7 = (t_4 + (t_6 - sqrt(y))) + t_2;
double tmp;
if (t_7 <= 1.0) {
tmp = (pow((sqrt(x) + t_3), -1.0) + t_2) + t_5;
} else if (t_7 <= 2.0002) {
tmp = ((pow((sqrt(z) + t_1), -1.0) + t_6) + t_3) - (sqrt(x) + sqrt(y));
} else {
tmp = (((1.0 - sqrt(y)) + t_4) + t_2) + t_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) :: 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((z + 1.0d0))
t_2 = t_1 - sqrt(z)
t_3 = sqrt((x + 1.0d0))
t_4 = t_3 - sqrt(x)
t_5 = sqrt((t + 1.0d0)) - sqrt(t)
t_6 = sqrt((1.0d0 + y))
t_7 = (t_4 + (t_6 - sqrt(y))) + t_2
if (t_7 <= 1.0d0) then
tmp = (((sqrt(x) + t_3) ** (-1.0d0)) + t_2) + t_5
else if (t_7 <= 2.0002d0) then
tmp = ((((sqrt(z) + t_1) ** (-1.0d0)) + t_6) + t_3) - (sqrt(x) + sqrt(y))
else
tmp = (((1.0d0 - sqrt(y)) + t_4) + t_2) + t_5
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((z + 1.0));
double t_2 = t_1 - Math.sqrt(z);
double t_3 = Math.sqrt((x + 1.0));
double t_4 = t_3 - Math.sqrt(x);
double t_5 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
double t_6 = Math.sqrt((1.0 + y));
double t_7 = (t_4 + (t_6 - Math.sqrt(y))) + t_2;
double tmp;
if (t_7 <= 1.0) {
tmp = (Math.pow((Math.sqrt(x) + t_3), -1.0) + t_2) + t_5;
} else if (t_7 <= 2.0002) {
tmp = ((Math.pow((Math.sqrt(z) + t_1), -1.0) + t_6) + t_3) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = (((1.0 - Math.sqrt(y)) + t_4) + t_2) + t_5;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((z + 1.0)) t_2 = t_1 - math.sqrt(z) t_3 = math.sqrt((x + 1.0)) t_4 = t_3 - math.sqrt(x) t_5 = math.sqrt((t + 1.0)) - math.sqrt(t) t_6 = math.sqrt((1.0 + y)) t_7 = (t_4 + (t_6 - math.sqrt(y))) + t_2 tmp = 0 if t_7 <= 1.0: tmp = (math.pow((math.sqrt(x) + t_3), -1.0) + t_2) + t_5 elif t_7 <= 2.0002: tmp = ((math.pow((math.sqrt(z) + t_1), -1.0) + t_6) + t_3) - (math.sqrt(x) + math.sqrt(y)) else: tmp = (((1.0 - math.sqrt(y)) + t_4) + t_2) + t_5 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = Float64(t_1 - sqrt(z)) t_3 = sqrt(Float64(x + 1.0)) t_4 = Float64(t_3 - sqrt(x)) t_5 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_6 = sqrt(Float64(1.0 + y)) t_7 = Float64(Float64(t_4 + Float64(t_6 - sqrt(y))) + t_2) tmp = 0.0 if (t_7 <= 1.0) tmp = Float64(Float64((Float64(sqrt(x) + t_3) ^ -1.0) + t_2) + t_5); elseif (t_7 <= 2.0002) tmp = Float64(Float64(Float64((Float64(sqrt(z) + t_1) ^ -1.0) + t_6) + t_3) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(y)) + t_4) + t_2) + t_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((z + 1.0));
t_2 = t_1 - sqrt(z);
t_3 = sqrt((x + 1.0));
t_4 = t_3 - sqrt(x);
t_5 = sqrt((t + 1.0)) - sqrt(t);
t_6 = sqrt((1.0 + y));
t_7 = (t_4 + (t_6 - sqrt(y))) + t_2;
tmp = 0.0;
if (t_7 <= 1.0)
tmp = (((sqrt(x) + t_3) ^ -1.0) + t_2) + t_5;
elseif (t_7 <= 2.0002)
tmp = ((((sqrt(z) + t_1) ^ -1.0) + t_6) + t_3) - (sqrt(x) + sqrt(y));
else
tmp = (((1.0 - sqrt(y)) + t_4) + t_2) + t_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[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$7 = N[(N[(t$95$4 + N[(t$95$6 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]}, If[LessEqual[t$95$7, 1.0], N[(N[(N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$3), $MachinePrecision], -1.0], $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$5), $MachinePrecision], If[LessEqual[t$95$7, 2.0002], N[(N[(N[(N[Power[N[(N[Sqrt[z], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision] + t$95$6), $MachinePrecision] + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$5), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := t\_1 - \sqrt{z}\\
t_3 := \sqrt{x + 1}\\
t_4 := t\_3 - \sqrt{x}\\
t_5 := \sqrt{t + 1} - \sqrt{t}\\
t_6 := \sqrt{1 + y}\\
t_7 := \left(t\_4 + \left(t\_6 - \sqrt{y}\right)\right) + t\_2\\
\mathbf{if}\;t\_7 \leq 1:\\
\;\;\;\;\left({\left(\sqrt{x} + t\_3\right)}^{-1} + t\_2\right) + t\_5\\
\mathbf{elif}\;t\_7 \leq 2.0002:\\
\;\;\;\;\left(\left({\left(\sqrt{z} + t\_1\right)}^{-1} + t\_6\right) + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(1 - \sqrt{y}\right) + t\_4\right) + t\_2\right) + t\_5\\
\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))) < 1Initial program 86.8%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
flip--N/A
lift--.f64N/A
flip--N/A
frac-addN/A
lower-/.f64N/A
Applied rewrites87.2%
Taylor expanded in y around 0
Applied rewrites89.0%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6471.2
Applied rewrites71.2%
if 1 < (+.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.00019999999999998Initial program 95.6%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6496.6
Applied rewrites96.6%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites25.2%
if 2.00019999999999998 < (+.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.6%
Taylor expanded in y around 0
lower--.f64N/A
lower-sqrt.f6491.3
Applied rewrites91.3%
Final simplification55.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 (+ z 1.0)))
(t_2 (- t_1 (sqrt z)))
(t_3 (sqrt (+ x 1.0)))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t)))
(t_5 (sqrt (+ 1.0 y)))
(t_6 (+ (+ (- t_3 (sqrt x)) (- t_5 (sqrt y))) t_2)))
(if (<= t_6 1.0)
(+ (+ (pow (+ (sqrt x) t_3) -1.0) t_2) t_4)
(if (<= t_6 2.0002)
(- (+ (+ (pow (+ (sqrt z) t_1) -1.0) t_5) t_3) (+ (sqrt x) (sqrt y)))
(+
(- (+ 2.0 (fma 0.5 x t_1)) (+ (+ (sqrt z) (sqrt y)) (sqrt x)))
t_4)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = t_1 - sqrt(z);
double t_3 = sqrt((x + 1.0));
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double t_5 = sqrt((1.0 + y));
double t_6 = ((t_3 - sqrt(x)) + (t_5 - sqrt(y))) + t_2;
double tmp;
if (t_6 <= 1.0) {
tmp = (pow((sqrt(x) + t_3), -1.0) + t_2) + t_4;
} else if (t_6 <= 2.0002) {
tmp = ((pow((sqrt(z) + t_1), -1.0) + t_5) + t_3) - (sqrt(x) + sqrt(y));
} else {
tmp = ((2.0 + fma(0.5, x, t_1)) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + t_4;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = Float64(t_1 - sqrt(z)) t_3 = sqrt(Float64(x + 1.0)) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_5 = sqrt(Float64(1.0 + y)) t_6 = Float64(Float64(Float64(t_3 - sqrt(x)) + Float64(t_5 - sqrt(y))) + t_2) tmp = 0.0 if (t_6 <= 1.0) tmp = Float64(Float64((Float64(sqrt(x) + t_3) ^ -1.0) + t_2) + t_4); elseif (t_6 <= 2.0002) tmp = Float64(Float64(Float64((Float64(sqrt(z) + t_1) ^ -1.0) + t_5) + t_3) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_1)) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))) + t_4); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$5 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]}, If[LessEqual[t$95$6, 1.0], N[(N[(N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$3), $MachinePrecision], -1.0], $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$4), $MachinePrecision], If[LessEqual[t$95$6, 2.0002], N[(N[(N[(N[Power[N[(N[Sqrt[z], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision] + t$95$5), $MachinePrecision] + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := t\_1 - \sqrt{z}\\
t_3 := \sqrt{x + 1}\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
t_5 := \sqrt{1 + y}\\
t_6 := \left(\left(t\_3 - \sqrt{x}\right) + \left(t\_5 - \sqrt{y}\right)\right) + t\_2\\
\mathbf{if}\;t\_6 \leq 1:\\
\;\;\;\;\left({\left(\sqrt{x} + t\_3\right)}^{-1} + t\_2\right) + t\_4\\
\mathbf{elif}\;t\_6 \leq 2.0002:\\
\;\;\;\;\left(\left({\left(\sqrt{z} + t\_1\right)}^{-1} + t\_5\right) + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_1\right)\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right) + t\_4\\
\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))) < 1Initial program 86.8%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
flip--N/A
lift--.f64N/A
flip--N/A
frac-addN/A
lower-/.f64N/A
Applied rewrites87.2%
Taylor expanded in y around 0
Applied rewrites89.0%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6471.2
Applied rewrites71.2%
if 1 < (+.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.00019999999999998Initial program 95.6%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6496.6
Applied rewrites96.6%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites25.2%
if 2.00019999999999998 < (+.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.6%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites96.4%
Taylor expanded in y around 0
Applied rewrites89.1%
Final simplification55.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 (+ z 1.0)))
(t_2 (sqrt (+ x 1.0)))
(t_3 (sqrt (+ 1.0 y)))
(t_4 (+ (+ (- t_2 (sqrt x)) (- t_3 (sqrt y))) (- t_1 (sqrt z))))
(t_5 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_4 1e-6)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_4 2.0)
(+ (- (+ (pow (+ (sqrt y) t_3) -1.0) t_2) (sqrt x)) t_5)
(+
(- (+ 2.0 (fma 0.5 x t_1)) (+ (+ (sqrt z) (sqrt y)) (sqrt x)))
t_5)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = sqrt((x + 1.0));
double t_3 = sqrt((1.0 + y));
double t_4 = ((t_2 - sqrt(x)) + (t_3 - sqrt(y))) + (t_1 - sqrt(z));
double t_5 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_4 <= 1e-6) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_4 <= 2.0) {
tmp = ((pow((sqrt(y) + t_3), -1.0) + t_2) - sqrt(x)) + t_5;
} else {
tmp = ((2.0 + fma(0.5, x, t_1)) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + t_5;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = sqrt(Float64(x + 1.0)) t_3 = sqrt(Float64(1.0 + y)) t_4 = Float64(Float64(Float64(t_2 - sqrt(x)) + Float64(t_3 - sqrt(y))) + Float64(t_1 - sqrt(z))) t_5 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_4 <= 1e-6) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_4 <= 2.0) tmp = Float64(Float64(Float64((Float64(sqrt(y) + t_3) ^ -1.0) + t_2) - sqrt(x)) + t_5); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_1)) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))) + t_5); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(t$95$2 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$3 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 1e-6], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$4, 2.0], N[(N[(N[(N[Power[N[(N[Sqrt[y], $MachinePrecision] + t$95$3), $MachinePrecision], -1.0], $MachinePrecision] + t$95$2), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$5), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$5), $MachinePrecision]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := \sqrt{x + 1}\\
t_3 := \sqrt{1 + y}\\
t_4 := \left(\left(t\_2 - \sqrt{x}\right) + \left(t\_3 - \sqrt{y}\right)\right) + \left(t\_1 - \sqrt{z}\right)\\
t_5 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_4 \leq 10^{-6}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_4 \leq 2:\\
\;\;\;\;\left(\left({\left(\sqrt{y} + t\_3\right)}^{-1} + t\_2\right) - \sqrt{x}\right) + t\_5\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_1\right)\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right) + t\_5\\
\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 57.4%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.3%
Taylor expanded in x around inf
Applied rewrites3.3%
Taylor expanded in x around 0
Applied rewrites12.0%
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))) < 2Initial program 97.3%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6498.2
Applied rewrites98.2%
Taylor expanded in z around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6446.0
Applied rewrites46.0%
if 2 < (+.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 97.3%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites95.1%
Taylor expanded in y around 0
Applied rewrites88.2%
Final simplification47.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 (+ z 1.0)))
(t_2 (sqrt (+ x 1.0)))
(t_3 (sqrt (+ 1.0 y)))
(t_4 (+ (+ (- t_2 (sqrt x)) (- t_3 (sqrt y))) (- t_1 (sqrt z)))))
(if (<= t_4 0.0005)
(* (sqrt (pow x -1.0)) 0.5)
(if (or (<= t_4 1.0) (not (<= t_4 2.0)))
(+ (- (+ t_1 t_3) (+ (+ (sqrt z) (sqrt y)) (sqrt x))) 1.0)
(- (+ t_2 t_3) (+ (sqrt x) (sqrt y)))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = sqrt((x + 1.0));
double t_3 = sqrt((1.0 + y));
double t_4 = ((t_2 - sqrt(x)) + (t_3 - sqrt(y))) + (t_1 - sqrt(z));
double tmp;
if (t_4 <= 0.0005) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if ((t_4 <= 1.0) || !(t_4 <= 2.0)) {
tmp = ((t_1 + t_3) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + 1.0;
} else {
tmp = (t_2 + t_3) - (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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_1 = sqrt((z + 1.0d0))
t_2 = sqrt((x + 1.0d0))
t_3 = sqrt((1.0d0 + y))
t_4 = ((t_2 - sqrt(x)) + (t_3 - sqrt(y))) + (t_1 - sqrt(z))
if (t_4 <= 0.0005d0) then
tmp = sqrt((x ** (-1.0d0))) * 0.5d0
else if ((t_4 <= 1.0d0) .or. (.not. (t_4 <= 2.0d0))) then
tmp = ((t_1 + t_3) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + 1.0d0
else
tmp = (t_2 + t_3) - (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 t_1 = Math.sqrt((z + 1.0));
double t_2 = Math.sqrt((x + 1.0));
double t_3 = Math.sqrt((1.0 + y));
double t_4 = ((t_2 - Math.sqrt(x)) + (t_3 - Math.sqrt(y))) + (t_1 - Math.sqrt(z));
double tmp;
if (t_4 <= 0.0005) {
tmp = Math.sqrt(Math.pow(x, -1.0)) * 0.5;
} else if ((t_4 <= 1.0) || !(t_4 <= 2.0)) {
tmp = ((t_1 + t_3) - ((Math.sqrt(z) + Math.sqrt(y)) + Math.sqrt(x))) + 1.0;
} else {
tmp = (t_2 + t_3) - (Math.sqrt(x) + Math.sqrt(y));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((z + 1.0)) t_2 = math.sqrt((x + 1.0)) t_3 = math.sqrt((1.0 + y)) t_4 = ((t_2 - math.sqrt(x)) + (t_3 - math.sqrt(y))) + (t_1 - math.sqrt(z)) tmp = 0 if t_4 <= 0.0005: tmp = math.sqrt(math.pow(x, -1.0)) * 0.5 elif (t_4 <= 1.0) or not (t_4 <= 2.0): tmp = ((t_1 + t_3) - ((math.sqrt(z) + math.sqrt(y)) + math.sqrt(x))) + 1.0 else: tmp = (t_2 + t_3) - (math.sqrt(x) + math.sqrt(y)) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = sqrt(Float64(x + 1.0)) t_3 = sqrt(Float64(1.0 + y)) t_4 = Float64(Float64(Float64(t_2 - sqrt(x)) + Float64(t_3 - sqrt(y))) + Float64(t_1 - sqrt(z))) tmp = 0.0 if (t_4 <= 0.0005) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif ((t_4 <= 1.0) || !(t_4 <= 2.0)) tmp = Float64(Float64(Float64(t_1 + t_3) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x))) + 1.0); else tmp = Float64(Float64(t_2 + t_3) - Float64(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)
t_1 = sqrt((z + 1.0));
t_2 = sqrt((x + 1.0));
t_3 = sqrt((1.0 + y));
t_4 = ((t_2 - sqrt(x)) + (t_3 - sqrt(y))) + (t_1 - sqrt(z));
tmp = 0.0;
if (t_4 <= 0.0005)
tmp = sqrt((x ^ -1.0)) * 0.5;
elseif ((t_4 <= 1.0) || ~((t_4 <= 2.0)))
tmp = ((t_1 + t_3) - ((sqrt(z) + sqrt(y)) + sqrt(x))) + 1.0;
else
tmp = (t_2 + t_3) - (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_] := Block[{t$95$1 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(t$95$2 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$3 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 0.0005], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[Or[LessEqual[t$95$4, 1.0], N[Not[LessEqual[t$95$4, 2.0]], $MachinePrecision]], N[(N[(N[(t$95$1 + t$95$3), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(t$95$2 + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := \sqrt{x + 1}\\
t_3 := \sqrt{1 + y}\\
t_4 := \left(\left(t\_2 - \sqrt{x}\right) + \left(t\_3 - \sqrt{y}\right)\right) + \left(t\_1 - \sqrt{z}\right)\\
\mathbf{if}\;t\_4 \leq 0.0005:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_4 \leq 1 \lor \neg \left(t\_4 \leq 2\right):\\
\;\;\;\;\left(\left(t\_1 + t\_3\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right) + 1\\
\mathbf{else}:\\
\;\;\;\;\left(t\_2 + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\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))) < 5.0000000000000001e-4Initial program 57.8%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites3.2%
Taylor expanded in x around 0
Applied rewrites11.9%
if 5.0000000000000001e-4 < (+.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))) < 1 or 2 < (+.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.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites18.7%
Taylor expanded in z around inf
Applied rewrites1.7%
Taylor expanded in x around 0
Applied rewrites38.5%
if 1 < (+.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))) < 2Initial program 96.1%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites6.1%
Taylor expanded in z around inf
Applied rewrites23.4%
Final simplification28.9%
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 z) (sqrt y)) (sqrt x)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (sqrt (+ x 1.0)))
(t_4 (sqrt (+ 1.0 y)))
(t_5 (+ (+ (- t_3 (sqrt x)) (- t_4 (sqrt y))) (- t_2 (sqrt z)))))
(if (<= t_5 0.0005)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_5 1.0)
(+ (- (+ t_2 t_4) t_1) 1.0)
(if (<= t_5 2.0)
(- (+ t_3 t_4) (+ (sqrt x) (sqrt y)))
(- (+ (+ t_4 1.0) t_2) t_1))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = (sqrt(z) + sqrt(y)) + sqrt(x);
double t_2 = sqrt((z + 1.0));
double t_3 = sqrt((x + 1.0));
double t_4 = sqrt((1.0 + y));
double t_5 = ((t_3 - sqrt(x)) + (t_4 - sqrt(y))) + (t_2 - sqrt(z));
double tmp;
if (t_5 <= 0.0005) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_5 <= 1.0) {
tmp = ((t_2 + t_4) - t_1) + 1.0;
} else if (t_5 <= 2.0) {
tmp = (t_3 + t_4) - (sqrt(x) + sqrt(y));
} else {
tmp = ((t_4 + 1.0) + t_2) - 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) :: t_4
real(8) :: t_5
real(8) :: tmp
t_1 = (sqrt(z) + sqrt(y)) + sqrt(x)
t_2 = sqrt((z + 1.0d0))
t_3 = sqrt((x + 1.0d0))
t_4 = sqrt((1.0d0 + y))
t_5 = ((t_3 - sqrt(x)) + (t_4 - sqrt(y))) + (t_2 - sqrt(z))
if (t_5 <= 0.0005d0) then
tmp = sqrt((x ** (-1.0d0))) * 0.5d0
else if (t_5 <= 1.0d0) then
tmp = ((t_2 + t_4) - t_1) + 1.0d0
else if (t_5 <= 2.0d0) then
tmp = (t_3 + t_4) - (sqrt(x) + sqrt(y))
else
tmp = ((t_4 + 1.0d0) + t_2) - 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(z) + Math.sqrt(y)) + Math.sqrt(x);
double t_2 = Math.sqrt((z + 1.0));
double t_3 = Math.sqrt((x + 1.0));
double t_4 = Math.sqrt((1.0 + y));
double t_5 = ((t_3 - Math.sqrt(x)) + (t_4 - Math.sqrt(y))) + (t_2 - Math.sqrt(z));
double tmp;
if (t_5 <= 0.0005) {
tmp = Math.sqrt(Math.pow(x, -1.0)) * 0.5;
} else if (t_5 <= 1.0) {
tmp = ((t_2 + t_4) - t_1) + 1.0;
} else if (t_5 <= 2.0) {
tmp = (t_3 + t_4) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = ((t_4 + 1.0) + t_2) - t_1;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = (math.sqrt(z) + math.sqrt(y)) + math.sqrt(x) t_2 = math.sqrt((z + 1.0)) t_3 = math.sqrt((x + 1.0)) t_4 = math.sqrt((1.0 + y)) t_5 = ((t_3 - math.sqrt(x)) + (t_4 - math.sqrt(y))) + (t_2 - math.sqrt(z)) tmp = 0 if t_5 <= 0.0005: tmp = math.sqrt(math.pow(x, -1.0)) * 0.5 elif t_5 <= 1.0: tmp = ((t_2 + t_4) - t_1) + 1.0 elif t_5 <= 2.0: tmp = (t_3 + t_4) - (math.sqrt(x) + math.sqrt(y)) else: tmp = ((t_4 + 1.0) + t_2) - t_1 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x)) t_2 = sqrt(Float64(z + 1.0)) t_3 = sqrt(Float64(x + 1.0)) t_4 = sqrt(Float64(1.0 + y)) t_5 = Float64(Float64(Float64(t_3 - sqrt(x)) + Float64(t_4 - sqrt(y))) + Float64(t_2 - sqrt(z))) tmp = 0.0 if (t_5 <= 0.0005) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_5 <= 1.0) tmp = Float64(Float64(Float64(t_2 + t_4) - t_1) + 1.0); elseif (t_5 <= 2.0) tmp = Float64(Float64(t_3 + t_4) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(t_4 + 1.0) + t_2) - 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(z) + sqrt(y)) + sqrt(x);
t_2 = sqrt((z + 1.0));
t_3 = sqrt((x + 1.0));
t_4 = sqrt((1.0 + y));
t_5 = ((t_3 - sqrt(x)) + (t_4 - sqrt(y))) + (t_2 - sqrt(z));
tmp = 0.0;
if (t_5 <= 0.0005)
tmp = sqrt((x ^ -1.0)) * 0.5;
elseif (t_5 <= 1.0)
tmp = ((t_2 + t_4) - t_1) + 1.0;
elseif (t_5 <= 2.0)
tmp = (t_3 + t_4) - (sqrt(x) + sqrt(y));
else
tmp = ((t_4 + 1.0) + t_2) - 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[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$4 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, 0.0005], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$5, 1.0], N[(N[(N[(t$95$2 + t$95$4), $MachinePrecision] - t$95$1), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$5, 2.0], N[(N[(t$95$3 + t$95$4), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$4 + 1.0), $MachinePrecision] + t$95$2), $MachinePrecision] - t$95$1), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\\
t_2 := \sqrt{z + 1}\\
t_3 := \sqrt{x + 1}\\
t_4 := \sqrt{1 + y}\\
t_5 := \left(\left(t\_3 - \sqrt{x}\right) + \left(t\_4 - \sqrt{y}\right)\right) + \left(t\_2 - \sqrt{z}\right)\\
\mathbf{if}\;t\_5 \leq 0.0005:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_5 \leq 1:\\
\;\;\;\;\left(\left(t\_2 + t\_4\right) - t\_1\right) + 1\\
\mathbf{elif}\;t\_5 \leq 2:\\
\;\;\;\;\left(t\_3 + t\_4\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_4 + 1\right) + t\_2\right) - t\_1\\
\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))) < 5.0000000000000001e-4Initial program 57.8%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites3.2%
Taylor expanded in x around 0
Applied rewrites11.9%
if 5.0000000000000001e-4 < (+.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))) < 1Initial program 99.2%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.1%
Taylor expanded in z around inf
Applied rewrites1.6%
Taylor expanded in x around 0
Applied rewrites31.8%
if 1 < (+.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))) < 2Initial program 96.1%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites6.1%
Taylor expanded in z around inf
Applied rewrites23.4%
if 2 < (+.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 97.3%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites54.0%
Taylor expanded in z around inf
Applied rewrites2.0%
Taylor expanded in x around 0
Applied rewrites53.7%
Final simplification28.9%
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 (+ z 1.0)))
(t_2 (sqrt (+ x 1.0)))
(t_3 (sqrt (pow x -1.0)))
(t_4 (sqrt (+ 1.0 y)))
(t_5 (+ (+ (- t_2 (sqrt x)) (- t_4 (sqrt y))) (- t_1 (sqrt z)))))
(if (<= t_5 0.998)
(* t_3 0.5)
(if (<= t_5 1.0)
(+ (- (fma t_3 0.5 t_1) (+ (sqrt z) (sqrt y))) 1.0)
(if (<= t_5 2.5)
(- (+ t_2 t_4) (+ (sqrt x) (sqrt y)))
(- (+ (+ t_4 1.0) t_2) (+ (sqrt y) (sqrt x))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = sqrt((x + 1.0));
double t_3 = sqrt(pow(x, -1.0));
double t_4 = sqrt((1.0 + y));
double t_5 = ((t_2 - sqrt(x)) + (t_4 - sqrt(y))) + (t_1 - sqrt(z));
double tmp;
if (t_5 <= 0.998) {
tmp = t_3 * 0.5;
} else if (t_5 <= 1.0) {
tmp = (fma(t_3, 0.5, t_1) - (sqrt(z) + sqrt(y))) + 1.0;
} else if (t_5 <= 2.5) {
tmp = (t_2 + t_4) - (sqrt(x) + sqrt(y));
} else {
tmp = ((t_4 + 1.0) + t_2) - (sqrt(y) + sqrt(x));
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = sqrt(Float64(x + 1.0)) t_3 = sqrt((x ^ -1.0)) t_4 = sqrt(Float64(1.0 + y)) t_5 = Float64(Float64(Float64(t_2 - sqrt(x)) + Float64(t_4 - sqrt(y))) + Float64(t_1 - sqrt(z))) tmp = 0.0 if (t_5 <= 0.998) tmp = Float64(t_3 * 0.5); elseif (t_5 <= 1.0) tmp = Float64(Float64(fma(t_3, 0.5, t_1) - Float64(sqrt(z) + sqrt(y))) + 1.0); elseif (t_5 <= 2.5) tmp = Float64(Float64(t_2 + t_4) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(t_4 + 1.0) + t_2) - Float64(sqrt(y) + sqrt(x))); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(t$95$2 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$4 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, 0.998], N[(t$95$3 * 0.5), $MachinePrecision], If[LessEqual[t$95$5, 1.0], N[(N[(N[(t$95$3 * 0.5 + t$95$1), $MachinePrecision] - N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[t$95$5, 2.5], N[(N[(t$95$2 + t$95$4), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$4 + 1.0), $MachinePrecision] + t$95$2), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := \sqrt{x + 1}\\
t_3 := \sqrt{{x}^{-1}}\\
t_4 := \sqrt{1 + y}\\
t_5 := \left(\left(t\_2 - \sqrt{x}\right) + \left(t\_4 - \sqrt{y}\right)\right) + \left(t\_1 - \sqrt{z}\right)\\
\mathbf{if}\;t\_5 \leq 0.998:\\
\;\;\;\;t\_3 \cdot 0.5\\
\mathbf{elif}\;t\_5 \leq 1:\\
\;\;\;\;\left(\mathsf{fma}\left(t\_3, 0.5, t\_1\right) - \left(\sqrt{z} + \sqrt{y}\right)\right) + 1\\
\mathbf{elif}\;t\_5 \leq 2.5:\\
\;\;\;\;\left(t\_2 + t\_4\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_4 + 1\right) + t\_2\right) - \left(\sqrt{y} + \sqrt{x}\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))) < 0.998Initial program 61.9%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites3.2%
Taylor expanded in x around 0
Applied rewrites11.9%
if 0.998 < (+.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))) < 1Initial program 99.2%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.1%
Taylor expanded in x around inf
Applied rewrites4.5%
Taylor expanded in y around 0
Applied rewrites20.0%
if 1 < (+.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.5Initial program 95.5%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites9.9%
Taylor expanded in z around inf
Applied rewrites23.6%
if 2.5 < (+.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 99.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites51.8%
Taylor expanded in y around inf
Applied rewrites51.8%
Taylor expanded in z around 0
Applied rewrites51.8%
Final simplification24.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 (+ x 1.0)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (- (sqrt (+ 1.0 y)) (sqrt y)))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_3 1e-6)
(+
t_4
(+
(- t_2 (sqrt z))
(fma (sqrt (pow y -1.0)) 0.5 (pow (+ (sqrt x) t_1) -1.0))))
(+
(+ (/ (- (+ z 1.0) z) (+ (sqrt z) t_2)) (+ (- t_1 (sqrt x)) t_3))
t_4))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((x + 1.0));
double t_2 = sqrt((z + 1.0));
double t_3 = sqrt((1.0 + y)) - sqrt(y);
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_3 <= 1e-6) {
tmp = t_4 + ((t_2 - sqrt(z)) + fma(sqrt(pow(y, -1.0)), 0.5, pow((sqrt(x) + t_1), -1.0)));
} else {
tmp = ((((z + 1.0) - z) / (sqrt(z) + t_2)) + ((t_1 - sqrt(x)) + t_3)) + t_4;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(x + 1.0)) t_2 = sqrt(Float64(z + 1.0)) t_3 = Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_3 <= 1e-6) tmp = Float64(t_4 + Float64(Float64(t_2 - sqrt(z)) + fma(sqrt((y ^ -1.0)), 0.5, (Float64(sqrt(x) + t_1) ^ -1.0)))); else tmp = Float64(Float64(Float64(Float64(Float64(z + 1.0) - z) / Float64(sqrt(z) + t_2)) + Float64(Float64(t_1 - sqrt(x)) + t_3)) + t_4); end return 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[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 1e-6], N[(t$95$4 + N[(N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[Power[y, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(z + 1.0), $MachinePrecision] - z), $MachinePrecision] / N[(N[Sqrt[z], $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$1 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{x + 1}\\
t_2 := \sqrt{z + 1}\\
t_3 := \sqrt{1 + y} - \sqrt{y}\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_3 \leq 10^{-6}:\\
\;\;\;\;t\_4 + \left(\left(t\_2 - \sqrt{z}\right) + \mathsf{fma}\left(\sqrt{{y}^{-1}}, 0.5, {\left(\sqrt{x} + t\_1\right)}^{-1}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\frac{\left(z + 1\right) - z}{\sqrt{z} + t\_2} + \left(\left(t\_1 - \sqrt{x}\right) + t\_3\right)\right) + t\_4\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) < 9.99999999999999955e-7Initial program 86.0%
Taylor expanded in y around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
Applied rewrites90.5%
if 9.99999999999999955e-7 < (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) Initial program 98.2%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6498.7
Applied rewrites98.7%
Final simplification94.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 (+ x 1.0)))
(t_2 (- (sqrt (+ z 1.0)) (sqrt z)))
(t_3 (- (sqrt (+ 1.0 y)) (sqrt y)))
(t_4 (sqrt (+ t 1.0))))
(if (<= t_3 1e-6)
(+
(- t_4 (sqrt t))
(+ t_2 (fma (sqrt (pow y -1.0)) 0.5 (pow (+ (sqrt x) t_1) -1.0))))
(+
(+ (+ (- t_1 (sqrt x)) t_3) t_2)
(/ (- (+ t 1.0) t) (+ (sqrt t) t_4))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((x + 1.0));
double t_2 = sqrt((z + 1.0)) - sqrt(z);
double t_3 = sqrt((1.0 + y)) - sqrt(y);
double t_4 = sqrt((t + 1.0));
double tmp;
if (t_3 <= 1e-6) {
tmp = (t_4 - sqrt(t)) + (t_2 + fma(sqrt(pow(y, -1.0)), 0.5, pow((sqrt(x) + t_1), -1.0)));
} else {
tmp = (((t_1 - sqrt(x)) + t_3) + t_2) + (((t + 1.0) - t) / (sqrt(t) + t_4));
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(x + 1.0)) t_2 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_3 = Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) t_4 = sqrt(Float64(t + 1.0)) tmp = 0.0 if (t_3 <= 1e-6) tmp = Float64(Float64(t_4 - sqrt(t)) + Float64(t_2 + fma(sqrt((y ^ -1.0)), 0.5, (Float64(sqrt(x) + t_1) ^ -1.0)))); else tmp = Float64(Float64(Float64(Float64(t_1 - sqrt(x)) + t_3) + t_2) + Float64(Float64(Float64(t + 1.0) - t) / Float64(sqrt(t) + t_4))); end return 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[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$3, 1e-6], N[(N[(t$95$4 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + N[(N[Sqrt[N[Power[y, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(t$95$1 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision] + t$95$2), $MachinePrecision] + N[(N[(N[(t + 1.0), $MachinePrecision] - t), $MachinePrecision] / N[(N[Sqrt[t], $MachinePrecision] + t$95$4), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{x + 1}\\
t_2 := \sqrt{z + 1} - \sqrt{z}\\
t_3 := \sqrt{1 + y} - \sqrt{y}\\
t_4 := \sqrt{t + 1}\\
\mathbf{if}\;t\_3 \leq 10^{-6}:\\
\;\;\;\;\left(t\_4 - \sqrt{t}\right) + \left(t\_2 + \mathsf{fma}\left(\sqrt{{y}^{-1}}, 0.5, {\left(\sqrt{x} + t\_1\right)}^{-1}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(t\_1 - \sqrt{x}\right) + t\_3\right) + t\_2\right) + \frac{\left(t + 1\right) - t}{\sqrt{t} + t\_4}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) < 9.99999999999999955e-7Initial program 86.0%
Taylor expanded in y around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
Applied rewrites90.5%
if 9.99999999999999955e-7 < (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) Initial program 98.2%
lift--.f64N/A
flip--N/A
lower-/.f64N/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lift-sqrt.f64N/A
lift-sqrt.f64N/A
rem-square-sqrtN/A
lower--.f64N/A
+-commutativeN/A
lower-+.f6498.4
Applied rewrites98.4%
Final simplification94.3%
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 (+ x 1.0)))
(t_2 (- (sqrt (+ z 1.0)) (sqrt z)))
(t_3 (- (sqrt (+ 1.0 y)) (sqrt y)))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_3 1e-6)
(+ t_4 (+ t_2 (fma (sqrt (pow y -1.0)) 0.5 (pow (+ (sqrt x) t_1) -1.0))))
(+ (+ (+ (- t_1 (sqrt x)) t_3) t_2) t_4))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((x + 1.0));
double t_2 = sqrt((z + 1.0)) - sqrt(z);
double t_3 = sqrt((1.0 + y)) - sqrt(y);
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_3 <= 1e-6) {
tmp = t_4 + (t_2 + fma(sqrt(pow(y, -1.0)), 0.5, pow((sqrt(x) + t_1), -1.0)));
} else {
tmp = (((t_1 - sqrt(x)) + t_3) + t_2) + t_4;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(x + 1.0)) t_2 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_3 = Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_3 <= 1e-6) tmp = Float64(t_4 + Float64(t_2 + fma(sqrt((y ^ -1.0)), 0.5, (Float64(sqrt(x) + t_1) ^ -1.0)))); else tmp = Float64(Float64(Float64(Float64(t_1 - sqrt(x)) + t_3) + t_2) + t_4); end return 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[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 1e-6], N[(t$95$4 + N[(t$95$2 + N[(N[Sqrt[N[Power[y, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$1), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(t$95$1 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$4), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{x + 1}\\
t_2 := \sqrt{z + 1} - \sqrt{z}\\
t_3 := \sqrt{1 + y} - \sqrt{y}\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_3 \leq 10^{-6}:\\
\;\;\;\;t\_4 + \left(t\_2 + \mathsf{fma}\left(\sqrt{{y}^{-1}}, 0.5, {\left(\sqrt{x} + t\_1\right)}^{-1}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(t\_1 - \sqrt{x}\right) + t\_3\right) + t\_2\right) + t\_4\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) < 9.99999999999999955e-7Initial program 86.0%
Taylor expanded in y around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6489.1
Applied rewrites89.1%
Applied rewrites90.5%
if 9.99999999999999955e-7 < (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y)) Initial program 98.2%
Final simplification94.2%
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 (+ x 1.0)))
(t_2 (sqrt (+ 1.0 y)))
(t_3
(+
(+ (- t_1 (sqrt x)) (- t_2 (sqrt y)))
(- (sqrt (+ z 1.0)) (sqrt z)))))
(if (<= t_3 0.9999999999995)
(* (sqrt (pow x -1.0)) 0.5)
(if (<= t_3 2.5)
(- (+ t_1 t_2) (+ (sqrt x) (sqrt y)))
(- (+ (+ t_2 1.0) t_1) (+ (sqrt y) (sqrt x)))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((x + 1.0));
double t_2 = sqrt((1.0 + y));
double t_3 = ((t_1 - sqrt(x)) + (t_2 - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
double tmp;
if (t_3 <= 0.9999999999995) {
tmp = sqrt(pow(x, -1.0)) * 0.5;
} else if (t_3 <= 2.5) {
tmp = (t_1 + t_2) - (sqrt(x) + sqrt(y));
} else {
tmp = ((t_2 + 1.0) + t_1) - (sqrt(y) + 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) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = sqrt((x + 1.0d0))
t_2 = sqrt((1.0d0 + y))
t_3 = ((t_1 - sqrt(x)) + (t_2 - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))
if (t_3 <= 0.9999999999995d0) then
tmp = sqrt((x ** (-1.0d0))) * 0.5d0
else if (t_3 <= 2.5d0) then
tmp = (t_1 + t_2) - (sqrt(x) + sqrt(y))
else
tmp = ((t_2 + 1.0d0) + t_1) - (sqrt(y) + 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 t_1 = Math.sqrt((x + 1.0));
double t_2 = Math.sqrt((1.0 + y));
double t_3 = ((t_1 - Math.sqrt(x)) + (t_2 - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z));
double tmp;
if (t_3 <= 0.9999999999995) {
tmp = Math.sqrt(Math.pow(x, -1.0)) * 0.5;
} else if (t_3 <= 2.5) {
tmp = (t_1 + t_2) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = ((t_2 + 1.0) + t_1) - (Math.sqrt(y) + Math.sqrt(x));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((x + 1.0)) t_2 = math.sqrt((1.0 + y)) t_3 = ((t_1 - math.sqrt(x)) + (t_2 - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z)) tmp = 0 if t_3 <= 0.9999999999995: tmp = math.sqrt(math.pow(x, -1.0)) * 0.5 elif t_3 <= 2.5: tmp = (t_1 + t_2) - (math.sqrt(x) + math.sqrt(y)) else: tmp = ((t_2 + 1.0) + t_1) - (math.sqrt(y) + math.sqrt(x)) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(x + 1.0)) t_2 = sqrt(Float64(1.0 + y)) t_3 = Float64(Float64(Float64(t_1 - sqrt(x)) + Float64(t_2 - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) tmp = 0.0 if (t_3 <= 0.9999999999995) tmp = Float64(sqrt((x ^ -1.0)) * 0.5); elseif (t_3 <= 2.5) tmp = Float64(Float64(t_1 + t_2) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(t_2 + 1.0) + t_1) - Float64(sqrt(y) + sqrt(x))); 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((x + 1.0));
t_2 = sqrt((1.0 + y));
t_3 = ((t_1 - sqrt(x)) + (t_2 - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
tmp = 0.0;
if (t_3 <= 0.9999999999995)
tmp = sqrt((x ^ -1.0)) * 0.5;
elseif (t_3 <= 2.5)
tmp = (t_1 + t_2) - (sqrt(x) + sqrt(y));
else
tmp = ((t_2 + 1.0) + t_1) - (sqrt(y) + 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_] := Block[{t$95$1 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$1 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(t$95$2 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.9999999999995], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$3, 2.5], N[(N[(t$95$1 + t$95$2), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$2 + 1.0), $MachinePrecision] + t$95$1), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{x + 1}\\
t_2 := \sqrt{1 + y}\\
t_3 := \left(\left(t\_1 - \sqrt{x}\right) + \left(t\_2 - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\\
\mathbf{if}\;t\_3 \leq 0.9999999999995:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\mathbf{elif}\;t\_3 \leq 2.5:\\
\;\;\;\;\left(t\_1 + t\_2\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_2 + 1\right) + t\_1\right) - \left(\sqrt{y} + \sqrt{x}\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))) < 0.99999999999949996Initial program 64.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites3.2%
Taylor expanded in x around 0
Applied rewrites11.8%
if 0.99999999999949996 < (+.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.5Initial program 97.0%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites7.0%
Taylor expanded in z around inf
Applied rewrites15.2%
if 2.5 < (+.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 99.6%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites51.8%
Taylor expanded in y around inf
Applied rewrites51.8%
Taylor expanded in z around 0
Applied rewrites51.8%
Final simplification18.9%
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 (+ z 1.0)) (sqrt z)))
(t_2 (sqrt (+ x 1.0)))
(t_3 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= (- t_2 (sqrt x)) 0.998)
(+ (+ (pow (+ (sqrt x) t_2) -1.0) t_1) t_3)
(+
(+ (+ (fma 0.5 x (- 1.0 (sqrt x))) (- (sqrt (+ 1.0 y)) (sqrt y))) t_1)
t_3))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = sqrt((x + 1.0));
double t_3 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if ((t_2 - sqrt(x)) <= 0.998) {
tmp = (pow((sqrt(x) + t_2), -1.0) + t_1) + t_3;
} else {
tmp = ((fma(0.5, x, (1.0 - sqrt(x))) + (sqrt((1.0 + y)) - sqrt(y))) + t_1) + t_3;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = sqrt(Float64(x + 1.0)) t_3 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (Float64(t_2 - sqrt(x)) <= 0.998) tmp = Float64(Float64((Float64(sqrt(x) + t_2) ^ -1.0) + t_1) + t_3); else tmp = Float64(Float64(Float64(fma(0.5, x, Float64(1.0 - sqrt(x))) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y))) + t_1) + t_3); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$2 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.998], N[(N[(N[Power[N[(N[Sqrt[x], $MachinePrecision] + t$95$2), $MachinePrecision], -1.0], $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision], N[(N[(N[(N[(0.5 * x + N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1} - \sqrt{z}\\
t_2 := \sqrt{x + 1}\\
t_3 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_2 - \sqrt{x} \leq 0.998:\\
\;\;\;\;\left({\left(\sqrt{x} + t\_2\right)}^{-1} + t\_1\right) + t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(0.5, x, 1 - \sqrt{x}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right) + t\_1\right) + t\_3\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.998Initial program 86.3%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
flip--N/A
lift--.f64N/A
flip--N/A
frac-addN/A
lower-/.f64N/A
Applied rewrites87.8%
Taylor expanded in y around 0
Applied rewrites89.4%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6451.0
Applied rewrites51.0%
if 0.998 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) Initial program 97.2%
Taylor expanded in x around 0
+-commutativeN/A
associate--l+N/A
lower-fma.f64N/A
lower--.f64N/A
lower-sqrt.f6496.9
Applied rewrites96.9%
Final simplification74.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 (+ z 1.0)) (sqrt z)))
(t_2 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= y 7.5e+27)
(+
(+ (- (- (+ (fma 0.5 x 1.0) (sqrt (+ 1.0 y))) (sqrt y)) (sqrt x)) t_1)
t_2)
(+ (+ (pow (+ (sqrt x) (sqrt (+ x 1.0))) -1.0) t_1) t_2))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (y <= 7.5e+27) {
tmp = ((((fma(0.5, x, 1.0) + sqrt((1.0 + y))) - sqrt(y)) - sqrt(x)) + t_1) + t_2;
} else {
tmp = (pow((sqrt(x) + sqrt((x + 1.0))), -1.0) + t_1) + t_2;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (y <= 7.5e+27) tmp = Float64(Float64(Float64(Float64(Float64(fma(0.5, x, 1.0) + sqrt(Float64(1.0 + y))) - sqrt(y)) - sqrt(x)) + t_1) + t_2); else tmp = Float64(Float64((Float64(sqrt(x) + sqrt(Float64(x + 1.0))) ^ -1.0) + t_1) + t_2); end return 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[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 7.5e+27], N[(N[(N[(N[(N[(N[(0.5 * x + 1.0), $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision], N[(N[(N[Power[N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1} - \sqrt{z}\\
t_2 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;y \leq 7.5 \cdot 10^{+27}:\\
\;\;\;\;\left(\left(\left(\left(\mathsf{fma}\left(0.5, x, 1\right) + \sqrt{1 + y}\right) - \sqrt{y}\right) - \sqrt{x}\right) + t\_1\right) + t\_2\\
\mathbf{else}:\\
\;\;\;\;\left({\left(\sqrt{x} + \sqrt{x + 1}\right)}^{-1} + t\_1\right) + t\_2\\
\end{array}
\end{array}
if y < 7.5000000000000002e27Initial program 96.5%
Taylor expanded in x around 0
+-commutativeN/A
associate--r+N/A
lower--.f64N/A
lower--.f64N/A
+-commutativeN/A
associate-+r+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6455.6
Applied rewrites55.6%
if 7.5000000000000002e27 < y Initial program 86.8%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
flip--N/A
lift--.f64N/A
flip--N/A
frac-addN/A
lower-/.f64N/A
Applied rewrites87.4%
Taylor expanded in y around 0
Applied rewrites89.0%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6488.7
Applied rewrites88.7%
Final simplification71.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 (<= y 2.2e+32) (- (+ (sqrt (+ x 1.0)) (sqrt (+ 1.0 y))) (+ (sqrt x) (sqrt y))) (* (sqrt (pow x -1.0)) 0.5)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (y <= 2.2e+32) {
tmp = (sqrt((x + 1.0)) + sqrt((1.0 + y))) - (sqrt(x) + sqrt(y));
} else {
tmp = sqrt(pow(x, -1.0)) * 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) :: tmp
if (y <= 2.2d+32) then
tmp = (sqrt((x + 1.0d0)) + sqrt((1.0d0 + y))) - (sqrt(x) + sqrt(y))
else
tmp = sqrt((x ** (-1.0d0))) * 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 tmp;
if (y <= 2.2e+32) {
tmp = (Math.sqrt((x + 1.0)) + Math.sqrt((1.0 + y))) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = Math.sqrt(Math.pow(x, -1.0)) * 0.5;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if y <= 2.2e+32: tmp = (math.sqrt((x + 1.0)) + math.sqrt((1.0 + y))) - (math.sqrt(x) + math.sqrt(y)) else: tmp = math.sqrt(math.pow(x, -1.0)) * 0.5 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (y <= 2.2e+32) tmp = Float64(Float64(sqrt(Float64(x + 1.0)) + sqrt(Float64(1.0 + y))) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(sqrt((x ^ -1.0)) * 0.5); 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 <= 2.2e+32)
tmp = (sqrt((x + 1.0)) + sqrt((1.0 + y))) - (sqrt(x) + sqrt(y));
else
tmp = sqrt((x ^ -1.0)) * 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_] := If[LessEqual[y, 2.2e+32], N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.2 \cdot 10^{+32}:\\
\;\;\;\;\left(\sqrt{x + 1} + \sqrt{1 + y}\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\end{array}
\end{array}
if y < 2.20000000000000001e32Initial program 96.5%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites19.4%
Taylor expanded in z around inf
Applied rewrites23.2%
if 2.20000000000000001e32 < y Initial program 86.8%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites3.7%
Taylor expanded in x around 0
Applied rewrites8.5%
Final simplification16.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 (<= y 2.2e+32) (- (+ (sqrt y) (sqrt (+ x 1.0))) (+ (sqrt y) (sqrt x))) (* (sqrt (pow x -1.0)) 0.5)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (y <= 2.2e+32) {
tmp = (sqrt(y) + sqrt((x + 1.0))) - (sqrt(y) + sqrt(x));
} else {
tmp = sqrt(pow(x, -1.0)) * 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) :: tmp
if (y <= 2.2d+32) then
tmp = (sqrt(y) + sqrt((x + 1.0d0))) - (sqrt(y) + sqrt(x))
else
tmp = sqrt((x ** (-1.0d0))) * 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 tmp;
if (y <= 2.2e+32) {
tmp = (Math.sqrt(y) + Math.sqrt((x + 1.0))) - (Math.sqrt(y) + Math.sqrt(x));
} else {
tmp = Math.sqrt(Math.pow(x, -1.0)) * 0.5;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if y <= 2.2e+32: tmp = (math.sqrt(y) + math.sqrt((x + 1.0))) - (math.sqrt(y) + math.sqrt(x)) else: tmp = math.sqrt(math.pow(x, -1.0)) * 0.5 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (y <= 2.2e+32) tmp = Float64(Float64(sqrt(y) + sqrt(Float64(x + 1.0))) - Float64(sqrt(y) + sqrt(x))); else tmp = Float64(sqrt((x ^ -1.0)) * 0.5); 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 <= 2.2e+32)
tmp = (sqrt(y) + sqrt((x + 1.0))) - (sqrt(y) + sqrt(x));
else
tmp = sqrt((x ^ -1.0)) * 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_] := If[LessEqual[y, 2.2e+32], N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 2.2 \cdot 10^{+32}:\\
\;\;\;\;\left(\sqrt{y} + \sqrt{x + 1}\right) - \left(\sqrt{y} + \sqrt{x}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\end{array}
\end{array}
if y < 2.20000000000000001e32Initial program 96.5%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites19.4%
Taylor expanded in y around inf
Applied rewrites18.6%
Taylor expanded in y around inf
Applied rewrites11.6%
if 2.20000000000000001e32 < y Initial program 86.8%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites3.7%
Taylor expanded in x around 0
Applied rewrites8.5%
Final simplification10.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 (<= x 5.8e-64) (- (sqrt z) (+ (sqrt y) (sqrt x))) (* (sqrt (pow x -1.0)) 0.5)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (x <= 5.8e-64) {
tmp = sqrt(z) - (sqrt(y) + sqrt(x));
} else {
tmp = sqrt(pow(x, -1.0)) * 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) :: tmp
if (x <= 5.8d-64) then
tmp = sqrt(z) - (sqrt(y) + sqrt(x))
else
tmp = sqrt((x ** (-1.0d0))) * 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 tmp;
if (x <= 5.8e-64) {
tmp = Math.sqrt(z) - (Math.sqrt(y) + Math.sqrt(x));
} else {
tmp = Math.sqrt(Math.pow(x, -1.0)) * 0.5;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if x <= 5.8e-64: tmp = math.sqrt(z) - (math.sqrt(y) + math.sqrt(x)) else: tmp = math.sqrt(math.pow(x, -1.0)) * 0.5 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (x <= 5.8e-64) tmp = Float64(sqrt(z) - Float64(sqrt(y) + sqrt(x))); else tmp = Float64(sqrt((x ^ -1.0)) * 0.5); 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 (x <= 5.8e-64)
tmp = sqrt(z) - (sqrt(y) + sqrt(x));
else
tmp = sqrt((x ^ -1.0)) * 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_] := If[LessEqual[x, 5.8e-64], N[(N[Sqrt[z], $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;x \leq 5.8 \cdot 10^{-64}:\\
\;\;\;\;\sqrt{z} - \left(\sqrt{y} + \sqrt{x}\right)\\
\mathbf{else}:\\
\;\;\;\;\sqrt{{x}^{-1}} \cdot 0.5\\
\end{array}
\end{array}
if x < 5.7999999999999998e-64Initial program 97.7%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites16.9%
Taylor expanded in z around inf
Applied rewrites2.1%
Taylor expanded in y around inf
Applied rewrites3.8%
if 5.7999999999999998e-64 < x Initial program 87.8%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites7.9%
Taylor expanded in x around inf
Applied rewrites16.3%
Taylor expanded in x around 0
Applied rewrites8.8%
Final simplification6.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (* (sqrt (pow x -1.0)) 0.5))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return sqrt(pow(x, -1.0)) * 0.5;
}
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))) * 0.5d0
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return Math.sqrt(Math.pow(x, -1.0)) * 0.5;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return math.sqrt(math.pow(x, -1.0)) * 0.5
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(sqrt((x ^ -1.0)) * 0.5) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = sqrt((x ^ -1.0)) * 0.5;
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[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\sqrt{{x}^{-1}} \cdot 0.5
\end{array}
Initial program 91.9%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites11.6%
Taylor expanded in x around inf
Applied rewrites11.7%
Taylor expanded in x around 0
Applied rewrites7.7%
Final simplification7.7%
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 x)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return 0.5 / 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.5d0 / 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.5 / Math.sqrt(x);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return 0.5 / math.sqrt(x)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(0.5 / sqrt(x)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = 0.5 / 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.5 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\frac{0.5}{\sqrt{x}}
\end{array}
Initial program 91.9%
Taylor expanded in t around inf
lower--.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
Applied rewrites11.6%
Taylor expanded in x around inf
Applied rewrites11.7%
Taylor expanded in x around 0
Applied rewrites7.7%
Applied rewrites7.7%
Final simplification7.7%
(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 2024271
(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))))