Average Error: 0.0 → 0.0
Time: 12.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 r59572 = x;
        double r59573 = y;
        double r59574 = r59572 + r59573;
        double r59575 = 1.0;
        double r59576 = z;
        double r59577 = r59575 - r59576;
        double r59578 = r59574 * r59577;
        return r59578;
}
↓
double f(double x, double y, double z) {
        double r59579 = x;
        double r59580 = y;
        double r59581 = r59579 + r59580;
        double r59582 = 1.0;
        double r59583 = z;
        double r59584 = r59582 - r59583;
        double r59585 = r59581 * r59584;
        return r59585;
}

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