Average Error: 0.0 → 0.0
Time: 7.0s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[{x}^{2} + \left(-1\right) \cdot x\]
x \cdot \left(x - 1\right)
↓
{x}^{2} + \left(-1\right) \cdot x
double f(double x) {
        double r367131 = x;
        double r367132 = 1.0;
        double r367133 = r367131 - r367132;
        double r367134 = r367131 * r367133;
        return r367134;
}
↓
double f(double x) {
        double r367135 = x;
        double r367136 = 2.0;
        double r367137 = pow(r367135, r367136);
        double r367138 = 1.0;
        double r367139 = -r367138;
        double r367140 = r367139 * r367135;
        double r367141 = r367137 + r367140;
        return r367141;
}

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

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

  7. Final simplification0.0

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

Reproduce

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

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

  (* x (- x 1)))