Average Error: 0.0 → 0.0
Time: 5.2s
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 r197518 = x;
        double r197519 = 1.0;
        double r197520 = r197518 - r197519;
        double r197521 = r197518 * r197520;
        return r197521;
}
↓
double f(double x) {
        double r197522 = x;
        double r197523 = r197522 * r197522;
        double r197524 = 1.0;
        double r197525 = -r197524;
        double r197526 = r197525 * r197522;
        double r197527 = r197523 + r197526;
        return r197527;
}

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

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2019326 +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)))