Average Error: 0.0 → 0.0
Time: 10.7s
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 r13271 = x;
        double r13272 = y;
        double r13273 = r13271 + r13272;
        double r13274 = 1.0;
        double r13275 = z;
        double r13276 = r13274 - r13275;
        double r13277 = r13273 * r13276;
        return r13277;
}
↓
double f(double x, double y, double z) {
        double r13278 = x;
        double r13279 = y;
        double r13280 = r13278 + r13279;
        double r13281 = 1.0;
        double r13282 = z;
        double r13283 = r13281 - r13282;
        double r13284 = r13280 * r13283;
        return r13284;
}

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