Average Error: 0.0 → 0.0
Time: 5.7s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r22880 = x;
        double r22881 = y;
        double r22882 = r22880 + r22881;
        double r22883 = 1.0;
        double r22884 = z;
        double r22885 = r22883 - r22884;
        double r22886 = r22882 * r22885;
        return r22886;
}
↓
double f(double x, double y, double z) {
        double r22887 = x;
        double r22888 = y;
        double r22889 = r22887 + r22888;
        double r22890 = 1.0;
        double r22891 = z;
        double r22892 = r22890 - r22891;
        double r22893 = r22889 * r22892;
        return r22893;
}

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(x + y\right) \cdot \left(1 - z\right)\]

Reproduce

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