Average Error: 0.0 → 0.0
Time: 4.6s
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 r17762904 = x;
        double r17762905 = 1.0;
        double r17762906 = r17762904 - r17762905;
        double r17762907 = r17762904 * r17762906;
        return r17762907;
}
↓
double f(double x) {
        double r17762908 = x;
        double r17762909 = 1.0;
        double r17762910 = r17762908 - r17762909;
        double r17762911 = r17762908 * r17762910;
        return r17762911;
}

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

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

  (* x (- x 1.0)))