Average Error: 0.0 → 0.0
Time: 1.3s
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 r37191 = x;
        double r37192 = y;
        double r37193 = r37191 + r37192;
        double r37194 = 1.0;
        double r37195 = z;
        double r37196 = r37194 - r37195;
        double r37197 = r37193 * r37196;
        return r37197;
}
↓
double f(double x, double y, double z) {
        double r37198 = x;
        double r37199 = y;
        double r37200 = r37198 + r37199;
        double r37201 = 1.0;
        double r37202 = z;
        double r37203 = r37201 - r37202;
        double r37204 = r37200 * r37203;
        return r37204;
}

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 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1 z)))