Average Error: 0.0 → 0.0
Time: 12.1s
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 r40104 = x;
        double r40105 = y;
        double r40106 = r40104 + r40105;
        double r40107 = 1.0;
        double r40108 = z;
        double r40109 = r40107 - r40108;
        double r40110 = r40106 * r40109;
        return r40110;
}
↓
double f(double x, double y, double z) {
        double r40111 = x;
        double r40112 = y;
        double r40113 = r40111 + r40112;
        double r40114 = 1.0;
        double r40115 = z;
        double r40116 = r40114 - r40115;
        double r40117 = r40113 * r40116;
        return r40117;
}

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 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1 z)))