Average Error: 0.0 → 0.0
Time: 1.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 r27528 = x;
        double r27529 = y;
        double r27530 = r27528 + r27529;
        double r27531 = 1.0;
        double r27532 = z;
        double r27533 = r27531 - r27532;
        double r27534 = r27530 * r27533;
        return r27534;
}
↓
double f(double x, double y, double z) {
        double r27535 = x;
        double r27536 = y;
        double r27537 = r27535 + r27536;
        double r27538 = 1.0;
        double r27539 = z;
        double r27540 = r27538 - r27539;
        double r27541 = r27537 * r27540;
        return r27541;
}

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