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 r43026 = x;
        double r43027 = y;
        double r43028 = r43026 + r43027;
        double r43029 = 1.0;
        double r43030 = z;
        double r43031 = r43029 - r43030;
        double r43032 = r43028 * r43031;
        return r43032;
}
↓
double f(double x, double y, double z) {
        double r43033 = x;
        double r43034 = y;
        double r43035 = r43033 + r43034;
        double r43036 = 1.0;
        double r43037 = z;
        double r43038 = r43036 - r43037;
        double r43039 = r43035 * r43038;
        return r43039;
}

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