Average Error: 0.0 → 0.0
Time: 1.4s
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 r32231 = x;
        double r32232 = y;
        double r32233 = r32231 + r32232;
        double r32234 = 1.0;
        double r32235 = z;
        double r32236 = r32234 - r32235;
        double r32237 = r32233 * r32236;
        return r32237;
}
↓
double f(double x, double y, double z) {
        double r32238 = x;
        double r32239 = y;
        double r32240 = r32238 + r32239;
        double r32241 = 1.0;
        double r32242 = z;
        double r32243 = r32241 - r32242;
        double r32244 = r32240 * r32243;
        return r32244;
}

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