Average Error: 0.0 → 0.0
Time: 21.6s
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 r34023 = x;
        double r34024 = y;
        double r34025 = r34023 + r34024;
        double r34026 = 1.0;
        double r34027 = z;
        double r34028 = r34026 - r34027;
        double r34029 = r34025 * r34028;
        return r34029;
}
↓
double f(double x, double y, double z) {
        double r34030 = x;
        double r34031 = y;
        double r34032 = r34030 + r34031;
        double r34033 = 1.0;
        double r34034 = z;
        double r34035 = r34033 - r34034;
        double r34036 = r34032 * r34035;
        return r34036;
}

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 2019199 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1.0 z)))