Average Error: 0.0 → 0.0
Time: 7.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 r44161 = x;
        double r44162 = y;
        double r44163 = r44161 + r44162;
        double r44164 = 1.0;
        double r44165 = z;
        double r44166 = r44164 - r44165;
        double r44167 = r44163 * r44166;
        return r44167;
}
↓
double f(double x, double y, double z) {
        double r44168 = x;
        double r44169 = y;
        double r44170 = r44168 + r44169;
        double r44171 = 1.0;
        double r44172 = z;
        double r44173 = r44171 - r44172;
        double r44174 = r44170 * r44173;
        return r44174;
}

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