Average Error: 0.0 → 0.0
Time: 3.4s
Precision: 64
\[x \cdot \left(x - 1.0\right)\]
↓
\[x \cdot x + \left(-1.0\right) \cdot x\]
x \cdot \left(x - 1.0\right)
↓
x \cdot x + \left(-1.0\right) \cdot x
double f(double x) {
        double r15154286 = x;
        double r15154287 = 1.0;
        double r15154288 = r15154286 - r15154287;
        double r15154289 = r15154286 * r15154288;
        return r15154289;
}
↓
double f(double x) {
        double r15154290 = x;
        double r15154291 = r15154290 * r15154290;
        double r15154292 = 1.0;
        double r15154293 = -r15154292;
        double r15154294 = r15154293 * r15154290;
        double r15154295 = r15154291 + r15154294;
        return r15154295;
}

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.0\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019165 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"

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

  (* x (- x 1.0)))