Average Error: 0.0 → 0.0
Time: 8.3s
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 r20108786 = x;
        double r20108787 = 1.0;
        double r20108788 = r20108786 - r20108787;
        double r20108789 = r20108786 * r20108788;
        return r20108789;
}
↓
double f(double x) {
        double r20108790 = x;
        double r20108791 = r20108790 * r20108790;
        double r20108792 = 1.0;
        double r20108793 = -r20108792;
        double r20108794 = r20108793 * r20108790;
        double r20108795 = r20108791 + r20108794;
        return r20108795;
}

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

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

  5. Final simplification0.0

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

Reproduce

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

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

  (* x (- x 1.0)))