
(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 19 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 x)))
(t_2 (sqrt (+ z 1.0)))
(t_3 (- t_2 (sqrt z)))
(t_4 (sqrt (+ 1.0 y)))
(t_5 (sqrt (+ t 1.0)))
(t_6 (- t_5 (sqrt t)))
(t_7 (+ (+ (+ (- t_4 (sqrt y)) (- t_1 (sqrt x))) t_3) t_6)))
(if (<= t_7 1.0)
(+ t_6 (+ t_3 (/ 1.0 (+ t_1 (sqrt x)))))
(if (<= t_7 3.5)
(-
(+ (+ (fma (sqrt (/ 1.0 t)) 0.5 (/ 1.0 (+ (sqrt z) t_2))) t_4) t_1)
(+ (sqrt x) (sqrt y)))
(+
(- (+ (+ t_2 t_4) t_5) (+ (+ (+ (sqrt y) (sqrt z)) (sqrt x)) (sqrt t)))
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 t_2 = sqrt((z + 1.0));
double t_3 = t_2 - sqrt(z);
double t_4 = sqrt((1.0 + y));
double t_5 = sqrt((t + 1.0));
double t_6 = t_5 - sqrt(t);
double t_7 = (((t_4 - sqrt(y)) + (t_1 - sqrt(x))) + t_3) + t_6;
double tmp;
if (t_7 <= 1.0) {
tmp = t_6 + (t_3 + (1.0 / (t_1 + sqrt(x))));
} else if (t_7 <= 3.5) {
tmp = ((fma(sqrt((1.0 / t)), 0.5, (1.0 / (sqrt(z) + t_2))) + t_4) + t_1) - (sqrt(x) + sqrt(y));
} else {
tmp = (((t_2 + t_4) + t_5) - (((sqrt(y) + sqrt(z)) + sqrt(x)) + sqrt(t))) + 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)) t_2 = sqrt(Float64(z + 1.0)) t_3 = Float64(t_2 - sqrt(z)) t_4 = sqrt(Float64(1.0 + y)) t_5 = sqrt(Float64(t + 1.0)) t_6 = Float64(t_5 - sqrt(t)) t_7 = Float64(Float64(Float64(Float64(t_4 - sqrt(y)) + Float64(t_1 - sqrt(x))) + t_3) + t_6) tmp = 0.0 if (t_7 <= 1.0) tmp = Float64(t_6 + Float64(t_3 + Float64(1.0 / Float64(t_1 + sqrt(x))))); elseif (t_7 <= 3.5) tmp = Float64(Float64(Float64(fma(sqrt(Float64(1.0 / t)), 0.5, Float64(1.0 / Float64(sqrt(z) + t_2))) + t_4) + t_1) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(Float64(t_2 + t_4) + t_5) - Float64(Float64(Float64(sqrt(y) + sqrt(z)) + sqrt(x)) + sqrt(t))) + 1.0); end return tmp end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$3 = N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$6 = N[(t$95$5 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$7 = N[(N[(N[(N[(t$95$4 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(t$95$1 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$3), $MachinePrecision] + t$95$6), $MachinePrecision]}, If[LessEqual[t$95$7, 1.0], N[(t$95$6 + N[(t$95$3 + N[(1.0 / N[(t$95$1 + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$7, 3.5], N[(N[(N[(N[(N[Sqrt[N[(1.0 / t), $MachinePrecision]], $MachinePrecision] * 0.5 + N[(1.0 / N[(N[Sqrt[z], $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$1), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(t$95$2 + t$95$4), $MachinePrecision] + t$95$5), $MachinePrecision] - N[(N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + x}\\
t_2 := \sqrt{z + 1}\\
t_3 := t\_2 - \sqrt{z}\\
t_4 := \sqrt{1 + y}\\
t_5 := \sqrt{t + 1}\\
t_6 := t\_5 - \sqrt{t}\\
t_7 := \left(\left(\left(t\_4 - \sqrt{y}\right) + \left(t\_1 - \sqrt{x}\right)\right) + t\_3\right) + t\_6\\
\mathbf{if}\;t\_7 \leq 1:\\
\;\;\;\;t\_6 + \left(t\_3 + \frac{1}{t\_1 + \sqrt{x}}\right)\\
\mathbf{elif}\;t\_7 \leq 3.5:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(\sqrt{\frac{1}{t}}, 0.5, \frac{1}{\sqrt{z} + t\_2}\right) + t\_4\right) + t\_1\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(t\_2 + t\_4\right) + t\_5\right) - \left(\left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right) + \sqrt{t}\right)\right) + 1\\
\end{array}
\end{array}
if (+.f64 (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 1Initial program 84.0%
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
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6484.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6484.0
Applied rewrites84.0%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6466.1
Applied rewrites66.1%
if 1 < (+.f64 (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) < 3.5Initial program 96.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-+.f6497.1
Applied rewrites97.1%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites25.3%
if 3.5 < (+.f64 (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) (-.f64 (sqrt.f64 (+.f64 t #s(literal 1 binary64))) (sqrt.f64 t))) Initial program 99.8%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.4
Applied rewrites20.4%
Taylor expanded in x around 0
associate--l+N/A
lower-+.f64N/A
lower--.f64N/A
Applied rewrites100.0%
Final simplification38.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 (+ z 1.0)))
(t_2 (- t_1 (sqrt z)))
(t_3 (sqrt (+ 1.0 x)))
(t_4 (sqrt (+ 1.0 y)))
(t_5 (+ (+ (- t_4 (sqrt y)) (- t_3 (sqrt x))) t_2))
(t_6 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_5 1.0)
(+ t_6 (+ t_2 (/ 1.0 (+ t_3 (sqrt x)))))
(if (<= t_5 2.05)
(- (+ (+ (/ 1.0 (+ (sqrt z) t_1)) t_4) t_3) (+ (sqrt x) (sqrt y)))
(+
(- (+ 2.0 (fma 0.5 x t_1)) (+ (+ (sqrt y) (sqrt z)) (sqrt x)))
t_6)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = t_1 - sqrt(z);
double t_3 = sqrt((1.0 + x));
double t_4 = sqrt((1.0 + y));
double t_5 = ((t_4 - sqrt(y)) + (t_3 - sqrt(x))) + t_2;
double t_6 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_5 <= 1.0) {
tmp = t_6 + (t_2 + (1.0 / (t_3 + sqrt(x))));
} else if (t_5 <= 2.05) {
tmp = (((1.0 / (sqrt(z) + t_1)) + t_4) + t_3) - (sqrt(x) + sqrt(y));
} else {
tmp = ((2.0 + fma(0.5, x, t_1)) - ((sqrt(y) + sqrt(z)) + sqrt(x))) + t_6;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = Float64(t_1 - sqrt(z)) t_3 = sqrt(Float64(1.0 + x)) t_4 = sqrt(Float64(1.0 + y)) t_5 = Float64(Float64(Float64(t_4 - sqrt(y)) + Float64(t_3 - sqrt(x))) + t_2) t_6 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_5 <= 1.0) tmp = Float64(t_6 + Float64(t_2 + Float64(1.0 / Float64(t_3 + sqrt(x))))); elseif (t_5 <= 2.05) tmp = Float64(Float64(Float64(Float64(1.0 / Float64(sqrt(z) + t_1)) + t_4) + t_3) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_1)) - Float64(Float64(sqrt(y) + sqrt(z)) + sqrt(x))) + t_6); end return tmp end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(t$95$4 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, 1.0], N[(t$95$6 + N[(t$95$2 + N[(1.0 / N[(t$95$3 + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 2.05], N[(N[(N[(N[(1.0 / N[(N[Sqrt[z], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$6), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := t\_1 - \sqrt{z}\\
t_3 := \sqrt{1 + x}\\
t_4 := \sqrt{1 + y}\\
t_5 := \left(\left(t\_4 - \sqrt{y}\right) + \left(t\_3 - \sqrt{x}\right)\right) + t\_2\\
t_6 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_5 \leq 1:\\
\;\;\;\;t\_6 + \left(t\_2 + \frac{1}{t\_3 + \sqrt{x}}\right)\\
\mathbf{elif}\;t\_5 \leq 2.05:\\
\;\;\;\;\left(\left(\frac{1}{\sqrt{z} + t\_1} + t\_4\right) + t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_1\right)\right) - \left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right)\right) + t\_6\\
\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 90.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
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6490.6
lift-+.f64N/A
+-commutativeN/A
lower-+.f6490.6
Applied rewrites90.6%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6467.7
Applied rewrites67.7%
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.0499999999999998Initial 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.7
Applied rewrites96.7%
Taylor expanded in t around inf
lower--.f64N/A
Applied rewrites25.6%
if 2.0499999999999998 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) Initial program 97.9%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites97.9%
Taylor expanded in y around 0
Applied rewrites94.3%
Final simplification53.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ z 1.0)))
(t_2 (- t_1 (sqrt z)))
(t_3 (sqrt (+ 1.0 y)))
(t_4 (sqrt (+ 1.0 x)))
(t_5 (+ (+ (- t_3 (sqrt y)) (- t_4 (sqrt x))) t_2))
(t_6 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_5 0.0)
(+ (+ (* (sqrt (/ 1.0 x)) 0.5) t_2) t_6)
(if (<= t_5 2.0)
(+ (- (+ (/ 1.0 (+ (sqrt y) t_3)) t_4) (sqrt x)) t_6)
(+
(- (+ 2.0 (fma 0.5 x t_1)) (+ (+ (sqrt y) (sqrt z)) (sqrt x)))
t_6)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = t_1 - sqrt(z);
double t_3 = sqrt((1.0 + y));
double t_4 = sqrt((1.0 + x));
double t_5 = ((t_3 - sqrt(y)) + (t_4 - sqrt(x))) + t_2;
double t_6 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_5 <= 0.0) {
tmp = ((sqrt((1.0 / x)) * 0.5) + t_2) + t_6;
} else if (t_5 <= 2.0) {
tmp = (((1.0 / (sqrt(y) + t_3)) + t_4) - sqrt(x)) + t_6;
} else {
tmp = ((2.0 + fma(0.5, x, t_1)) - ((sqrt(y) + sqrt(z)) + sqrt(x))) + t_6;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = Float64(t_1 - sqrt(z)) t_3 = sqrt(Float64(1.0 + y)) t_4 = sqrt(Float64(1.0 + x)) t_5 = Float64(Float64(Float64(t_3 - sqrt(y)) + Float64(t_4 - sqrt(x))) + t_2) t_6 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_5 <= 0.0) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 / x)) * 0.5) + t_2) + t_6); elseif (t_5 <= 2.0) tmp = Float64(Float64(Float64(Float64(1.0 / Float64(sqrt(y) + t_3)) + t_4) - sqrt(x)) + t_6); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_1)) - Float64(Float64(sqrt(y) + sqrt(z)) + sqrt(x))) + t_6); end return tmp end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(t$95$3 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(t$95$4 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$6 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, 0.0], N[(N[(N[(N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$6), $MachinePrecision], If[LessEqual[t$95$5, 2.0], N[(N[(N[(N[(1.0 / N[(N[Sqrt[y], $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision] + t$95$4), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$6), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$6), $MachinePrecision]]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := t\_1 - \sqrt{z}\\
t_3 := \sqrt{1 + y}\\
t_4 := \sqrt{1 + x}\\
t_5 := \left(\left(t\_3 - \sqrt{y}\right) + \left(t\_4 - \sqrt{x}\right)\right) + t\_2\\
t_6 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_5 \leq 0:\\
\;\;\;\;\left(\sqrt{\frac{1}{x}} \cdot 0.5 + t\_2\right) + t\_6\\
\mathbf{elif}\;t\_5 \leq 2:\\
\;\;\;\;\left(\left(\frac{1}{\sqrt{y} + t\_3} + t\_4\right) - \sqrt{x}\right) + t\_6\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_1\right)\right) - \left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right)\right) + t\_6\\
\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 57.2%
Taylor expanded in x around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6471.9
Applied rewrites71.9%
Taylor expanded in x around 0
Applied rewrites71.9%
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))) < 2Initial program 97.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.3
Applied rewrites97.3%
Taylor expanded in z around inf
lower--.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6440.0
Applied rewrites40.0%
if 2 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) Initial program 95.1%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites94.9%
Taylor expanded in y around 0
Applied rewrites82.2%
Final simplification48.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ z 1.0)))
(t_2 (- t_1 (sqrt z)))
(t_3 (sqrt (+ 1.0 y)))
(t_4 (+ (+ (- t_3 (sqrt y)) (- (sqrt (+ 1.0 x)) (sqrt x))) t_2))
(t_5 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= t_4 0.0005)
(+ (+ (* (sqrt (/ 1.0 x)) 0.5) t_2) t_5)
(if (<= t_4 2.0001)
(+ (- (fma (sqrt (/ 1.0 z)) 0.5 t_3) (+ (sqrt x) (sqrt y))) 1.0)
(+
(- (+ 2.0 (fma 0.5 x t_1)) (+ (+ (sqrt y) (sqrt z)) (sqrt x)))
t_5)))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double t_2 = t_1 - sqrt(z);
double t_3 = sqrt((1.0 + y));
double t_4 = ((t_3 - sqrt(y)) + (sqrt((1.0 + x)) - sqrt(x))) + t_2;
double t_5 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (t_4 <= 0.0005) {
tmp = ((sqrt((1.0 / x)) * 0.5) + t_2) + t_5;
} else if (t_4 <= 2.0001) {
tmp = (fma(sqrt((1.0 / z)), 0.5, t_3) - (sqrt(x) + sqrt(y))) + 1.0;
} else {
tmp = ((2.0 + fma(0.5, x, t_1)) - ((sqrt(y) + sqrt(z)) + sqrt(x))) + t_5;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) t_2 = Float64(t_1 - sqrt(z)) t_3 = sqrt(Float64(1.0 + y)) t_4 = Float64(Float64(Float64(t_3 - sqrt(y)) + Float64(sqrt(Float64(1.0 + x)) - sqrt(x))) + t_2) t_5 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (t_4 <= 0.0005) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 / x)) * 0.5) + t_2) + t_5); elseif (t_4 <= 2.0001) tmp = Float64(Float64(fma(sqrt(Float64(1.0 / z)), 0.5, t_3) - Float64(sqrt(x) + sqrt(y))) + 1.0); else tmp = Float64(Float64(Float64(2.0 + fma(0.5, x, t_1)) - Float64(Float64(sqrt(y) + sqrt(z)) + sqrt(x))) + t_5); end return tmp end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(t$95$3 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision]}, Block[{t$95$5 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$4, 0.0005], N[(N[(N[(N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$5), $MachinePrecision], If[LessEqual[t$95$4, 2.0001], N[(N[(N[(N[Sqrt[N[(1.0 / z), $MachinePrecision]], $MachinePrecision] * 0.5 + t$95$3), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(N[(2.0 + N[(0.5 * x + t$95$1), $MachinePrecision]), $MachinePrecision] - N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$5), $MachinePrecision]]]]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
t_2 := t\_1 - \sqrt{z}\\
t_3 := \sqrt{1 + y}\\
t_4 := \left(\left(t\_3 - \sqrt{y}\right) + \left(\sqrt{1 + x} - \sqrt{x}\right)\right) + t\_2\\
t_5 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;t\_4 \leq 0.0005:\\
\;\;\;\;\left(\sqrt{\frac{1}{x}} \cdot 0.5 + t\_2\right) + t\_5\\
\mathbf{elif}\;t\_4 \leq 2.0001:\\
\;\;\;\;\left(\mathsf{fma}\left(\sqrt{\frac{1}{z}}, 0.5, t\_3\right) - \left(\sqrt{x} + \sqrt{y}\right)\right) + 1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(2 + \mathsf{fma}\left(0.5, x, t\_1\right)\right) - \left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right)\right) + t\_5\\
\end{array}
\end{array}
if (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 5.0000000000000001e-4Initial program 57.2%
Taylor expanded in x around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6471.9
Applied rewrites71.9%
Taylor expanded in x around 0
Applied rewrites71.9%
if 5.0000000000000001e-4 < (+.f64 (+.f64 (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) (-.f64 (sqrt.f64 (+.f64 y #s(literal 1 binary64))) (sqrt.f64 y))) (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z))) < 2.00010000000000021Initial program 96.7%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f646.3
Applied rewrites6.3%
Taylor expanded in z around inf
Applied rewrites1.8%
Taylor expanded in x around 0
Applied rewrites22.5%
Taylor expanded in z around inf
Applied rewrites21.2%
if 2.00010000000000021 < (+.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.0%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites97.8%
Taylor expanded in y around 0
Applied rewrites91.0%
Final simplification33.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 (+ t 1.0)) (sqrt t)))
(t_2 (- (sqrt (+ 1.0 y)) (sqrt y)))
(t_3 (- (sqrt (+ z 1.0)) (sqrt z)))
(t_4 (sqrt (+ 1.0 x))))
(if (<= (+ t_2 (- t_4 (sqrt x))) 0.9)
(+ t_1 (+ t_3 (/ 1.0 (+ t_4 (sqrt x)))))
(+ (+ (+ (- 1.0 (sqrt x)) t_2) t_3) 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 t_2 = sqrt((1.0 + y)) - sqrt(y);
double t_3 = sqrt((z + 1.0)) - sqrt(z);
double t_4 = sqrt((1.0 + x));
double tmp;
if ((t_2 + (t_4 - sqrt(x))) <= 0.9) {
tmp = t_1 + (t_3 + (1.0 / (t_4 + sqrt(x))));
} else {
tmp = (((1.0 - sqrt(x)) + t_2) + t_3) + t_1;
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: t_4
real(8) :: tmp
t_1 = sqrt((t + 1.0d0)) - sqrt(t)
t_2 = sqrt((1.0d0 + y)) - sqrt(y)
t_3 = sqrt((z + 1.0d0)) - sqrt(z)
t_4 = sqrt((1.0d0 + x))
if ((t_2 + (t_4 - sqrt(x))) <= 0.9d0) then
tmp = t_1 + (t_3 + (1.0d0 / (t_4 + sqrt(x))))
else
tmp = (((1.0d0 - sqrt(x)) + t_2) + t_3) + 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 t_2 = Math.sqrt((1.0 + y)) - Math.sqrt(y);
double t_3 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
double t_4 = Math.sqrt((1.0 + x));
double tmp;
if ((t_2 + (t_4 - Math.sqrt(x))) <= 0.9) {
tmp = t_1 + (t_3 + (1.0 / (t_4 + Math.sqrt(x))));
} else {
tmp = (((1.0 - Math.sqrt(x)) + t_2) + t_3) + 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) t_2 = math.sqrt((1.0 + y)) - math.sqrt(y) t_3 = math.sqrt((z + 1.0)) - math.sqrt(z) t_4 = math.sqrt((1.0 + x)) tmp = 0 if (t_2 + (t_4 - math.sqrt(x))) <= 0.9: tmp = t_1 + (t_3 + (1.0 / (t_4 + math.sqrt(x)))) else: tmp = (((1.0 - math.sqrt(x)) + t_2) + t_3) + 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)) t_2 = Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) t_3 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_4 = sqrt(Float64(1.0 + x)) tmp = 0.0 if (Float64(t_2 + Float64(t_4 - sqrt(x))) <= 0.9) tmp = Float64(t_1 + Float64(t_3 + Float64(1.0 / Float64(t_4 + sqrt(x))))); else tmp = Float64(Float64(Float64(Float64(1.0 - sqrt(x)) + t_2) + t_3) + 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);
t_2 = sqrt((1.0 + y)) - sqrt(y);
t_3 = sqrt((z + 1.0)) - sqrt(z);
t_4 = sqrt((1.0 + x));
tmp = 0.0;
if ((t_2 + (t_4 - sqrt(x))) <= 0.9)
tmp = t_1 + (t_3 + (1.0 / (t_4 + sqrt(x))));
else
tmp = (((1.0 - sqrt(x)) + t_2) + t_3) + 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]}, Block[{t$95$2 = N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$3 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$2 + N[(t$95$4 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.9], N[(t$95$1 + N[(t$95$3 + N[(1.0 / N[(t$95$4 + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$2), $MachinePrecision] + t$95$3), $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}\\
t_2 := \sqrt{1 + y} - \sqrt{y}\\
t_3 := \sqrt{z + 1} - \sqrt{z}\\
t_4 := \sqrt{1 + x}\\
\mathbf{if}\;t\_2 + \left(t\_4 - \sqrt{x}\right) \leq 0.9:\\
\;\;\;\;t\_1 + \left(t\_3 + \frac{1}{t\_4 + \sqrt{x}}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(1 - \sqrt{x}\right) + t\_2\right) + t\_3\right) + t\_1\\
\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.900000000000000022Initial program 81.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
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6481.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6481.8
Applied rewrites81.8%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6487.4
Applied rewrites87.4%
if 0.900000000000000022 < (+.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.0%
Taylor expanded in x around 0
lower--.f64N/A
lower-sqrt.f6460.0
Applied rewrites60.0%
Final simplification66.0%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ 1.0 y)))
(t_2 (- (sqrt (+ z 1.0)) (sqrt z)))
(t_3 (sqrt (+ 1.0 x))))
(if (<= (+ (- t_1 (sqrt y)) (- t_3 (sqrt x))) 0.0005)
(+ (+ (* (sqrt (/ 1.0 x)) 0.5) t_2) (- (sqrt (+ t 1.0)) (sqrt t)))
(+ (+ (- t_2 (+ (sqrt x) (sqrt y))) t_1) t_3))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + y));
double t_2 = sqrt((z + 1.0)) - sqrt(z);
double t_3 = sqrt((1.0 + x));
double tmp;
if (((t_1 - sqrt(y)) + (t_3 - sqrt(x))) <= 0.0005) {
tmp = ((sqrt((1.0 / x)) * 0.5) + t_2) + (sqrt((t + 1.0)) - sqrt(t));
} else {
tmp = ((t_2 - (sqrt(x) + sqrt(y))) + t_1) + t_3;
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = sqrt((1.0d0 + y))
t_2 = sqrt((z + 1.0d0)) - sqrt(z)
t_3 = sqrt((1.0d0 + x))
if (((t_1 - sqrt(y)) + (t_3 - sqrt(x))) <= 0.0005d0) then
tmp = ((sqrt((1.0d0 / x)) * 0.5d0) + t_2) + (sqrt((t + 1.0d0)) - sqrt(t))
else
tmp = ((t_2 - (sqrt(x) + sqrt(y))) + t_1) + t_3
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((1.0 + y));
double t_2 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
double t_3 = Math.sqrt((1.0 + x));
double tmp;
if (((t_1 - Math.sqrt(y)) + (t_3 - Math.sqrt(x))) <= 0.0005) {
tmp = ((Math.sqrt((1.0 / x)) * 0.5) + t_2) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
} else {
tmp = ((t_2 - (Math.sqrt(x) + Math.sqrt(y))) + t_1) + t_3;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((1.0 + y)) t_2 = math.sqrt((z + 1.0)) - math.sqrt(z) t_3 = math.sqrt((1.0 + x)) tmp = 0 if ((t_1 - math.sqrt(y)) + (t_3 - math.sqrt(x))) <= 0.0005: tmp = ((math.sqrt((1.0 / x)) * 0.5) + t_2) + (math.sqrt((t + 1.0)) - math.sqrt(t)) else: tmp = ((t_2 - (math.sqrt(x) + math.sqrt(y))) + t_1) + t_3 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + y)) t_2 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_3 = sqrt(Float64(1.0 + x)) tmp = 0.0 if (Float64(Float64(t_1 - sqrt(y)) + Float64(t_3 - sqrt(x))) <= 0.0005) tmp = Float64(Float64(Float64(sqrt(Float64(1.0 / x)) * 0.5) + t_2) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))); else tmp = Float64(Float64(Float64(t_2 - Float64(sqrt(x) + sqrt(y))) + t_1) + t_3); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((1.0 + y));
t_2 = sqrt((z + 1.0)) - sqrt(z);
t_3 = sqrt((1.0 + x));
tmp = 0.0;
if (((t_1 - sqrt(y)) + (t_3 - sqrt(x))) <= 0.0005)
tmp = ((sqrt((1.0 / x)) * 0.5) + t_2) + (sqrt((t + 1.0)) - sqrt(t));
else
tmp = ((t_2 - (sqrt(x) + sqrt(y))) + t_1) + t_3;
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + 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[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(t$95$3 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0005], N[(N[(N[(N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision] * 0.5), $MachinePrecision] + t$95$2), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t$95$2 - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$3), $MachinePrecision]]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + y}\\
t_2 := \sqrt{z + 1} - \sqrt{z}\\
t_3 := \sqrt{1 + x}\\
\mathbf{if}\;\left(t\_1 - \sqrt{y}\right) + \left(t\_3 - \sqrt{x}\right) \leq 0.0005:\\
\;\;\;\;\left(\sqrt{\frac{1}{x}} \cdot 0.5 + t\_2\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_2 - \left(\sqrt{x} + \sqrt{y}\right)\right) + t\_1\right) + t\_3\\
\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))) < 5.0000000000000001e-4Initial program 81.3%
Taylor expanded in x around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6486.8
Applied rewrites86.8%
Taylor expanded in x around 0
Applied rewrites86.8%
if 5.0000000000000001e-4 < (+.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.0%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6415.5
Applied rewrites15.5%
Applied rewrites33.7%
Final simplification45.1%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ t 1.0))) (t_2 (sqrt (+ z 1.0))))
(if (<= y 5.2e+17)
(-
(+
(+ (/ 1.0 (+ (sqrt t) t_1)) (/ 1.0 (+ (sqrt z) t_2)))
(+ (sqrt (+ 1.0 y)) 1.0))
(+ (sqrt x) (sqrt y)))
(+
(- t_1 (sqrt t))
(+ (- t_2 (sqrt z)) (/ 1.0 (+ (sqrt (+ 1.0 x)) (sqrt x))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((t + 1.0));
double t_2 = sqrt((z + 1.0));
double tmp;
if (y <= 5.2e+17) {
tmp = (((1.0 / (sqrt(t) + t_1)) + (1.0 / (sqrt(z) + t_2))) + (sqrt((1.0 + y)) + 1.0)) - (sqrt(x) + sqrt(y));
} else {
tmp = (t_1 - sqrt(t)) + ((t_2 - sqrt(z)) + (1.0 / (sqrt((1.0 + x)) + 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((t + 1.0d0))
t_2 = sqrt((z + 1.0d0))
if (y <= 5.2d+17) then
tmp = (((1.0d0 / (sqrt(t) + t_1)) + (1.0d0 / (sqrt(z) + t_2))) + (sqrt((1.0d0 + y)) + 1.0d0)) - (sqrt(x) + sqrt(y))
else
tmp = (t_1 - sqrt(t)) + ((t_2 - sqrt(z)) + (1.0d0 / (sqrt((1.0d0 + x)) + 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((t + 1.0));
double t_2 = Math.sqrt((z + 1.0));
double tmp;
if (y <= 5.2e+17) {
tmp = (((1.0 / (Math.sqrt(t) + t_1)) + (1.0 / (Math.sqrt(z) + t_2))) + (Math.sqrt((1.0 + y)) + 1.0)) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = (t_1 - Math.sqrt(t)) + ((t_2 - Math.sqrt(z)) + (1.0 / (Math.sqrt((1.0 + x)) + Math.sqrt(x))));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((t + 1.0)) t_2 = math.sqrt((z + 1.0)) tmp = 0 if y <= 5.2e+17: tmp = (((1.0 / (math.sqrt(t) + t_1)) + (1.0 / (math.sqrt(z) + t_2))) + (math.sqrt((1.0 + y)) + 1.0)) - (math.sqrt(x) + math.sqrt(y)) else: tmp = (t_1 - math.sqrt(t)) + ((t_2 - math.sqrt(z)) + (1.0 / (math.sqrt((1.0 + x)) + math.sqrt(x)))) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(t + 1.0)) t_2 = sqrt(Float64(z + 1.0)) tmp = 0.0 if (y <= 5.2e+17) tmp = Float64(Float64(Float64(Float64(1.0 / Float64(sqrt(t) + t_1)) + Float64(1.0 / Float64(sqrt(z) + t_2))) + Float64(sqrt(Float64(1.0 + y)) + 1.0)) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(t_1 - sqrt(t)) + Float64(Float64(t_2 - sqrt(z)) + Float64(1.0 / Float64(sqrt(Float64(1.0 + x)) + 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((t + 1.0));
t_2 = sqrt((z + 1.0));
tmp = 0.0;
if (y <= 5.2e+17)
tmp = (((1.0 / (sqrt(t) + t_1)) + (1.0 / (sqrt(z) + t_2))) + (sqrt((1.0 + y)) + 1.0)) - (sqrt(x) + sqrt(y));
else
tmp = (t_1 - sqrt(t)) + ((t_2 - sqrt(z)) + (1.0 / (sqrt((1.0 + x)) + 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[(t + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, 5.2e+17], N[(N[(N[(N[(1.0 / N[(N[Sqrt[t], $MachinePrecision] + t$95$1), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[z], $MachinePrecision] + t$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(t$95$1 - N[Sqrt[t], $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{t + 1}\\
t_2 := \sqrt{z + 1}\\
\mathbf{if}\;y \leq 5.2 \cdot 10^{+17}:\\
\;\;\;\;\left(\left(\frac{1}{\sqrt{t} + t\_1} + \frac{1}{\sqrt{z} + t\_2}\right) + \left(\sqrt{1 + y} + 1\right)\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(t\_1 - \sqrt{t}\right) + \left(\left(t\_2 - \sqrt{z}\right) + \frac{1}{\sqrt{1 + x} + \sqrt{x}}\right)\\
\end{array}
\end{array}
if y < 5.2e17Initial program 96.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.8
Applied rewrites96.8%
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.3
Applied rewrites97.3%
Taylor expanded in x around 0
lower--.f64N/A
Applied rewrites44.8%
if 5.2e17 < y Initial program 90.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
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6490.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6490.5
Applied rewrites90.5%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6493.2
Applied rewrites93.2%
Final simplification66.7%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (- (sqrt (+ z 1.0)) (sqrt z)))
(t_2 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= x 1.45e+16)
(+
(+ (+ (- (sqrt (+ 1.0 y)) (sqrt y)) (- (sqrt (+ 1.0 x)) (sqrt x))) t_1)
t_2)
(+ (+ (* (+ (sqrt (/ 1.0 x)) (sqrt (/ 1.0 y))) 0.5) t_1) t_2))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (x <= 1.45e+16) {
tmp = (((sqrt((1.0 + y)) - sqrt(y)) + (sqrt((1.0 + x)) - sqrt(x))) + t_1) + t_2;
} else {
tmp = (((sqrt((1.0 / x)) + sqrt((1.0 / y))) * 0.5) + t_1) + t_2;
}
return tmp;
}
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = sqrt((z + 1.0d0)) - sqrt(z)
t_2 = sqrt((t + 1.0d0)) - sqrt(t)
if (x <= 1.45d+16) then
tmp = (((sqrt((1.0d0 + y)) - sqrt(y)) + (sqrt((1.0d0 + x)) - sqrt(x))) + t_1) + t_2
else
tmp = (((sqrt((1.0d0 / x)) + sqrt((1.0d0 / y))) * 0.5d0) + t_1) + t_2
end if
code = tmp
end function
assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
double t_1 = Math.sqrt((z + 1.0)) - Math.sqrt(z);
double t_2 = Math.sqrt((t + 1.0)) - Math.sqrt(t);
double tmp;
if (x <= 1.45e+16) {
tmp = (((Math.sqrt((1.0 + y)) - Math.sqrt(y)) + (Math.sqrt((1.0 + x)) - Math.sqrt(x))) + t_1) + t_2;
} else {
tmp = (((Math.sqrt((1.0 / x)) + Math.sqrt((1.0 / y))) * 0.5) + t_1) + t_2;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((z + 1.0)) - math.sqrt(z) t_2 = math.sqrt((t + 1.0)) - math.sqrt(t) tmp = 0 if x <= 1.45e+16: tmp = (((math.sqrt((1.0 + y)) - math.sqrt(y)) + (math.sqrt((1.0 + x)) - math.sqrt(x))) + t_1) + t_2 else: tmp = (((math.sqrt((1.0 / x)) + math.sqrt((1.0 / y))) * 0.5) + t_1) + t_2 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (x <= 1.45e+16) tmp = Float64(Float64(Float64(Float64(sqrt(Float64(1.0 + y)) - sqrt(y)) + Float64(sqrt(Float64(1.0 + x)) - sqrt(x))) + t_1) + t_2); else tmp = Float64(Float64(Float64(Float64(sqrt(Float64(1.0 / x)) + sqrt(Float64(1.0 / y))) * 0.5) + t_1) + t_2); end return tmp end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
t_1 = sqrt((z + 1.0)) - sqrt(z);
t_2 = sqrt((t + 1.0)) - sqrt(t);
tmp = 0.0;
if (x <= 1.45e+16)
tmp = (((sqrt((1.0 + y)) - sqrt(y)) + (sqrt((1.0 + x)) - sqrt(x))) + t_1) + t_2;
else
tmp = (((sqrt((1.0 / x)) + sqrt((1.0 / y))) * 0.5) + t_1) + t_2;
end
tmp_2 = tmp;
end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.45e+16], N[(N[(N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision], N[(N[(N[(N[(N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision] + N[Sqrt[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1} - \sqrt{z}\\
t_2 := \sqrt{t + 1} - \sqrt{t}\\
\mathbf{if}\;x \leq 1.45 \cdot 10^{+16}:\\
\;\;\;\;\left(\left(\left(\sqrt{1 + y} - \sqrt{y}\right) + \left(\sqrt{1 + x} - \sqrt{x}\right)\right) + t\_1\right) + t\_2\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\sqrt{\frac{1}{x}} + \sqrt{\frac{1}{y}}\right) \cdot 0.5 + t\_1\right) + t\_2\\
\end{array}
\end{array}
if x < 1.45e16Initial program 96.5%
if 1.45e16 < x Initial program 90.8%
Taylor expanded in x around inf
+-commutativeN/A
associate--l+N/A
*-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
lower-/.f64N/A
lower--.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6493.6
Applied rewrites93.6%
Taylor expanded in y around inf
Applied rewrites42.3%
Final simplification69.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 (+ z 1.0)) (sqrt z)))
(t_2 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= x 0.021)
(+
(+ (+ (fma 0.5 x (- 1.0 (sqrt x))) (- (sqrt (+ 1.0 y)) (sqrt y))) t_1)
t_2)
(+ t_2 (+ t_1 (/ 1.0 (+ (sqrt (+ 1.0 x)) (sqrt x))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (x <= 0.021) {
tmp = ((fma(0.5, x, (1.0 - sqrt(x))) + (sqrt((1.0 + y)) - sqrt(y))) + t_1) + t_2;
} else {
tmp = t_2 + (t_1 + (1.0 / (sqrt((1.0 + x)) + sqrt(x))));
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (x <= 0.021) tmp = Float64(Float64(Float64(fma(0.5, x, Float64(1.0 - sqrt(x))) + Float64(sqrt(Float64(1.0 + y)) - sqrt(y))) + t_1) + t_2); else tmp = Float64(t_2 + Float64(t_1 + Float64(1.0 / Float64(sqrt(Float64(1.0 + x)) + 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[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 0.021], N[(N[(N[(N[(0.5 * x + N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision], N[(t$95$2 + N[(t$95$1 + N[(1.0 / N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $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} - \sqrt{t}\\
\mathbf{if}\;x \leq 0.021:\\
\;\;\;\;\left(\left(\mathsf{fma}\left(0.5, x, 1 - \sqrt{x}\right) + \left(\sqrt{1 + y} - \sqrt{y}\right)\right) + t\_1\right) + t\_2\\
\mathbf{else}:\\
\;\;\;\;t\_2 + \left(t\_1 + \frac{1}{\sqrt{1 + x} + \sqrt{x}}\right)\\
\end{array}
\end{array}
if x < 0.0210000000000000013Initial program 96.5%
Taylor expanded in x around 0
+-commutativeN/A
associate--l+N/A
lower-fma.f64N/A
lower--.f64N/A
lower-sqrt.f6496.5
Applied rewrites96.5%
if 0.0210000000000000013 < x Initial program 90.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
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6491.0
lift-+.f64N/A
+-commutativeN/A
lower-+.f6491.0
Applied rewrites91.0%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6446.8
Applied rewrites46.8%
Final simplification71.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 (+ z 1.0)) (sqrt z)))
(t_2 (- (sqrt (+ t 1.0)) (sqrt t))))
(if (<= y 1e+18)
(+
(+ (- (- (+ (fma 0.5 x 1.0) (sqrt (+ 1.0 y))) (sqrt y)) (sqrt x)) t_1)
t_2)
(+ t_2 (+ t_1 (/ 1.0 (+ (sqrt (+ 1.0 x)) (sqrt x))))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0)) - sqrt(z);
double t_2 = sqrt((t + 1.0)) - sqrt(t);
double tmp;
if (y <= 1e+18) {
tmp = ((((fma(0.5, x, 1.0) + sqrt((1.0 + y))) - sqrt(y)) - sqrt(x)) + t_1) + t_2;
} else {
tmp = t_2 + (t_1 + (1.0 / (sqrt((1.0 + x)) + sqrt(x))));
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) t_2 = Float64(sqrt(Float64(t + 1.0)) - sqrt(t)) tmp = 0.0 if (y <= 1e+18) tmp = Float64(Float64(Float64(Float64(Float64(fma(0.5, x, 1.0) + sqrt(Float64(1.0 + y))) - sqrt(y)) - sqrt(x)) + t_1) + t_2); else tmp = Float64(t_2 + Float64(t_1 + Float64(1.0 / Float64(sqrt(Float64(1.0 + x)) + 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[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 1e+18], N[(N[(N[(N[(N[(N[(0.5 * x + 1.0), $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision] + t$95$2), $MachinePrecision], N[(t$95$2 + N[(t$95$1 + N[(1.0 / N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $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} - \sqrt{t}\\
\mathbf{if}\;y \leq 10^{+18}:\\
\;\;\;\;\left(\left(\left(\left(\mathsf{fma}\left(0.5, x, 1\right) + \sqrt{1 + y}\right) - \sqrt{y}\right) - \sqrt{x}\right) + t\_1\right) + t\_2\\
\mathbf{else}:\\
\;\;\;\;t\_2 + \left(t\_1 + \frac{1}{\sqrt{1 + x} + \sqrt{x}}\right)\\
\end{array}
\end{array}
if y < 1e18Initial program 96.3%
Taylor expanded in x around 0
+-commutativeN/A
associate--r+N/A
lower--.f64N/A
lower--.f64N/A
+-commutativeN/A
associate-+r+N/A
lower-+.f64N/A
+-commutativeN/A
lower-fma.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6446.1
Applied rewrites46.1%
if 1e18 < y Initial program 90.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
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f6490.5
lift-+.f64N/A
+-commutativeN/A
lower-+.f6490.5
Applied rewrites90.5%
Taylor expanded in y around inf
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f6493.2
Applied rewrites93.2%
Final simplification67.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 (+ 1.0 y))) (t_2 (sqrt (+ z 1.0))))
(if (<= (- t_2 (sqrt z)) 5e-6)
(+ (- (fma (sqrt (/ 1.0 z)) 0.5 t_1) (+ (sqrt x) (sqrt y))) 1.0)
(+ (+ (- (- t_1 (sqrt y)) (+ (sqrt x) (sqrt z))) 1.0) t_2))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((1.0 + y));
double t_2 = sqrt((z + 1.0));
double tmp;
if ((t_2 - sqrt(z)) <= 5e-6) {
tmp = (fma(sqrt((1.0 / z)), 0.5, t_1) - (sqrt(x) + sqrt(y))) + 1.0;
} else {
tmp = (((t_1 - sqrt(y)) - (sqrt(x) + sqrt(z))) + 1.0) + t_2;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(1.0 + y)) t_2 = sqrt(Float64(z + 1.0)) tmp = 0.0 if (Float64(t_2 - sqrt(z)) <= 5e-6) tmp = Float64(Float64(fma(sqrt(Float64(1.0 / z)), 0.5, t_1) - Float64(sqrt(x) + sqrt(y))) + 1.0); else tmp = Float64(Float64(Float64(Float64(t_1 - sqrt(y)) - Float64(sqrt(x) + sqrt(z))) + 1.0) + t_2); end return tmp end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$2 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision], 5e-6], N[(N[(N[(N[Sqrt[N[(1.0 / z), $MachinePrecision]], $MachinePrecision] * 0.5 + t$95$1), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(N[(N[(t$95$1 - N[Sqrt[y], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] + t$95$2), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{1 + y}\\
t_2 := \sqrt{z + 1}\\
\mathbf{if}\;t\_2 - \sqrt{z} \leq 5 \cdot 10^{-6}:\\
\;\;\;\;\left(\mathsf{fma}\left(\sqrt{\frac{1}{z}}, 0.5, t\_1\right) - \left(\sqrt{x} + \sqrt{y}\right)\right) + 1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(\left(t\_1 - \sqrt{y}\right) - \left(\sqrt{x} + \sqrt{z}\right)\right) + 1\right) + t\_2\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) < 5.00000000000000041e-6Initial program 89.9%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f644.9
Applied rewrites4.9%
Taylor expanded in z around inf
Applied rewrites2.2%
Taylor expanded in x around 0
Applied rewrites31.3%
Taylor expanded in z around inf
Applied rewrites33.6%
if 5.00000000000000041e-6 < (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) Initial program 97.0%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.3
Applied rewrites20.3%
Taylor expanded in z around inf
Applied rewrites1.5%
Taylor expanded in x around 0
Applied rewrites24.4%
Applied rewrites27.1%
Final simplification30.3%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
:precision binary64
(let* ((t_1 (sqrt (+ z 1.0))))
(if (<= (- t_1 (sqrt z)) 5e-6)
(+
(- (fma (sqrt (/ 1.0 z)) 0.5 (sqrt (+ 1.0 y))) (+ (sqrt x) (sqrt y)))
1.0)
(+ (- (+ t_1 1.0) (+ (+ (sqrt y) (sqrt z)) (sqrt x))) 1.0))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double tmp;
if ((t_1 - sqrt(z)) <= 5e-6) {
tmp = (fma(sqrt((1.0 / z)), 0.5, sqrt((1.0 + y))) - (sqrt(x) + sqrt(y))) + 1.0;
} else {
tmp = ((t_1 + 1.0) - ((sqrt(y) + sqrt(z)) + sqrt(x))) + 1.0;
}
return tmp;
}
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) tmp = 0.0 if (Float64(t_1 - sqrt(z)) <= 5e-6) tmp = Float64(Float64(fma(sqrt(Float64(1.0 / z)), 0.5, sqrt(Float64(1.0 + y))) - Float64(sqrt(x) + sqrt(y))) + 1.0); else tmp = Float64(Float64(Float64(t_1 + 1.0) - Float64(Float64(sqrt(y) + sqrt(z)) + sqrt(x))) + 1.0); end return tmp end
NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := Block[{t$95$1 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision], 5e-6], N[(N[(N[(N[Sqrt[N[(1.0 / z), $MachinePrecision]], $MachinePrecision] * 0.5 + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(N[(t$95$1 + 1.0), $MachinePrecision] - N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
\mathbf{if}\;t\_1 - \sqrt{z} \leq 5 \cdot 10^{-6}:\\
\;\;\;\;\left(\mathsf{fma}\left(\sqrt{\frac{1}{z}}, 0.5, \sqrt{1 + y}\right) - \left(\sqrt{x} + \sqrt{y}\right)\right) + 1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_1 + 1\right) - \left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right)\right) + 1\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) < 5.00000000000000041e-6Initial program 89.9%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f644.9
Applied rewrites4.9%
Taylor expanded in z around inf
Applied rewrites2.2%
Taylor expanded in x around 0
Applied rewrites31.3%
Taylor expanded in z around inf
Applied rewrites33.6%
if 5.00000000000000041e-6 < (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) Initial program 97.0%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.3
Applied rewrites20.3%
Taylor expanded in z around inf
Applied rewrites1.5%
Taylor expanded in x around 0
Applied rewrites24.4%
Taylor expanded in y around 0
Applied rewrites14.0%
Final simplification23.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 (+ z 1.0))))
(if (<= (- t_1 (sqrt z)) 5e-8)
(+ (- (sqrt (+ 1.0 y)) (+ (sqrt x) (sqrt y))) 1.0)
(+ (- (+ t_1 1.0) (+ (+ (sqrt y) (sqrt z)) (sqrt x))) 1.0))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double tmp;
if ((t_1 - sqrt(z)) <= 5e-8) {
tmp = (sqrt((1.0 + y)) - (sqrt(x) + sqrt(y))) + 1.0;
} else {
tmp = ((t_1 + 1.0) - ((sqrt(y) + sqrt(z)) + sqrt(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) :: t_1
real(8) :: tmp
t_1 = sqrt((z + 1.0d0))
if ((t_1 - sqrt(z)) <= 5d-8) then
tmp = (sqrt((1.0d0 + y)) - (sqrt(x) + sqrt(y))) + 1.0d0
else
tmp = ((t_1 + 1.0d0) - ((sqrt(y) + sqrt(z)) + sqrt(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 t_1 = Math.sqrt((z + 1.0));
double tmp;
if ((t_1 - Math.sqrt(z)) <= 5e-8) {
tmp = (Math.sqrt((1.0 + y)) - (Math.sqrt(x) + Math.sqrt(y))) + 1.0;
} else {
tmp = ((t_1 + 1.0) - ((Math.sqrt(y) + Math.sqrt(z)) + Math.sqrt(x))) + 1.0;
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((z + 1.0)) tmp = 0 if (t_1 - math.sqrt(z)) <= 5e-8: tmp = (math.sqrt((1.0 + y)) - (math.sqrt(x) + math.sqrt(y))) + 1.0 else: tmp = ((t_1 + 1.0) - ((math.sqrt(y) + math.sqrt(z)) + math.sqrt(x))) + 1.0 return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) tmp = 0.0 if (Float64(t_1 - sqrt(z)) <= 5e-8) tmp = Float64(Float64(sqrt(Float64(1.0 + y)) - Float64(sqrt(x) + sqrt(y))) + 1.0); else tmp = Float64(Float64(Float64(t_1 + 1.0) - Float64(Float64(sqrt(y) + sqrt(z)) + sqrt(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)
t_1 = sqrt((z + 1.0));
tmp = 0.0;
if ((t_1 - sqrt(z)) <= 5e-8)
tmp = (sqrt((1.0 + y)) - (sqrt(x) + sqrt(y))) + 1.0;
else
tmp = ((t_1 + 1.0) - ((sqrt(y) + sqrt(z)) + sqrt(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_] := Block[{t$95$1 = N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision], 5e-8], N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(N[(t$95$1 + 1.0), $MachinePrecision] - N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
\mathbf{if}\;t\_1 - \sqrt{z} \leq 5 \cdot 10^{-8}:\\
\;\;\;\;\left(\sqrt{1 + y} - \left(\sqrt{x} + \sqrt{y}\right)\right) + 1\\
\mathbf{else}:\\
\;\;\;\;\left(\left(t\_1 + 1\right) - \left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right)\right) + 1\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) < 4.9999999999999998e-8Initial program 90.4%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f644.2
Applied rewrites4.2%
Taylor expanded in z around inf
Applied rewrites2.2%
Taylor expanded in x around 0
Applied rewrites31.3%
Taylor expanded in z around inf
Applied rewrites33.5%
if 4.9999999999999998e-8 < (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) Initial program 96.5%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.5
Applied rewrites20.5%
Taylor expanded in z around inf
Applied rewrites1.5%
Taylor expanded in x around 0
Applied rewrites24.5%
Taylor expanded in y around 0
Applied rewrites14.2%
Final simplification23.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))))
(if (<= (- t_1 (sqrt z)) 5e-8)
(+ (- (sqrt (+ 1.0 y)) (+ (sqrt x) (sqrt y))) 1.0)
(- (+ 2.0 t_1) (+ (+ (sqrt y) (sqrt z)) (sqrt x))))))assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
double t_1 = sqrt((z + 1.0));
double tmp;
if ((t_1 - sqrt(z)) <= 5e-8) {
tmp = (sqrt((1.0 + y)) - (sqrt(x) + sqrt(y))) + 1.0;
} else {
tmp = (2.0 + t_1) - ((sqrt(y) + sqrt(z)) + 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) :: tmp
t_1 = sqrt((z + 1.0d0))
if ((t_1 - sqrt(z)) <= 5d-8) then
tmp = (sqrt((1.0d0 + y)) - (sqrt(x) + sqrt(y))) + 1.0d0
else
tmp = (2.0d0 + t_1) - ((sqrt(y) + sqrt(z)) + 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((z + 1.0));
double tmp;
if ((t_1 - Math.sqrt(z)) <= 5e-8) {
tmp = (Math.sqrt((1.0 + y)) - (Math.sqrt(x) + Math.sqrt(y))) + 1.0;
} else {
tmp = (2.0 + t_1) - ((Math.sqrt(y) + Math.sqrt(z)) + Math.sqrt(x));
}
return tmp;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): t_1 = math.sqrt((z + 1.0)) tmp = 0 if (t_1 - math.sqrt(z)) <= 5e-8: tmp = (math.sqrt((1.0 + y)) - (math.sqrt(x) + math.sqrt(y))) + 1.0 else: tmp = (2.0 + t_1) - ((math.sqrt(y) + math.sqrt(z)) + math.sqrt(x)) return tmp
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) t_1 = sqrt(Float64(z + 1.0)) tmp = 0.0 if (Float64(t_1 - sqrt(z)) <= 5e-8) tmp = Float64(Float64(sqrt(Float64(1.0 + y)) - Float64(sqrt(x) + sqrt(y))) + 1.0); else tmp = Float64(Float64(2.0 + t_1) - Float64(Float64(sqrt(y) + sqrt(z)) + 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((z + 1.0));
tmp = 0.0;
if ((t_1 - sqrt(z)) <= 5e-8)
tmp = (sqrt((1.0 + y)) - (sqrt(x) + sqrt(y))) + 1.0;
else
tmp = (2.0 + t_1) - ((sqrt(y) + sqrt(z)) + 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[(z + 1.0), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(t$95$1 - N[Sqrt[z], $MachinePrecision]), $MachinePrecision], 5e-8], N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision], N[(N[(2.0 + t$95$1), $MachinePrecision] - N[(N[(N[Sqrt[y], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
t_1 := \sqrt{z + 1}\\
\mathbf{if}\;t\_1 - \sqrt{z} \leq 5 \cdot 10^{-8}:\\
\;\;\;\;\left(\sqrt{1 + y} - \left(\sqrt{x} + \sqrt{y}\right)\right) + 1\\
\mathbf{else}:\\
\;\;\;\;\left(2 + t\_1\right) - \left(\left(\sqrt{y} + \sqrt{z}\right) + \sqrt{x}\right)\\
\end{array}
\end{array}
if (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) < 4.9999999999999998e-8Initial program 90.4%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f644.2
Applied rewrites4.2%
Taylor expanded in z around inf
Applied rewrites2.2%
Taylor expanded in x around 0
Applied rewrites31.3%
Taylor expanded in z around inf
Applied rewrites33.5%
if 4.9999999999999998e-8 < (-.f64 (sqrt.f64 (+.f64 z #s(literal 1 binary64))) (sqrt.f64 z)) Initial program 96.5%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6420.5
Applied rewrites20.5%
Taylor expanded in z around inf
Applied rewrites1.5%
Taylor expanded in x around 0
Applied rewrites24.5%
Taylor expanded in y around 0
Applied rewrites14.2%
Final simplification23.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 (+ z 1.0)) (sqrt z)) (+ (sqrt x) (sqrt y))) (sqrt (+ 1.0 y))) (sqrt (+ 1.0 x))))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return (((sqrt((z + 1.0)) - sqrt(z)) - (sqrt(x) + sqrt(y))) + sqrt((1.0 + y))) + sqrt((1.0 + 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((z + 1.0d0)) - sqrt(z)) - (sqrt(x) + sqrt(y))) + sqrt((1.0d0 + y))) + sqrt((1.0d0 + 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((z + 1.0)) - Math.sqrt(z)) - (Math.sqrt(x) + Math.sqrt(y))) + Math.sqrt((1.0 + y))) + Math.sqrt((1.0 + x));
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return (((math.sqrt((z + 1.0)) - math.sqrt(z)) - (math.sqrt(x) + math.sqrt(y))) + math.sqrt((1.0 + y))) + math.sqrt((1.0 + x))
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(Float64(Float64(sqrt(Float64(z + 1.0)) - sqrt(z)) - Float64(sqrt(x) + sqrt(y))) + sqrt(Float64(1.0 + y))) + sqrt(Float64(1.0 + x))) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = (((sqrt((z + 1.0)) - sqrt(z)) - (sqrt(x) + sqrt(y))) + sqrt((1.0 + y))) + sqrt((1.0 + 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[(N[(N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[z], $MachinePrecision]), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] + N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(\left(\left(\sqrt{z + 1} - \sqrt{z}\right) - \left(\sqrt{x} + \sqrt{y}\right)\right) + \sqrt{1 + y}\right) + \sqrt{1 + x}
\end{array}
Initial program 93.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6412.9
Applied rewrites12.9%
Applied rewrites27.6%
Final simplification27.6%
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+29) (- (+ (sqrt (+ 1.0 y)) 1.0) (+ (sqrt x) (sqrt y))) (+ (- (sqrt 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+29) {
tmp = (sqrt((1.0 + y)) + 1.0) - (sqrt(x) + sqrt(y));
} else {
tmp = -sqrt(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+29) then
tmp = (sqrt((1.0d0 + y)) + 1.0d0) - (sqrt(x) + sqrt(y))
else
tmp = -sqrt(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+29) {
tmp = (Math.sqrt((1.0 + y)) + 1.0) - (Math.sqrt(x) + Math.sqrt(y));
} else {
tmp = -Math.sqrt(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+29: tmp = (math.sqrt((1.0 + y)) + 1.0) - (math.sqrt(x) + math.sqrt(y)) else: tmp = -math.sqrt(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+29) tmp = Float64(Float64(sqrt(Float64(1.0 + y)) + 1.0) - Float64(sqrt(x) + sqrt(y))); else tmp = Float64(Float64(-sqrt(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+29)
tmp = (sqrt((1.0 + y)) + 1.0) - (sqrt(x) + sqrt(y));
else
tmp = -sqrt(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+29], N[(N[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] + 1.0), $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[Sqrt[x], $MachinePrecision]) + 1.0), $MachinePrecision]]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;y \leq 10^{+29}:\\
\;\;\;\;\left(\sqrt{1 + y} + 1\right) - \left(\sqrt{x} + \sqrt{y}\right)\\
\mathbf{else}:\\
\;\;\;\;\left(-\sqrt{x}\right) + 1\\
\end{array}
\end{array}
if y < 9.99999999999999914e28Initial program 95.3%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6419.7
Applied rewrites19.7%
Taylor expanded in z around inf
Applied rewrites2.0%
Taylor expanded in x around 0
Applied rewrites26.4%
Taylor expanded in z around inf
Applied rewrites18.4%
if 9.99999999999999914e28 < y Initial program 91.5%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f644.1
Applied rewrites4.1%
Taylor expanded in z around inf
Applied rewrites1.5%
Taylor expanded in x around 0
Applied rewrites29.4%
Taylor expanded in x around inf
Applied rewrites19.8%
Final simplification19.0%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (+ (- (sqrt (+ 1.0 y)) (+ (sqrt x) (sqrt y))) 1.0))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return (sqrt((1.0 + y)) - (sqrt(x) + sqrt(y))) + 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((1.0d0 + y)) - (sqrt(x) + sqrt(y))) + 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((1.0 + y)) - (Math.sqrt(x) + Math.sqrt(y))) + 1.0;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return (math.sqrt((1.0 + y)) - (math.sqrt(x) + math.sqrt(y))) + 1.0
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(sqrt(Float64(1.0 + y)) - Float64(sqrt(x) + sqrt(y))) + 1.0) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = (sqrt((1.0 + y)) - (sqrt(x) + sqrt(y))) + 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[(N[Sqrt[N[(1.0 + y), $MachinePrecision]], $MachinePrecision] - N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(\sqrt{1 + y} - \left(\sqrt{x} + \sqrt{y}\right)\right) + 1
\end{array}
Initial program 93.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6412.9
Applied rewrites12.9%
Taylor expanded in z around inf
Applied rewrites1.8%
Taylor expanded in x around 0
Applied rewrites27.7%
Taylor expanded in z around inf
Applied rewrites22.9%
Final simplification22.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)) 1.0))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return -sqrt(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) + 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) + 1.0;
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return -math.sqrt(x) + 1.0
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(Float64(-sqrt(x)) + 1.0) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = -sqrt(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]) + 1.0), $MachinePrecision]
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
\left(-\sqrt{x}\right) + 1
\end{array}
Initial program 93.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6412.9
Applied rewrites12.9%
Taylor expanded in z around inf
Applied rewrites1.8%
Taylor expanded in x around 0
Applied rewrites27.7%
Taylor expanded in x around inf
Applied rewrites13.8%
Final simplification13.8%
NOTE: x, y, z, and t should be sorted in increasing order before calling this function. (FPCore (x y z t) :precision binary64 (- (sqrt x)))
assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
return -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)
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);
}
[x, y, z, t] = sort([x, y, z, t]) def code(x, y, z, t): return -math.sqrt(x)
x, y, z, t = sort([x, y, z, t]) function code(x, y, z, t) return Float64(-sqrt(x)) end
x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
tmp = -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[Sqrt[x], $MachinePrecision])
\begin{array}{l}
[x, y, z, t] = \mathsf{sort}([x, y, z, t])\\
\\
-\sqrt{x}
\end{array}
Initial program 93.6%
Taylor expanded in t around inf
lower--.f64N/A
associate-+r+N/A
lower-+.f64N/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f64N/A
lower-sqrt.f6412.9
Applied rewrites12.9%
Taylor expanded in z around inf
Applied rewrites1.8%
Taylor expanded in x around 0
Applied rewrites27.7%
Taylor expanded in x around inf
Applied rewrites1.6%
(FPCore (x y z t)
:precision binary64
(+
(+
(+
(/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x)))
(/ 1.0 (+ (sqrt (+ y 1.0)) (sqrt y))))
(/ 1.0 (+ (sqrt (+ z 1.0)) (sqrt z))))
(- (sqrt (+ t 1.0)) (sqrt t))))
double code(double x, double y, double z, double t) {
return (((1.0 / (sqrt((x + 1.0)) + sqrt(x))) + (1.0 / (sqrt((y + 1.0)) + sqrt(y)))) + (1.0 / (sqrt((z + 1.0)) + sqrt(z)))) + (sqrt((t + 1.0)) - sqrt(t));
}
real(8) function code(x, y, z, t)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
code = (((1.0d0 / (sqrt((x + 1.0d0)) + sqrt(x))) + (1.0d0 / (sqrt((y + 1.0d0)) + sqrt(y)))) + (1.0d0 / (sqrt((z + 1.0d0)) + sqrt(z)))) + (sqrt((t + 1.0d0)) - sqrt(t))
end function
public static double code(double x, double y, double z, double t) {
return (((1.0 / (Math.sqrt((x + 1.0)) + Math.sqrt(x))) + (1.0 / (Math.sqrt((y + 1.0)) + Math.sqrt(y)))) + (1.0 / (Math.sqrt((z + 1.0)) + Math.sqrt(z)))) + (Math.sqrt((t + 1.0)) - Math.sqrt(t));
}
def code(x, y, z, t): return (((1.0 / (math.sqrt((x + 1.0)) + math.sqrt(x))) + (1.0 / (math.sqrt((y + 1.0)) + math.sqrt(y)))) + (1.0 / (math.sqrt((z + 1.0)) + math.sqrt(z)))) + (math.sqrt((t + 1.0)) - math.sqrt(t))
function code(x, y, z, t) return Float64(Float64(Float64(Float64(1.0 / Float64(sqrt(Float64(x + 1.0)) + sqrt(x))) + Float64(1.0 / Float64(sqrt(Float64(y + 1.0)) + sqrt(y)))) + Float64(1.0 / Float64(sqrt(Float64(z + 1.0)) + sqrt(z)))) + Float64(sqrt(Float64(t + 1.0)) - sqrt(t))) end
function tmp = code(x, y, z, t) tmp = (((1.0 / (sqrt((x + 1.0)) + sqrt(x))) + (1.0 / (sqrt((y + 1.0)) + sqrt(y)))) + (1.0 / (sqrt((z + 1.0)) + sqrt(z)))) + (sqrt((t + 1.0)) - sqrt(t)); end
code[x_, y_, z_, t_] := N[(N[(N[(N[(1.0 / N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[N[(y + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(N[Sqrt[N[(z + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Sqrt[N[(t + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[t], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(\left(\frac{1}{\sqrt{x + 1} + \sqrt{x}} + \frac{1}{\sqrt{y + 1} + \sqrt{y}}\right) + \frac{1}{\sqrt{z + 1} + \sqrt{z}}\right) + \left(\sqrt{t + 1} - \sqrt{t}\right)
\end{array}
herbie shell --seed 2024235
(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))))