Average Error: 0.0 → 0.0
Time: 2.1s
Precision: binary64
\[\left(x + y\right) \cdot \left(z + 1\right) \]
↓
\[\left(y + x\right) + z \cdot \left(y + x\right) \]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) + z \cdot \left(y + x\right)

(FPCore (x y z) :precision binary64 (* (+ x y) (+ z 1.0)))
↓
(FPCore (x y z) :precision binary64 (+ (+ y x) (* z (+ y x))))
double code(double x, double y, double z) {
	return (x + y) * (z + 1.0);
}
↓
double code(double x, double y, double z) {
	return (y + x) + (z * (y + x));
}

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(z + 1\right) \]

  2. Applied distribute-rgt-in_binary640.0

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

  3. Simplified0.0

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

  4. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

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