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

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

    \[\left(1 + x\right) + x \cdot y\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020153 
(FPCore (x y)
  :name "(+ (+ 1 x) (* x y))"
  :precision binary64
  (+ (+ 1.0 x) (* x y)))