Average Error: 0.0 → 0.0
Time: 5.5s
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 r13072727 = x;
        double r13072728 = 1.0;
        double r13072729 = r13072727 - r13072728;
        double r13072730 = r13072727 * r13072729;
        return r13072730;
}
↓
double f(double x) {
        double r13072731 = x;
        double r13072732 = 1.0;
        double r13072733 = r13072731 - r13072732;
        double r13072734 = r13072731 * r13072733;
        return r13072734;
}

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