Average Error: 0.0 → 0.0
Time: 13.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot 1.0 + \left(y + x\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot 1.0 + \left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r2984971 = x;
        double r2984972 = y;
        double r2984973 = r2984971 + r2984972;
        double r2984974 = z;
        double r2984975 = 1.0;
        double r2984976 = r2984974 + r2984975;
        double r2984977 = r2984973 * r2984976;
        return r2984977;
}
↓
double f(double x, double y, double z) {
        double r2984978 = y;
        double r2984979 = x;
        double r2984980 = r2984978 + r2984979;
        double r2984981 = 1.0;
        double r2984982 = r2984980 * r2984981;
        double r2984983 = z;
        double r2984984 = r2984980 * r2984983;
        double r2984985 = r2984982 + r2984984;
        return r2984985;
}

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-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

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