
(FPCore (a b) :precision binary64 (- (* (* (* a a) b) b)))
double code(double a, double b) {
return -(((a * a) * b) * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -(((a * a) * b) * b)
end function
public static double code(double a, double b) {
return -(((a * a) * b) * b);
}
def code(a, b): return -(((a * a) * b) * b)
function code(a, b) return Float64(-Float64(Float64(Float64(a * a) * b) * b)) end
function tmp = code(a, b) tmp = -(((a * a) * b) * b); end
code[a_, b_] := (-N[(N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision])
\begin{array}{l}
\\
-\left(\left(a \cdot a\right) \cdot b\right) \cdot b
\end{array}
Sampling outcomes in binary64 precision:
Herbie found 6 alternatives:
| Alternative | Accuracy | Speedup |
|---|
(FPCore (a b) :precision binary64 (- (* (* (* a a) b) b)))
double code(double a, double b) {
return -(((a * a) * b) * b);
}
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -(((a * a) * b) * b)
end function
public static double code(double a, double b) {
return -(((a * a) * b) * b);
}
def code(a, b): return -(((a * a) * b) * b)
function code(a, b) return Float64(-Float64(Float64(Float64(a * a) * b) * b)) end
function tmp = code(a, b) tmp = -(((a * a) * b) * b); end
code[a_, b_] := (-N[(N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision])
\begin{array}{l}
\\
-\left(\left(a \cdot a\right) \cdot b\right) \cdot b
\end{array}
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (* a b) (/ b (/ -1.0 a))))
assert(a < b);
double code(double a, double b) {
return (a * b) * (b / (-1.0 / a));
}
NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a * b) * (b / ((-1.0d0) / a))
end function
assert a < b;
public static double code(double a, double b) {
return (a * b) * (b / (-1.0 / a));
}
[a, b] = sort([a, b]) def code(a, b): return (a * b) * (b / (-1.0 / a))
a, b = sort([a, b]) function code(a, b) return Float64(Float64(a * b) * Float64(b / Float64(-1.0 / a))) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (a * b) * (b / (-1.0 / a));
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(a * b), $MachinePrecision] * N[(b / N[(-1.0 / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\left(a \cdot b\right) \cdot \frac{b}{\frac{-1}{a}}
\end{array}
Initial program 82.1%
lift-neg.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
unswap-sqrN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-outN/A
pow2N/A
metadata-evalN/A
pow-prod-upN/A
lift-pow.f64N/A
inv-powN/A
div-invN/A
distribute-neg-frac2N/A
lift-pow.f64N/A
sqr-powN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites57.6%
lift-*.f64N/A
lift-neg.f64N/A
distribute-rgt-neg-outN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-upN/A
metadata-evalN/A
pow2N/A
distribute-lft-neg-inN/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift-neg.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
/-rgt-identityN/A
associate-*r/N/A
associate-*l/N/A
associate-/r/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites99.7%
lift-/.f64N/A
clear-numN/A
div-invN/A
associate-/r*N/A
lift-pow.f64N/A
unpow-1N/A
remove-double-divN/A
lower-/.f64N/A
metadata-evalN/A
lift-neg.f64N/A
frac-2negN/A
lower-/.f6499.7
Applied rewrites99.7%
Final simplification99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (/ a (/ -1.0 b)) (* a b)))
assert(a < b);
double code(double a, double b) {
return (a / (-1.0 / b)) * (a * b);
}
NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a / ((-1.0d0) / b)) * (a * b)
end function
assert a < b;
public static double code(double a, double b) {
return (a / (-1.0 / b)) * (a * b);
}
[a, b] = sort([a, b]) def code(a, b): return (a / (-1.0 / b)) * (a * b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(a / Float64(-1.0 / b)) * Float64(a * b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (a / (-1.0 / b)) * (a * b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(a / N[(-1.0 / b), $MachinePrecision]), $MachinePrecision] * N[(a * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\frac{a}{\frac{-1}{b}} \cdot \left(a \cdot b\right)
\end{array}
Initial program 82.1%
lift-neg.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
unswap-sqrN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
lift-*.f64N/A
lift-*.f64N/A
lift-neg.f64N/A
distribute-lft-neg-outN/A
*-commutativeN/A
lift-*.f64N/A
distribute-lft-neg-outN/A
pow2N/A
metadata-evalN/A
pow-prod-upN/A
lift-pow.f64N/A
inv-powN/A
div-invN/A
distribute-neg-frac2N/A
lift-pow.f64N/A
sqr-powN/A
lift-*.f64N/A
*-commutativeN/A
distribute-lft-neg-outN/A
lift-neg.f64N/A
lift-*.f64N/A
associate-/l*N/A
lower-*.f64N/A
Applied rewrites57.6%
lift-*.f64N/A
lift-neg.f64N/A
distribute-rgt-neg-outN/A
lift-pow.f64N/A
lift-pow.f64N/A
pow-prod-upN/A
metadata-evalN/A
pow2N/A
distribute-lft-neg-inN/A
lift-*.f64N/A
distribute-rgt-neg-outN/A
lift-neg.f64N/A
*-commutativeN/A
associate-*r*N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
lift-*.f64N/A
/-rgt-identityN/A
associate-*r/N/A
associate-*l/N/A
associate-/r/N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
Applied rewrites99.7%
lift-/.f64N/A
frac-2negN/A
lift-neg.f64N/A
remove-double-negN/A
lower-/.f64N/A
lift-pow.f64N/A
unpow-1N/A
distribute-neg-fracN/A
metadata-evalN/A
lower-/.f6499.7
Applied rewrites99.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (* (- a) b) (* a b)))
assert(a < b);
double code(double a, double b) {
return (-a * b) * (a * b);
}
NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (-a * b) * (a * b)
end function
assert a < b;
public static double code(double a, double b) {
return (-a * b) * (a * b);
}
[a, b] = sort([a, b]) def code(a, b): return (-a * b) * (a * b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(-a) * b) * Float64(a * b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (-a * b) * (a * b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[((-a) * b), $MachinePrecision] * N[(a * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\left(\left(-a\right) \cdot b\right) \cdot \left(a \cdot b\right)
\end{array}
Initial program 82.1%
lift-neg.f64N/A
lift-*.f64N/A
lift-*.f64N/A
associate-*l*N/A
lift-*.f64N/A
unswap-sqrN/A
distribute-lft-neg-inN/A
lower-*.f64N/A
distribute-lft-neg-inN/A
lower-*.f64N/A
lower-neg.f64N/A
*-commutativeN/A
lower-*.f6499.6
Applied rewrites99.6%
Final simplification99.6%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (- b) (* (* a a) b)))
assert(a < b);
double code(double a, double b) {
return -b * ((a * a) * b);
}
NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = -b * ((a * a) * b)
end function
assert a < b;
public static double code(double a, double b) {
return -b * ((a * a) * b);
}
[a, b] = sort([a, b]) def code(a, b): return -b * ((a * a) * b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(-b) * Float64(Float64(a * a) * b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = -b * ((a * a) * b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[((-b) * N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\left(-b\right) \cdot \left(\left(a \cdot a\right) \cdot b\right)
\end{array}
Initial program 82.1%
Final simplification82.1%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (* (* a a) b) b))
assert(a < b);
double code(double a, double b) {
return ((a * a) * b) * b;
}
NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = ((a * a) * b) * b
end function
assert a < b;
public static double code(double a, double b) {
return ((a * a) * b) * b;
}
[a, b] = sort([a, b]) def code(a, b): return ((a * a) * b) * b
a, b = sort([a, b]) function code(a, b) return Float64(Float64(Float64(a * a) * b) * b) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = ((a * a) * b) * b;
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(N[(a * a), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\left(\left(a \cdot a\right) \cdot b\right) \cdot b
\end{array}
Initial program 82.1%
lift-neg.f64N/A
+-lft-identityN/A
flip3-+N/A
distribute-neg-fracN/A
Applied rewrites25.7%
Final simplification25.7%
NOTE: a and b should be sorted in increasing order before calling this function. (FPCore (a b) :precision binary64 (* (* a b) (* a b)))
assert(a < b);
double code(double a, double b) {
return (a * b) * (a * b);
}
NOTE: a and b should be sorted in increasing order before calling this function.
real(8) function code(a, b)
real(8), intent (in) :: a
real(8), intent (in) :: b
code = (a * b) * (a * b)
end function
assert a < b;
public static double code(double a, double b) {
return (a * b) * (a * b);
}
[a, b] = sort([a, b]) def code(a, b): return (a * b) * (a * b)
a, b = sort([a, b]) function code(a, b) return Float64(Float64(a * b) * Float64(a * b)) end
a, b = num2cell(sort([a, b])){:}
function tmp = code(a, b)
tmp = (a * b) * (a * b);
end
NOTE: a and b should be sorted in increasing order before calling this function. code[a_, b_] := N[(N[(a * b), $MachinePrecision] * N[(a * b), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}
[a, b] = \mathsf{sort}([a, b])\\
\\
\left(a \cdot b\right) \cdot \left(a \cdot b\right)
\end{array}
Initial program 82.1%
lift-neg.f64N/A
+-lft-identityN/A
flip3-+N/A
distribute-neg-fracN/A
Applied rewrites25.6%
Final simplification25.6%
herbie shell --seed 2024255
(FPCore (a b)
:name "ab-angle->ABCF D"
:precision binary64
(- (* (* (* a a) b) b)))