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 r20631 = x;
        double r20632 = y;
        double r20633 = r20631 + r20632;
        double r20634 = 1.0;
        double r20635 = z;
        double r20636 = r20634 - r20635;
        double r20637 = r20633 * r20636;
        return r20637;
}
↓
double f(double x, double y, double z) {
        double r20638 = x;
        double r20639 = y;
        double r20640 = r20638 + r20639;
        double r20641 = 1.0;
        double r20642 = z;
        double r20643 = r20641 - r20642;
        double r20644 = r20640 * r20643;
        return r20644;
}

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