Average Error: 0.0 → 0.0
Time: 1.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 r29718 = x;
        double r29719 = y;
        double r29720 = r29718 + r29719;
        double r29721 = 1.0;
        double r29722 = z;
        double r29723 = r29721 - r29722;
        double r29724 = r29720 * r29723;
        return r29724;
}
↓
double f(double x, double y, double z) {
        double r29725 = x;
        double r29726 = y;
        double r29727 = r29725 + r29726;
        double r29728 = 1.0;
        double r29729 = z;
        double r29730 = r29728 - r29729;
        double r29731 = r29727 * r29730;
        return r29731;
}

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