Average Error: 0.0 → 0.0
Time: 18.6s
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 r63474 = x;
        double r63475 = y;
        double r63476 = r63474 + r63475;
        double r63477 = 1.0;
        double r63478 = z;
        double r63479 = r63477 - r63478;
        double r63480 = r63476 * r63479;
        return r63480;
}
↓
double f(double x, double y, double z) {
        double r63481 = x;
        double r63482 = y;
        double r63483 = r63481 + r63482;
        double r63484 = 1.0;
        double r63485 = z;
        double r63486 = r63484 - r63485;
        double r63487 = r63483 * r63486;
        return r63487;
}

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