Average Error: 0.0 → 0.0
Time: 2.7s
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.0

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

  2. Simplified0.0

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

    [Start]0.0

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

    +-commutative [=>]0.0

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

    fma-def [=>]0.0

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

  3. Final simplification0.0

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

Alternatives

Alternative 1
Error15.5
Cost592
\[\begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{-143}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 10^{-79}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 9.8 \cdot 10^{-40}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
Alternative 2
Error8.0
Cost588
\[\begin{array}{l} \mathbf{if}\;x \leq -3 \cdot 10^{+135}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -1.7 \cdot 10^{+127}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 3.4 \cdot 10^{+22}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
Alternative 3
Error0.4
Cost584
\[\begin{array}{l} \mathbf{if}\;x \leq -24:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{elif}\;x \leq 1.9 \cdot 10^{-81}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x + 1\right)\\ \end{array} \]
Alternative 4
Error17.5
Cost460
\[\begin{array}{l} \mathbf{if}\;y \leq 2.8 \cdot 10^{-143}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 4.6 \cdot 10^{-80}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 3.1 \cdot 10^{-40}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
Alternative 5
Error1.1
Cost456
\[\begin{array}{l} \mathbf{if}\;x \leq -24:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{elif}\;x \leq 1.56 \cdot 10^{+22}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
Alternative 6
Error0.0
Cost448
\[y + \left(x + y \cdot x\right) \]
Alternative 7
Error35.5
Cost64
\[x \]

Error

Reproduce

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