Average Error: 0.0 → 0.0
Time: 6.8s
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 r13796832 = x;
        double r13796833 = 1.0;
        double r13796834 = r13796832 - r13796833;
        double r13796835 = r13796832 * r13796834;
        return r13796835;
}
↓
double f(double x) {
        double r13796836 = x;
        double r13796837 = r13796836 * r13796836;
        double r13796838 = 1.0;
        double r13796839 = -r13796838;
        double r13796840 = r13796839 * r13796836;
        double r13796841 = r13796837 + r13796840;
        return r13796841;
}

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-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot x + \left(-1.0\right) \cdot x}\]

  5. Final simplification0.0

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

Reproduce

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