Average Error: 0.0 → 0.0
Time: 5.6s
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 r1717509 = x;
        double r1717510 = y;
        double r1717511 = r1717509 + r1717510;
        double r1717512 = z;
        double r1717513 = 1.0;
        double r1717514 = r1717512 + r1717513;
        double r1717515 = r1717511 * r1717514;
        return r1717515;
}
↓
double f(double x, double y, double z) {
        double r1717516 = x;
        double r1717517 = y;
        double r1717518 = r1717516 + r1717517;
        double r1717519 = 1.0;
        double r1717520 = r1717518 * r1717519;
        double r1717521 = z;
        double r1717522 = r1717518 * r1717521;
        double r1717523 = r1717520 + r1717522;
        return r1717523;
}

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