Average Error: 0.0 → 0.0
Time: 10.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot z + \left(x + y\right) \cdot 1\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot z + \left(x + y\right) \cdot 1
double f(double x, double y, double z) {
        double r47163 = x;
        double r47164 = y;
        double r47165 = r47163 + r47164;
        double r47166 = z;
        double r47167 = 1.0;
        double r47168 = r47166 + r47167;
        double r47169 = r47165 * r47168;
        return r47169;
}
↓
double f(double x, double y, double z) {
        double r47170 = x;
        double r47171 = y;
        double r47172 = r47170 + r47171;
        double r47173 = z;
        double r47174 = r47172 * r47173;
        double r47175 = 1.0;
        double r47176 = r47172 * r47175;
        double r47177 = r47174 + r47176;
        return r47177;
}

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

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

Reproduce

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