Average Error: 0.0 → 0.0
Time: 14.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 r38034 = x;
        double r38035 = y;
        double r38036 = r38034 + r38035;
        double r38037 = 1.0;
        double r38038 = z;
        double r38039 = r38037 - r38038;
        double r38040 = r38036 * r38039;
        return r38040;
}
↓
double f(double x, double y, double z) {
        double r38041 = x;
        double r38042 = y;
        double r38043 = r38041 + r38042;
        double r38044 = 1.0;
        double r38045 = z;
        double r38046 = r38044 - r38045;
        double r38047 = r38043 * r38046;
        return r38047;
}

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