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 r185 = x;
        double r186 = y;
        double r187 = r185 + r186;
        double r188 = 1.0;
        double r189 = z;
        double r190 = r188 - r189;
        double r191 = r187 * r190;
        return r191;
}
↓
double f(double x, double y, double z) {
        double r192 = x;
        double r193 = y;
        double r194 = r192 + r193;
        double r195 = 1.0;
        double r196 = z;
        double r197 = r195 - r196;
        double r198 = r194 * r197;
        return r198;
}

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