Average Error: 0.0 → 0.0
Time: 1.7s
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 r383597 = x;
        double r383598 = 1.0;
        double r383599 = r383597 - r383598;
        double r383600 = r383597 * r383599;
        return r383600;
}
↓
double f(double x) {
        double r383601 = x;
        double r383602 = r383601 * r383601;
        double r383603 = 1.0;
        double r383604 = -r383603;
        double r383605 = r383601 * r383604;
        double r383606 = r383602 + r383605;
        return r383606;
}

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 2020047 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

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

  (* x (- x 1)))