Average Error: 0.0 → 0.0
Time: 4.9s
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 r2274071 = x;
        double r2274072 = y;
        double r2274073 = r2274071 + r2274072;
        double r2274074 = z;
        double r2274075 = 1.0;
        double r2274076 = r2274074 + r2274075;
        double r2274077 = r2274073 * r2274076;
        return r2274077;
}
↓
double f(double x, double y, double z) {
        double r2274078 = x;
        double r2274079 = y;
        double r2274080 = r2274078 + r2274079;
        double r2274081 = 1.0;
        double r2274082 = r2274080 * r2274081;
        double r2274083 = z;
        double r2274084 = r2274080 * r2274083;
        double r2274085 = r2274082 + r2274084;
        return r2274085;
}

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)))