Average Error: 0.0 → 0.0
Time: 6.8s
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 r11923515 = x;
        double r11923516 = 1.0;
        double r11923517 = r11923515 - r11923516;
        double r11923518 = r11923515 * r11923517;
        return r11923518;
}
↓
double f(double x) {
        double r11923519 = x;
        double r11923520 = 1.0;
        double r11923521 = r11923519 - r11923520;
        double r11923522 = r11923519 * r11923521;
        return r11923522;
}

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 2019169 +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)))