Average Error: 0.0 → 0.0
Time: 5.1s
Precision: 64
\[x \cdot \left(x - 1.0\right)\]
↓
\[x \cdot \left(x - 1.0\right)\]
x \cdot \left(x - 1.0\right)
↓
x \cdot \left(x - 1.0\right)
double f(double x) {
        double r18019298 = x;
        double r18019299 = 1.0;
        double r18019300 = r18019298 - r18019299;
        double r18019301 = r18019298 * r18019300;
        return r18019301;
}
↓
double f(double x) {
        double r18019302 = x;
        double r18019303 = 1.0;
        double r18019304 = r18019302 - r18019303;
        double r18019305 = r18019302 * r18019304;
        return r18019305;
}

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. Final simplification0.0

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

Reproduce

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

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

  (* x (- x 1.0)))