Average Error: 0.0 → 0.0
Time: 11.7s
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 r2243498 = x;
        double r2243499 = y;
        double r2243500 = r2243498 + r2243499;
        double r2243501 = z;
        double r2243502 = 1.0;
        double r2243503 = r2243501 + r2243502;
        double r2243504 = r2243500 * r2243503;
        return r2243504;
}
↓
double f(double x, double y, double z) {
        double r2243505 = y;
        double r2243506 = x;
        double r2243507 = r2243505 + r2243506;
        double r2243508 = z;
        double r2243509 = 1.0;
        double r2243510 = r2243508 + r2243509;
        double r2243511 = r2243507 * r2243510;
        return r2243511;
}

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