Average Error: 0.0 → 0.0
Time: 2.1s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z) {
	return ((double) (((double) (x + y)) * ((double) (1.0 - z))));
}

↓
double code(double x, double y, double z) {
	return ((double) (((double) (((double) (x + y)) * 1.0)) - ((double) (((double) (x + y)) * 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 0.0
    \[\]
  2. Using strategy rm
  3. Applied sub-neg0.0
    \[\leadsto \]
  4. Applied distribute-lft-in0.0
    \[\leadsto \]
  5. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1.0 z)))