Average Error: 0.0 → 0.0
Time: 810.0ms
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[{x}^{2} + x \cdot \left(-1\right)\]
x \cdot \left(x - 1\right)
↓
{x}^{2} + x \cdot \left(-1\right)
double f(double x) {
        double r258117 = x;
        double r258118 = 1.0;
        double r258119 = r258117 - r258118;
        double r258120 = r258117 * r258119;
        return r258120;
}
↓
double f(double x) {
        double r258121 = x;
        double r258122 = 2.0;
        double r258123 = pow(r258121, r258122);
        double r258124 = 1.0;
        double r258125 = -r258124;
        double r258126 = r258121 * r258125;
        double r258127 = r258123 + r258126;
        return r258127;
}

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. Simplified0.0

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

  6. Final simplification0.0

    \[\leadsto {x}^{2} + x \cdot \left(-1\right)\]

Reproduce

herbie shell --seed 2020039 +o rules:numerics
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

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

  (* x (- x 1)))