Average Error: 0.0 → 0.0
Time: 2.7s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot x + \left(-1\right) \cdot x\]
x \cdot \left(x - 1\right)
↓
x \cdot x + \left(-1\right) \cdot x
double f(double x) {
        double r184520 = x;
        double r184521 = 1.0;
        double r184522 = r184520 - r184521;
        double r184523 = r184520 * r184522;
        return r184523;
}
↓
double f(double x) {
        double r184524 = x;
        double r184525 = r184524 * r184524;
        double r184526 = 1.0;
        double r184527 = -r184526;
        double r184528 = r184527 * r184524;
        double r184529 = r184525 + r184528;
        return r184529;
}

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. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-rgt-in0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019305 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

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

  (* x (- x 1)))