Average Error: 0.0 → 0.0
Time: 6.4s
Precision: 64
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot x + \left(-1\right) \cdot x\]
x \cdot \left(x - 1\right)
↓
x \cdot x + \left(-1\right) \cdot x
double f(double x) {
        double r344258 = x;
        double r344259 = 1.0;
        double r344260 = r344258 - r344259;
        double r344261 = r344258 * r344260;
        return r344261;
}
↓
double f(double x) {
        double r344262 = x;
        double r344263 = r344262 * r344262;
        double r344264 = 1.0;
        double r344265 = -r344264;
        double r344266 = r344265 * r344262;
        double r344267 = r344263 + r344266;
        return r344267;
}

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 x \cdot x + \color{blue}{\left(-1\right) \cdot x}\]

  6. Final simplification0.0

    \[\leadsto x \cdot x + \left(-1\right) \cdot x\]

Reproduce

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

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

  (* x (- x 1)))