Average Error: 0.0 → 0.0
Time: 6.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 r12636293 = x;
        double r12636294 = 1.0;
        double r12636295 = r12636293 - r12636294;
        double r12636296 = r12636293 * r12636295;
        return r12636296;
}
↓
double f(double x) {
        double r12636297 = x;
        double r12636298 = 1.0;
        double r12636299 = r12636297 - r12636298;
        double r12636300 = r12636297 * r12636299;
        return r12636300;
}

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

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

  (* x (- x 1.0)))