Average Error: 0.0 → 0.0
Time: 2.2s
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 r179554 = x;
        double r179555 = 1.0;
        double r179556 = r179554 - r179555;
        double r179557 = r179554 * r179556;
        return r179557;
}
↓
double f(double x) {
        double r179558 = x;
        double r179559 = r179558 * r179558;
        double r179560 = 1.0;
        double r179561 = -r179560;
        double r179562 = r179558 * r179561;
        double r179563 = r179559 + r179562;
        return r179563;
}

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 2019208 +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)))