Average Error: 0.0 → 0.0
Time: 1.8s
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 r38181 = x;
        double r38182 = y;
        double r38183 = r38181 + r38182;
        double r38184 = 1.0;
        double r38185 = z;
        double r38186 = r38184 - r38185;
        double r38187 = r38183 * r38186;
        return r38187;
}
↓
double f(double x, double y, double z) {
        double r38188 = x;
        double r38189 = y;
        double r38190 = r38188 + r38189;
        double r38191 = 1.0;
        double r38192 = z;
        double r38193 = r38191 - r38192;
        double r38194 = r38190 * r38193;
        return r38194;
}

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