Average Error: 0.0 → 0.0
Time: 5.3s
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 r27084021 = x;
        double r27084022 = 1.0;
        double r27084023 = r27084021 - r27084022;
        double r27084024 = r27084021 * r27084023;
        return r27084024;
}
↓
double f(double x) {
        double r27084025 = x;
        double r27084026 = 1.0;
        double r27084027 = r27084025 - r27084026;
        double r27084028 = r27084025 * r27084027;
        return r27084028;
}

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 2019158 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"

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

  (* x (- x 1.0)))