Average Error: 0.0 → 0.0
Time: 9.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 r43048 = x;
        double r43049 = y;
        double r43050 = r43048 + r43049;
        double r43051 = 1.0;
        double r43052 = z;
        double r43053 = r43051 - r43052;
        double r43054 = r43050 * r43053;
        return r43054;
}
↓
double f(double x, double y, double z) {
        double r43055 = x;
        double r43056 = y;
        double r43057 = r43055 + r43056;
        double r43058 = 1.0;
        double r43059 = z;
        double r43060 = r43058 - r43059;
        double r43061 = r43057 * r43060;
        return r43061;
}

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