Average Error: 0.0 → 0
Time: 1.3s
Precision: binary64
\[x \cdot \left(x - 1\right) \]
↓
\[\mathsf{fma}\left(x, x, -x\right) \]
x \cdot \left(x - 1\right)
↓
\mathsf{fma}\left(x, x, -x\right)

(FPCore (x) :precision binary64 (* x (- x 1.0)))
↓
(FPCore (x) :precision binary64 (fma x x (- x)))
double code(double x) {
	return x * (x - 1.0);
}
↓
double code(double x) {
	return fma(x, x, -x);
}

Error

Bits error versus x

Target

Original0.0
Target0.0
Herbie0
\[x \cdot x - x \]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x - 1\right) \]

  2. Taylor expanded in x around 0 0.0

    \[\leadsto \color{blue}{{x}^{2} - x} \]

  3. Applied unpow2_binary640.0

    \[\leadsto \color{blue}{x \cdot x} - x \]

  4. Applied fma-neg_binary640

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

  5. Final simplification0

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

Reproduce

herbie shell --seed 2021280 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (- (* x x) x)

  (* x (- x 1.0)))