Average Error: 0.0 → 0.0
Time: 7.0s
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 r43391 = x;
        double r43392 = y;
        double r43393 = r43391 + r43392;
        double r43394 = z;
        double r43395 = 1.0;
        double r43396 = r43394 + r43395;
        double r43397 = r43393 * r43396;
        return r43397;
}
↓
double f(double x, double y, double z) {
        double r43398 = y;
        double r43399 = x;
        double r43400 = r43398 + r43399;
        double r43401 = z;
        double r43402 = 1.0;
        double r43403 = r43401 + r43402;
        double r43404 = r43400 * r43403;
        return r43404;
}

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