Average Error: 0.0 → 0.0
Time: 4.0s
Precision: binary64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) - \left(x \cdot z + y \cdot z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) - \left(x \cdot z + y \cdot z\right)
(FPCore (x y z) :precision binary64 (* (+ x y) (- 1.0 z)))
↓
(FPCore (x y z) :precision binary64 (- (+ x y) (+ (* x z) (* y z))))
double code(double x, double y, double z) {
	return (x + y) * (1.0 - z);
}
↓
double code(double x, double y, double z) {
	return (x + y) - ((x * z) + (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

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

  2. Taylor expanded around 0 0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2021044 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1.0 z)))