Average Error: 0.0 → 0.0
Time: 8.3s
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 r2361481 = x;
        double r2361482 = y;
        double r2361483 = r2361481 + r2361482;
        double r2361484 = z;
        double r2361485 = 1.0;
        double r2361486 = r2361484 + r2361485;
        double r2361487 = r2361483 * r2361486;
        return r2361487;
}
↓
double f(double x, double y, double z) {
        double r2361488 = y;
        double r2361489 = x;
        double r2361490 = r2361488 + r2361489;
        double r2361491 = z;
        double r2361492 = 1.0;
        double r2361493 = r2361491 + r2361492;
        double r2361494 = r2361490 * r2361493;
        return r2361494;
}

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