
(FPCore (x y z t a b) :precision binary64 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))
double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
def code(x, y, z, t, a, b): return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))
function code(x, y, z, t, a, b) return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0))) end
function tmp = code(x, y, z, t, a, b) tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0)); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3}
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 13 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (x y z t a b) :precision binary64 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))
double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function
public static double code(double x, double y, double z, double t, double a, double b) {
return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}
def code(x, y, z, t, a, b): return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))
function code(x, y, z, t, a, b) return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0))) end
function tmp = code(x, y, z, t, a, b) tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0)); end
code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3}
\end{array}
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* 2.0 (sqrt x))))
(if (<= (* t_1 (cos (- y (/ (* z t) 3.0)))) 1e+136)
(-
(*
2.0
(*
(sqrt x)
(fma
(cos y)
(cos (* z (* t -0.3333333333333333)))
(* (sin y) (sin (* 0.3333333333333333 (* z t)))))))
(/ a (* 3.0 b)))
(- t_1 (/ (/ a 3.0) b)))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 2.0 * sqrt(x);
double tmp;
if ((t_1 * cos((y - ((z * t) / 3.0)))) <= 1e+136) {
tmp = (2.0 * (sqrt(x) * fma(cos(y), cos((z * (t * -0.3333333333333333))), (sin(y) * sin((0.3333333333333333 * (z * t))))))) - (a / (3.0 * b));
} else {
tmp = t_1 - ((a / 3.0) / b);
}
return tmp;
}
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(2.0 * sqrt(x)) tmp = 0.0 if (Float64(t_1 * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 1e+136) tmp = Float64(Float64(2.0 * Float64(sqrt(x) * fma(cos(y), cos(Float64(z * Float64(t * -0.3333333333333333))), Float64(sin(y) * sin(Float64(0.3333333333333333 * Float64(z * t))))))) - Float64(a / Float64(3.0 * b))); else tmp = Float64(t_1 - Float64(Float64(a / 3.0) / b)); end return tmp end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$1 * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e+136], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[Cos[y], $MachinePrecision] * N[Cos[N[(z * N[(t * -0.3333333333333333), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[(N[Sin[y], $MachinePrecision] * N[Sin[N[(0.3333333333333333 * N[(z * t), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := 2 \cdot \sqrt{x}\\
\mathbf{if}\;t_1 \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 10^{+136}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \mathsf{fma}\left(\cos y, \cos \left(z \cdot \left(t \cdot -0.3333333333333333\right)\right), \sin y \cdot \sin \left(0.3333333333333333 \cdot \left(z \cdot t\right)\right)\right)\right) - \frac{a}{3 \cdot b}\\
\mathbf{else}:\\
\;\;\;\;t_1 - \frac{\frac{a}{3}}{b}\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 1.00000000000000006e136Initial program 80.0%
associate-*l*80.0%
fma-neg80.0%
remove-double-neg80.0%
fma-neg80.0%
remove-double-neg80.0%
associate-/l*80.1%
*-commutative80.1%
Simplified80.1%
cos-diff81.1%
associate-/r/81.3%
*-commutative81.3%
div-inv81.3%
metadata-eval81.3%
associate-/r/81.5%
*-commutative81.5%
div-inv81.5%
metadata-eval81.5%
Applied egg-rr81.5%
fma-def81.5%
associate-*r*81.4%
*-commutative81.4%
cos-neg81.4%
distribute-lft-neg-in81.4%
metadata-eval81.4%
*-commutative81.4%
*-commutative81.4%
associate-*r*81.5%
associate-*r*81.6%
*-commutative81.6%
Simplified81.6%
if 1.00000000000000006e136 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 20.0%
associate-*l*20.0%
fma-neg20.0%
remove-double-neg20.0%
fma-neg20.0%
remove-double-neg20.0%
associate-/l*20.0%
*-commutative20.0%
Simplified20.0%
Taylor expanded in z around 0 62.4%
*-un-lft-identity62.4%
associate-/r*62.5%
Applied egg-rr62.5%
Taylor expanded in y around 0 63.4%
Final simplification79.0%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* 2.0 (sqrt x))) (t_2 (* t (* z 0.3333333333333333))))
(if (<= (* t_1 (cos (- y (/ (* z t) 3.0)))) 1e+136)
(-
(* 2.0 (* (sqrt x) (+ (* (cos y) (cos t_2)) (* (sin y) (sin t_2)))))
(/ a (* 3.0 b)))
(- t_1 (/ (/ a 3.0) b)))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 2.0 * sqrt(x);
double t_2 = t * (z * 0.3333333333333333);
double tmp;
if ((t_1 * cos((y - ((z * t) / 3.0)))) <= 1e+136) {
tmp = (2.0 * (sqrt(x) * ((cos(y) * cos(t_2)) + (sin(y) * sin(t_2))))) - (a / (3.0 * b));
} else {
tmp = t_1 - ((a / 3.0) / b);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 2.0d0 * sqrt(x)
t_2 = t * (z * 0.3333333333333333d0)
if ((t_1 * cos((y - ((z * t) / 3.0d0)))) <= 1d+136) then
tmp = (2.0d0 * (sqrt(x) * ((cos(y) * cos(t_2)) + (sin(y) * sin(t_2))))) - (a / (3.0d0 * b))
else
tmp = t_1 - ((a / 3.0d0) / b)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 2.0 * Math.sqrt(x);
double t_2 = t * (z * 0.3333333333333333);
double tmp;
if ((t_1 * Math.cos((y - ((z * t) / 3.0)))) <= 1e+136) {
tmp = (2.0 * (Math.sqrt(x) * ((Math.cos(y) * Math.cos(t_2)) + (Math.sin(y) * Math.sin(t_2))))) - (a / (3.0 * b));
} else {
tmp = t_1 - ((a / 3.0) / b);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): t_1 = 2.0 * math.sqrt(x) t_2 = t * (z * 0.3333333333333333) tmp = 0 if (t_1 * math.cos((y - ((z * t) / 3.0)))) <= 1e+136: tmp = (2.0 * (math.sqrt(x) * ((math.cos(y) * math.cos(t_2)) + (math.sin(y) * math.sin(t_2))))) - (a / (3.0 * b)) else: tmp = t_1 - ((a / 3.0) / b) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(2.0 * sqrt(x)) t_2 = Float64(t * Float64(z * 0.3333333333333333)) tmp = 0.0 if (Float64(t_1 * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 1e+136) tmp = Float64(Float64(2.0 * Float64(sqrt(x) * Float64(Float64(cos(y) * cos(t_2)) + Float64(sin(y) * sin(t_2))))) - Float64(a / Float64(3.0 * b))); else tmp = Float64(t_1 - Float64(Float64(a / 3.0) / b)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = 2.0 * sqrt(x);
t_2 = t * (z * 0.3333333333333333);
tmp = 0.0;
if ((t_1 * cos((y - ((z * t) / 3.0)))) <= 1e+136)
tmp = (2.0 * (sqrt(x) * ((cos(y) * cos(t_2)) + (sin(y) * sin(t_2))))) - (a / (3.0 * b));
else
tmp = t_1 - ((a / 3.0) / b);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(z * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$1 * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e+136], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[(N[Cos[y], $MachinePrecision] * N[Cos[t$95$2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[y], $MachinePrecision] * N[Sin[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := 2 \cdot \sqrt{x}\\
t_2 := t \cdot \left(z \cdot 0.3333333333333333\right)\\
\mathbf{if}\;t_1 \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 10^{+136}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \left(\cos y \cdot \cos t_2 + \sin y \cdot \sin t_2\right)\right) - \frac{a}{3 \cdot b}\\
\mathbf{else}:\\
\;\;\;\;t_1 - \frac{\frac{a}{3}}{b}\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 1.00000000000000006e136Initial program 80.0%
associate-*l*80.0%
fma-neg80.0%
remove-double-neg80.0%
fma-neg80.0%
remove-double-neg80.0%
associate-/l*80.1%
*-commutative80.1%
Simplified80.1%
cos-diff81.1%
associate-/r/81.3%
*-commutative81.3%
div-inv81.3%
metadata-eval81.3%
associate-/r/81.5%
*-commutative81.5%
div-inv81.5%
metadata-eval81.5%
Applied egg-rr81.5%
if 1.00000000000000006e136 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 20.0%
associate-*l*20.0%
fma-neg20.0%
remove-double-neg20.0%
fma-neg20.0%
remove-double-neg20.0%
associate-/l*20.0%
*-commutative20.0%
Simplified20.0%
Taylor expanded in z around 0 62.4%
*-un-lft-identity62.4%
associate-/r*62.5%
Applied egg-rr62.5%
Taylor expanded in y around 0 63.4%
Final simplification79.0%
NOTE: z and t should be sorted in increasing order before calling this function.
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (* 2.0 (sqrt x))) (t_2 (* z (* t 0.3333333333333333))))
(if (<= (* t_1 (cos (- y (/ (* z t) 3.0)))) 1e+136)
(-
(* 2.0 (* (sqrt x) (+ (* (cos y) (cos t_2)) (* (sin y) (sin t_2)))))
(/ a (* 3.0 b)))
(- t_1 (/ (/ a 3.0) b)))))assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 2.0 * sqrt(x);
double t_2 = z * (t * 0.3333333333333333);
double tmp;
if ((t_1 * cos((y - ((z * t) / 3.0)))) <= 1e+136) {
tmp = (2.0 * (sqrt(x) * ((cos(y) * cos(t_2)) + (sin(y) * sin(t_2))))) - (a / (3.0 * b));
} else {
tmp = t_1 - ((a / 3.0) / b);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: tmp
t_1 = 2.0d0 * sqrt(x)
t_2 = z * (t * 0.3333333333333333d0)
if ((t_1 * cos((y - ((z * t) / 3.0d0)))) <= 1d+136) then
tmp = (2.0d0 * (sqrt(x) * ((cos(y) * cos(t_2)) + (sin(y) * sin(t_2))))) - (a / (3.0d0 * b))
else
tmp = t_1 - ((a / 3.0d0) / b)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = 2.0 * Math.sqrt(x);
double t_2 = z * (t * 0.3333333333333333);
double tmp;
if ((t_1 * Math.cos((y - ((z * t) / 3.0)))) <= 1e+136) {
tmp = (2.0 * (Math.sqrt(x) * ((Math.cos(y) * Math.cos(t_2)) + (Math.sin(y) * Math.sin(t_2))))) - (a / (3.0 * b));
} else {
tmp = t_1 - ((a / 3.0) / b);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): t_1 = 2.0 * math.sqrt(x) t_2 = z * (t * 0.3333333333333333) tmp = 0 if (t_1 * math.cos((y - ((z * t) / 3.0)))) <= 1e+136: tmp = (2.0 * (math.sqrt(x) * ((math.cos(y) * math.cos(t_2)) + (math.sin(y) * math.sin(t_2))))) - (a / (3.0 * b)) else: tmp = t_1 - ((a / 3.0) / b) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) t_1 = Float64(2.0 * sqrt(x)) t_2 = Float64(z * Float64(t * 0.3333333333333333)) tmp = 0.0 if (Float64(t_1 * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) <= 1e+136) tmp = Float64(Float64(2.0 * Float64(sqrt(x) * Float64(Float64(cos(y) * cos(t_2)) + Float64(sin(y) * sin(t_2))))) - Float64(a / Float64(3.0 * b))); else tmp = Float64(t_1 - Float64(Float64(a / 3.0) / b)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
t_1 = 2.0 * sqrt(x);
t_2 = z * (t * 0.3333333333333333);
tmp = 0.0;
if ((t_1 * cos((y - ((z * t) / 3.0)))) <= 1e+136)
tmp = (2.0 * (sqrt(x) * ((cos(y) * cos(t_2)) + (sin(y) * sin(t_2))))) - (a / (3.0 * b));
else
tmp = t_1 - ((a / 3.0) / b);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(z * N[(t * 0.3333333333333333), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$1 * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 1e+136], N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[(N[(N[Cos[y], $MachinePrecision] * N[Cos[t$95$2], $MachinePrecision]), $MachinePrecision] + N[(N[Sin[y], $MachinePrecision] * N[Sin[t$95$2], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$1 - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]]]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
t_1 := 2 \cdot \sqrt{x}\\
t_2 := z \cdot \left(t \cdot 0.3333333333333333\right)\\
\mathbf{if}\;t_1 \cdot \cos \left(y - \frac{z \cdot t}{3}\right) \leq 10^{+136}:\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \left(\cos y \cdot \cos t_2 + \sin y \cdot \sin t_2\right)\right) - \frac{a}{3 \cdot b}\\
\mathbf{else}:\\
\;\;\;\;t_1 - \frac{\frac{a}{3}}{b}\\
\end{array}
\end{array}
if (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) < 1.00000000000000006e136Initial program 80.0%
associate-*l*80.0%
fma-neg80.0%
remove-double-neg80.0%
fma-neg80.0%
remove-double-neg80.0%
associate-/l*80.1%
*-commutative80.1%
Simplified80.1%
*-un-lft-identity80.1%
add-sqr-sqrt38.6%
times-frac38.7%
Applied egg-rr38.7%
associate-*l/38.8%
*-lft-identity38.8%
Simplified38.8%
associate-/l/38.6%
*-un-lft-identity38.6%
add-sqr-sqrt80.1%
add-cube-cbrt80.0%
times-frac80.0%
pow280.0%
Applied egg-rr80.0%
cos-diff81.5%
frac-times81.5%
*-un-lft-identity81.5%
unpow281.5%
add-cube-cbrt81.0%
div-inv81.0%
clear-num81.3%
div-inv81.3%
metadata-eval81.3%
frac-times81.2%
Applied egg-rr81.4%
if 1.00000000000000006e136 < (*.f64 (*.f64 2 (sqrt.f64 x)) (cos.f64 (-.f64 y (/.f64 (*.f64 z t) 3)))) Initial program 20.0%
associate-*l*20.0%
fma-neg20.0%
remove-double-neg20.0%
fma-neg20.0%
remove-double-neg20.0%
associate-/l*20.0%
*-commutative20.0%
Simplified20.0%
Taylor expanded in z around 0 62.4%
*-un-lft-identity62.4%
associate-/r*62.5%
Applied egg-rr62.5%
Taylor expanded in y around 0 63.4%
Final simplification78.9%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (* (sqrt x) (cos y))) (* 0.3333333333333333 (/ a b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (sqrt(x) * cos(y))) - (0.3333333333333333 * (a / b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * (sqrt(x) * cos(y))) - (0.3333333333333333d0 * (a / b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (Math.sqrt(x) * Math.cos(y))) - (0.3333333333333333 * (a / b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * (math.sqrt(x) * math.cos(y))) - (0.3333333333333333 * (a / b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * Float64(sqrt(x) * cos(y))) - Float64(0.3333333333333333 * Float64(a / b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * (sqrt(x) * cos(y))) - (0.3333333333333333 * (a / b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \left(\sqrt{x} \cdot \cos y\right) - 0.3333333333333333 \cdot \frac{a}{b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
Taylor expanded in a around 0 76.6%
Final simplification76.6%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (* (sqrt x) (cos y))) (/ a (* 3.0 b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (sqrt(x) * cos(y))) - (a / (3.0 * b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * (sqrt(x) * cos(y))) - (a / (3.0d0 * b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (Math.sqrt(x) * Math.cos(y))) - (a / (3.0 * b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * (math.sqrt(x) * math.cos(y))) - (a / (3.0 * b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * Float64(sqrt(x) * cos(y))) - Float64(a / Float64(3.0 * b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * (sqrt(x) * cos(y))) - (a / (3.0 * b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \left(\sqrt{x} \cdot \cos y\right) - \frac{a}{3 \cdot b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
Final simplification76.6%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (* (sqrt x) (cos y))) (/ (/ a 3.0) b)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (sqrt(x) * cos(y))) - ((a / 3.0) / b);
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * (sqrt(x) * cos(y))) - ((a / 3.0d0) / b)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * (Math.sqrt(x) * Math.cos(y))) - ((a / 3.0) / b);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * (math.sqrt(x) * math.cos(y))) - ((a / 3.0) / b)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * Float64(sqrt(x) * cos(y))) - Float64(Float64(a / 3.0) / b)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * (sqrt(x) * cos(y))) - ((a / 3.0) / b);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \left(\sqrt{x} \cdot \cos y\right) - \frac{\frac{a}{3}}{b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
*-un-lft-identity76.6%
associate-/r*76.7%
Applied egg-rr76.7%
Final simplification76.7%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (or (<= b -2.5e+249) (not (<= b 1.85e+230))) (* 2.0 (* (sqrt x) (cos y))) (- (* 2.0 (sqrt x)) (/ (/ a 3.0) b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((b <= -2.5e+249) || !(b <= 1.85e+230)) {
tmp = 2.0 * (sqrt(x) * cos(y));
} else {
tmp = (2.0 * sqrt(x)) - ((a / 3.0) / b);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((b <= (-2.5d+249)) .or. (.not. (b <= 1.85d+230))) then
tmp = 2.0d0 * (sqrt(x) * cos(y))
else
tmp = (2.0d0 * sqrt(x)) - ((a / 3.0d0) / b)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((b <= -2.5e+249) || !(b <= 1.85e+230)) {
tmp = 2.0 * (Math.sqrt(x) * Math.cos(y));
} else {
tmp = (2.0 * Math.sqrt(x)) - ((a / 3.0) / b);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): tmp = 0 if (b <= -2.5e+249) or not (b <= 1.85e+230): tmp = 2.0 * (math.sqrt(x) * math.cos(y)) else: tmp = (2.0 * math.sqrt(x)) - ((a / 3.0) / b) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) tmp = 0.0 if ((b <= -2.5e+249) || !(b <= 1.85e+230)) tmp = Float64(2.0 * Float64(sqrt(x) * cos(y))); else tmp = Float64(Float64(2.0 * sqrt(x)) - Float64(Float64(a / 3.0) / b)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if ((b <= -2.5e+249) || ~((b <= 1.85e+230)))
tmp = 2.0 * (sqrt(x) * cos(y));
else
tmp = (2.0 * sqrt(x)) - ((a / 3.0) / b);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[b, -2.5e+249], N[Not[LessEqual[b, 1.85e+230]], $MachinePrecision]], N[(2.0 * N[(N[Sqrt[x], $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;b \leq -2.5 \cdot 10^{+249} \lor \neg \left(b \leq 1.85 \cdot 10^{+230}\right):\\
\;\;\;\;2 \cdot \left(\sqrt{x} \cdot \cos y\right)\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{x} - \frac{\frac{a}{3}}{b}\\
\end{array}
\end{array}
if b < -2.4999999999999998e249 or 1.84999999999999996e230 < b Initial program 58.4%
associate-*l*58.4%
fma-neg58.4%
remove-double-neg58.4%
fma-neg58.4%
remove-double-neg58.4%
associate-/l*58.4%
*-commutative58.4%
Simplified58.4%
Taylor expanded in z around 0 56.6%
Taylor expanded in a around 0 56.6%
Taylor expanded in a around 0 56.6%
*-commutative56.6%
Simplified56.6%
if -2.4999999999999998e249 < b < 1.84999999999999996e230Initial program 73.1%
associate-*l*73.1%
fma-neg73.1%
remove-double-neg73.1%
fma-neg73.1%
remove-double-neg73.1%
associate-/l*73.2%
*-commutative73.2%
Simplified73.2%
Taylor expanded in z around 0 79.0%
*-un-lft-identity79.0%
associate-/r*79.0%
Applied egg-rr79.0%
Taylor expanded in y around 0 73.8%
Final simplification72.0%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (sqrt x)) (* 0.3333333333333333 (/ a b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * sqrt(x)) - (0.3333333333333333 * (a / b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * sqrt(x)) - (0.3333333333333333d0 * (a / b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * Math.sqrt(x)) - (0.3333333333333333 * (a / b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * math.sqrt(x)) - (0.3333333333333333 * (a / b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * sqrt(x)) - Float64(0.3333333333333333 * Float64(a / b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * sqrt(x)) - (0.3333333333333333 * (a / b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \sqrt{x} - 0.3333333333333333 \cdot \frac{a}{b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
Taylor expanded in y around 0 68.3%
Taylor expanded in a around 0 68.3%
Final simplification68.3%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (sqrt x)) (/ a (* 3.0 b))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * sqrt(x)) - (a / (3.0 * b));
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * sqrt(x)) - (a / (3.0d0 * b))
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * Math.sqrt(x)) - (a / (3.0 * b));
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * math.sqrt(x)) - (a / (3.0 * b))
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * sqrt(x)) - Float64(a / Float64(3.0 * b))) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * sqrt(x)) - (a / (3.0 * b));
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(a / N[(3.0 * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \sqrt{x} - \frac{a}{3 \cdot b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
Taylor expanded in y around 0 68.3%
Final simplification68.3%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (- (* 2.0 (sqrt x)) (/ (/ a 3.0) b)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * sqrt(x)) - ((a / 3.0) / b);
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (2.0d0 * sqrt(x)) - ((a / 3.0d0) / b)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return (2.0 * Math.sqrt(x)) - ((a / 3.0) / b);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return (2.0 * math.sqrt(x)) - ((a / 3.0) / b)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(Float64(2.0 * sqrt(x)) - Float64(Float64(a / 3.0) / b)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = (2.0 * sqrt(x)) - ((a / 3.0) / b);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] - N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
2 \cdot \sqrt{x} - \frac{\frac{a}{3}}{b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
*-un-lft-identity76.6%
associate-/r*76.7%
Applied egg-rr76.7%
Taylor expanded in y around 0 68.4%
Final simplification68.4%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (if (or (<= a -3e-66) (not (<= a 8e-133))) (/ -0.3333333333333333 (/ b a)) (* 2.0 (sqrt x))))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((a <= -3e-66) || !(a <= 8e-133)) {
tmp = -0.3333333333333333 / (b / a);
} else {
tmp = 2.0 * sqrt(x);
}
return tmp;
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((a <= (-3d-66)) .or. (.not. (a <= 8d-133))) then
tmp = (-0.3333333333333333d0) / (b / a)
else
tmp = 2.0d0 * sqrt(x)
end if
code = tmp
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
double tmp;
if ((a <= -3e-66) || !(a <= 8e-133)) {
tmp = -0.3333333333333333 / (b / a);
} else {
tmp = 2.0 * Math.sqrt(x);
}
return tmp;
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): tmp = 0 if (a <= -3e-66) or not (a <= 8e-133): tmp = -0.3333333333333333 / (b / a) else: tmp = 2.0 * math.sqrt(x) return tmp
z, t = sort([z, t]) function code(x, y, z, t, a, b) tmp = 0.0 if ((a <= -3e-66) || !(a <= 8e-133)) tmp = Float64(-0.3333333333333333 / Float64(b / a)); else tmp = Float64(2.0 * sqrt(x)); end return tmp end
z, t = num2cell(sort([z, t])){:}
function tmp_2 = code(x, y, z, t, a, b)
tmp = 0.0;
if ((a <= -3e-66) || ~((a <= 8e-133)))
tmp = -0.3333333333333333 / (b / a);
else
tmp = 2.0 * sqrt(x);
end
tmp_2 = tmp;
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := If[Or[LessEqual[a, -3e-66], N[Not[LessEqual[a, 8e-133]], $MachinePrecision]], N[(-0.3333333333333333 / N[(b / a), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\begin{array}{l}
\mathbf{if}\;a \leq -3 \cdot 10^{-66} \lor \neg \left(a \leq 8 \cdot 10^{-133}\right):\\
\;\;\;\;\frac{-0.3333333333333333}{\frac{b}{a}}\\
\mathbf{else}:\\
\;\;\;\;2 \cdot \sqrt{x}\\
\end{array}
\end{array}
if a < -3.0000000000000002e-66 or 8.0000000000000005e-133 < a Initial program 77.2%
associate-*l*77.2%
fma-neg77.2%
remove-double-neg77.2%
fma-neg77.2%
remove-double-neg77.2%
associate-/l*77.3%
*-commutative77.3%
Simplified77.3%
Taylor expanded in z around 0 85.0%
Taylor expanded in a around 0 84.9%
Taylor expanded in x around 0 69.1%
associate-*r/69.1%
associate-/l*69.1%
Simplified69.1%
if -3.0000000000000002e-66 < a < 8.0000000000000005e-133Initial program 56.3%
associate-*l*56.3%
fma-neg56.3%
remove-double-neg56.3%
fma-neg56.3%
remove-double-neg56.3%
associate-/l*56.5%
*-commutative56.5%
Simplified56.5%
Taylor expanded in z around 0 54.1%
Taylor expanded in y around 0 42.1%
Taylor expanded in a around 0 42.0%
Taylor expanded in a around 0 33.5%
Final simplification59.5%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (* -0.3333333333333333 (/ a b)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return -0.3333333333333333 * (a / b);
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (-0.3333333333333333d0) * (a / b)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return -0.3333333333333333 * (a / b);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return -0.3333333333333333 * (a / b)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(-0.3333333333333333 * Float64(a / b)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = -0.3333333333333333 * (a / b);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
-0.3333333333333333 \cdot \frac{a}{b}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
Taylor expanded in a around 0 76.6%
Taylor expanded in x around 0 53.8%
Final simplification53.8%
NOTE: z and t should be sorted in increasing order before calling this function. (FPCore (x y z t a b) :precision binary64 (/ -0.3333333333333333 (/ b a)))
assert(z < t);
double code(double x, double y, double z, double t, double a, double b) {
return -0.3333333333333333 / (b / a);
}
NOTE: z and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (-0.3333333333333333d0) / (b / a)
end function
assert z < t;
public static double code(double x, double y, double z, double t, double a, double b) {
return -0.3333333333333333 / (b / a);
}
[z, t] = sort([z, t]) def code(x, y, z, t, a, b): return -0.3333333333333333 / (b / a)
z, t = sort([z, t]) function code(x, y, z, t, a, b) return Float64(-0.3333333333333333 / Float64(b / a)) end
z, t = num2cell(sort([z, t])){:}
function tmp = code(x, y, z, t, a, b)
tmp = -0.3333333333333333 / (b / a);
end
NOTE: z and t should be sorted in increasing order before calling this function. code[x_, y_, z_, t_, a_, b_] := N[(-0.3333333333333333 / N[(b / a), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[z, t] = \mathsf{sort}([z, t])\\
\\
\frac{-0.3333333333333333}{\frac{b}{a}}
\end{array}
Initial program 71.5%
associate-*l*71.5%
fma-neg71.5%
remove-double-neg71.5%
fma-neg71.5%
remove-double-neg71.5%
associate-/l*71.7%
*-commutative71.7%
Simplified71.7%
Taylor expanded in z around 0 76.6%
Taylor expanded in a around 0 76.6%
Taylor expanded in x around 0 53.8%
associate-*r/53.8%
associate-/l*53.8%
Simplified53.8%
Final simplification53.8%
(FPCore (x y z t a b)
:precision binary64
(let* ((t_1 (/ (/ 0.3333333333333333 z) t))
(t_2 (/ (/ a 3.0) b))
(t_3 (* 2.0 (sqrt x))))
(if (< z -1.3793337487235141e+129)
(- (* t_3 (cos (- (/ 1.0 y) t_1))) t_2)
(if (< z 3.516290613555987e+106)
(- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) t_2)
(- (* (cos (- y t_1)) t_3) (/ (/ a b) 3.0))))))
double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (0.3333333333333333 / z) / t;
double t_2 = (a / 3.0) / b;
double t_3 = 2.0 * sqrt(x);
double tmp;
if (z < -1.3793337487235141e+129) {
tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2;
} else if (z < 3.516290613555987e+106) {
tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2;
} else {
tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0);
}
return tmp;
}
real(8) function code(x, y, z, t, a, b)
real(8), intent (in) :: x
real(8), intent (in) :: y
real(8), intent (in) :: z
real(8), intent (in) :: t
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_1
real(8) :: t_2
real(8) :: t_3
real(8) :: tmp
t_1 = (0.3333333333333333d0 / z) / t
t_2 = (a / 3.0d0) / b
t_3 = 2.0d0 * sqrt(x)
if (z < (-1.3793337487235141d+129)) then
tmp = (t_3 * cos(((1.0d0 / y) - t_1))) - t_2
else if (z < 3.516290613555987d+106) then
tmp = ((sqrt(x) * 2.0d0) * cos((y - ((t / 3.0d0) * z)))) - t_2
else
tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0d0)
end if
code = tmp
end function
public static double code(double x, double y, double z, double t, double a, double b) {
double t_1 = (0.3333333333333333 / z) / t;
double t_2 = (a / 3.0) / b;
double t_3 = 2.0 * Math.sqrt(x);
double tmp;
if (z < -1.3793337487235141e+129) {
tmp = (t_3 * Math.cos(((1.0 / y) - t_1))) - t_2;
} else if (z < 3.516290613555987e+106) {
tmp = ((Math.sqrt(x) * 2.0) * Math.cos((y - ((t / 3.0) * z)))) - t_2;
} else {
tmp = (Math.cos((y - t_1)) * t_3) - ((a / b) / 3.0);
}
return tmp;
}
def code(x, y, z, t, a, b): t_1 = (0.3333333333333333 / z) / t t_2 = (a / 3.0) / b t_3 = 2.0 * math.sqrt(x) tmp = 0 if z < -1.3793337487235141e+129: tmp = (t_3 * math.cos(((1.0 / y) - t_1))) - t_2 elif z < 3.516290613555987e+106: tmp = ((math.sqrt(x) * 2.0) * math.cos((y - ((t / 3.0) * z)))) - t_2 else: tmp = (math.cos((y - t_1)) * t_3) - ((a / b) / 3.0) return tmp
function code(x, y, z, t, a, b) t_1 = Float64(Float64(0.3333333333333333 / z) / t) t_2 = Float64(Float64(a / 3.0) / b) t_3 = Float64(2.0 * sqrt(x)) tmp = 0.0 if (z < -1.3793337487235141e+129) tmp = Float64(Float64(t_3 * cos(Float64(Float64(1.0 / y) - t_1))) - t_2); elseif (z < 3.516290613555987e+106) tmp = Float64(Float64(Float64(sqrt(x) * 2.0) * cos(Float64(y - Float64(Float64(t / 3.0) * z)))) - t_2); else tmp = Float64(Float64(cos(Float64(y - t_1)) * t_3) - Float64(Float64(a / b) / 3.0)); end return tmp end
function tmp_2 = code(x, y, z, t, a, b) t_1 = (0.3333333333333333 / z) / t; t_2 = (a / 3.0) / b; t_3 = 2.0 * sqrt(x); tmp = 0.0; if (z < -1.3793337487235141e+129) tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2; elseif (z < 3.516290613555987e+106) tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2; else tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0); end tmp_2 = tmp; end
code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(0.3333333333333333 / z), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[Less[z, -1.3793337487235141e+129], N[(N[(t$95$3 * N[Cos[N[(N[(1.0 / y), $MachinePrecision] - t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[z, 3.516290613555987e+106], N[(N[(N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision] * N[Cos[N[(y - N[(N[(t / 3.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], N[(N[(N[Cos[N[(y - t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] - N[(N[(a / b), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]]]]]]
\begin{array}{l}
\\
\begin{array}{l}
t_1 := \frac{\frac{0.3333333333333333}{z}}{t}\\
t_2 := \frac{\frac{a}{3}}{b}\\
t_3 := 2 \cdot \sqrt{x}\\
\mathbf{if}\;z < -1.3793337487235141 \cdot 10^{+129}:\\
\;\;\;\;t_3 \cdot \cos \left(\frac{1}{y} - t_1\right) - t_2\\
\mathbf{elif}\;z < 3.516290613555987 \cdot 10^{+106}:\\
\;\;\;\;\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(y - \frac{t}{3} \cdot z\right) - t_2\\
\mathbf{else}:\\
\;\;\;\;\cos \left(y - t_1\right) \cdot t_3 - \frac{\frac{a}{b}}{3}\\
\end{array}
\end{array}
herbie shell --seed 2023255
(FPCore (x y z t a b)
:name "Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, K"
:precision binary64
:herbie-target
(if (< z -1.3793337487235141e+129) (- (* (* 2.0 (sqrt x)) (cos (- (/ 1.0 y) (/ (/ 0.3333333333333333 z) t)))) (/ (/ a 3.0) b)) (if (< z 3.516290613555987e+106) (- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) (/ (/ a 3.0) b)) (- (* (cos (- y (/ (/ 0.3333333333333333 z) t))) (* 2.0 (sqrt x))) (/ (/ a b) 3.0))))
(- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))