Average Error: 0.0 → 0.0
Time: 4.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r706197 = x;
        double r706198 = y;
        double r706199 = r706197 + r706198;
        double r706200 = z;
        double r706201 = 1.0;
        double r706202 = r706200 + r706201;
        double r706203 = r706199 * r706202;
        return r706203;
}
↓
double f(double x, double y, double z) {
        double r706204 = x;
        double r706205 = y;
        double r706206 = r706204 + r706205;
        double r706207 = 1.0;
        double r706208 = r706206 * r706207;
        double r706209 = z;
        double r706210 = r706206 * r706209;
        double r706211 = r706208 + r706210;
        return r706211;
}

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.0\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{z \cdot \left(x + y\right) + 1.0 \cdot \left(x + y\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2019156 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))