Average Error: 0.0 → 0.0
Time: 18.2s
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 r2996986 = x;
        double r2996987 = y;
        double r2996988 = r2996986 + r2996987;
        double r2996989 = 1.0;
        double r2996990 = z;
        double r2996991 = r2996989 - r2996990;
        double r2996992 = r2996988 * r2996991;
        return r2996992;
}
↓
double f(double x, double y, double z) {
        double r2996993 = y;
        double r2996994 = x;
        double r2996995 = r2996993 + r2996994;
        double r2996996 = 1.0;
        double r2996997 = z;
        double r2996998 = r2996996 - r2996997;
        double r2996999 = r2996995 * r2996998;
        return r2996999;
}

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