Average Error: 0.0 → 0.0
Time: 4.4s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot \left(x - 1\right)\]
x \cdot \left(x - 1\right)
↓
x \cdot \left(x - 1\right)
double f(double x) {
        double r235463 = x;
        double r235464 = 1.0;
        double r235465 = r235463 - r235464;
        double r235466 = r235463 * r235465;
        return r235466;
}
↓
double f(double x) {
        double r235467 = x;
        double r235468 = 1.0;
        double r235469 = r235467 - r235468;
        double r235470 = r235467 * r235469;
        return r235470;
}

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 \color{blue}{{x}^{2}} + x \cdot \left(-1\right)\]

  6. Final simplification0.0

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

Reproduce

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

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

  (* x (- x 1)))