Average Error: 0.0 → 0.0
Time: 2.4s
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 r26572 = x;
        double r26573 = y;
        double r26574 = r26572 + r26573;
        double r26575 = z;
        double r26576 = 1.0;
        double r26577 = r26575 + r26576;
        double r26578 = r26574 * r26577;
        return r26578;
}
↓
double f(double x, double y, double z) {
        double r26579 = z;
        double r26580 = x;
        double r26581 = y;
        double r26582 = r26580 + r26581;
        double r26583 = r26579 * r26582;
        double r26584 = 1.0;
        double r26585 = r26584 * r26582;
        double r26586 = r26583 + r26585;
        return r26586;
}

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