Average Error: 0.0 → 0.0
Time: 506.0ms
Precision: 64
\[x \cdot y - x\]
↓
\[x \cdot y - x\]
x \cdot y - x
↓
x \cdot y - x
double f(double x, double y) {
        double r253664 = x;
        double r253665 = y;
        double r253666 = r253664 * r253665;
        double r253667 = r253666 - r253664;
        return r253667;
}
↓
double f(double x, double y) {
        double r253668 = x;
        double r253669 = y;
        double r253670 = r253668 * r253669;
        double r253671 = r253670 - r253668;
        return r253671;
}

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. Final simplification0.0

    \[\leadsto x \cdot y - x\]

Reproduce

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