Average Error: 0.0 → 0.0
Time: 7.9s
Precision: 64
\[x \cdot \left(x - 1.0\right)\]
\[x \cdot x + \left(-1.0\right) \cdot x\]
x \cdot \left(x - 1.0\right)
x \cdot x + \left(-1.0\right) \cdot x
double f(double x) {
        double r8924173 = x;
        double r8924174 = 1.0;
        double r8924175 = r8924173 - r8924174;
        double r8924176 = r8924173 * r8924175;
        return r8924176;
}

double f(double x) {
        double r8924177 = x;
        double r8924178 = r8924177 * r8924177;
        double r8924179 = 1.0;
        double r8924180 = -r8924179;
        double r8924181 = r8924180 * r8924177;
        double r8924182 = r8924178 + r8924181;
        return r8924182;
}

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.0\right)\]
  2. Using strategy rm
  3. Applied sub-neg0.0

    \[\leadsto x \cdot \color{blue}{\left(x + \left(-1.0\right)\right)}\]
  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot x + x \cdot \left(-1.0\right)}\]
  5. Final simplification0.0

    \[\leadsto x \cdot x + \left(-1.0\right) \cdot x\]

Reproduce

herbie shell --seed 2019162 +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)))