Average Error: 0.0 → 0.0
Time: 9.2s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(y + x\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r1521268 = x;
        double r1521269 = y;
        double r1521270 = r1521268 + r1521269;
        double r1521271 = 1.0;
        double r1521272 = z;
        double r1521273 = r1521271 - r1521272;
        double r1521274 = r1521270 * r1521273;
        return r1521274;
}
↓
double f(double x, double y, double z) {
        double r1521275 = y;
        double r1521276 = x;
        double r1521277 = r1521275 + r1521276;
        double r1521278 = 1.0;
        double r1521279 = z;
        double r1521280 = r1521278 - r1521279;
        double r1521281 = r1521277 * r1521280;
        return r1521281;
}

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

  2. Final simplification0.0

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

Reproduce

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