
(FPCore (x y z a) :precision binary64 (+ x (- (tan (+ y z)) (tan a))))
double code(double x, double y, double z, double a) {
return x + (tan((y + z)) - tan(a));
}
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = x + (tan((y + z)) - tan(a))
end function
public static double code(double x, double y, double z, double a) {
return x + (Math.tan((y + z)) - Math.tan(a));
}
def code(x, y, z, a): return x + (math.tan((y + z)) - math.tan(a))
function code(x, y, z, a) return Float64(x + Float64(tan(Float64(y + z)) - tan(a))) end
function tmp = code(x, y, z, a) tmp = x + (tan((y + z)) - tan(a)); end
code[x_, y_, z_, a_] := N[(x + N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x + \left(\tan \left(y + z\right) - \tan a\right)
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 11 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z a) :precision binary64 (+ x (- (tan (+ y z)) (tan a))))
double code(double x, double y, double z, double a) {
return x + (tan((y + z)) - tan(a));
}
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = x + (tan((y + z)) - tan(a))
end function
public static double code(double x, double y, double z, double a) {
return x + (Math.tan((y + z)) - Math.tan(a));
}
def code(x, y, z, a): return x + (math.tan((y + z)) - math.tan(a))
function code(x, y, z, a) return Float64(x + Float64(tan(Float64(y + z)) - tan(a))) end
function tmp = code(x, y, z, a) tmp = x + (tan((y + z)) - tan(a)); end
code[x_, y_, z_, a_] := N[(x + N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
x + \left(\tan \left(y + z\right) - \tan a\right)
\end{array}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (+ (- (/ (+ (tan y) (tan z)) (- 1.0 (/ (* (sin z) (tan y)) (cos z)))) (tan a)) x))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return (((tan(y) + tan(z)) / (1.0 - ((sin(z) * tan(y)) / cos(z)))) - tan(a)) + x;
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = (((tan(y) + tan(z)) / (1.0d0 - ((sin(z) * tan(y)) / cos(z)))) - tan(a)) + x
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return (((Math.tan(y) + Math.tan(z)) / (1.0 - ((Math.sin(z) * Math.tan(y)) / Math.cos(z)))) - Math.tan(a)) + x;
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return (((math.tan(y) + math.tan(z)) / (1.0 - ((math.sin(z) * math.tan(y)) / math.cos(z)))) - math.tan(a)) + x
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(Float64(Float64(Float64(tan(y) + tan(z)) / Float64(1.0 - Float64(Float64(sin(z) * tan(y)) / cos(z)))) - tan(a)) + x) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = (((tan(y) + tan(z)) / (1.0 - ((sin(z) * tan(y)) / cos(z)))) - tan(a)) + x;
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(N[(N[(N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision] / N[(1.0 - N[(N[(N[Sin[z], $MachinePrecision] * N[Tan[y], $MachinePrecision]), $MachinePrecision] / N[Cos[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\left(\frac{\tan y + \tan z}{1 - \frac{\sin z \cdot \tan y}{\cos z}} - \tan a\right) + x
\end{array}
Initial program 80.3%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.7
Applied rewrites99.7%
lift-fma.f64N/A
+-commutativeN/A
lift-neg.f64N/A
cancel-sign-sub-invN/A
lift-tan.f64N/A
lift-tan.f64N/A
lower--.f64N/A
lift-tan.f64N/A
lift-tan.f64N/A
*-commutativeN/A
lower-*.f6499.7
Applied rewrites99.7%
lift-*.f64N/A
lift-tan.f64N/A
tan-quotN/A
associate-*r/N/A
lower-/.f64N/A
lower-*.f64N/A
lower-sin.f64N/A
lower-cos.f6499.7
Applied rewrites99.7%
Final simplification99.7%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
(FPCore (x y z a)
:precision binary64
(let* ((t_0 (+ (tan y) (tan z))))
(if (<= (tan a) -0.01)
(-
(tan (* (/ (- z y) (/ (- z y) (- y z))) (/ (+ y z) (- y z))))
(- (tan a) x))
(if (<= (tan a) 2e-40)
(-
x
(-
(*
(fma
(fma 0.13333333333333333 (* a a) 0.3333333333333333)
(* a a)
1.0)
a)
(/ t_0 (fma (- (tan z)) (tan y) 1.0))))
(- x (- (tan a) (/ t_0 1.0)))))))assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
double t_0 = tan(y) + tan(z);
double tmp;
if (tan(a) <= -0.01) {
tmp = tan((((z - y) / ((z - y) / (y - z))) * ((y + z) / (y - z)))) - (tan(a) - x);
} else if (tan(a) <= 2e-40) {
tmp = x - ((fma(fma(0.13333333333333333, (a * a), 0.3333333333333333), (a * a), 1.0) * a) - (t_0 / fma(-tan(z), tan(y), 1.0)));
} else {
tmp = x - (tan(a) - (t_0 / 1.0));
}
return tmp;
}
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) t_0 = Float64(tan(y) + tan(z)) tmp = 0.0 if (tan(a) <= -0.01) tmp = Float64(tan(Float64(Float64(Float64(z - y) / Float64(Float64(z - y) / Float64(y - z))) * Float64(Float64(y + z) / Float64(y - z)))) - Float64(tan(a) - x)); elseif (tan(a) <= 2e-40) tmp = Float64(x - Float64(Float64(fma(fma(0.13333333333333333, Float64(a * a), 0.3333333333333333), Float64(a * a), 1.0) * a) - Float64(t_0 / fma(Float64(-tan(z)), tan(y), 1.0)))); else tmp = Float64(x - Float64(tan(a) - Float64(t_0 / 1.0))); end return tmp end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, a_] := Block[{t$95$0 = N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Tan[a], $MachinePrecision], -0.01], N[(N[Tan[N[(N[(N[(z - y), $MachinePrecision] / N[(N[(z - y), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(y + z), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(N[Tan[a], $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Tan[a], $MachinePrecision], 2e-40], N[(x - N[(N[(N[(N[(0.13333333333333333 * N[(a * a), $MachinePrecision] + 0.3333333333333333), $MachinePrecision] * N[(a * a), $MachinePrecision] + 1.0), $MachinePrecision] * a), $MachinePrecision] - N[(t$95$0 / N[((-N[Tan[z], $MachinePrecision]) * N[Tan[y], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[Tan[a], $MachinePrecision] - N[(t$95$0 / 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\begin{array}{l}
t_0 := \tan y + \tan z\\
\mathbf{if}\;\tan a \leq -0.01:\\
\;\;\;\;\tan \left(\frac{z - y}{\frac{z - y}{y - z}} \cdot \frac{y + z}{y - z}\right) - \left(\tan a - x\right)\\
\mathbf{elif}\;\tan a \leq 2 \cdot 10^{-40}:\\
\;\;\;\;x - \left(\mathsf{fma}\left(\mathsf{fma}\left(0.13333333333333333, a \cdot a, 0.3333333333333333\right), a \cdot a, 1\right) \cdot a - \frac{t\_0}{\mathsf{fma}\left(-\tan z, \tan y, 1\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;x - \left(\tan a - \frac{t\_0}{1}\right)\\
\end{array}
\end{array}
if (tan.f64 a) < -0.0100000000000000002Initial program 79.8%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
associate-+l-N/A
lower--.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6479.8
Applied rewrites79.8%
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lift--.f64N/A
*-commutativeN/A
flip--N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
times-fracN/A
lower-*.f64N/A
Applied rewrites79.9%
if -0.0100000000000000002 < (tan.f64 a) < 1.9999999999999999e-40Initial program 82.7%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.8
Applied rewrites99.8%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
*-commutativeN/A
lower-fma.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f64N/A
unpow2N/A
lower-*.f6499.8
Applied rewrites99.8%
if 1.9999999999999999e-40 < (tan.f64 a) Initial program 77.5%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.6
Applied rewrites99.6%
Taylor expanded in z around 0
Applied rewrites77.9%
Final simplification87.9%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
(FPCore (x y z a)
:precision binary64
(let* ((t_0 (+ (tan y) (tan z))))
(if (<= (tan a) -0.01)
(-
(tan (* (/ (- z y) (/ (- z y) (- y z))) (/ (+ y z) (- y z))))
(- (tan a) x))
(if (<= (tan a) 2e-40)
(-
x
(-
(* (fma 0.3333333333333333 (* a a) 1.0) a)
(/ t_0 (fma (- (tan z)) (tan y) 1.0))))
(- x (- (tan a) (/ t_0 1.0)))))))assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
double t_0 = tan(y) + tan(z);
double tmp;
if (tan(a) <= -0.01) {
tmp = tan((((z - y) / ((z - y) / (y - z))) * ((y + z) / (y - z)))) - (tan(a) - x);
} else if (tan(a) <= 2e-40) {
tmp = x - ((fma(0.3333333333333333, (a * a), 1.0) * a) - (t_0 / fma(-tan(z), tan(y), 1.0)));
} else {
tmp = x - (tan(a) - (t_0 / 1.0));
}
return tmp;
}
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) t_0 = Float64(tan(y) + tan(z)) tmp = 0.0 if (tan(a) <= -0.01) tmp = Float64(tan(Float64(Float64(Float64(z - y) / Float64(Float64(z - y) / Float64(y - z))) * Float64(Float64(y + z) / Float64(y - z)))) - Float64(tan(a) - x)); elseif (tan(a) <= 2e-40) tmp = Float64(x - Float64(Float64(fma(0.3333333333333333, Float64(a * a), 1.0) * a) - Float64(t_0 / fma(Float64(-tan(z)), tan(y), 1.0)))); else tmp = Float64(x - Float64(tan(a) - Float64(t_0 / 1.0))); end return tmp end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, a_] := Block[{t$95$0 = N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Tan[a], $MachinePrecision], -0.01], N[(N[Tan[N[(N[(N[(z - y), $MachinePrecision] / N[(N[(z - y), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(y + z), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(N[Tan[a], $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Tan[a], $MachinePrecision], 2e-40], N[(x - N[(N[(N[(0.3333333333333333 * N[(a * a), $MachinePrecision] + 1.0), $MachinePrecision] * a), $MachinePrecision] - N[(t$95$0 / N[((-N[Tan[z], $MachinePrecision]) * N[Tan[y], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - N[(N[Tan[a], $MachinePrecision] - N[(t$95$0 / 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\begin{array}{l}
t_0 := \tan y + \tan z\\
\mathbf{if}\;\tan a \leq -0.01:\\
\;\;\;\;\tan \left(\frac{z - y}{\frac{z - y}{y - z}} \cdot \frac{y + z}{y - z}\right) - \left(\tan a - x\right)\\
\mathbf{elif}\;\tan a \leq 2 \cdot 10^{-40}:\\
\;\;\;\;x - \left(\mathsf{fma}\left(0.3333333333333333, a \cdot a, 1\right) \cdot a - \frac{t\_0}{\mathsf{fma}\left(-\tan z, \tan y, 1\right)}\right)\\
\mathbf{else}:\\
\;\;\;\;x - \left(\tan a - \frac{t\_0}{1}\right)\\
\end{array}
\end{array}
if (tan.f64 a) < -0.0100000000000000002Initial program 79.8%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
associate-+l-N/A
lower--.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6479.8
Applied rewrites79.8%
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lift--.f64N/A
*-commutativeN/A
flip--N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
times-fracN/A
lower-*.f64N/A
Applied rewrites79.9%
if -0.0100000000000000002 < (tan.f64 a) < 1.9999999999999999e-40Initial program 82.7%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.8
Applied rewrites99.8%
Taylor expanded in a around 0
*-commutativeN/A
lower-*.f64N/A
+-commutativeN/A
lower-fma.f64N/A
unpow2N/A
lower-*.f6499.7
Applied rewrites99.7%
if 1.9999999999999999e-40 < (tan.f64 a) Initial program 77.5%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.6
Applied rewrites99.6%
Taylor expanded in z around 0
Applied rewrites77.9%
Final simplification87.8%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
(FPCore (x y z a)
:precision binary64
(let* ((t_0 (+ (tan y) (tan z))))
(if (<= (tan a) -1e-12)
(-
(tan (* (/ (- z y) (/ (- z y) (- y z))) (/ (+ y z) (- y z))))
(- (tan a) x))
(if (<= (tan a) 2e-40)
(- (/ t_0 (fma (- (tan z)) (tan y) 1.0)) (- x))
(- x (- (tan a) (/ t_0 1.0)))))))assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
double t_0 = tan(y) + tan(z);
double tmp;
if (tan(a) <= -1e-12) {
tmp = tan((((z - y) / ((z - y) / (y - z))) * ((y + z) / (y - z)))) - (tan(a) - x);
} else if (tan(a) <= 2e-40) {
tmp = (t_0 / fma(-tan(z), tan(y), 1.0)) - -x;
} else {
tmp = x - (tan(a) - (t_0 / 1.0));
}
return tmp;
}
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) t_0 = Float64(tan(y) + tan(z)) tmp = 0.0 if (tan(a) <= -1e-12) tmp = Float64(tan(Float64(Float64(Float64(z - y) / Float64(Float64(z - y) / Float64(y - z))) * Float64(Float64(y + z) / Float64(y - z)))) - Float64(tan(a) - x)); elseif (tan(a) <= 2e-40) tmp = Float64(Float64(t_0 / fma(Float64(-tan(z)), tan(y), 1.0)) - Float64(-x)); else tmp = Float64(x - Float64(tan(a) - Float64(t_0 / 1.0))); end return tmp end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
code[x_, y_, z_, a_] := Block[{t$95$0 = N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Tan[a], $MachinePrecision], -1e-12], N[(N[Tan[N[(N[(N[(z - y), $MachinePrecision] / N[(N[(z - y), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(y + z), $MachinePrecision] / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(N[Tan[a], $MachinePrecision] - x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Tan[a], $MachinePrecision], 2e-40], N[(N[(t$95$0 / N[((-N[Tan[z], $MachinePrecision]) * N[Tan[y], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] - (-x)), $MachinePrecision], N[(x - N[(N[Tan[a], $MachinePrecision] - N[(t$95$0 / 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\begin{array}{l}
t_0 := \tan y + \tan z\\
\mathbf{if}\;\tan a \leq -1 \cdot 10^{-12}:\\
\;\;\;\;\tan \left(\frac{z - y}{\frac{z - y}{y - z}} \cdot \frac{y + z}{y - z}\right) - \left(\tan a - x\right)\\
\mathbf{elif}\;\tan a \leq 2 \cdot 10^{-40}:\\
\;\;\;\;\frac{t\_0}{\mathsf{fma}\left(-\tan z, \tan y, 1\right)} - \left(-x\right)\\
\mathbf{else}:\\
\;\;\;\;x - \left(\tan a - \frac{t\_0}{1}\right)\\
\end{array}
\end{array}
if (tan.f64 a) < -9.9999999999999998e-13Initial program 79.6%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
associate-+l-N/A
lower--.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6479.6
Applied rewrites79.6%
lift-+.f64N/A
+-commutativeN/A
flip-+N/A
difference-of-squaresN/A
+-commutativeN/A
lift-+.f64N/A
lift--.f64N/A
*-commutativeN/A
flip--N/A
+-commutativeN/A
flip-+N/A
associate-/r/N/A
times-fracN/A
lower-*.f64N/A
Applied rewrites79.7%
if -9.9999999999999998e-13 < (tan.f64 a) < 1.9999999999999999e-40Initial program 82.9%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
associate-+l-N/A
lower--.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6482.9
Applied rewrites82.9%
lift--.f64N/A
flip--N/A
unpow2N/A
lift-pow.f64N/A
div-subN/A
lower--.f64N/A
lower-/.f64N/A
lower-+.f64N/A
lower-/.f64N/A
lower-*.f64N/A
lower-+.f6482.8
Applied rewrites82.8%
Taylor expanded in a around 0
mul-1-negN/A
lower-neg.f6482.9
Applied rewrites82.9%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lift-tan.f64N/A
lift-tan.f64N/A
lift-+.f64N/A
lift-tan.f64N/A
lift-tan.f64N/A
*-commutativeN/A
lift-*.f64N/A
lift--.f64N/A
lift-/.f6499.8
lift-+.f64N/A
+-commutativeN/A
lower-+.f6499.8
lift--.f64N/A
sub-negN/A
+-commutativeN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f6499.8
Applied rewrites99.8%
if 1.9999999999999999e-40 < (tan.f64 a) Initial program 77.5%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.6
Applied rewrites99.6%
Taylor expanded in z around 0
Applied rewrites77.9%
Final simplification87.6%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (- x (- (tan a) (/ (+ (tan y) (tan z)) (fma (- (tan z)) (tan y) 1.0)))))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return x - (tan(a) - ((tan(y) + tan(z)) / fma(-tan(z), tan(y), 1.0)));
}
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(x - Float64(tan(a) - Float64(Float64(tan(y) + tan(z)) / fma(Float64(-tan(z)), tan(y), 1.0)))) end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(x - N[(N[Tan[a], $MachinePrecision] - N[(N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision] / N[((-N[Tan[z], $MachinePrecision]) * N[Tan[y], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
x - \left(\tan a - \frac{\tan y + \tan z}{\mathsf{fma}\left(-\tan z, \tan y, 1\right)}\right)
\end{array}
Initial program 80.3%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.7
Applied rewrites99.7%
Final simplification99.7%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (+ (- (/ (+ (tan y) (tan z)) (- 1.0 (* (tan y) (tan z)))) (tan a)) x))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return (((tan(y) + tan(z)) / (1.0 - (tan(y) * tan(z)))) - tan(a)) + x;
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = (((tan(y) + tan(z)) / (1.0d0 - (tan(y) * tan(z)))) - tan(a)) + x
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return (((Math.tan(y) + Math.tan(z)) / (1.0 - (Math.tan(y) * Math.tan(z)))) - Math.tan(a)) + x;
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return (((math.tan(y) + math.tan(z)) / (1.0 - (math.tan(y) * math.tan(z)))) - math.tan(a)) + x
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(Float64(Float64(Float64(tan(y) + tan(z)) / Float64(1.0 - Float64(tan(y) * tan(z)))) - tan(a)) + x) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = (((tan(y) + tan(z)) / (1.0 - (tan(y) * tan(z)))) - tan(a)) + x;
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(N[(N[(N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision] / N[(1.0 - N[(N[Tan[y], $MachinePrecision] * N[Tan[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\left(\frac{\tan y + \tan z}{1 - \tan y \cdot \tan z} - \tan a\right) + x
\end{array}
Initial program 80.3%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.7
Applied rewrites99.7%
lift-fma.f64N/A
+-commutativeN/A
lift-neg.f64N/A
cancel-sign-sub-invN/A
lift-tan.f64N/A
lift-tan.f64N/A
lower--.f64N/A
lift-tan.f64N/A
lift-tan.f64N/A
*-commutativeN/A
lower-*.f6499.7
Applied rewrites99.7%
Final simplification99.7%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (- x (- (tan a) (/ (+ (tan y) (tan z)) 1.0))))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return x - (tan(a) - ((tan(y) + tan(z)) / 1.0));
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = x - (tan(a) - ((tan(y) + tan(z)) / 1.0d0))
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return x - (Math.tan(a) - ((Math.tan(y) + Math.tan(z)) / 1.0));
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return x - (math.tan(a) - ((math.tan(y) + math.tan(z)) / 1.0))
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(x - Float64(tan(a) - Float64(Float64(tan(y) + tan(z)) / 1.0))) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = x - (tan(a) - ((tan(y) + tan(z)) / 1.0));
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(x - N[(N[Tan[a], $MachinePrecision] - N[(N[(N[Tan[y], $MachinePrecision] + N[Tan[z], $MachinePrecision]), $MachinePrecision] / 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
x - \left(\tan a - \frac{\tan y + \tan z}{1}\right)
\end{array}
Initial program 80.3%
lift-tan.f64N/A
lift-+.f64N/A
tan-sumN/A
lower-/.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower-tan.f64N/A
lower-tan.f64N/A
sub-negN/A
+-commutativeN/A
*-commutativeN/A
distribute-lft-neg-inN/A
lower-fma.f64N/A
lower-neg.f64N/A
lower-tan.f64N/A
lower-tan.f6499.7
Applied rewrites99.7%
Taylor expanded in z around 0
Applied rewrites80.4%
Final simplification80.4%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (+ (- (tan (- (* (/ y (- y z)) y) (* (/ z (- y z)) z))) (tan a)) x))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return (tan((((y / (y - z)) * y) - ((z / (y - z)) * z))) - tan(a)) + x;
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = (tan((((y / (y - z)) * y) - ((z / (y - z)) * z))) - tan(a)) + x
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return (Math.tan((((y / (y - z)) * y) - ((z / (y - z)) * z))) - Math.tan(a)) + x;
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return (math.tan((((y / (y - z)) * y) - ((z / (y - z)) * z))) - math.tan(a)) + x
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(Float64(tan(Float64(Float64(Float64(y / Float64(y - z)) * y) - Float64(Float64(z / Float64(y - z)) * z))) - tan(a)) + x) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = (tan((((y / (y - z)) * y) - ((z / (y - z)) * z))) - tan(a)) + x;
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(N[(N[Tan[N[(N[(N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision] - N[(N[(z / N[(y - z), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\left(\tan \left(\frac{y}{y - z} \cdot y - \frac{z}{y - z} \cdot z\right) - \tan a\right) + x
\end{array}
Initial program 80.3%
lift-+.f64N/A
flip-+N/A
div-subN/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower--.f64N/A
associate-/l*N/A
lower-*.f64N/A
lower-/.f64N/A
lower--.f6480.3
Applied rewrites80.3%
Final simplification80.3%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (+ (- (tan (+ y z)) (tan a)) x))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return (tan((y + z)) - tan(a)) + x;
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = (tan((y + z)) - tan(a)) + x
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return (Math.tan((y + z)) - Math.tan(a)) + x;
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return (math.tan((y + z)) - math.tan(a)) + x
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(Float64(tan(Float64(y + z)) - tan(a)) + x) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = (tan((y + z)) - tan(a)) + x;
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] - N[Tan[a], $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\left(\tan \left(y + z\right) - \tan a\right) + x
\end{array}
Initial program 80.3%
Final simplification80.3%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (- (tan (+ y z)) (- x)))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return tan((y + z)) - -x;
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = tan((y + z)) - -x
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return Math.tan((y + z)) - -x;
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return math.tan((y + z)) - -x
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(tan(Float64(y + z)) - Float64(-x)) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = tan((y + z)) - -x;
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(N[Tan[N[(y + z), $MachinePrecision]], $MachinePrecision] - (-x)), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\tan \left(y + z\right) - \left(-x\right)
\end{array}
Initial program 80.3%
lift-+.f64N/A
+-commutativeN/A
lift--.f64N/A
associate-+l-N/A
lower--.f64N/A
lift-+.f64N/A
+-commutativeN/A
lower-+.f64N/A
lower--.f6480.3
Applied rewrites80.3%
Taylor expanded in a around 0
mul-1-negN/A
lower-neg.f6449.7
Applied rewrites49.7%
Final simplification49.7%
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. (FPCore (x y z a) :precision binary64 (/ 1.0 (/ 1.0 x)))
assert(x < y && y < z && z < a);
double code(double x, double y, double z, double a) {
return 1.0 / (1.0 / x);
}
NOTE: x, y, z, and a should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, a)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: a
code = 1.0d0 / (1.0d0 / x)
end function
assert x < y && y < z && z < a;
public static double code(double x, double y, double z, double a) {
return 1.0 / (1.0 / x);
}
[x, y, z, a] = sort([x, y, z, a]) def code(x, y, z, a): return 1.0 / (1.0 / x)
x, y, z, a = sort([x, y, z, a]) function code(x, y, z, a) return Float64(1.0 / Float64(1.0 / x)) end
x, y, z, a = num2cell(sort([x, y, z, a])){:}
function tmp = code(x, y, z, a)
tmp = 1.0 / (1.0 / x);
end
NOTE: x, y, z, and a should be sorted in increasing order before calling this function. code[x_, y_, z_, a_] := N[(1.0 / N[(1.0 / x), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[x, y, z, a] = \mathsf{sort}([x, y, z, a])\\
\\
\frac{1}{\frac{1}{x}}
\end{array}
Initial program 80.3%
lift-+.f64N/A
flip3-+N/A
clear-numN/A
lower-/.f64N/A
clear-numN/A
flip3-+N/A
lift-+.f64N/A
lower-/.f6480.2
Applied rewrites80.2%
Taylor expanded in x around inf
lower-/.f6431.0
Applied rewrites31.0%
herbie shell --seed 2024270
(FPCore (x y z a)
:name "tan-example (used to crash)"
:precision binary64
:pre (and (and (and (or (== x 0.0) (and (<= 0.5884142 x) (<= x 505.5909))) (or (and (<= -1.796658e+308 y) (<= y -9.425585e-310)) (and (<= 1.284938e-309 y) (<= y 1.751224e+308)))) (or (and (<= -1.776707e+308 z) (<= z -8.599796e-310)) (and (<= 3.293145e-311 z) (<= z 1.725154e+308)))) (or (and (<= -1.796658e+308 a) (<= a -9.425585e-310)) (and (<= 1.284938e-309 a) (<= a 1.751224e+308))))
(+ x (- (tan (+ y z)) (tan a))))