Average Error: 0.0 → 0.0
Time: 4.5s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot x + x \cdot \left(-1\right)\]
x \cdot \left(x - 1\right)
↓
x \cdot x + x \cdot \left(-1\right)
double f(double x) {
        double r378339 = x;
        double r378340 = 1.0;
        double r378341 = r378339 - r378340;
        double r378342 = r378339 * r378341;
        return r378342;
}
↓
double f(double x) {
        double r378343 = x;
        double r378344 = r378343 * r378343;
        double r378345 = 1.0;
        double r378346 = -r378345;
        double r378347 = r378343 * r378346;
        double r378348 = r378344 + r378347;
        return r378348;
}

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-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020046 +o rules:numerics
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

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

  (* x (- x 1)))