Average Error: 0.0 → 0.0
Time: 1.1s
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 r39757 = x;
        double r39758 = y;
        double r39759 = r39757 + r39758;
        double r39760 = 1.0;
        double r39761 = z;
        double r39762 = r39760 - r39761;
        double r39763 = r39759 * r39762;
        return r39763;
}
↓
double f(double x, double y, double z) {
        double r39764 = x;
        double r39765 = y;
        double r39766 = r39764 + r39765;
        double r39767 = 1.0;
        double r39768 = z;
        double r39769 = r39767 - r39768;
        double r39770 = r39766 * r39769;
        return r39770;
}

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 2020018 +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)))