
(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 21 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t) :precision binary64 (+ (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z))) (- (sqrt (+ t 1.0)) (sqrt t))))
double code(double x, double y, double z, double t) {
return (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function
public static double code(double x, double y, double z, double t) {
return (((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}
def code(x, y, z, t): return (((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))) end
function tmp = code(x, y, z, t) tmp = (((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)
\end{array}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 y)))
(t_2 (pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0))
(t_3 (+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))))
(if (<= t_3 0.0)
(+
(+
(* (+ (sqrt (pow x -1.0)) (sqrt (pow y -1.0))) 0.5)
(- (sqrt (+ z 1.0)) (sqrt z)))
(- (sqrt (+ t 1.0)) (sqrt t)))
(if (<= t_3 1.02)
(- (+ (+ (sqrt (+ 1.0 x)) (pow (+ t_1 (sqrt y)) -1.0)) t_2) (sqrt x))
(-
(+ (+ t_1 1.0) (+ t_2 (pow (+ (sqrt (+ 1.0 t)) (sqrt t)) -1.0)))
(+ (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 = pow((sqrt((1.0 + z)) + sqrt(z)), -1.0);
double t_3 = (sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y));
double tmp;
if (t_3 <= 0.0) {
tmp = (((sqrt(pow(x, -1.0)) + sqrt(pow(y, -1.0))) * 0.5) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
} else if (t_3 <= 1.02) {
tmp = ((sqrt((1.0 + x)) + pow((t_1 + sqrt(y)), -1.0)) + t_2) - sqrt(x);
} else {
tmp = ((t_1 + 1.0) + (t_2 + pow((sqrt((1.0 + t)) + sqrt(t)), -1.0))) - (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((1.0d0 + y))
t_2 = (sqrt((1.0d0 + z)) + sqrt(z)) ** (-1.0d0)
t_3 = (sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))
if (t_3 <= 0.0d0) then
tmp = (((sqrt((x ** (-1.0d0))) + sqrt((y ** (-1.0d0)))) * 0.5d0) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
else if (t_3 <= 1.02d0) then
tmp = ((sqrt((1.0d0 + x)) + ((t_1 + sqrt(y)) ** (-1.0d0))) + t_2) - sqrt(x)
else
tmp = ((t_1 + 1.0d0) + (t_2 + ((sqrt((1.0d0 + t)) + sqrt(t)) ** (-1.0d0)))) - (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((1.0 + y));
double t_2 = Math.pow((Math.sqrt((1.0 + z)) + Math.sqrt(z)), -1.0);
double t_3 = (Math.sqrt((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y));
double tmp;
if (t_3 <= 0.0) {
tmp = (((Math.sqrt(Math.pow(x, -1.0)) + Math.sqrt(Math.pow(y, -1.0))) * 0.5) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
} else if (t_3 <= 1.02) {
tmp = ((Math.sqrt((1.0 + x)) + Math.pow((t_1 + Math.sqrt(y)), -1.0)) + t_2) - Math.sqrt(x);
} else {
tmp = ((t_1 + 1.0) + (t_2 + Math.pow((Math.sqrt((1.0 + t)) + Math.sqrt(t)), -1.0))) - (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((1.0 + y)) t_2 = math.pow((math.sqrt((1.0 + z)) + math.sqrt(z)), -1.0) t_3 = (math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y)) tmp = 0 if t_3 <= 0.0: tmp = (((math.sqrt(math.pow(x, -1.0)) + math.sqrt(math.pow(y, -1.0))) * 0.5) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t)) elif t_3 <= 1.02: tmp = ((math.sqrt((1.0 + x)) + math.pow((t_1 + math.sqrt(y)), -1.0)) + t_2) - math.sqrt(x) else: tmp = ((t_1 + 1.0) + (t_2 + math.pow((math.sqrt((1.0 + t)) + math.sqrt(t)), -1.0))) - (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(1.0 + y)) t_2 = Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0 t_3 = Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(Float64(Float64(Float64(sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))); elseif (t_3 <= 1.02) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + (Float64(t_1 + sqrt(y)) ^ -1.0)) + t_2) - sqrt(x)); else tmp = Float64(Float64(Float64(t_1 + 1.0) + Float64(t_2 + (Float64(sqrt(Float64(1.0 + t)) + sqrt(t)) ^ -1.0))) - 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((1.0 + y));
t_2 = (sqrt((1.0 + z)) + sqrt(z)) ^ -1.0;
t_3 = (sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y));
tmp = 0.0;
if (t_3 <= 0.0)
tmp = (((sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
elseif (t_3 <= 1.02)
tmp = ((sqrt((1.0 + x)) + ((t_1 + sqrt(y)) ^ -1.0)) + t_2) - sqrt(x);
else
tmp = ((t_1 + 1.0) + (t_2 + ((sqrt((1.0 + t)) + sqrt(t)) ^ -1.0))) - (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[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]}, Block[{t$95$3 = 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]}, If[LessEqual[t$95$3, 0.0], 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] + 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], If[LessEqual[t$95$3, 1.02], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Power[N[(t$95$1 + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$1 + 1.0), $MachinePrecision] + N[(t$95$2 + N[Power[N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] + N[Sqrt[t], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $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{1 + y}\\
t_2 := {\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1}\\
t_3 := \left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\left(\left(\sqrt{{x}^{-1}} + \sqrt{{y}^{-1}}\right) \cdot 0.5 + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)\\
\mathbf{elif}\;t\_3 \leq 1.02:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + {\left(t\_1 + \sqrt{y}\right)}^{-1}\right) + t\_2\right) - \sqrt{x}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_1 + 1\right) + \left(t\_2 + {\left(\sqrt{1 + t} + \sqrt{t}\right)}^{-1}\right)\right) - \left(\sqrt{y} + \sqrt{x}\right)\\
\end{array}
\end{array}
if (+.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))) < 0.0Initial program 64.8%
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
lower-+.f64N/A
lower-sqrt.f6470.9
Applied rewrites70.9%
Taylor expanded in x around inf
Applied rewrites79.3%
if 0.0 < (+.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))) < 1.02Initial program 95.9%
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.3
Applied rewrites96.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-+.f6496.5
Applied rewrites96.5%
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-+.f6497.2
Applied rewrites97.2%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites33.4%
if 1.02 < (+.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))) Initial program 97.1%
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%
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.1
Applied rewrites99.1%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites97.4%
Final simplification60.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 (pow (+ (sqrt (+ 1.0 t)) (sqrt t)) -1.0))
(t_2
(+
(pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0)
(pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0))))
(if (<= (- (sqrt (+ x 1.0)) (sqrt x)) 0.01)
(+ (fma (sqrt (pow x -1.0)) 0.5 t_1) t_2)
(- (+ (fma 0.5 x 1.0) (+ t_2 t_1)) (sqrt x)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = pow((sqrt((1.0 + t)) + sqrt(t)), -1.0);
double t_2 = pow((sqrt((1.0 + z)) + sqrt(z)), -1.0) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0);
double tmp;
if ((sqrt((x + 1.0)) - sqrt(x)) <= 0.01) {
tmp = fma(sqrt(pow(x, -1.0)), 0.5, t_1) + t_2;
} else {
tmp = (fma(0.5, x, 1.0) + (t_2 + t_1)) - sqrt(x);
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(1.0 + t)) + sqrt(t)) ^ -1.0 t_2 = Float64((Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0)) tmp = 0.0 if (Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) <= 0.01) tmp = Float64(fma(sqrt((x ^ -1.0)), 0.5, t_1) + t_2); else tmp = Float64(Float64(fma(0.5, x, 1.0) + Float64(t_2 + t_1)) - 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[Power[N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] + N[Sqrt[t], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]}, Block[{t$95$2 = N[(N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.01], N[(N[(N[Sqrt[N[Power[x, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5 + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision], N[(N[(N[(0.5 * x + 1.0), $MachinePrecision] + N[(t$95$2 + t$95$1), $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := {\left(\sqrt{1 + t} + \sqrt{t}\right)}^{-1}\\
t_2 := {\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\\
\mathbf{if}\;\sqrt{x + 1} - \sqrt{x} \leq 0.01:\\
\;\;\;\;\mathsf{fma}\left(\sqrt{{x}^{-1}}, 0.5, t\_1\right) + t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(\mathsf{fma}\left(0.5, x, 1\right) + \left(t\_2 + t\_1\right)\right) - \sqrt{x}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.0100000000000000002Initial program 82.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-+.f6482.4
Applied rewrites82.4%
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-+.f6482.4
Applied rewrites82.4%
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-+.f6483.0
Applied rewrites83.0%
Taylor expanded in x around inf
associate-+r+N/A
lower-+.f64N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
Applied rewrites99.4%
if 0.0100000000000000002 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) Initial program 97.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-+.f6498.5
Applied rewrites98.5%
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.1
Applied rewrites99.1%
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.2
Applied rewrites99.2%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites97.7%
Final simplification98.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)))
(t_3
(+
(+ (- (sqrt (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
t_1)))
(if (<= t_3 0.0)
(+
(+ (* (+ (sqrt (pow x -1.0)) (sqrt (pow y -1.0))) 0.5) t_1)
(- t_2 (sqrt t)))
(if (<= t_3 2.95)
(-
(+
(+ (sqrt (+ 1.0 x)) (pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0))
(pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0))
(sqrt x))
(+
(+ (+ (fma 0.5 x (- 1.0 (sqrt x))) (- 1.0 (sqrt y))) t_1)
(/ (- (+ t 1.0) t) (+ (sqrt t) 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));
double t_3 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1;
double tmp;
if (t_3 <= 0.0) {
tmp = (((sqrt(pow(x, -1.0)) + sqrt(pow(y, -1.0))) * 0.5) + t_1) + (t_2 - sqrt(t));
} else if (t_3 <= 2.95) {
tmp = ((sqrt((1.0 + x)) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0)) + pow((sqrt((1.0 + z)) + sqrt(z)), -1.0)) - sqrt(x);
} else {
tmp = ((fma(0.5, x, (1.0 - sqrt(x))) + (1.0 - sqrt(y))) + t_1) + (((t + 1.0) - t) / (sqrt(t) + 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 = sqrt(Float64(t + 1.0)) t_3 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_1) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(Float64(Float64(Float64(sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + t_1) + Float64(t_2 - sqrt(t))); elseif (t_3 <= 2.95) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0)) + (Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0)) - sqrt(x)); else tmp = Float64(Float64(Float64(fma(0.5, x, Float64(1.0 - sqrt(x))) + Float64(1.0 - sqrt(y))) + t_1) + Float64(Float64(Float64(t + 1.0) - t) / Float64(sqrt(t) + 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[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = 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] + t$95$1), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], 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] + N[(t$95$2 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 2.95], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(0.5 * x + N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + N[(N[(N[(t + 1.0), $MachinePrecision] - t), $MachinePrecision] / N[(N[Sqrt[t], $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]), $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}\\
t_3 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_1\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\left(\left(\sqrt{{x}^{-1}} + \sqrt{{y}^{-1}}\right) \cdot 0.5 + t\_1\right) + \left(t\_2 - \sqrt{t}\right)\\
\mathbf{elif}\;t\_3 \leq 2.95:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\right) + {\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1}\right) - \sqrt{x}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(0.5, x, 1 - \sqrt{x}\right) + \left(1 - \sqrt{y}\right)\right) + t\_1\right) + \frac{\left(t + 1\right) - t}{\sqrt{t} + 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))) < 0.0Initial program 38.9%
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
lower-+.f64N/A
lower-sqrt.f6448.6
Applied rewrites48.6%
Taylor expanded in x around inf
Applied rewrites63.5%
if 0.0 < (+.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.9500000000000002Initial program 96.1%
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.9
Applied rewrites96.9%
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-+.f6497.2
Applied rewrites97.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-+.f6497.7
Applied rewrites97.7%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites34.5%
if 2.9500000000000002 < (+.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.7%
Taylor expanded in x around 0
+-commutativeN/A
associate--l+N/A
lower-fma.f64N/A
lower--.f64N/A
lower-sqrt.f6498.5
Applied rewrites98.5%
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.3
Applied rewrites99.3%
Taylor expanded in y around 0
lower--.f64N/A
lower-sqrt.f6497.3
Applied rewrites97.3%
Final simplification45.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 (+ y 1.0)) (sqrt y)))
(t_2 (- (sqrt (+ z 1.0)) (sqrt z)))
(t_3 (+ (+ (- (sqrt (+ x 1.0)) (sqrt x)) t_1) t_2))
(t_4 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_3 0.0)
(+ (+ (* (+ (sqrt (pow x -1.0)) (sqrt (pow y -1.0))) 0.5) t_2) t_4)
(if (<= t_3 2.2)
(-
(+
(+ (sqrt (+ 1.0 x)) (pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0))
(pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0))
(sqrt x))
(+ (+ (+ (- 1.0 (sqrt x)) t_1) 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((y + 1.0)) - sqrt(y);
double t_2 = sqrt((z + 1.0)) - sqrt(z);
double t_3 = ((sqrt((x + 1.0)) - sqrt(x)) + t_1) + t_2;
double t_4 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_3 <= 0.0) {
tmp = (((sqrt(pow(x, -1.0)) + sqrt(pow(y, -1.0))) * 0.5) + t_2) + t_4;
} else if (t_3 <= 2.2) {
tmp = ((sqrt((1.0 + x)) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0)) + pow((sqrt((1.0 + z)) + sqrt(z)), -1.0)) - sqrt(x);
} else {
tmp = (((1.0 - sqrt(x)) + t_1) + t_2) + t_4;
}
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((y + 1.0d0)) - sqrt(y)
t_2 = sqrt((z + 1.0d0)) - sqrt(z)
t_3 = ((sqrt((x + 1.0d0)) - sqrt(x)) + t_1) + t_2
t_4 = sqrt((t + 1.0d0)) - sqrt(t)
if (t_3 <= 0.0d0) then
tmp = (((sqrt((x ** (-1.0d0))) + sqrt((y ** (-1.0d0)))) * 0.5d0) + t_2) + t_4
else if (t_3 <= 2.2d0) then
tmp = ((sqrt((1.0d0 + x)) + ((sqrt((1.0d0 + y)) + sqrt(y)) ** (-1.0d0))) + ((sqrt((1.0d0 + z)) + sqrt(z)) ** (-1.0d0))) - sqrt(x)
else
tmp = (((1.0d0 - sqrt(x)) + t_1) + t_2) + t_4
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((y + 1.0)) - Math.sqrt(y);
double t_2 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
double t_3 = ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) + t_1) + t_2;
double t_4 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
double tmp;
if (t_3 <= 0.0) {
tmp = (((Math.sqrt(Math.pow(x, -1.0)) + Math.sqrt(Math.pow(y, -1.0))) * 0.5) + t_2) + t_4;
} else if (t_3 <= 2.2) {
tmp = ((Math.sqrt((1.0 + x)) + Math.pow((Math.sqrt((1.0 + y)) + Math.sqrt(y)), -1.0)) + Math.pow((Math.sqrt((1.0 + z)) + Math.sqrt(z)), -1.0)) - Math.sqrt(x);
} else {
tmp = (((1.0 - Math.sqrt(x)) + t_1) + t_2) + t_4;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((y + 1.0)) - math.sqrt(y) t_2 = math.sqrt((z + 1.0)) - math.sqrt(z) t_3 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + t_1) + t_2 t_4 = math.sqrt((t + 1.0)) - math.sqrt(t) tmp = 0 if t_3 <= 0.0: tmp = (((math.sqrt(math.pow(x, -1.0)) + math.sqrt(math.pow(y, -1.0))) * 0.5) + t_2) + t_4 elif t_3 <= 2.2: tmp = ((math.sqrt((1.0 + x)) + math.pow((math.sqrt((1.0 + y)) + math.sqrt(y)), -1.0)) + math.pow((math.sqrt((1.0 + z)) + math.sqrt(z)), -1.0)) - math.sqrt(x) else: tmp = (((1.0 - math.sqrt(x)) + t_1) + t_2) + t_4 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(y + 1.0)) - sqrt(y)) t_2 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_3 = Float64(Float64(Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) + t_1) + t_2) t_4 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_3 <= 0.0) tmp = Float64(Float64(Float64(Float64(sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + t_2) + t_4); elseif (t_3 <= 2.2) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0)) + (Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0)) - sqrt(x)); else tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(x)) + t_1) + t_2) + t_4); 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((y + 1.0)) - sqrt(y);
t_2 = sqrt((z + 1.0)) - sqrt(z);
t_3 = ((sqrt((x + 1.0)) - sqrt(x)) + t_1) + t_2;
t_4 = sqrt((t + 1.0)) - sqrt(t);
tmp = 0.0;
if (t_3 <= 0.0)
tmp = (((sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + t_2) + t_4;
elseif (t_3 <= 2.2)
tmp = ((sqrt((1.0 + x)) + ((sqrt((1.0 + y)) + sqrt(y)) ^ -1.0)) + ((sqrt((1.0 + z)) + sqrt(z)) ^ -1.0)) - sqrt(x);
else
tmp = (((1.0 - sqrt(x)) + t_1) + t_2) + t_4;
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[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $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[(N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$4 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, 0.0], 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$2), $MachinePrecision] + t$95$4), $MachinePrecision], If[LessEqual[t$95$3, 2.2], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $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{y + 1} - \sqrt{y}\\
t_2 := \sqrt{z + 1} - \sqrt{z}\\
t_3 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + t\_1\right) + t\_2\\
t_4 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_3 \leq 0:\\
\;\;\;\;\left(\left(\sqrt{{x}^{-1}} + \sqrt{{y}^{-1}}\right) \cdot 0.5 + t\_2\right) + t\_4\\
\mathbf{elif}\;t\_3 \leq 2.2:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\right) + {\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1}\right) - \sqrt{x}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(1 - \sqrt{x}\right) + t\_1\right) + t\_2\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))) < 0.0Initial program 38.9%
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
lower-+.f64N/A
lower-sqrt.f6448.6
Applied rewrites48.6%
Taylor expanded in x around inf
Applied rewrites63.5%
if 0.0 < (+.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.2000000000000002Initial program 96.1%
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.9
Applied rewrites96.9%
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-+.f6497.2
Applied rewrites97.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-+.f6497.7
Applied rewrites97.7%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites34.2%
if 2.2000000000000002 < (+.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.7%
Taylor expanded in x around 0
lower--.f64N/A
lower-sqrt.f6497.4
Applied rewrites97.4%
Final simplification45.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(if (<= (- (sqrt (+ x 1.0)) (sqrt x)) 0.01)
(+
(+
(* (+ (sqrt (pow x -1.0)) (sqrt (pow y -1.0))) 0.5)
(- (sqrt (+ z 1.0)) (sqrt z)))
(- (sqrt (+ t 1.0)) (sqrt t)))
(-
(+
(fma 0.5 x 1.0)
(+
(+
(pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0)
(pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0))
(pow (+ (sqrt (+ 1.0 t)) (sqrt t)) -1.0)))
(sqrt x))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if ((sqrt((x + 1.0)) - sqrt(x)) <= 0.01) {
tmp = (((sqrt(pow(x, -1.0)) + sqrt(pow(y, -1.0))) * 0.5) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
} else {
tmp = (fma(0.5, x, 1.0) + ((pow((sqrt((1.0 + z)) + sqrt(z)), -1.0) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0)) + pow((sqrt((1.0 + t)) + sqrt(t)), -1.0))) - sqrt(x);
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) <= 0.01) tmp = Float64(Float64(Float64(Float64(sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))); else tmp = Float64(Float64(fma(0.5, x, 1.0) + Float64(Float64((Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0)) + (Float64(sqrt(Float64(1.0 + t)) + sqrt(t)) ^ -1.0))) - 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_] := If[LessEqual[N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.01], 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] + 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], N[(N[(N[(0.5 * x + 1.0), $MachinePrecision] + N[(N[(N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] + N[Sqrt[t], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{x + 1} - \sqrt{x} \leq 0.01:\\
\;\;\;\;\left(\left(\sqrt{{x}^{-1}} + \sqrt{{y}^{-1}}\right) \cdot 0.5 + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\mathsf{fma}\left(0.5, x, 1\right) + \left(\left({\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\right) + {\left(\sqrt{1 + t} + \sqrt{t}\right)}^{-1}\right)\right) - \sqrt{x}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.0100000000000000002Initial program 82.2%
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
lower-+.f64N/A
lower-sqrt.f6436.1
Applied rewrites36.1%
Taylor expanded in x around inf
Applied rewrites40.1%
if 0.0100000000000000002 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) Initial program 97.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-+.f6498.5
Applied rewrites98.5%
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.1
Applied rewrites99.1%
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.2
Applied rewrites99.2%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites97.7%
Final simplification71.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(if (<= (- (sqrt (+ x 1.0)) (sqrt x)) 0.6)
(+
(+
(* (+ (sqrt (pow x -1.0)) (sqrt (pow y -1.0))) 0.5)
(- (sqrt (+ z 1.0)) (sqrt z)))
(- (sqrt (+ t 1.0)) (sqrt t)))
(-
(+
(+ 1.0 (pow (+ (sqrt (+ 1.0 t)) (sqrt t)) -1.0))
(+
(pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0)
(pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0)))
(sqrt x))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if ((sqrt((x + 1.0)) - sqrt(x)) <= 0.6) {
tmp = (((sqrt(pow(x, -1.0)) + sqrt(pow(y, -1.0))) * 0.5) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
} else {
tmp = ((1.0 + pow((sqrt((1.0 + t)) + sqrt(t)), -1.0)) + (pow((sqrt((1.0 + z)) + sqrt(z)), -1.0) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0))) - sqrt(x);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: tmp
if ((sqrt((x + 1.0d0)) - sqrt(x)) <= 0.6d0) then
tmp = (((sqrt((x ** (-1.0d0))) + sqrt((y ** (-1.0d0)))) * 0.5d0) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
else
tmp = ((1.0d0 + ((sqrt((1.0d0 + t)) + sqrt(t)) ** (-1.0d0))) + (((sqrt((1.0d0 + z)) + sqrt(z)) ** (-1.0d0)) + ((sqrt((1.0d0 + y)) + sqrt(y)) ** (-1.0d0)))) - sqrt(x)
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double tmp;
if ((Math.sqrt((x + 1.0)) - Math.sqrt(x)) <= 0.6) {
tmp = (((Math.sqrt(Math.pow(x, -1.0)) + Math.sqrt(Math.pow(y, -1.0))) * 0.5) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
} else {
tmp = ((1.0 + Math.pow((Math.sqrt((1.0 + t)) + Math.sqrt(t)), -1.0)) + (Math.pow((Math.sqrt((1.0 + z)) + Math.sqrt(z)), -1.0) + Math.pow((Math.sqrt((1.0 + y)) + Math.sqrt(y)), -1.0))) - Math.sqrt(x);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if (math.sqrt((x + 1.0)) - math.sqrt(x)) <= 0.6: tmp = (((math.sqrt(math.pow(x, -1.0)) + math.sqrt(math.pow(y, -1.0))) * 0.5) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + (math.sqrt((t + 1.0)) - math.sqrt(t)) else: tmp = ((1.0 + math.pow((math.sqrt((1.0 + t)) + math.sqrt(t)), -1.0)) + (math.pow((math.sqrt((1.0 + z)) + math.sqrt(z)), -1.0) + math.pow((math.sqrt((1.0 + y)) + math.sqrt(y)), -1.0))) - math.sqrt(x) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (Float64(sqrt(Float64(x + 1.0)) - sqrt(x)) <= 0.6) tmp = Float64(Float64(Float64(Float64(sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))); else tmp = Float64(Float64(Float64(1.0 + (Float64(sqrt(Float64(1.0 + t)) + sqrt(t)) ^ -1.0)) + Float64((Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0))) - sqrt(x)); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
tmp = 0.0;
if ((sqrt((x + 1.0)) - sqrt(x)) <= 0.6)
tmp = (((sqrt((x ^ -1.0)) + sqrt((y ^ -1.0))) * 0.5) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
else
tmp = ((1.0 + ((sqrt((1.0 + t)) + sqrt(t)) ^ -1.0)) + (((sqrt((1.0 + z)) + sqrt(z)) ^ -1.0) + ((sqrt((1.0 + y)) + sqrt(y)) ^ -1.0))) - sqrt(x);
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := If[LessEqual[N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.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] + 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], N[(N[(N[(1.0 + N[Power[N[(N[Sqrt[N[(1.0 + t), $MachinePrecision]], $MachinePrecision] + N[Sqrt[t], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + N[(N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;\sqrt{x + 1} - \sqrt{x} \leq 0.6:\\
\;\;\;\;\left(\left(\sqrt{{x}^{-1}} + \sqrt{{y}^{-1}}\right) \cdot 0.5 + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(1 + {\left(\sqrt{1 + t} + \sqrt{t}\right)}^{-1}\right) + \left({\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\right)\right) - \sqrt{x}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.599999999999999978Initial program 82.3%
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
lower-+.f64N/A
lower-sqrt.f6436.7
Applied rewrites36.7%
Taylor expanded in x around inf
Applied rewrites39.9%
if 0.599999999999999978 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) Initial program 97.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-+.f6498.5
Applied rewrites98.5%
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.1
Applied rewrites99.1%
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.2
Applied rewrites99.2%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites97.5%
Final simplification71.4%
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)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
(- (sqrt (+ z 1.0)) (sqrt z))))
(t_2 (sqrt (+ 1.0 y))))
(if (or (<= t_1 1.0) (not (<= t_1 2.002)))
(+ 1.0 (- (+ t_2 (sqrt (+ 1.0 z))) (+ (+ (sqrt z) (sqrt y)) (sqrt x))))
(+ (- (* (sqrt (pow z -1.0)) 0.5) (+ (sqrt y) (sqrt x))) (+ t_2 1.0)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
double t_2 = sqrt((1.0 + y));
double tmp;
if ((t_1 <= 1.0) || !(t_1 <= 2.002)) {
tmp = 1.0 + ((t_2 + sqrt((1.0 + z))) - ((sqrt(z) + sqrt(y)) + sqrt(x)));
} else {
tmp = ((sqrt(pow(z, -1.0)) * 0.5) - (sqrt(y) + sqrt(x))) + (t_2 + 1.0);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))
t_2 = sqrt((1.0d0 + y))
if ((t_1 <= 1.0d0) .or. (.not. (t_1 <= 2.002d0))) then
tmp = 1.0d0 + ((t_2 + sqrt((1.0d0 + z))) - ((sqrt(z) + sqrt(y)) + sqrt(x)))
else
tmp = ((sqrt((z ** (-1.0d0))) * 0.5d0) - (sqrt(y) + sqrt(x))) + (t_2 + 1.0d0)
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)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z));
double t_2 = Math.sqrt((1.0 + y));
double tmp;
if ((t_1 <= 1.0) || !(t_1 <= 2.002)) {
tmp = 1.0 + ((t_2 + Math.sqrt((1.0 + z))) - ((Math.sqrt(z) + Math.sqrt(y)) + Math.sqrt(x)));
} else {
tmp = ((Math.sqrt(Math.pow(z, -1.0)) * 0.5) - (Math.sqrt(y) + Math.sqrt(x))) + (t_2 + 1.0);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z)) t_2 = math.sqrt((1.0 + y)) tmp = 0 if (t_1 <= 1.0) or not (t_1 <= 2.002): tmp = 1.0 + ((t_2 + math.sqrt((1.0 + z))) - ((math.sqrt(z) + math.sqrt(y)) + math.sqrt(x))) else: tmp = ((math.sqrt(math.pow(z, -1.0)) * 0.5) - (math.sqrt(y) + math.sqrt(x))) + (t_2 + 1.0) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = 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))) t_2 = sqrt(Float64(1.0 + y)) tmp = 0.0 if ((t_1 <= 1.0) || !(t_1 <= 2.002)) tmp = Float64(1.0 + Float64(Float64(t_2 + sqrt(Float64(1.0 + z))) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x)))); else tmp = Float64(Float64(Float64(sqrt((z ^ -1.0)) * 0.5) - Float64(sqrt(y) + sqrt(x))) + Float64(t_2 + 1.0)); 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)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
t_2 = sqrt((1.0 + y));
tmp = 0.0;
if ((t_1 <= 1.0) || ~((t_1 <= 2.002)))
tmp = 1.0 + ((t_2 + sqrt((1.0 + z))) - ((sqrt(z) + sqrt(y)) + sqrt(x)));
else
tmp = ((sqrt((z ^ -1.0)) * 0.5) - (sqrt(y) + sqrt(x))) + (t_2 + 1.0);
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[(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]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, If[Or[LessEqual[t$95$1, 1.0], N[Not[LessEqual[t$95$1, 2.002]], $MachinePrecision]], N[(1.0 + N[(N[(t$95$2 + N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + 1.0), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\\
t_2 := \sqrt{1 + y}\\
\mathbf{if}\;t\_1 \leq 1 \lor \neg \left(t\_1 \leq 2.002\right):\\
\;\;\;\;1 + \left(\left(t\_2 + \sqrt{1 + z}\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{{z}^{-1}} \cdot 0.5 - \left(\sqrt{y} + \sqrt{x}\right)\right) + \left(t\_2 + 1\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))) < 1 or 2.0019999999999998 < (+.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 86.9%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6416.8
Applied rewrites16.8%
Applied rewrites18.6%
Taylor expanded in x around inf
Applied rewrites9.7%
Taylor expanded in x around 0
Applied rewrites40.3%
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.0019999999999998Initial program 95.4%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f648.8
Applied rewrites8.8%
Applied rewrites23.5%
Taylor expanded in z around inf
Applied rewrites22.6%
Taylor expanded in x around 0
Applied rewrites21.5%
Final simplification31.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 (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
(- (sqrt (+ z 1.0)) (sqrt z))))
(t_2 (sqrt (+ 1.0 y)))
(t_3 (sqrt (+ 1.0 z)))
(t_4 (+ (+ (sqrt z) (sqrt y)) (sqrt x))))
(if (<= t_1 1.0)
(+ 1.0 (- (+ t_2 t_3) t_4))
(if (<= t_1 2.002)
(+ (- (* (sqrt (pow z -1.0)) 0.5) (+ (sqrt y) (sqrt x))) (+ t_2 1.0))
(- (+ (+ (sqrt (+ 1.0 x)) 1.0) (fma 0.5 y 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)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
double t_2 = sqrt((1.0 + y));
double t_3 = sqrt((1.0 + z));
double t_4 = (sqrt(z) + sqrt(y)) + sqrt(x);
double tmp;
if (t_1 <= 1.0) {
tmp = 1.0 + ((t_2 + t_3) - t_4);
} else if (t_1 <= 2.002) {
tmp = ((sqrt(pow(z, -1.0)) * 0.5) - (sqrt(y) + sqrt(x))) + (t_2 + 1.0);
} else {
tmp = ((sqrt((1.0 + x)) + 1.0) + fma(0.5, y, t_3)) - t_4;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = 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))) t_2 = sqrt(Float64(1.0 + y)) t_3 = sqrt(Float64(1.0 + z)) t_4 = Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x)) tmp = 0.0 if (t_1 <= 1.0) tmp = Float64(1.0 + Float64(Float64(t_2 + t_3) - t_4)); elseif (t_1 <= 2.002) tmp = Float64(Float64(Float64(sqrt((z ^ -1.0)) * 0.5) - Float64(sqrt(y) + sqrt(x))) + Float64(t_2 + 1.0)); else tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + 1.0) + fma(0.5, y, 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[(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]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1.0], N[(1.0 + N[(N[(t$95$2 + t$95$3), $MachinePrecision] - t$95$4), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2.002], N[(N[(N[(N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t$95$2 + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision] + N[(0.5 * y + 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 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\\
t_2 := \sqrt{1 + y}\\
t_3 := \sqrt{1 + z}\\
t_4 := \left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\\
\mathbf{if}\;t\_1 \leq 1:\\
\;\;\;\;1 + \left(\left(t\_2 + t\_3\right) - t\_4\right)\\
\mathbf{elif}\;t\_1 \leq 2.002:\\
\;\;\;\;\left(\sqrt{{z}^{-1}} \cdot 0.5 - \left(\sqrt{y} + \sqrt{x}\right)\right) + \left(t\_2 + 1\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + 1\right) + \mathsf{fma}\left(0.5, y, t\_3\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 82.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f643.9
Applied rewrites3.9%
Applied rewrites6.4%
Taylor expanded in x around inf
Applied rewrites6.2%
Taylor expanded in x around 0
Applied rewrites35.9%
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.0019999999999998Initial program 95.4%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f648.8
Applied rewrites8.8%
Applied rewrites23.5%
Taylor expanded in z around inf
Applied rewrites22.6%
Taylor expanded in x around 0
Applied rewrites21.5%
if 2.0019999999999998 < (+.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.5%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6453.4
Applied rewrites53.4%
Taylor expanded in y around 0
Applied rewrites50.3%
Final simplification31.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 (+ x 1.0)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
(- (sqrt (+ z 1.0)) (sqrt z))))
(t_2 (sqrt (+ 1.0 y)))
(t_3 (+ t_2 1.0))
(t_4 (sqrt (+ 1.0 z)))
(t_5 (+ (+ (sqrt z) (sqrt y)) (sqrt x))))
(if (<= t_1 1.0)
(+ 1.0 (- (+ t_2 t_4) t_5))
(if (<= t_1 2.002)
(+ (- (* (sqrt (pow z -1.0)) 0.5) (+ (sqrt y) (sqrt x))) t_3)
(- (+ t_3 t_4) t_5)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = ((sqrt((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
double t_2 = sqrt((1.0 + y));
double t_3 = t_2 + 1.0;
double t_4 = sqrt((1.0 + z));
double t_5 = (sqrt(z) + sqrt(y)) + sqrt(x);
double tmp;
if (t_1 <= 1.0) {
tmp = 1.0 + ((t_2 + t_4) - t_5);
} else if (t_1 <= 2.002) {
tmp = ((sqrt(pow(z, -1.0)) * 0.5) - (sqrt(y) + sqrt(x))) + t_3;
} else {
tmp = (t_3 + t_4) - 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) :: tmp
t_1 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))
t_2 = sqrt((1.0d0 + y))
t_3 = t_2 + 1.0d0
t_4 = sqrt((1.0d0 + z))
t_5 = (sqrt(z) + sqrt(y)) + sqrt(x)
if (t_1 <= 1.0d0) then
tmp = 1.0d0 + ((t_2 + t_4) - t_5)
else if (t_1 <= 2.002d0) then
tmp = ((sqrt((z ** (-1.0d0))) * 0.5d0) - (sqrt(y) + sqrt(x))) + t_3
else
tmp = (t_3 + t_4) - 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((x + 1.0)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z));
double t_2 = Math.sqrt((1.0 + y));
double t_3 = t_2 + 1.0;
double t_4 = Math.sqrt((1.0 + z));
double t_5 = (Math.sqrt(z) + Math.sqrt(y)) + Math.sqrt(x);
double tmp;
if (t_1 <= 1.0) {
tmp = 1.0 + ((t_2 + t_4) - t_5);
} else if (t_1 <= 2.002) {
tmp = ((Math.sqrt(Math.pow(z, -1.0)) * 0.5) - (Math.sqrt(y) + Math.sqrt(x))) + t_3;
} else {
tmp = (t_3 + t_4) - t_5;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = ((math.sqrt((x + 1.0)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z)) t_2 = math.sqrt((1.0 + y)) t_3 = t_2 + 1.0 t_4 = math.sqrt((1.0 + z)) t_5 = (math.sqrt(z) + math.sqrt(y)) + math.sqrt(x) tmp = 0 if t_1 <= 1.0: tmp = 1.0 + ((t_2 + t_4) - t_5) elif t_1 <= 2.002: tmp = ((math.sqrt(math.pow(z, -1.0)) * 0.5) - (math.sqrt(y) + math.sqrt(x))) + t_3 else: tmp = (t_3 + t_4) - t_5 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = 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))) t_2 = sqrt(Float64(1.0 + y)) t_3 = Float64(t_2 + 1.0) t_4 = sqrt(Float64(1.0 + z)) t_5 = Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x)) tmp = 0.0 if (t_1 <= 1.0) tmp = Float64(1.0 + Float64(Float64(t_2 + t_4) - t_5)); elseif (t_1 <= 2.002) tmp = Float64(Float64(Float64(sqrt((z ^ -1.0)) * 0.5) - Float64(sqrt(y) + sqrt(x))) + t_3); else tmp = Float64(Float64(t_3 + t_4) - 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((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
t_2 = sqrt((1.0 + y));
t_3 = t_2 + 1.0;
t_4 = sqrt((1.0 + z));
t_5 = (sqrt(z) + sqrt(y)) + sqrt(x);
tmp = 0.0;
if (t_1 <= 1.0)
tmp = 1.0 + ((t_2 + t_4) - t_5);
elseif (t_1 <= 2.002)
tmp = ((sqrt((z ^ -1.0)) * 0.5) - (sqrt(y) + sqrt(x))) + t_3;
else
tmp = (t_3 + t_4) - 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[(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]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 + 1.0), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1.0], N[(1.0 + N[(N[(t$95$2 + t$95$4), $MachinePrecision] - t$95$5), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2.002], N[(N[(N[(N[Sqrt[N[Power[z, -1.0], $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision], N[(N[(t$95$3 + t$95$4), $MachinePrecision] - t$95$5), $MachinePrecision]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\\
t_2 := \sqrt{1 + y}\\
t_3 := t\_2 + 1\\
t_4 := \sqrt{1 + z}\\
t_5 := \left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\\
\mathbf{if}\;t\_1 \leq 1:\\
\;\;\;\;1 + \left(\left(t\_2 + t\_4\right) - t\_5\right)\\
\mathbf{elif}\;t\_1 \leq 2.002:\\
\;\;\;\;\left(\sqrt{{z}^{-1}} \cdot 0.5 - \left(\sqrt{y} + \sqrt{x}\right)\right) + t\_3\\
\mathbf{else}:\\
\;\;\;\;\left(t\_3 + t\_4\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 82.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f643.9
Applied rewrites3.9%
Applied rewrites6.4%
Taylor expanded in x around inf
Applied rewrites6.2%
Taylor expanded in x around 0
Applied rewrites35.9%
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.0019999999999998Initial program 95.4%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f648.8
Applied rewrites8.8%
Applied rewrites23.5%
Taylor expanded in z around inf
Applied rewrites22.6%
Taylor expanded in x around 0
Applied rewrites21.5%
if 2.0019999999999998 < (+.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.5%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6453.4
Applied rewrites53.4%
Taylor expanded in x around 0
Applied rewrites52.9%
Final simplification31.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 (+ t 1.0)) (sqrt t))) (t_2 (sqrt (+ 1.0 z))))
(if (<= t_1 0.0)
(-
(+
(+ (sqrt (+ 1.0 x)) (pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0))
(pow (+ t_2 (sqrt z)) -1.0))
(sqrt x))
(-
(+
t_1
(+ (+ (fma 0.5 x (- 1.0 (sqrt x))) (- (sqrt (+ y 1.0)) (sqrt y))) t_2))
(sqrt z)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((t + 1.0)) - sqrt(t);
double t_2 = sqrt((1.0 + z));
double tmp;
if (t_1 <= 0.0) {
tmp = ((sqrt((1.0 + x)) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0)) + pow((t_2 + sqrt(z)), -1.0)) - sqrt(x);
} else {
tmp = (t_1 + ((fma(0.5, x, (1.0 - sqrt(x))) + (sqrt((y + 1.0)) - sqrt(y))) + t_2)) - sqrt(z);
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) t_2 = sqrt(Float64(1.0 + z)) tmp = 0.0 if (t_1 <= 0.0) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0)) + (Float64(t_2 + sqrt(z)) ^ -1.0)) - sqrt(x)); else tmp = Float64(Float64(t_1 + Float64(Float64(fma(0.5, x, Float64(1.0 - sqrt(x))) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_2)) - sqrt(z)); 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[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + N[Power[N[(t$95$2 + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 + N[(N[(N[(0.5 * x + N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{t + 1} - \sqrt{t}\\
t_2 := \sqrt{1 + z}\\
\mathbf{if}\;t\_1 \leq 0:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\right) + {\left(t\_2 + \sqrt{z}\right)}^{-1}\right) - \sqrt{x}\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 + \left(\left(\mathsf{fma}\left(0.5, x, 1 - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_2\right)\right) - \sqrt{z}\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) < 0.0Initial program 84.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-+.f6484.7
Applied rewrites84.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-+.f6484.7
Applied rewrites84.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-+.f6485.1
Applied rewrites85.1%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites55.1%
if 0.0 < (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) Initial program 96.5%
Taylor expanded in x around 0
+-commutativeN/A
associate--l+N/A
lower-fma.f64N/A
lower--.f64N/A
lower-sqrt.f6459.0
Applied rewrites59.0%
lift-+.f64N/A
+-commutativeN/A
lift-+.f64N/A
lift--.f64N/A
associate-+r-N/A
associate-+r-N/A
Applied rewrites36.1%
Final simplification45.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 (+ t 1.0)) (sqrt t))))
(if (<= t_1 0.0)
(-
(+
(+ (sqrt (+ 1.0 x)) (pow (+ (sqrt (+ 1.0 y)) (sqrt y)) -1.0))
(pow (+ (sqrt (+ 1.0 z)) (sqrt z)) -1.0))
(sqrt x))
(+
(+
(+ (- 1.0 (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
(- (sqrt (+ z 1.0)) (sqrt z)))
t_1))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_1 <= 0.0) {
tmp = ((sqrt((1.0 + x)) + pow((sqrt((1.0 + y)) + sqrt(y)), -1.0)) + pow((sqrt((1.0 + z)) + sqrt(z)), -1.0)) - sqrt(x);
} else {
tmp = (((1.0 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + 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) :: tmp
t_1 = sqrt((t + 1.0d0)) - sqrt(t)
if (t_1 <= 0.0d0) then
tmp = ((sqrt((1.0d0 + x)) + ((sqrt((1.0d0 + y)) + sqrt(y)) ** (-1.0d0))) + ((sqrt((1.0d0 + z)) + sqrt(z)) ** (-1.0d0))) - sqrt(x)
else
tmp = (((1.0d0 - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + 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((t + 1.0)) - Math.sqrt(t);
double tmp;
if (t_1 <= 0.0) {
tmp = ((Math.sqrt((1.0 + x)) + Math.pow((Math.sqrt((1.0 + y)) + Math.sqrt(y)), -1.0)) + Math.pow((Math.sqrt((1.0 + z)) + Math.sqrt(z)), -1.0)) - Math.sqrt(x);
} else {
tmp = (((1.0 - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z))) + t_1;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((t + 1.0)) - math.sqrt(t) tmp = 0 if t_1 <= 0.0: tmp = ((math.sqrt((1.0 + x)) + math.pow((math.sqrt((1.0 + y)) + math.sqrt(y)), -1.0)) + math.pow((math.sqrt((1.0 + z)) + math.sqrt(z)), -1.0)) - math.sqrt(x) else: tmp = (((1.0 - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z))) + t_1 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_1 <= 0.0) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + (Float64(sqrt(Float64(1.0 + y)) + sqrt(y)) ^ -1.0)) + (Float64(sqrt(Float64(1.0 + z)) + sqrt(z)) ^ -1.0)) - sqrt(x)); else tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + Float64(sqrt(Float64(z + 1.0)) - sqrt(z))) + 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((t + 1.0)) - sqrt(t);
tmp = 0.0;
if (t_1 <= 0.0)
tmp = ((sqrt((1.0 + x)) + ((sqrt((1.0 + y)) + sqrt(y)) ^ -1.0)) + ((sqrt((1.0 + z)) + sqrt(z)) ^ -1.0)) - sqrt(x);
else
tmp = (((1.0 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + 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[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] + N[Power[N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 - 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] + t$95$1), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_1 \leq 0:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + {\left(\sqrt{1 + y} + \sqrt{y}\right)}^{-1}\right) + {\left(\sqrt{1 + z} + \sqrt{z}\right)}^{-1}\right) - \sqrt{x}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(1 - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\right) + t\_1\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) < 0.0Initial program 84.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-+.f6484.7
Applied rewrites84.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-+.f6484.7
Applied rewrites84.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-+.f6485.1
Applied rewrites85.1%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites55.1%
if 0.0 < (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t)) Initial program 96.5%
Taylor expanded in x around 0
lower--.f64N/A
lower-sqrt.f6456.8
Applied rewrites56.8%
Final simplification56.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)) (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y)))
(- (sqrt (+ z 1.0)) (sqrt z))))
(t_2 (sqrt (+ 1.0 y))))
(if (or (<= t_1 1.0) (not (<= t_1 2.0)))
(+ 1.0 (- (+ t_2 (sqrt (+ 1.0 z))) (+ (+ (sqrt z) (sqrt y)) (sqrt x))))
(- (+ (sqrt (+ 1.0 x)) 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((x + 1.0)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
double t_2 = sqrt((1.0 + y));
double tmp;
if ((t_1 <= 1.0) || !(t_1 <= 2.0)) {
tmp = 1.0 + ((t_2 + sqrt((1.0 + z))) - ((sqrt(z) + sqrt(y)) + sqrt(x)));
} else {
tmp = (sqrt((1.0 + x)) + t_2) - (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) :: tmp
t_1 = ((sqrt((x + 1.0d0)) - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))
t_2 = sqrt((1.0d0 + y))
if ((t_1 <= 1.0d0) .or. (.not. (t_1 <= 2.0d0))) then
tmp = 1.0d0 + ((t_2 + sqrt((1.0d0 + z))) - ((sqrt(z) + sqrt(y)) + sqrt(x)))
else
tmp = (sqrt((1.0d0 + x)) + t_2) - (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)) - Math.sqrt(x)) + (Math.sqrt((y + 1.0)) - Math.sqrt(y))) + (Math.sqrt((z + 1.0)) - Math.sqrt(z));
double t_2 = Math.sqrt((1.0 + y));
double tmp;
if ((t_1 <= 1.0) || !(t_1 <= 2.0)) {
tmp = 1.0 + ((t_2 + Math.sqrt((1.0 + z))) - ((Math.sqrt(z) + Math.sqrt(y)) + Math.sqrt(x)));
} else {
tmp = (Math.sqrt((1.0 + x)) + t_2) - (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)) - math.sqrt(x)) + (math.sqrt((y + 1.0)) - math.sqrt(y))) + (math.sqrt((z + 1.0)) - math.sqrt(z)) t_2 = math.sqrt((1.0 + y)) tmp = 0 if (t_1 <= 1.0) or not (t_1 <= 2.0): tmp = 1.0 + ((t_2 + math.sqrt((1.0 + z))) - ((math.sqrt(z) + math.sqrt(y)) + math.sqrt(x))) else: tmp = (math.sqrt((1.0 + x)) + t_2) - (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 = 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))) t_2 = sqrt(Float64(1.0 + y)) tmp = 0.0 if ((t_1 <= 1.0) || !(t_1 <= 2.0)) tmp = Float64(1.0 + Float64(Float64(t_2 + sqrt(Float64(1.0 + z))) - Float64(Float64(sqrt(z) + sqrt(y)) + sqrt(x)))); else tmp = Float64(Float64(sqrt(Float64(1.0 + x)) + t_2) - 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)) - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z));
t_2 = sqrt((1.0 + y));
tmp = 0.0;
if ((t_1 <= 1.0) || ~((t_1 <= 2.0)))
tmp = 1.0 + ((t_2 + sqrt((1.0 + z))) - ((sqrt(z) + sqrt(y)) + sqrt(x)));
else
tmp = (sqrt((1.0 + x)) + t_2) - (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[(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]}, Block[{t$95$2 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, If[Or[LessEqual[t$95$1, 1.0], N[Not[LessEqual[t$95$1, 2.0]], $MachinePrecision]], N[(1.0 + N[(N[(t$95$2 + N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[z], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $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 := \left(\left(\sqrt{x + 1} - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + \left(\sqrt{z + 1} - \sqrt{z}\right)\\
t_2 := \sqrt{1 + y}\\
\mathbf{if}\;t\_1 \leq 1 \lor \neg \left(t\_1 \leq 2\right):\\
\;\;\;\;1 + \left(\left(t\_2 + \sqrt{1 + z}\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\sqrt{1 + x} + 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))) < 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 86.4%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6418.0
Applied rewrites18.0%
Applied rewrites19.8%
Taylor expanded in x around inf
Applied rewrites10.3%
Taylor expanded in x around 0
Applied rewrites40.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))) < 2Initial program 96.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f646.7
Applied rewrites6.7%
Applied rewrites22.2%
Taylor expanded in x around inf
Applied rewrites21.2%
Taylor expanded in z around inf
Applied rewrites21.6%
Final simplification32.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))))
(if (<= (+ (+ (- t_2 (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) t_1) 2.002)
(+ (- (- (/ 0.5 (sqrt z)) (sqrt y)) (- (sqrt x) (sqrt (+ 1.0 y)))) t_2)
(+
(+ (+ (- 1.0 (sqrt x)) (fma 0.5 y (- 1.0 (sqrt y)))) t_1)
(- (sqrt (+ t 1.0)) (sqrt t))))))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 tmp;
if ((((t_2 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + t_1) <= 2.002) {
tmp = (((0.5 / sqrt(z)) - sqrt(y)) - (sqrt(x) - sqrt((1.0 + y)))) + t_2;
} else {
tmp = (((1.0 - sqrt(x)) + fma(0.5, y, (1.0 - sqrt(y)))) + t_1) + (sqrt((t + 1.0)) - sqrt(t));
}
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)) tmp = 0.0 if (Float64(Float64(Float64(t_2 - sqrt(x)) + Float64(sqrt(Float64(y + 1.0)) - sqrt(y))) + t_1) <= 2.002) tmp = Float64(Float64(Float64(Float64(0.5 / sqrt(z)) - sqrt(y)) - Float64(sqrt(x) - sqrt(Float64(1.0 + y)))) + t_2); else tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(x)) + fma(0.5, y, Float64(1.0 - sqrt(y)))) + t_1) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))); 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]}, If[LessEqual[N[(N[(N[(t$95$2 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], 2.002], N[(N[(N[(N[(0.5 / N[Sqrt[z], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] - N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision], N[(N[(N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(0.5 * y + N[(1.0 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $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}\\
\mathbf{if}\;\left(\left(t\_2 - \sqrt{x}\right) + \left(\sqrt{y + 1} - \sqrt{y}\right)\right) + t\_1 \leq 2.002:\\
\;\;\;\;\left(\left(\frac{0.5}{\sqrt{z}} - \sqrt{y}\right) - \left(\sqrt{x} - \sqrt{1 + y}\right)\right) + t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(1 - \sqrt{x}\right) + \mathsf{fma}\left(0.5, y, 1 - \sqrt{y}\right)\right) + t\_1\right) + \left(\sqrt{t + 1} - \sqrt{t}\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))) < 2.0019999999999998Initial program 89.3%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f646.4
Applied rewrites6.4%
Applied rewrites15.3%
Taylor expanded in z around inf
Applied rewrites14.9%
Applied rewrites22.7%
if 2.0019999999999998 < (+.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.5%
Taylor expanded in y around 0
+-commutativeN/A
associate--l+N/A
lower-fma.f64N/A
lower--.f64N/A
lower-sqrt.f6495.5
Applied rewrites95.5%
Taylor expanded in x around 0
lower--.f64N/A
lower-sqrt.f6491.8
Applied rewrites91.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(if (<= (- (sqrt (+ z 1.0)) (sqrt z)) 0.001)
(+
(- (- (/ 0.5 (sqrt z)) (sqrt y)) (- (sqrt x) (sqrt (+ 1.0 y))))
(sqrt (+ x 1.0)))
(-
(+ (+ (sqrt (+ 1.0 x)) 1.0) (fma 0.5 y (sqrt (+ 1.0 z))))
(+ (+ (sqrt z) (sqrt y)) (sqrt x)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if ((sqrt((z + 1.0)) - sqrt(z)) <= 0.001) {
tmp = (((0.5 / sqrt(z)) - sqrt(y)) - (sqrt(x) - sqrt((1.0 + y)))) + sqrt((x + 1.0));
} else {
tmp = ((sqrt((1.0 + x)) + 1.0) + fma(0.5, y, sqrt((1.0 + z)))) - ((sqrt(z) + sqrt(y)) + sqrt(x));
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) <= 0.001) tmp = Float64(Float64(Float64(Float64(0.5 / sqrt(z)) - sqrt(y)) - Float64(sqrt(x) - sqrt(Float64(1.0 + y)))) + sqrt(Float64(x + 1.0))); else tmp = Float64(Float64(Float64(sqrt(Float64(1.0 + x)) + 1.0) + fma(0.5, y, sqrt(Float64(1.0 + z)))) - 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_] := If[LessEqual[N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision], 0.001], N[(N[(N[(N[(0.5 / N[Sqrt[z], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] - N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision] + N[(0.5 * y + N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $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}
\mathbf{if}\;\sqrt{z + 1} - \sqrt{z} \leq 0.001:\\
\;\;\;\;\left(\left(\frac{0.5}{\sqrt{z}} - \sqrt{y}\right) - \left(\sqrt{x} - \sqrt{1 + y}\right)\right) + \sqrt{x + 1}\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\sqrt{1 + x} + 1\right) + \mathsf{fma}\left(0.5, y, \sqrt{1 + z}\right)\right) - \left(\left(\sqrt{z} + \sqrt{y}\right) + \sqrt{x}\right)\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) < 1e-3Initial program 84.2%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f646.6
Applied rewrites6.6%
Applied rewrites21.7%
Taylor expanded in z around inf
Applied rewrites22.1%
Applied rewrites33.8%
if 1e-3 < (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) Initial program 97.2%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6419.9
Applied rewrites19.9%
Taylor expanded in y around 0
Applied rewrites19.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ (+ (+ (- 1.0 (sqrt x)) (- (sqrt (+ y 1.0)) (sqrt y))) (- (sqrt (+ z 1.0)) (sqrt z))) (- (sqrt (+ t 1.0)) (sqrt t))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return (((1.0 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((1.0d0 - sqrt(x)) + (sqrt((y + 1.0d0)) - sqrt(y))) + (sqrt((z + 1.0d0)) - sqrt(z))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return (((1.0 - Math.sqrt(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));
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return (((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))
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(Float64(Float64(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
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = (((1.0 - sqrt(x)) + (sqrt((y + 1.0)) - sqrt(y))) + (sqrt((z + 1.0)) - sqrt(z))) + (sqrt((t + 1.0)) - sqrt(t));
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(N[(N[(N[(1.0 - 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}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(\left(\left(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}
Initial program 90.7%
Taylor expanded in x around 0
lower--.f64N/A
lower-sqrt.f6453.1
Applied rewrites53.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ (sqrt (+ x 1.0)) (+ (sqrt (+ y 1.0)) (- (- (sqrt (+ 1.0 z)) (sqrt z)) (+ (sqrt y) (sqrt x))))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return sqrt((x + 1.0)) + (sqrt((y + 1.0)) + ((sqrt((1.0 + z)) - sqrt(z)) - (sqrt(y) + sqrt(x))));
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = sqrt((x + 1.0d0)) + (sqrt((y + 1.0d0)) + ((sqrt((1.0d0 + z)) - sqrt(z)) - (sqrt(y) + sqrt(x))))
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return Math.sqrt((x + 1.0)) + (Math.sqrt((y + 1.0)) + ((Math.sqrt((1.0 + z)) - Math.sqrt(z)) - (Math.sqrt(y) + Math.sqrt(x))));
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return math.sqrt((x + 1.0)) + (math.sqrt((y + 1.0)) + ((math.sqrt((1.0 + z)) - math.sqrt(z)) - (math.sqrt(y) + math.sqrt(x))))
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(sqrt(Float64(x + 1.0)) + Float64(sqrt(Float64(y + 1.0)) + Float64(Float64(sqrt(Float64(1.0 + z)) - sqrt(z)) - Float64(sqrt(y) + sqrt(x))))) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = sqrt((x + 1.0)) + (sqrt((y + 1.0)) + ((sqrt((1.0 + z)) - sqrt(z)) - (sqrt(y) + sqrt(x))));
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] + N[(N[(N[Sqrt[N[(1.0 + z), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\sqrt{x + 1} + \left(\sqrt{y + 1} + \left(\left(\sqrt{1 + z} - \sqrt{z}\right) - \left(\sqrt{y} + \sqrt{x}\right)\right)\right)
\end{array}
Initial program 90.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6413.2
Applied rewrites13.2%
Applied rewrites28.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 x))))
(if (<= y 1e+32)
(- (+ t_1 (sqrt (+ 1.0 y))) (+ (sqrt y) (sqrt x)))
(+ (- (sqrt x)) (+ t_1 1.0)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + x));
double tmp;
if (y <= 1e+32) {
tmp = (t_1 + sqrt((1.0 + y))) - (sqrt(y) + sqrt(x));
} else {
tmp = -sqrt(x) + (t_1 + 1.0);
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: tmp
t_1 = sqrt((1.0d0 + x))
if (y <= 1d+32) then
tmp = (t_1 + sqrt((1.0d0 + y))) - (sqrt(y) + sqrt(x))
else
tmp = -sqrt(x) + (t_1 + 1.0d0)
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + x));
double tmp;
if (y <= 1e+32) {
tmp = (t_1 + Math.sqrt((1.0 + y))) - (Math.sqrt(y) + Math.sqrt(x));
} else {
tmp = -Math.sqrt(x) + (t_1 + 1.0);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + x)) tmp = 0 if y <= 1e+32: tmp = (t_1 + math.sqrt((1.0 + y))) - (math.sqrt(y) + math.sqrt(x)) else: tmp = -math.sqrt(x) + (t_1 + 1.0) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + x)) tmp = 0.0 if (y <= 1e+32) tmp = Float64(Float64(t_1 + sqrt(Float64(1.0 + y))) - Float64(sqrt(y) + sqrt(x))); else tmp = Float64(Float64(-sqrt(x)) + Float64(t_1 + 1.0)); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + x));
tmp = 0.0;
if (y <= 1e+32)
tmp = (t_1 + sqrt((1.0 + y))) - (sqrt(y) + sqrt(x));
else
tmp = -sqrt(x) + (t_1 + 1.0);
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, 1e+32], N[(N[(t$95$1 + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[x], $MachinePrecision]) + N[(t$95$1 + 1.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + x}\\
\mathbf{if}\;y \leq 10^{+32}:\\
\;\;\;\;\left(t\_1 + \sqrt{1 + y}\right) - \left(\sqrt{y} + \sqrt{x}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{x}\right) + \left(t\_1 + 1\right)\\
\end{array}
\end{array}
if y < 1.00000000000000005e32Initial program 94.9%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.2
Applied rewrites20.2%
Applied rewrites33.1%
Taylor expanded in x around inf
Applied rewrites21.3%
Taylor expanded in z around inf
Applied rewrites23.5%
if 1.00000000000000005e32 < y Initial program 84.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f643.2
Applied rewrites3.2%
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites5.7%
Taylor expanded in y around 0
Applied rewrites32.4%
Final simplification27.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (if (<= y 1e+32) (+ (- (sqrt y)) (+ (sqrt (+ y 1.0)) (sqrt (+ x 1.0)))) (+ (- (sqrt x)) (+ (sqrt (+ 1.0 x)) 1.0))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double tmp;
if (y <= 1e+32) {
tmp = -sqrt(y) + (sqrt((y + 1.0)) + sqrt((x + 1.0)));
} else {
tmp = -sqrt(x) + (sqrt((1.0 + x)) + 1.0);
}
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 <= 1d+32) then
tmp = -sqrt(y) + (sqrt((y + 1.0d0)) + sqrt((x + 1.0d0)))
else
tmp = -sqrt(x) + (sqrt((1.0d0 + x)) + 1.0d0)
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 <= 1e+32) {
tmp = -Math.sqrt(y) + (Math.sqrt((y + 1.0)) + Math.sqrt((x + 1.0)));
} else {
tmp = -Math.sqrt(x) + (Math.sqrt((1.0 + x)) + 1.0);
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): tmp = 0 if y <= 1e+32: tmp = -math.sqrt(y) + (math.sqrt((y + 1.0)) + math.sqrt((x + 1.0))) else: tmp = -math.sqrt(x) + (math.sqrt((1.0 + x)) + 1.0) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) tmp = 0.0 if (y <= 1e+32) tmp = Float64(Float64(-sqrt(y)) + Float64(sqrt(Float64(y + 1.0)) + sqrt(Float64(x + 1.0)))); else tmp = Float64(Float64(-sqrt(x)) + Float64(sqrt(Float64(1.0 + x)) + 1.0)); 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 <= 1e+32)
tmp = -sqrt(y) + (sqrt((y + 1.0)) + sqrt((x + 1.0)));
else
tmp = -sqrt(x) + (sqrt((1.0 + x)) + 1.0);
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, 1e+32], N[((-N[Sqrt[y], $MachinePrecision]) + N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[x], $MachinePrecision]) + N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 10^{+32}:\\
\;\;\;\;\left(-\sqrt{y}\right) + \left(\sqrt{y + 1} + \sqrt{x + 1}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{x}\right) + \left(\sqrt{1 + x} + 1\right)\\
\end{array}
\end{array}
if y < 1.00000000000000005e32Initial program 94.9%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.2
Applied rewrites20.2%
Applied rewrites33.1%
Taylor expanded in y around inf
Applied rewrites23.1%
if 1.00000000000000005e32 < y Initial program 84.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f643.2
Applied rewrites3.2%
Applied rewrites3.2%
Taylor expanded in x around inf
Applied rewrites5.7%
Taylor expanded in y around 0
Applied rewrites32.4%
Final simplification26.9%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ (- (sqrt x)) (+ (sqrt (+ 1.0 x)) 1.0)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return -sqrt(x) + (sqrt((1.0 + x)) + 1.0);
}
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) + (sqrt((1.0d0 + x)) + 1.0d0)
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return -Math.sqrt(x) + (Math.sqrt((1.0 + x)) + 1.0);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return -math.sqrt(x) + (math.sqrt((1.0 + x)) + 1.0)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(-sqrt(x)) + Float64(sqrt(Float64(1.0 + x)) + 1.0)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = -sqrt(x) + (sqrt((1.0 + x)) + 1.0);
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[x], $MachinePrecision]) + N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(-\sqrt{x}\right) + \left(\sqrt{1 + x} + 1\right)
\end{array}
Initial program 90.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6413.2
Applied rewrites13.2%
Applied rewrites20.8%
Taylor expanded in x around inf
Applied rewrites14.9%
Taylor expanded in y around 0
Applied rewrites26.4%
Final simplification26.4%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ (- (sqrt x)) (sqrt y)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return -sqrt(x) + sqrt(y);
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = -sqrt(x) + sqrt(y)
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return -Math.sqrt(x) + Math.sqrt(y);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return -math.sqrt(x) + math.sqrt(y)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(-sqrt(x)) + sqrt(y)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = -sqrt(x) + sqrt(y);
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[((-N[Sqrt[x], $MachinePrecision]) + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(-\sqrt{x}\right) + \sqrt{y}
\end{array}
Initial program 90.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6413.2
Applied rewrites13.2%
Applied rewrites20.8%
Taylor expanded in x around inf
Applied rewrites14.9%
Taylor expanded in y around inf
Applied rewrites4.3%
Final simplification4.3%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ (- (sqrt x)) (sqrt x)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return -sqrt(x) + sqrt(x);
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = -sqrt(x) + sqrt(x)
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
return -Math.sqrt(x) + Math.sqrt(x);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return -math.sqrt(x) + math.sqrt(x)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(-sqrt(x)) + sqrt(x)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = -sqrt(x) + sqrt(x);
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_] := N[((-N[Sqrt[x], $MachinePrecision]) + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(-\sqrt{x}\right) + \sqrt{x}
\end{array}
Initial program 90.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6413.2
Applied rewrites13.2%
Applied rewrites20.8%
Taylor expanded in x around inf
Applied rewrites14.9%
Taylor expanded in x around inf
Applied rewrites3.1%
Final simplification3.1%
(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 2024298
(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))))