Average Error: 0.0 → 0.0
Time: 4.0s
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 r49673 = x;
        double r49674 = y;
        double r49675 = r49673 + r49674;
        double r49676 = 1.0;
        double r49677 = z;
        double r49678 = r49676 - r49677;
        double r49679 = r49675 * r49678;
        return r49679;
}
↓
double f(double x, double y, double z) {
        double r49680 = x;
        double r49681 = y;
        double r49682 = r49680 + r49681;
        double r49683 = 1.0;
        double r49684 = z;
        double r49685 = r49683 - r49684;
        double r49686 = r49682 * r49685;
        return r49686;
}

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