Average Error: 0.0 → 0.0
Time: 16.6s
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 r46897 = x;
        double r46898 = y;
        double r46899 = r46897 + r46898;
        double r46900 = 1.0;
        double r46901 = z;
        double r46902 = r46900 - r46901;
        double r46903 = r46899 * r46902;
        return r46903;
}
↓
double f(double x, double y, double z) {
        double r46904 = x;
        double r46905 = y;
        double r46906 = r46904 + r46905;
        double r46907 = 1.0;
        double r46908 = z;
        double r46909 = r46907 - r46908;
        double r46910 = r46906 * r46909;
        return r46910;
}

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