Average Error: 0.0 → 0.0
Time: 2.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 r50520 = x;
        double r50521 = y;
        double r50522 = r50520 + r50521;
        double r50523 = 1.0;
        double r50524 = z;
        double r50525 = r50523 - r50524;
        double r50526 = r50522 * r50525;
        return r50526;
}
↓
double f(double x, double y, double z) {
        double r50527 = x;
        double r50528 = y;
        double r50529 = r50527 + r50528;
        double r50530 = 1.0;
        double r50531 = z;
        double r50532 = r50530 - r50531;
        double r50533 = r50529 * r50532;
        return r50533;
}

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