Average Error: 0.0 → 0.0
Time: 6.8s
Precision: 64
\[x \cdot \left(x - 1.0\right)\]
\[x \cdot x + \left(-1.0\right) \cdot x\]
x \cdot \left(x - 1.0\right)
x \cdot x + \left(-1.0\right) \cdot x
double f(double x) {
        double r14035965 = x;
        double r14035966 = 1.0;
        double r14035967 = r14035965 - r14035966;
        double r14035968 = r14035965 * r14035967;
        return r14035968;
}

double f(double x) {
        double r14035969 = x;
        double r14035970 = r14035969 * r14035969;
        double r14035971 = 1.0;
        double r14035972 = -r14035971;
        double r14035973 = r14035972 * r14035969;
        double r14035974 = r14035970 + r14035973;
        return r14035974;
}

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.0\right)\]
  2. Using strategy rm
  3. Applied sub-neg0.0

    \[\leadsto x \cdot \color{blue}{\left(x + \left(-1.0\right)\right)}\]
  4. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{x \cdot x + \left(-1.0\right) \cdot x}\]
  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019168 +o rules:numerics
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"

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

  (* x (- x 1.0)))