Average Error: 0.0 → 0.0
Time: 3.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[z \cdot \left(x + y\right) + 1 \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
z \cdot \left(x + y\right) + 1 \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r30221 = x;
        double r30222 = y;
        double r30223 = r30221 + r30222;
        double r30224 = z;
        double r30225 = 1.0;
        double r30226 = r30224 + r30225;
        double r30227 = r30223 * r30226;
        return r30227;
}
↓
double f(double x, double y, double z) {
        double r30228 = z;
        double r30229 = x;
        double r30230 = y;
        double r30231 = r30229 + r30230;
        double r30232 = r30228 * r30231;
        double r30233 = 1.0;
        double r30234 = r30233 * r30231;
        double r30235 = r30232 + r30234;
        return r30235;
}

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

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

  4. Simplified0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

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