Average Error: 0.0 → 0.0
Time: 2.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 r66584 = x;
        double r66585 = y;
        double r66586 = r66584 + r66585;
        double r66587 = 1.0;
        double r66588 = z;
        double r66589 = r66587 - r66588;
        double r66590 = r66586 * r66589;
        return r66590;
}
↓
double f(double x, double y, double z) {
        double r66591 = x;
        double r66592 = y;
        double r66593 = r66591 + r66592;
        double r66594 = 1.0;
        double r66595 = z;
        double r66596 = r66594 - r66595;
        double r66597 = r66593 * r66596;
        return r66597;
}

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