?

Average Error: 0.01% → 0.01%
Time: 3.3s
Precision: binary64
Cost: 6720

?

\[ \begin{array}{c}[x, y] = \mathsf{sort}([x, y])\\ \end{array} \]
\[\left(x \cdot y + x\right) + y \]
\[y + \mathsf{fma}\left(x, y, x\right) \]
(FPCore (x y) :precision binary64 (+ (+ (* x y) x) y))
(FPCore (x y) :precision binary64 (+ y (fma x y x)))
double code(double x, double y) {
	return ((x * y) + x) + y;
}
double code(double x, double y) {
	return y + fma(x, y, x);
}
function code(x, y)
	return Float64(Float64(Float64(x * y) + x) + y)
end
function code(x, y)
	return Float64(y + fma(x, y, x))
end
code[x_, y_] := N[(N[(N[(x * y), $MachinePrecision] + x), $MachinePrecision] + y), $MachinePrecision]
code[x_, y_] := N[(y + N[(x * y + x), $MachinePrecision]), $MachinePrecision]
\left(x \cdot y + x\right) + y
y + \mathsf{fma}\left(x, y, x\right)

Error?

Derivation?

  1. Initial program 0.01

    \[\left(x \cdot y + x\right) + y \]
  2. Simplified0.01

    \[\leadsto \color{blue}{y + \mathsf{fma}\left(x, y, x\right)} \]
    Proof

    [Start]0.01

    \[ \left(x \cdot y + x\right) + y \]

    +-commutative [=>]0.01

    \[ \color{blue}{y + \left(x \cdot y + x\right)} \]

    fma-def [=>]0.01

    \[ y + \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]
  3. Final simplification0.01

    \[\leadsto y + \mathsf{fma}\left(x, y, x\right) \]

Alternatives

Alternative 1
Error26.56%
Cost1248
\[\begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1.5 \cdot 10^{-156}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{-141}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{-62}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+21}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 2.75 \cdot 10^{+32}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 6 \cdot 10^{+104}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 6.8 \cdot 10^{+134}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
Alternative 2
Error13.66%
Cost589
\[\begin{array}{l} \mathbf{if}\;y \leq -1.8 \lor \neg \left(y \leq 1.6 \cdot 10^{+104}\right) \land y \leq 2.3 \cdot 10^{+134}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \]
Alternative 3
Error0.8%
Cost584
\[\begin{array}{l} \mathbf{if}\;x \leq -6500:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{-16}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x + 1\right)\\ \end{array} \]
Alternative 4
Error0.8%
Cost584
\[\begin{array}{l} \mathbf{if}\;x \leq -6500:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{-16}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y + y \cdot x\\ \end{array} \]
Alternative 5
Error1.6%
Cost456
\[\begin{array}{l} \mathbf{if}\;x \leq -6500:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{elif}\;x \leq 1950:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
Alternative 6
Error0.01%
Cost448
\[y + \left(x + y \cdot x\right) \]
Alternative 7
Error27.41%
Cost196
\[\begin{array}{l} \mathbf{if}\;x \leq -4.3 \cdot 10^{-95}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
Alternative 8
Error56.03%
Cost64
\[x \]

Error

Reproduce?

herbie shell --seed 2023093 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))