Average Error: 0.0 → 0.0
Time: 6.4s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[z \cdot \left(x + y\right) + \left(x + y\right) \cdot 1\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
z \cdot \left(x + y\right) + \left(x + y\right) \cdot 1
double f(double x, double y, double z) {
        double r44553 = x;
        double r44554 = y;
        double r44555 = r44553 + r44554;
        double r44556 = z;
        double r44557 = 1.0;
        double r44558 = r44556 + r44557;
        double r44559 = r44555 * r44558;
        return r44559;
}
↓
double f(double x, double y, double z) {
        double r44560 = z;
        double r44561 = x;
        double r44562 = y;
        double r44563 = r44561 + r44562;
        double r44564 = r44560 * r44563;
        double r44565 = 1.0;
        double r44566 = r44563 * r44565;
        double r44567 = r44564 + r44566;
        return r44567;
}

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. Final simplification0.0

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

Reproduce

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