Average Error: 0.0 → 0.0
Time: 10.2s
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 r2184521 = x;
        double r2184522 = y;
        double r2184523 = r2184521 + r2184522;
        double r2184524 = z;
        double r2184525 = 1.0;
        double r2184526 = r2184524 + r2184525;
        double r2184527 = r2184523 * r2184526;
        return r2184527;
}
↓
double f(double x, double y, double z) {
        double r2184528 = y;
        double r2184529 = x;
        double r2184530 = r2184528 + r2184529;
        double r2184531 = z;
        double r2184532 = 1.0;
        double r2184533 = r2184531 + r2184532;
        double r2184534 = r2184530 * r2184533;
        return r2184534;
}

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