Average Error: 0.0 → 0.0
Time: 872.0ms
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 r264988 = x;
        double r264989 = 1.0;
        double r264990 = r264988 - r264989;
        double r264991 = r264988 * r264990;
        return r264991;
}
↓
double f(double x) {
        double r264992 = x;
        double r264993 = 1.0;
        double r264994 = r264992 - r264993;
        double r264995 = r264992 * r264994;
        return r264995;
}

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

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

Reproduce

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

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

  (* x (- x 1)))