Average Error: 0.0 → 0.0
Time: 3.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 r24864 = x;
        double r24865 = y;
        double r24866 = r24864 + r24865;
        double r24867 = 1.0;
        double r24868 = z;
        double r24869 = r24867 - r24868;
        double r24870 = r24866 * r24869;
        return r24870;
}
↓
double f(double x, double y, double z) {
        double r24871 = x;
        double r24872 = y;
        double r24873 = r24871 + r24872;
        double r24874 = 1.0;
        double r24875 = z;
        double r24876 = r24874 - r24875;
        double r24877 = r24873 * r24876;
        return r24877;
}

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