Average Error: 0.0 → 0.0
Time: 5.5s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot 1 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r1251297 = x;
        double r1251298 = y;
        double r1251299 = r1251297 + r1251298;
        double r1251300 = z;
        double r1251301 = 1.0;
        double r1251302 = r1251300 + r1251301;
        double r1251303 = r1251299 * r1251302;
        return r1251303;
}
↓
double f(double x, double y, double z) {
        double r1251304 = x;
        double r1251305 = y;
        double r1251306 = r1251304 + r1251305;
        double r1251307 = 1.0;
        double r1251308 = r1251306 * r1251307;
        double r1251309 = z;
        double r1251310 = r1251306 * r1251309;
        double r1251311 = r1251308 + r1251310;
        return r1251311;
}

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. Using strategy rm

  3. Applied distribute-rgt-in0.0

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

  4. Final simplification0.0

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

Reproduce

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