Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot x + \left(-1\right) \cdot x\]
x \cdot \left(x - 1\right)
↓
x \cdot x + \left(-1\right) \cdot x
double f(double x) {
        double r12464302 = x;
        double r12464303 = 1.0;
        double r12464304 = r12464302 - r12464303;
        double r12464305 = r12464302 * r12464304;
        return r12464305;
}
↓
double f(double x) {
        double r12464306 = x;
        double r12464307 = r12464306 * r12464306;
        double r12464308 = 1.0;
        double r12464309 = -r12464308;
        double r12464310 = r12464309 * r12464306;
        double r12464311 = r12464307 + r12464310;
        return r12464311;
}

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 + \left(-1\right) \cdot x\]

Reproduce

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

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

  (* x (- x 1.0)))