Average Error: 0.0 → 0.0
Time: 14.9s
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 r2923249 = x;
        double r2923250 = y;
        double r2923251 = r2923249 + r2923250;
        double r2923252 = z;
        double r2923253 = 1.0;
        double r2923254 = r2923252 + r2923253;
        double r2923255 = r2923251 * r2923254;
        return r2923255;
}
↓
double f(double x, double y, double z) {
        double r2923256 = y;
        double r2923257 = x;
        double r2923258 = r2923256 + r2923257;
        double r2923259 = z;
        double r2923260 = 1.0;
        double r2923261 = r2923259 + r2923260;
        double r2923262 = r2923258 * r2923261;
        return r2923262;
}

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 2019164 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))