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

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

Alternatives

Alternative 1
Error1.7
Cost904
\[\begin{array}{l} \mathbf{if}\;z + 1 \leq -248.73613724086334 \lor \neg \left(z + 1 \leq 1.0137052643239726\right):\\ \;\;\;\;\left(x + y\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array}\]
Alternative 2
Error12.3
Cost648
\[\begin{array}{l} \mathbf{if}\;z \leq -4.615500328805919 \cdot 10^{-06} \lor \neg \left(z \leq 42.97719920721273\right):\\ \;\;\;\;y + y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array}\]
Alternative 3
Error23.4
Cost192
\[x + y\]
Alternative 4
Error61.9
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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