Average Error: 0.0 → 0.0
Time: 10.3s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot 1.0 + \left(y + x\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot 1.0 + \left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r1242278 = x;
        double r1242279 = y;
        double r1242280 = r1242278 + r1242279;
        double r1242281 = z;
        double r1242282 = 1.0;
        double r1242283 = r1242281 + r1242282;
        double r1242284 = r1242280 * r1242283;
        return r1242284;
}
↓
double f(double x, double y, double z) {
        double r1242285 = y;
        double r1242286 = x;
        double r1242287 = r1242285 + r1242286;
        double r1242288 = 1.0;
        double r1242289 = r1242287 * r1242288;
        double r1242290 = z;
        double r1242291 = r1242287 * r1242290;
        double r1242292 = r1242289 + r1242291;
        return r1242292;
}

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-lft-in0.0

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

  4. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot 1.0 + \left(y + x\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)))