Average Error: 0.0 → 0.0
Time: 14.7s
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 r50351 = x;
        double r50352 = y;
        double r50353 = r50351 + r50352;
        double r50354 = 1.0;
        double r50355 = z;
        double r50356 = r50354 - r50355;
        double r50357 = r50353 * r50356;
        return r50357;
}
↓
double f(double x, double y, double z) {
        double r50358 = x;
        double r50359 = y;
        double r50360 = r50358 + r50359;
        double r50361 = 1.0;
        double r50362 = z;
        double r50363 = r50361 - r50362;
        double r50364 = r50360 * r50363;
        return r50364;
}

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