Average Error: 0.0 → 0.0
Time: 4.4s
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 r2091360 = x;
        double r2091361 = y;
        double r2091362 = r2091360 + r2091361;
        double r2091363 = z;
        double r2091364 = 1.0;
        double r2091365 = r2091363 + r2091364;
        double r2091366 = r2091362 * r2091365;
        return r2091366;
}
↓
double f(double x, double y, double z) {
        double r2091367 = x;
        double r2091368 = y;
        double r2091369 = r2091367 + r2091368;
        double r2091370 = 1.0;
        double r2091371 = r2091369 * r2091370;
        double r2091372 = z;
        double r2091373 = r2091369 * r2091372;
        double r2091374 = r2091371 + r2091373;
        return r2091374;
}

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