Average Error: 0.0 → 0.0
Time: 717.0ms
Precision: 64
\[x \cdot y - x\]
↓
\[x \cdot \left(y - 1\right)\]
x \cdot y - x
↓
x \cdot \left(y - 1\right)
double code(double x, double y) {
	return ((double) (((double) (x * y)) - x));
}
↓
double code(double x, double y) {
	return ((double) (x * ((double) (y - 1.0))));
}

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 *-un-lft-identity0.0

    \[\leadsto x \cdot y - \color{blue}{1 \cdot x}\]

  4. Applied *-commutative0.0

    \[\leadsto \color{blue}{y \cdot x} - 1 \cdot x\]

  5. Applied distribute-rgt-out--0.0

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

  6. Final simplification0.0

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

Reproduce

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