Average Error: 0.0 → 0.0
Time: 1.0s
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 r187195 = x;
        double r187196 = 1.0;
        double r187197 = r187195 - r187196;
        double r187198 = r187195 * r187197;
        return r187198;
}
↓
double f(double x) {
        double r187199 = x;
        double r187200 = 1.0;
        double r187201 = r187199 - r187200;
        double r187202 = r187199 * r187201;
        return r187202;
}

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

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

  (* x (- x 1)))