Average Error: 0.0 → 0.0
Time: 2.8s
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 r48684 = x;
        double r48685 = y;
        double r48686 = r48684 + r48685;
        double r48687 = 1.0;
        double r48688 = z;
        double r48689 = r48687 - r48688;
        double r48690 = r48686 * r48689;
        return r48690;
}
↓
double f(double x, double y, double z) {
        double r48691 = x;
        double r48692 = y;
        double r48693 = r48691 + r48692;
        double r48694 = 1.0;
        double r48695 = z;
        double r48696 = r48694 - r48695;
        double r48697 = r48693 * r48696;
        return r48697;
}

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