Average Error: 0.0 → 0.0
Time: 2.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 r388191 = x;
        double r388192 = 1.0;
        double r388193 = r388191 - r388192;
        double r388194 = r388191 * r388193;
        return r388194;
}

double f(double x) {
        double r388195 = x;
        double r388196 = 1.0;
        double r388197 = r388195 - r388196;
        double r388198 = r388195 * r388197;
        return r388198;
}

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

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

  (* x (- x 1)))