Average Error: 0.0 → 0.0
Time: 4.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 r35873 = x;
        double r35874 = y;
        double r35875 = r35873 + r35874;
        double r35876 = 1.0;
        double r35877 = z;
        double r35878 = r35876 - r35877;
        double r35879 = r35875 * r35878;
        return r35879;
}
↓
double f(double x, double y, double z) {
        double r35880 = x;
        double r35881 = y;
        double r35882 = r35880 + r35881;
        double r35883 = 1.0;
        double r35884 = z;
        double r35885 = r35883 - r35884;
        double r35886 = r35882 * r35885;
        return r35886;
}

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