Average Error: 0.0 → 0.0
Time: 750.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 r405120 = x;
        double r405121 = 1.0;
        double r405122 = r405120 - r405121;
        double r405123 = r405120 * r405122;
        return r405123;
}
↓
double f(double x) {
        double r405124 = x;
        double r405125 = 2.0;
        double r405126 = pow(r405124, r405125);
        double r405127 = 1.0;
        double r405128 = -r405127;
        double r405129 = r405124 * r405128;
        double r405130 = r405126 + r405129;
        return r405130;
}

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 2020089 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

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

  (* x (- x 1)))