Average Error: 0.0 → 0.0
Time: 15.5s
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 r37381 = x;
        double r37382 = y;
        double r37383 = r37381 + r37382;
        double r37384 = 1.0;
        double r37385 = z;
        double r37386 = r37384 - r37385;
        double r37387 = r37383 * r37386;
        return r37387;
}
↓
double f(double x, double y, double z) {
        double r37388 = x;
        double r37389 = y;
        double r37390 = r37388 + r37389;
        double r37391 = 1.0;
        double r37392 = z;
        double r37393 = r37391 - r37392;
        double r37394 = r37390 * r37393;
        return r37394;
}

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