Average Error: 0.0 → 0.0
Time: 1.4s
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 r38302 = x;
        double r38303 = y;
        double r38304 = r38302 + r38303;
        double r38305 = 1.0;
        double r38306 = z;
        double r38307 = r38305 - r38306;
        double r38308 = r38304 * r38307;
        return r38308;
}
↓
double f(double x, double y, double z) {
        double r38309 = x;
        double r38310 = y;
        double r38311 = r38309 + r38310;
        double r38312 = 1.0;
        double r38313 = z;
        double r38314 = r38312 - r38313;
        double r38315 = r38311 * r38314;
        return r38315;
}

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