Average Error: 0.0 → 0.0
Time: 8.7s
Precision: 64
\[x \cdot \left(x - 1\right)\]
\[x \cdot x - x \cdot 1\]
x \cdot \left(x - 1\right)
x \cdot x - x \cdot 1
double f(double x) {
        double r19042845 = x;
        double r19042846 = 1.0;
        double r19042847 = r19042845 - r19042846;
        double r19042848 = r19042845 * r19042847;
        return r19042848;
}

double f(double x) {
        double r19042849 = x;
        double r19042850 = r19042849 * r19042849;
        double r19042851 = 1.0;
        double r19042852 = r19042849 * r19042851;
        double r19042853 = r19042850 - r19042852;
        return r19042853;
}

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

    \[\leadsto \color{blue}{{x}^{2} - 1 \cdot x}\]
  3. Simplified0.0

    \[\leadsto \color{blue}{x \cdot x - x \cdot 1}\]
  4. Final simplification0.0

    \[\leadsto x \cdot x - x \cdot 1\]

Reproduce

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

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

  (* x (- x 1.0)))