Average Error: 0.0 → 0.0
Time: 12.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1.0 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1.0 - z\right)\]
\left(x + y\right) \cdot \left(1.0 - z\right)
↓
\left(y + x\right) \cdot \left(1.0 - z\right)
double f(double x, double y, double z) {
        double r2274244 = x;
        double r2274245 = y;
        double r2274246 = r2274244 + r2274245;
        double r2274247 = 1.0;
        double r2274248 = z;
        double r2274249 = r2274247 - r2274248;
        double r2274250 = r2274246 * r2274249;
        return r2274250;
}
↓
double f(double x, double y, double z) {
        double r2274251 = y;
        double r2274252 = x;
        double r2274253 = r2274251 + r2274252;
        double r2274254 = 1.0;
        double r2274255 = z;
        double r2274256 = r2274254 - r2274255;
        double r2274257 = r2274253 * r2274256;
        return r2274257;
}

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(1.0 - z\right)\]

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(1.0 - z\right)\]

Reproduce

herbie shell --seed 2019164 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1.0 z)))