Average Error: 0.0 → 0.0
Time: 7.8s
Precision: 64
\[x \cdot y - x\]
↓
\[x \cdot \left(y - 1\right)\]
x \cdot y - x
↓
x \cdot \left(y - 1\right)
double f(double x, double y) {
        double r207305 = x;
        double r207306 = y;
        double r207307 = r207305 * r207306;
        double r207308 = r207307 - r207305;
        return r207308;
}
↓
double f(double x, double y) {
        double r207309 = x;
        double r207310 = y;
        double r207311 = 1.0;
        double r207312 = r207310 - r207311;
        double r207313 = r207309 * r207312;
        return r207313;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y - x\]
  2. Using strategy rm

  3. Applied flip--28.1

    \[\leadsto \color{blue}{\frac{\left(x \cdot y\right) \cdot \left(x \cdot y\right) - x \cdot x}{x \cdot y + x}}\]

  4. Simplified30.4

    \[\leadsto \frac{\color{blue}{x \cdot \left(y \cdot \left(x \cdot y\right) - x\right)}}{x \cdot y + x}\]
  5. Using strategy rm

  6. Applied *-un-lft-identity30.4

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

  7. Applied times-frac9.0

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

  8. Simplified9.0

    \[\leadsto \color{blue}{x} \cdot \frac{y \cdot \left(x \cdot y\right) - x}{x \cdot y + x}\]

  9. Taylor expanded around 0 0.0

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

  10. Final simplification0.0

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

Reproduce

herbie shell --seed 2019209 
(FPCore (x y)
  :name "Data.Histogram.Bin.LogBinD:$cbinSizeN from histogram-fill-0.8.4.1"
  :precision binary64
  (- (* x y) x))