Average Error: 0.0 → 0.0
Time: 2.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 r53288 = x;
        double r53289 = y;
        double r53290 = r53288 + r53289;
        double r53291 = z;
        double r53292 = 1.0;
        double r53293 = r53291 + r53292;
        double r53294 = r53290 * r53293;
        return r53294;
}
↓
double f(double x, double y, double z) {
        double r53295 = z;
        double r53296 = x;
        double r53297 = y;
        double r53298 = r53296 + r53297;
        double r53299 = r53295 * r53298;
        double r53300 = 1.0;
        double r53301 = r53300 * r53298;
        double r53302 = r53299 + r53301;
        return r53302;
}

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 2019353 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))