Average Error: 0.0 → 0.0
Time: 10.7s
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 r35890 = x;
        double r35891 = y;
        double r35892 = r35890 + r35891;
        double r35893 = z;
        double r35894 = 1.0;
        double r35895 = r35893 + r35894;
        double r35896 = r35892 * r35895;
        return r35896;
}
↓
double f(double x, double y, double z) {
        double r35897 = x;
        double r35898 = y;
        double r35899 = r35897 + r35898;
        double r35900 = z;
        double r35901 = r35899 * r35900;
        double r35902 = 1.0;
        double r35903 = r35899 * r35902;
        double r35904 = r35901 + r35903;
        return r35904;
}

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