Average Error: 0.0 → 0.0
Time: 4.8s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r1596250 = x;
        double r1596251 = y;
        double r1596252 = r1596250 + r1596251;
        double r1596253 = z;
        double r1596254 = 1.0;
        double r1596255 = r1596253 + r1596254;
        double r1596256 = r1596252 * r1596255;
        return r1596256;
}
↓
double f(double x, double y, double z) {
        double r1596257 = y;
        double r1596258 = x;
        double r1596259 = r1596257 + r1596258;
        double r1596260 = z;
        double r1596261 = 1.0;
        double r1596262 = r1596260 + r1596261;
        double r1596263 = r1596259 * r1596262;
        return r1596263;
}

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

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

Reproduce

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