Average Error: 0.0 → 0.0
Time: 1.1s
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 r41980 = x;
        double r41981 = y;
        double r41982 = r41980 + r41981;
        double r41983 = 1.0;
        double r41984 = z;
        double r41985 = r41983 - r41984;
        double r41986 = r41982 * r41985;
        return r41986;
}
↓
double f(double x, double y, double z) {
        double r41987 = x;
        double r41988 = y;
        double r41989 = r41987 + r41988;
        double r41990 = 1.0;
        double r41991 = z;
        double r41992 = r41990 - r41991;
        double r41993 = r41989 * r41992;
        return r41993;
}

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