
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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 * (((a * a) * (1.0d0 - a)) + ((b * b) * (3.0d0 + a))))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 - a)) + Float64(Float64(b * b) * Float64(3.0 + a))))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(3.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))
double code(double a, double b) {
return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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 * (((a * a) * (1.0d0 - a)) + ((b * b) * (3.0d0 + a))))) - 1.0d0
end function
public static double code(double a, double b) {
return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0;
}
def code(a, b): return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 1.0
function code(a, b) return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 - a)) + Float64(Float64(b * b) * Float64(3.0 + a))))) - 1.0) end
function tmp = code(a, b) tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (3.0 + a))))) - 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[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(3.0 + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]
\begin{array}{l}
\\
\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1
\end{array}
(FPCore (a b)
:precision binary64
(let* ((t_0 (* a (- 2.0 a))))
(if (<= a 5.4e+50)
(+
(+ (pow (fma a a (* b b)) 2.0) (* 4.0 (- (pow a 2.0) (pow a 3.0))))
-1.0)
(fma (cbrt (pow t_0 4.0)) (pow (cbrt t_0) 2.0) -1.0))))
double code(double a, double b) {
double t_0 = a * (2.0 - a);
double tmp;
if (a <= 5.4e+50) {
tmp = (pow(fma(a, a, (b * b)), 2.0) + (4.0 * (pow(a, 2.0) - pow(a, 3.0)))) + -1.0;
} else {
tmp = fma(cbrt(pow(t_0, 4.0)), pow(cbrt(t_0), 2.0), -1.0);
}
return tmp;
}
function code(a, b) t_0 = Float64(a * Float64(2.0 - a)) tmp = 0.0 if (a <= 5.4e+50) tmp = Float64(Float64((fma(a, a, Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64((a ^ 2.0) - (a ^ 3.0)))) + -1.0); else tmp = fma(cbrt((t_0 ^ 4.0)), (cbrt(t_0) ^ 2.0), -1.0); end return tmp end
code[a_, b_] := Block[{t$95$0 = N[(a * N[(2.0 - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, 5.4e+50], N[(N[(N[Power[N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[Power[a, 2.0], $MachinePrecision] - N[Power[a, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[Power[N[Power[t$95$0, 4.0], $MachinePrecision], 1/3], $MachinePrecision] * N[Power[N[Power[t$95$0, 1/3], $MachinePrecision], 2.0], $MachinePrecision] + -1.0), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := a \cdot \left(2 - a\right)\\
\mathbf{if}\;a \leq 5.4 \cdot 10^{+50}:\\
\;\;\;\;\left({\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}^{2} + 4 \cdot \left({a}^{2} - {a}^{3}\right)\right) + -1\\
\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\sqrt[3]{{t_0}^{4}}, {\left(\sqrt[3]{t_0}\right)}^{2}, -1\right)\\
\end{array}
\end{array}
if a < 5.4e50Initial program 86.6%
sub-neg86.6%
sqr-neg86.6%
+-commutative86.6%
sqr-neg86.6%
+-commutative86.6%
Simplified86.6%
Taylor expanded in a around inf 99.1%
+-commutative99.1%
mul-1-neg99.1%
unsub-neg99.1%
Simplified99.1%
if 5.4e50 < a Initial program 18.3%
associate--l+18.3%
sqr-pow18.3%
Simplified23.3%
Taylor expanded in b around 0 12.2%
add-sqr-sqrt12.2%
pow212.2%
+-commutative12.2%
metadata-eval12.2%
pow-prod-up12.2%
add-sqr-sqrt0.0%
hypot-def68.3%
sqrt-prod68.3%
metadata-eval68.3%
sqrt-prod68.3%
unpow268.3%
sqrt-prod68.3%
add-sqr-sqrt68.3%
Applied egg-rr68.3%
Taylor expanded in a around 0 93.8%
+-commutative93.8%
*-commutative93.8%
mul-1-neg93.8%
unsub-neg93.8%
Simplified93.8%
add-cube-cbrt93.8%
fma-neg93.8%
metadata-eval93.8%
cbrt-unprod100.0%
pow-prod-up100.0%
metadata-eval100.0%
unpow2100.0%
cbrt-prod100.0%
pow2100.0%
Applied egg-rr100.0%
unpow2100.0%
distribute-lft-out--100.0%
unpow2100.0%
distribute-lft-out--100.0%
Simplified100.0%
Final simplification99.3%
(FPCore (a b) :precision binary64 (if (<= a 2e+76) (+ (+ (pow (fma a a (* b b)) 2.0) (* 4.0 (- (pow a 2.0) (pow a 3.0)))) -1.0) (+ -1.0 (pow a 4.0))))
double code(double a, double b) {
double tmp;
if (a <= 2e+76) {
tmp = (pow(fma(a, a, (b * b)), 2.0) + (4.0 * (pow(a, 2.0) - pow(a, 3.0)))) + -1.0;
} else {
tmp = -1.0 + pow(a, 4.0);
}
return tmp;
}
function code(a, b) tmp = 0.0 if (a <= 2e+76) tmp = Float64(Float64((fma(a, a, Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64((a ^ 2.0) - (a ^ 3.0)))) + -1.0); else tmp = Float64(-1.0 + (a ^ 4.0)); end return tmp end
code[a_, b_] := If[LessEqual[a, 2e+76], N[(N[(N[Power[N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[Power[a, 2.0], $MachinePrecision] - N[Power[a, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[(-1.0 + N[Power[a, 4.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;a \leq 2 \cdot 10^{+76}:\\
\;\;\;\;\left({\left(\mathsf{fma}\left(a, a, b \cdot b\right)\right)}^{2} + 4 \cdot \left({a}^{2} - {a}^{3}\right)\right) + -1\\
\mathbf{else}:\\
\;\;\;\;-1 + {a}^{4}\\
\end{array}
\end{array}
if a < 2.0000000000000001e76Initial program 86.8%
sub-neg86.8%
sqr-neg86.8%
+-commutative86.8%
sqr-neg86.8%
+-commutative86.8%
Simplified86.8%
Taylor expanded in a around inf 99.1%
+-commutative99.1%
mul-1-neg99.1%
unsub-neg99.1%
Simplified99.1%
if 2.0000000000000001e76 < a Initial program 12.5%
sub-neg12.5%
sqr-neg12.5%
+-commutative12.5%
sqr-neg12.5%
+-commutative12.5%
Simplified17.9%
Taylor expanded in a around inf 100.0%
Final simplification99.3%
(FPCore (a b)
:precision binary64
(let* ((t_0
(+
(pow (+ (* b b) (* a a)) 2.0)
(* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ a 3.0)))))))
(if (<= t_0 INFINITY) (+ -1.0 t_0) (+ -1.0 (pow (* a (- 2.0 a)) 2.0)))))
double code(double a, double b) {
double t_0 = pow(((b * b) + (a * a)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))));
double tmp;
if (t_0 <= ((double) INFINITY)) {
tmp = -1.0 + t_0;
} else {
tmp = -1.0 + pow((a * (2.0 - a)), 2.0);
}
return tmp;
}
public static double code(double a, double b) {
double t_0 = Math.pow(((b * b) + (a * a)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0))));
double tmp;
if (t_0 <= Double.POSITIVE_INFINITY) {
tmp = -1.0 + t_0;
} else {
tmp = -1.0 + Math.pow((a * (2.0 - a)), 2.0);
}
return tmp;
}
def code(a, b): t_0 = math.pow(((b * b) + (a * a)), 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0)))) tmp = 0 if t_0 <= math.inf: tmp = -1.0 + t_0 else: tmp = -1.0 + math.pow((a * (2.0 - a)), 2.0) return tmp
function code(a, b) t_0 = Float64((Float64(Float64(b * b) + Float64(a * a)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 - a)) + Float64(Float64(b * b) * Float64(a + 3.0))))) tmp = 0.0 if (t_0 <= Inf) tmp = Float64(-1.0 + t_0); else tmp = Float64(-1.0 + (Float64(a * Float64(2.0 - a)) ^ 2.0)); end return tmp end
function tmp_2 = code(a, b) t_0 = (((b * b) + (a * a)) ^ 2.0) + (4.0 * (((a * a) * (1.0 - a)) + ((b * b) * (a + 3.0)))); tmp = 0.0; if (t_0 <= Inf) tmp = -1.0 + t_0; else tmp = -1.0 + ((a * (2.0 - a)) ^ 2.0); end tmp_2 = tmp; end
code[a_, b_] := Block[{t$95$0 = N[(N[Power[N[(N[(b * b), $MachinePrecision] + N[(a * a), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 - a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(a + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, Infinity], N[(-1.0 + t$95$0), $MachinePrecision], N[(-1.0 + N[Power[N[(a * N[(2.0 - a), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}
\\
\begin{array}{l}
t_0 := {\left(b \cdot b + a \cdot a\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(a + 3\right)\right)\\
\mathbf{if}\;t_0 \leq \infty:\\
\;\;\;\;-1 + t_0\\
\mathbf{else}:\\
\;\;\;\;-1 + {\left(a \cdot \left(2 - a\right)\right)}^{2}\\
\end{array}
\end{array}
if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 a))))) < +inf.0Initial program 99.8%
if +inf.0 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (-.f64 1 a)) (*.f64 (*.f64 b b) (+.f64 3 a))))) Initial program 0.0%
associate--l+0.0%
sqr-pow0.0%
Simplified4.0%
Taylor expanded in b around 0 27.1%
add-sqr-sqrt27.1%
pow227.1%
+-commutative27.1%
metadata-eval27.1%
pow-prod-up27.1%
add-sqr-sqrt27.1%
hypot-def81.8%
sqrt-prod81.8%
metadata-eval81.8%
sqrt-prod81.8%
unpow281.8%
sqrt-prod72.0%
add-sqr-sqrt81.8%
Applied egg-rr81.8%
Taylor expanded in a around 0 92.5%
+-commutative92.5%
*-commutative92.5%
mul-1-neg92.5%
unsub-neg92.5%
Simplified92.5%
Taylor expanded in a around 0 92.5%
neg-mul-192.5%
*-commutative92.5%
+-commutative92.5%
sub-neg92.5%
unpow292.5%
distribute-lft-out--92.5%
Simplified92.5%
Final simplification97.7%
(FPCore (a b) :precision binary64 (if (<= b 2350000000.0) (+ -1.0 (pow (* a (- 2.0 a)) 2.0)) (+ -1.0 (pow b 4.0))))
double code(double a, double b) {
double tmp;
if (b <= 2350000000.0) {
tmp = -1.0 + pow((a * (2.0 - a)), 2.0);
} else {
tmp = -1.0 + pow(b, 4.0);
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (b <= 2350000000.0d0) then
tmp = (-1.0d0) + ((a * (2.0d0 - a)) ** 2.0d0)
else
tmp = (-1.0d0) + (b ** 4.0d0)
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if (b <= 2350000000.0) {
tmp = -1.0 + Math.pow((a * (2.0 - a)), 2.0);
} else {
tmp = -1.0 + Math.pow(b, 4.0);
}
return tmp;
}
def code(a, b): tmp = 0 if b <= 2350000000.0: tmp = -1.0 + math.pow((a * (2.0 - a)), 2.0) else: tmp = -1.0 + math.pow(b, 4.0) return tmp
function code(a, b) tmp = 0.0 if (b <= 2350000000.0) tmp = Float64(-1.0 + (Float64(a * Float64(2.0 - a)) ^ 2.0)); else tmp = Float64(-1.0 + (b ^ 4.0)); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if (b <= 2350000000.0) tmp = -1.0 + ((a * (2.0 - a)) ^ 2.0); else tmp = -1.0 + (b ^ 4.0); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[b, 2350000000.0], N[(-1.0 + N[Power[N[(a * N[(2.0 - a), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(-1.0 + N[Power[b, 4.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq 2350000000:\\
\;\;\;\;-1 + {\left(a \cdot \left(2 - a\right)\right)}^{2}\\
\mathbf{else}:\\
\;\;\;\;-1 + {b}^{4}\\
\end{array}
\end{array}
if b < 2.35e9Initial program 73.2%
associate--l+73.2%
sqr-pow73.2%
Simplified74.3%
Taylor expanded in b around 0 61.5%
add-sqr-sqrt61.5%
pow261.5%
+-commutative61.5%
metadata-eval61.5%
pow-prod-up61.5%
add-sqr-sqrt54.8%
hypot-def71.7%
sqrt-prod71.7%
metadata-eval71.7%
sqrt-prod71.7%
unpow271.7%
sqrt-prod45.6%
add-sqr-sqrt71.7%
Applied egg-rr71.7%
Taylor expanded in a around 0 82.0%
+-commutative82.0%
*-commutative82.0%
mul-1-neg82.0%
unsub-neg82.0%
Simplified82.0%
Taylor expanded in a around 0 82.0%
neg-mul-182.0%
*-commutative82.0%
+-commutative82.0%
sub-neg82.0%
unpow282.0%
distribute-lft-out--82.0%
Simplified82.0%
if 2.35e9 < b Initial program 62.1%
sub-neg62.1%
sqr-neg62.1%
+-commutative62.1%
sqr-neg62.1%
+-commutative62.1%
Simplified63.8%
Taylor expanded in b around inf 93.7%
Final simplification84.8%
(FPCore (a b) :precision binary64 (if (<= b 6000000000.0) (+ -1.0 (pow a 4.0)) (+ -1.0 (pow b 4.0))))
double code(double a, double b) {
double tmp;
if (b <= 6000000000.0) {
tmp = -1.0 + pow(a, 4.0);
} else {
tmp = -1.0 + pow(b, 4.0);
}
return tmp;
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
real(8) :: tmp
if (b <= 6000000000.0d0) then
tmp = (-1.0d0) + (a ** 4.0d0)
else
tmp = (-1.0d0) + (b ** 4.0d0)
end if
code = tmp
end function
public static double code(double a, double b) {
double tmp;
if (b <= 6000000000.0) {
tmp = -1.0 + Math.pow(a, 4.0);
} else {
tmp = -1.0 + Math.pow(b, 4.0);
}
return tmp;
}
def code(a, b): tmp = 0 if b <= 6000000000.0: tmp = -1.0 + math.pow(a, 4.0) else: tmp = -1.0 + math.pow(b, 4.0) return tmp
function code(a, b) tmp = 0.0 if (b <= 6000000000.0) tmp = Float64(-1.0 + (a ^ 4.0)); else tmp = Float64(-1.0 + (b ^ 4.0)); end return tmp end
function tmp_2 = code(a, b) tmp = 0.0; if (b <= 6000000000.0) tmp = -1.0 + (a ^ 4.0); else tmp = -1.0 + (b ^ 4.0); end tmp_2 = tmp; end
code[a_, b_] := If[LessEqual[b, 6000000000.0], N[(-1.0 + N[Power[a, 4.0], $MachinePrecision]), $MachinePrecision], N[(-1.0 + N[Power[b, 4.0], $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}
\\
\begin{array}{l}
\mathbf{if}\;b \leq 6000000000:\\
\;\;\;\;-1 + {a}^{4}\\
\mathbf{else}:\\
\;\;\;\;-1 + {b}^{4}\\
\end{array}
\end{array}
if b < 6e9Initial program 73.2%
sub-neg73.2%
sqr-neg73.2%
+-commutative73.2%
sqr-neg73.2%
+-commutative73.2%
Simplified74.2%
Taylor expanded in a around inf 79.7%
if 6e9 < b Initial program 62.1%
sub-neg62.1%
sqr-neg62.1%
+-commutative62.1%
sqr-neg62.1%
+-commutative62.1%
Simplified63.8%
Taylor expanded in b around inf 93.7%
Final simplification83.1%
(FPCore (a b) :precision binary64 (+ -1.0 (pow a 4.0)))
double code(double a, double b) {
return -1.0 + pow(a, 4.0);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (-1.0d0) + (a ** 4.0d0)
end function
public static double code(double a, double b) {
return -1.0 + Math.pow(a, 4.0);
}
def code(a, b): return -1.0 + math.pow(a, 4.0)
function code(a, b) return Float64(-1.0 + (a ^ 4.0)) end
function tmp = code(a, b) tmp = -1.0 + (a ^ 4.0); end
code[a_, b_] := N[(-1.0 + N[Power[a, 4.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
\\
-1 + {a}^{4}
\end{array}
Initial program 70.6%
sub-neg70.6%
sqr-neg70.6%
+-commutative70.6%
sqr-neg70.6%
+-commutative70.6%
Simplified71.7%
Taylor expanded in a around inf 70.0%
Final simplification70.0%
(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 70.6%
sub-neg70.6%
sqr-neg70.6%
+-commutative70.6%
sqr-neg70.6%
+-commutative70.6%
Simplified71.7%
Taylor expanded in a around inf 70.0%
Taylor expanded in a around 0 23.1%
Final simplification23.1%
herbie shell --seed 2023314
(FPCore (a b)
:name "Bouland and Aaronson, Equation (24)"
:precision binary64
(- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (- 1.0 a)) (* (* b b) (+ 3.0 a))))) 1.0))