Average Error: 0.0 → 0.0
Time: 15.1s
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 r46667 = x;
        double r46668 = y;
        double r46669 = r46667 + r46668;
        double r46670 = 1.0;
        double r46671 = z;
        double r46672 = r46670 - r46671;
        double r46673 = r46669 * r46672;
        return r46673;
}
↓
double f(double x, double y, double z) {
        double r46674 = x;
        double r46675 = y;
        double r46676 = r46674 + r46675;
        double r46677 = 1.0;
        double r46678 = z;
        double r46679 = r46677 - r46678;
        double r46680 = r46676 * r46679;
        return r46680;
}

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