Average Error: 0.0 → 0.0
Time: 14.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1.0\right)\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot \left(z + 1.0\right)
double f(double x, double y, double z) {
        double r2962915 = x;
        double r2962916 = y;
        double r2962917 = r2962915 + r2962916;
        double r2962918 = z;
        double r2962919 = 1.0;
        double r2962920 = r2962918 + r2962919;
        double r2962921 = r2962917 * r2962920;
        return r2962921;
}
↓
double f(double x, double y, double z) {
        double r2962922 = y;
        double r2962923 = x;
        double r2962924 = r2962922 + r2962923;
        double r2962925 = z;
        double r2962926 = 1.0;
        double r2962927 = r2962925 + r2962926;
        double r2962928 = r2962924 * r2962927;
        return r2962928;
}

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

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

Reproduce

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