Average Error: 0.0 → 0.0
Time: 10.9s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r2222164 = x;
        double r2222165 = y;
        double r2222166 = r2222164 + r2222165;
        double r2222167 = z;
        double r2222168 = 1.0;
        double r2222169 = r2222167 + r2222168;
        double r2222170 = r2222166 * r2222169;
        return r2222170;
}
↓
double f(double x, double y, double z) {
        double r2222171 = x;
        double r2222172 = y;
        double r2222173 = r2222171 + r2222172;
        double r2222174 = 1.0;
        double r2222175 = r2222173 * r2222174;
        double r2222176 = z;
        double r2222177 = r2222173 * r2222176;
        double r2222178 = r2222175 + r2222177;
        return r2222178;
}

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.0\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019163 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))