Average Error: 0.0 → 0.0
Time: 10.2s
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 r208401 = x;
        double r208402 = y;
        double r208403 = r208401 * r208402;
        double r208404 = r208403 - r208401;
        return r208404;
}
↓
double f(double x, double y) {
        double r208405 = x;
        double r208406 = y;
        double r208407 = r208405 * r208406;
        double r208408 = r208407 - r208405;
        return r208408;
}

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 2019325 
(FPCore (x y)
  :name "Data.Histogram.Bin.LogBinD:$cbinSizeN from histogram-fill-0.8.4.1"
  :precision binary64
  (- (* x y) x))