Average Error: 0.0 → 0.0
Time: 3.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 r30518 = x;
        double r30519 = y;
        double r30520 = r30518 + r30519;
        double r30521 = 1.0;
        double r30522 = z;
        double r30523 = r30521 - r30522;
        double r30524 = r30520 * r30523;
        return r30524;
}
↓
double f(double x, double y, double z) {
        double r30525 = x;
        double r30526 = y;
        double r30527 = r30525 + r30526;
        double r30528 = 1.0;
        double r30529 = z;
        double r30530 = r30528 - r30529;
        double r30531 = r30527 * r30530;
        return r30531;
}

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