Average Error: 0.0 → 0.0
Time: 9.3s
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 r1190989 = x;
        double r1190990 = y;
        double r1190991 = r1190989 + r1190990;
        double r1190992 = 1.0;
        double r1190993 = z;
        double r1190994 = r1190992 - r1190993;
        double r1190995 = r1190991 * r1190994;
        return r1190995;
}
↓
double f(double x, double y, double z) {
        double r1190996 = y;
        double r1190997 = x;
        double r1190998 = r1190996 + r1190997;
        double r1190999 = 1.0;
        double r1191000 = z;
        double r1191001 = r1190999 - r1191000;
        double r1191002 = r1190998 * r1191001;
        return r1191002;
}

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