Average Error: 0.0 → 0.0
Time: 3.5s
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 r206355 = x;
        double r206356 = 1.0;
        double r206357 = r206355 - r206356;
        double r206358 = r206355 * r206357;
        return r206358;
}
↓
double f(double x) {
        double r206359 = x;
        double r206360 = r206359 * r206359;
        double r206361 = 1.0;
        double r206362 = -r206361;
        double r206363 = r206359 * r206362;
        double r206364 = r206360 + r206363;
        return r206364;
}

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

  6. Final simplification0.0

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

Reproduce

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

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

  (* x (- x 1.0)))