Average Error: 0.0 → 0.0
Time: 14.2s
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 r39788 = x;
        double r39789 = y;
        double r39790 = r39788 + r39789;
        double r39791 = 1.0;
        double r39792 = z;
        double r39793 = r39791 - r39792;
        double r39794 = r39790 * r39793;
        return r39794;
}
↓
double f(double x, double y, double z) {
        double r39795 = x;
        double r39796 = y;
        double r39797 = r39795 + r39796;
        double r39798 = 1.0;
        double r39799 = z;
        double r39800 = r39798 - r39799;
        double r39801 = r39797 * r39800;
        return r39801;
}

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