Average Error: 0.0 → 0.0
Time: 5.4s
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 r2006541 = x;
        double r2006542 = y;
        double r2006543 = r2006541 + r2006542;
        double r2006544 = z;
        double r2006545 = 1.0;
        double r2006546 = r2006544 + r2006545;
        double r2006547 = r2006543 * r2006546;
        return r2006547;
}
↓
double f(double x, double y, double z) {
        double r2006548 = y;
        double r2006549 = x;
        double r2006550 = r2006548 + r2006549;
        double r2006551 = z;
        double r2006552 = 1.0;
        double r2006553 = r2006551 + r2006552;
        double r2006554 = r2006550 * r2006553;
        return r2006554;
}

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