
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 1.0; end
code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 8 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (b * b))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (b * b))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(b * b))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (b * b))) - 1.0; end
code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1
\end{array}
(FPCore (a b) :precision binary64 (+ (+ (pow (+ (* a a) (* b b)) 2.0) (* (* b b) 4.0)) -1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + ((b * b) * 4.0)) + -1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((((a * a) + (b * b)) ** 2.0d0) + ((b * b) * 4.0d0)) + (-1.0d0)
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + ((b * b) * 4.0)) + -1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + ((b * b) * 4.0)) + -1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(Float64(b * b) * 4.0)) + -1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + ((b * b) * 4.0)) + -1.0; end
code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + \left(b \cdot b\right) \cdot 4\right) + -1
\end{array}
Initial program 99.8%
Final simplification99.8%
(FPCore (a b) :precision binary64 (if (<= (* a a) 1000.0) (+ (* b (* b (+ (* b b) 4.0))) -1.0) (* (* a (* a (* a a))) (+ 1.0 (* b (* b (/ 2.0 (* a a))))))))
double code(double a, double b) {
double tmp;
if ((a * a) <= 1000.0) {
tmp = (b * (b * ((b * b) + 4.0))) + -1.0;
} else {
tmp = (a * (a * (a * a))) * (1.0 + (b * (b * (2.0 / (a * a)))));
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((a * a) <= 1000.0d0) then
tmp = (b * (b * ((b * b) + 4.0d0))) + (-1.0d0)
else
tmp = (a * (a * (a * a))) * (1.0d0 + (b * (b * (2.0d0 / (a * a)))))
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if ((a * a) <= 1000.0) {
tmp = (b * (b * ((b * b) + 4.0))) + -1.0;
} else {
tmp = (a * (a * (a * a))) * (1.0 + (b * (b * (2.0 / (a * a)))));
}
return tmp;
}
def code(a, b): tmp = 0 if (a * a) <= 1000.0: tmp = (b * (b * ((b * b) + 4.0))) + -1.0 else: tmp = (a * (a * (a * a))) * (1.0 + (b * (b * (2.0 / (a * a))))) return tmp
function code(a, b) tmp = 0.0 if (Float64(a * a) <= 1000.0) tmp = Float64(Float64(b * Float64(b * Float64(Float64(b * b) + 4.0))) + -1.0); else tmp = Float64(Float64(a * Float64(a * Float64(a * a))) * Float64(1.0 + Float64(b * Float64(b * Float64(2.0 / Float64(a * a)))))); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if ((a * a) <= 1000.0) tmp = (b * (b * ((b * b) + 4.0))) + -1.0; else tmp = (a * (a * (a * a))) * (1.0 + (b * (b * (2.0 / (a * a))))); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 1000.0], N[(N[(b * N[(b * N[(N[(b * b), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(1.0 + N[(b * N[(b * N[(2.0 / N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot a \leq 1000:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b + 4\right)\right) + -1\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot \left(a \cdot \left(a \cdot a\right)\right)\right) \cdot \left(1 + b \cdot \left(b \cdot \frac{2}{a \cdot a}\right)\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 1e3Initial program 99.9%
Taylor expanded in a around 0
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6498.9%
Simplified98.9%
if 1e3 < (*.f64 a a) Initial program 99.8%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in a around inf
distribute-lft-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
associate-*l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
Simplified97.9%
Taylor expanded in a around inf
*-lowering-*.f64N/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
unpow2N/A
cube-multN/A
*-lowering-*.f64N/A
cube-multN/A
unpow2N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
associate-*r/N/A
associate-*l/N/A
metadata-evalN/A
associate-*r/N/A
unpow2N/A
associate-*r*N/A
*-lowering-*.f64N/A
Simplified97.9%
Final simplification98.4%
(FPCore (a b) :precision binary64 (let* ((t_0 (+ (* a a) (* b b)))) (+ (* b (* b 4.0)) (+ (* t_0 t_0) -1.0))))
double code(double a, double b) {
double t_0 = (a * a) + (b * b);
return (b * (b * 4.0)) + ((t_0 * t_0) + -1.0);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: t_0
t_0 = (a * a) + (b * b)
code = (b * (b * 4.0d0)) + ((t_0 * t_0) + (-1.0d0))
end function
public static double code(double a, double b) {
double t_0 = (a * a) + (b * b);
return (b * (b * 4.0)) + ((t_0 * t_0) + -1.0);
}
def code(a, b): t_0 = (a * a) + (b * b) return (b * (b * 4.0)) + ((t_0 * t_0) + -1.0)
function code(a, b) t_0 = Float64(Float64(a * a) + Float64(b * b)) return Float64(Float64(b * Float64(b * 4.0)) + Float64(Float64(t_0 * t_0) + -1.0)) end
function tmp = code(a, b) t_0 = (a * a) + (b * b); tmp = (b * (b * 4.0)) + ((t_0 * t_0) + -1.0); end
code[a_, b_] := Block[{t$95$0 = N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]}, N[(N[(b * N[(b * 4.0), $MachinePrecision]), $MachinePrecision] + N[(N[(t$95$0 * t$95$0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot a + b \cdot b\\
b \cdot \left(b \cdot 4\right) + \left(t\_0 \cdot t\_0 + -1\right)
\end{array}
\end{array}
Initial program 99.8%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.8%
Simplified99.8%
(FPCore (a b) :precision binary64 (if (<= (* a a) 1e-92) -1.0 (if (<= (* a a) 5e+20) (* b (* b (* b b))) (* a (* a (* a a))))))
double code(double a, double b) {
double tmp;
if ((a * a) <= 1e-92) {
tmp = -1.0;
} else if ((a * a) <= 5e+20) {
tmp = b * (b * (b * b));
} else {
tmp = a * (a * (a * a));
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((a * a) <= 1d-92) then
tmp = -1.0d0
else if ((a * a) <= 5d+20) then
tmp = b * (b * (b * b))
else
tmp = a * (a * (a * a))
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if ((a * a) <= 1e-92) {
tmp = -1.0;
} else if ((a * a) <= 5e+20) {
tmp = b * (b * (b * b));
} else {
tmp = a * (a * (a * a));
}
return tmp;
}
def code(a, b): tmp = 0 if (a * a) <= 1e-92: tmp = -1.0 elif (a * a) <= 5e+20: tmp = b * (b * (b * b)) else: tmp = a * (a * (a * a)) return tmp
function code(a, b) tmp = 0.0 if (Float64(a * a) <= 1e-92) tmp = -1.0; elseif (Float64(a * a) <= 5e+20) tmp = Float64(b * Float64(b * Float64(b * b))); else tmp = Float64(a * Float64(a * Float64(a * a))); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if ((a * a) <= 1e-92) tmp = -1.0; elseif ((a * a) <= 5e+20) tmp = b * (b * (b * b)); else tmp = a * (a * (a * a)); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 1e-92], -1.0, If[LessEqual[N[(a * a), $MachinePrecision], 5e+20], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot a \leq 10^{-92}:\\
\;\;\;\;-1\\
\mathbf{elif}\;a \cdot a \leq 5 \cdot 10^{+20}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a \cdot \left(a \cdot a\right)\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 9.99999999999999988e-93Initial program 99.9%
Taylor expanded in a around 0
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.9%
Simplified99.9%
Taylor expanded in b around 0
Simplified59.5%
if 9.99999999999999988e-93 < (*.f64 a a) < 5e20Initial program 99.8%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.7%
Simplified99.7%
Taylor expanded in b around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6462.0%
Simplified62.0%
if 5e20 < (*.f64 a a) Initial program 99.8%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6491.3%
Simplified91.3%
(FPCore (a b) :precision binary64 (if (<= (* a a) 1000.0) (+ (* b (* b (+ (* b b) 4.0))) -1.0) (* (* a a) (+ (* a a) (* (* b b) 2.0)))))
double code(double a, double b) {
double tmp;
if ((a * a) <= 1000.0) {
tmp = (b * (b * ((b * b) + 4.0))) + -1.0;
} else {
tmp = (a * a) * ((a * a) + ((b * b) * 2.0));
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((a * a) <= 1000.0d0) then
tmp = (b * (b * ((b * b) + 4.0d0))) + (-1.0d0)
else
tmp = (a * a) * ((a * a) + ((b * b) * 2.0d0))
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if ((a * a) <= 1000.0) {
tmp = (b * (b * ((b * b) + 4.0))) + -1.0;
} else {
tmp = (a * a) * ((a * a) + ((b * b) * 2.0));
}
return tmp;
}
def code(a, b): tmp = 0 if (a * a) <= 1000.0: tmp = (b * (b * ((b * b) + 4.0))) + -1.0 else: tmp = (a * a) * ((a * a) + ((b * b) * 2.0)) return tmp
function code(a, b) tmp = 0.0 if (Float64(a * a) <= 1000.0) tmp = Float64(Float64(b * Float64(b * Float64(Float64(b * b) + 4.0))) + -1.0); else tmp = Float64(Float64(a * a) * Float64(Float64(a * a) + Float64(Float64(b * b) * 2.0))); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if ((a * a) <= 1000.0) tmp = (b * (b * ((b * b) + 4.0))) + -1.0; else tmp = (a * a) * ((a * a) + ((b * b) * 2.0)); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[N[(a * a), $MachinePrecision], 1000.0], N[(N[(b * N[(b * N[(N[(b * b), $MachinePrecision] + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(N[(a * a), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \cdot a \leq 1000:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b + 4\right)\right) + -1\\
\mathbf{else}:\\
\;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a + \left(b \cdot b\right) \cdot 2\right)\\
\end{array}
\end{array}
if (*.f64 a a) < 1e3Initial program 99.9%
Taylor expanded in a around 0
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-commutativeN/A
unpow2N/A
associate-*r*N/A
distribute-rgt-outN/A
*-lowering-*.f64N/A
*-commutativeN/A
distribute-lft-outN/A
+-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f6498.9%
Simplified98.9%
if 1e3 < (*.f64 a a) Initial program 99.8%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in a around inf
distribute-lft-inN/A
*-rgt-identityN/A
*-commutativeN/A
associate-*r*N/A
*-commutativeN/A
metadata-evalN/A
pow-sqrN/A
associate-*l*N/A
associate-*r/N/A
*-commutativeN/A
associate-/l*N/A
*-inversesN/A
*-rgt-identityN/A
metadata-evalN/A
pow-sqrN/A
Simplified97.9%
Final simplification98.3%
(FPCore (a b) :precision binary64 (if (<= (* b b) 1e+18) (+ (* a (* a (* a a))) -1.0) (* b (* b (* b b)))))
double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+18) {
tmp = (a * (a * (a * a))) + -1.0;
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if ((b * b) <= 1d+18) then
tmp = (a * (a * (a * a))) + (-1.0d0)
else
tmp = b * (b * (b * b))
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if ((b * b) <= 1e+18) {
tmp = (a * (a * (a * a))) + -1.0;
} else {
tmp = b * (b * (b * b));
}
return tmp;
}
def code(a, b): tmp = 0 if (b * b) <= 1e+18: tmp = (a * (a * (a * a))) + -1.0 else: tmp = b * (b * (b * b)) return tmp
function code(a, b) tmp = 0.0 if (Float64(b * b) <= 1e+18) tmp = Float64(Float64(a * Float64(a * Float64(a * a))) + -1.0); else tmp = Float64(b * Float64(b * Float64(b * b))); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if ((b * b) <= 1e+18) tmp = (a * (a * (a * a))) + -1.0; else tmp = b * (b * (b * b)); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+18], N[(N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(b * N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \cdot b \leq 10^{+18}:\\
\;\;\;\;a \cdot \left(a \cdot \left(a \cdot a\right)\right) + -1\\
\mathbf{else}:\\
\;\;\;\;b \cdot \left(b \cdot \left(b \cdot b\right)\right)\\
\end{array}
\end{array}
if (*.f64 b b) < 1e18Initial program 99.9%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6499.2%
Simplified99.2%
if 1e18 < (*.f64 b b) Initial program 99.8%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.8%
Simplified99.8%
Taylor expanded in b around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6490.8%
Simplified90.8%
Final simplification95.3%
(FPCore (a b) :precision binary64 (if (<= a 0.017) -1.0 (* a (* a (* a a)))))
double code(double a, double b) {
double tmp;
if (a <= 0.017) {
tmp = -1.0;
} else {
tmp = a * (a * (a * a));
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (a <= 0.017d0) then
tmp = -1.0d0
else
tmp = a * (a * (a * a))
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if (a <= 0.017) {
tmp = -1.0;
} else {
tmp = a * (a * (a * a));
}
return tmp;
}
def code(a, b): tmp = 0 if a <= 0.017: tmp = -1.0 else: tmp = a * (a * (a * a)) return tmp
function code(a, b) tmp = 0.0 if (a <= 0.017) tmp = -1.0; else tmp = Float64(a * Float64(a * Float64(a * a))); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if (a <= 0.017) tmp = -1.0; else tmp = a * (a * (a * a)); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[a, 0.017], -1.0, N[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \leq 0.017:\\
\;\;\;\;-1\\
\mathbf{else}:\\
\;\;\;\;a \cdot \left(a \cdot \left(a \cdot a\right)\right)\\
\end{array}
\end{array}
if a < 0.017000000000000001Initial program 99.8%
Taylor expanded in a around 0
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6482.8%
Simplified82.8%
Taylor expanded in b around 0
Simplified34.2%
if 0.017000000000000001 < a Initial program 99.9%
sub-negN/A
+-commutativeN/A
associate-+l+N/A
+-lowering-+.f64N/A
associate-*r*N/A
*-commutativeN/A
*-lowering-*.f64N/A
*-commutativeN/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
metadata-eval99.9%
Simplified99.9%
Taylor expanded in a around inf
metadata-evalN/A
pow-sqrN/A
unpow2N/A
associate-*l*N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6484.4%
Simplified84.4%
(FPCore (a b) :precision binary64 -1.0)
double code(double a, double b) {
return -1.0;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -1.0d0
end function
public static double code(double a, double b) {
return -1.0;
}
def code(a, b): return -1.0
function code(a, b) return -1.0 end
function tmp = code(a, b) tmp = -1.0; end
code[a_, b_] := -1.0
\begin{array}{l}
\\
-1
\end{array}
Initial program 99.8%
Taylor expanded in a around 0
associate-+r+N/A
associate-*r*N/A
distribute-rgt-inN/A
+-commutativeN/A
metadata-evalN/A
pow-sqrN/A
distribute-lft-inN/A
associate-+r+N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f64N/A
+-lowering-+.f64N/A
+-commutativeN/A
+-lowering-+.f64N/A
unpow2N/A
*-lowering-*.f64N/A
*-lowering-*.f64N/A
unpow2N/A
*-lowering-*.f6476.5%
Simplified76.5%
Taylor expanded in b around 0
Simplified26.2%
herbie shell --seed 2024141
(FPCore (a b)
:name "Bouland and Aaronson, Equation (26)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (* b b))) 1.0))