Average Error: 0.0 → 0.0
Time: 11.9s
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 r35342 = x;
        double r35343 = y;
        double r35344 = r35342 + r35343;
        double r35345 = 1.0;
        double r35346 = z;
        double r35347 = r35345 - r35346;
        double r35348 = r35344 * r35347;
        return r35348;
}
↓
double f(double x, double y, double z) {
        double r35349 = x;
        double r35350 = y;
        double r35351 = r35349 + r35350;
        double r35352 = 1.0;
        double r35353 = z;
        double r35354 = r35352 - r35353;
        double r35355 = r35351 * r35354;
        return r35355;
}

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 2019212 +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)))