Average Error: 0.0 → 0
Time: 474.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[\mathsf{fma}\left(x, x, x\right)\]
x + x \cdot x
↓
\mathsf{fma}\left(x, x, x\right)
double code(double x) {
	return (x + (x * x));
}
↓
double code(double x) {
	return fma(x, x, x);
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Simplified0

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

  3. Final simplification0

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

Reproduce

herbie shell --seed 2020057 +o rules:numerics
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))