Average Error: 0.0 → 0.0
Time: 2.3s
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 r40530 = x;
        double r40531 = y;
        double r40532 = r40530 + r40531;
        double r40533 = 1.0;
        double r40534 = z;
        double r40535 = r40533 - r40534;
        double r40536 = r40532 * r40535;
        return r40536;
}
↓
double f(double x, double y, double z) {
        double r40537 = x;
        double r40538 = y;
        double r40539 = r40537 + r40538;
        double r40540 = 1.0;
        double r40541 = z;
        double r40542 = r40540 - r40541;
        double r40543 = r40539 * r40542;
        return r40543;
}

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