Average Error: 0.0 → 0.0
Time: 16.5s
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 r2066477 = x;
        double r2066478 = y;
        double r2066479 = r2066477 + r2066478;
        double r2066480 = z;
        double r2066481 = 1.0;
        double r2066482 = r2066480 + r2066481;
        double r2066483 = r2066479 * r2066482;
        return r2066483;
}
↓
double f(double x, double y, double z) {
        double r2066484 = y;
        double r2066485 = x;
        double r2066486 = r2066484 + r2066485;
        double r2066487 = z;
        double r2066488 = 1.0;
        double r2066489 = r2066487 + r2066488;
        double r2066490 = r2066486 * r2066489;
        return r2066490;
}

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