Average Error: 0.0 → 0.0
Time: 596.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 r252852 = x;
        double r252853 = 1.0;
        double r252854 = r252852 - r252853;
        double r252855 = r252852 * r252854;
        return r252855;
}
↓
double f(double x) {
        double r252856 = x;
        double r252857 = 2.0;
        double r252858 = pow(r252856, r252857);
        double r252859 = 1.0;
        double r252860 = -r252859;
        double r252861 = r252856 * r252860;
        double r252862 = r252858 + r252861;
        return r252862;
}

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 2020036 +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)))