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 r33635 = x;
        double r33636 = y;
        double r33637 = r33635 + r33636;
        double r33638 = 1.0;
        double r33639 = z;
        double r33640 = r33638 - r33639;
        double r33641 = r33637 * r33640;
        return r33641;
}
↓
double f(double x, double y, double z) {
        double r33642 = x;
        double r33643 = y;
        double r33644 = r33642 + r33643;
        double r33645 = 1.0;
        double r33646 = z;
        double r33647 = r33645 - r33646;
        double r33648 = r33644 * r33647;
        return r33648;
}

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