Average Error: 0.0 → 0.0
Time: 16.6s
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 r56235 = x;
        double r56236 = y;
        double r56237 = r56235 + r56236;
        double r56238 = 1.0;
        double r56239 = z;
        double r56240 = r56238 - r56239;
        double r56241 = r56237 * r56240;
        return r56241;
}
↓
double f(double x, double y, double z) {
        double r56242 = x;
        double r56243 = y;
        double r56244 = r56242 + r56243;
        double r56245 = 1.0;
        double r56246 = z;
        double r56247 = r56245 - r56246;
        double r56248 = r56244 * r56247;
        return r56248;
}

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