Average Error: 0.0 → 0.0
Time: 4.2s
Precision: 64
\[x \cdot \left(x - 1.0\right)\]
↓
\[x \cdot x - x \cdot 1.0\]
x \cdot \left(x - 1.0\right)
↓
x \cdot x - x \cdot 1.0
double f(double x) {
        double r16951310 = x;
        double r16951311 = 1.0;
        double r16951312 = r16951310 - r16951311;
        double r16951313 = r16951310 * r16951312;
        return r16951313;
}
↓
double f(double x) {
        double r16951314 = x;
        double r16951315 = r16951314 * r16951314;
        double r16951316 = 1.0;
        double r16951317 = r16951314 * r16951316;
        double r16951318 = r16951315 - r16951317;
        return r16951318;
}

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. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{{x}^{2} - 1.0 \cdot x}\]

  3. Simplified0.0

    \[\leadsto \color{blue}{x \cdot x - x \cdot 1.0}\]

  4. Final simplification0.0

    \[\leadsto x \cdot x - x \cdot 1.0\]

Reproduce

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

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

  (* x (- x 1.0)))