Average Error: 0.0 → 0.0
Time: 595.0ms
Precision: binary64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot x - x\]
x \cdot \left(x - 1\right)
↓
x \cdot x - x
(FPCore (x) :precision binary64 (* x (- x 1.0)))
↓
(FPCore (x) :precision binary64 (- (* x x) x))
double code(double x) {
	return x * (x - 1.0);
}
↓
double code(double x) {
	return (x * x) - x;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x - 1\right)\]
  2. Using strategy rm

  3. Applied sub-neg_binary640.0

    \[\leadsto x \cdot \color{blue}{\left(x + \left(-1\right)\right)}\]

  4. Applied distribute-rgt-in_binary640.0

    \[\leadsto \color{blue}{x \cdot x + \left(-1\right) \cdot x}\]

  5. Simplified0.0

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

  6. Final simplification0.0

    \[\leadsto x \cdot x - x\]

Reproduce

herbie shell --seed 2020232 
(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)))