Average Error: 0.0 → 0.0
Time: 2.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 r170119 = x;
        double r170120 = 1.0;
        double r170121 = r170119 - r170120;
        double r170122 = r170119 * r170121;
        return r170122;
}
↓
double f(double x) {
        double r170123 = x;
        double r170124 = r170123 * r170123;
        double r170125 = 1.0;
        double r170126 = -r170125;
        double r170127 = r170123 * r170126;
        double r170128 = r170124 + r170127;
        return r170128;
}

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

  6. Final simplification0.0

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

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