Average Error: 0.0 → 0.0
Time: 766.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 r342655 = x;
        double r342656 = 1.0;
        double r342657 = r342655 - r342656;
        double r342658 = r342655 * r342657;
        return r342658;
}

double f(double x) {
        double r342659 = x;
        double r342660 = 2.0;
        double r342661 = pow(r342659, r342660);
        double r342662 = 1.0;
        double r342663 = -r342662;
        double r342664 = r342659 * r342663;
        double r342665 = r342661 + r342664;
        return r342665;
}

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

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

  (* x (- x 1)))