Average Error: 0.0 → 0.0
Time: 2.2s
Precision: binary64
\[x + y \cdot \left(z + x\right)\]
↓
\[x + y \cdot \left(x + z\right)\]
x + y \cdot \left(z + x\right)
↓
x + y \cdot \left(x + z\right)
(FPCore (x y z) :precision binary64 (+ x (* y (+ z x))))
↓
(FPCore (x y z) :precision binary64 (+ x (* y (+ x z))))
double code(double x, double y, double z) {
	return ((double) (x + ((double) (y * ((double) (z + x))))));
}
↓
double code(double x, double y, double z) {
	return ((double) (x + ((double) (y * ((double) (x + z))))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program Error: 0.0 bits

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

  2. Final simplificationError: 0.0 bits

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

Reproduce

herbie shell --seed 2020204 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))