Average Error: 0.0 → 0.0
Time: 335.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 r310257 = x;
        double r310258 = 1.0;
        double r310259 = r310257 - r310258;
        double r310260 = r310257 * r310259;
        return r310260;
}
↓
double f(double x) {
        double r310261 = x;
        double r310262 = 1.0;
        double r310263 = r310261 - r310262;
        double r310264 = r310261 * r310263;
        return r310264;
}

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

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

  (* x (- x 1)))