Average Error: 0.0 → 0.0
Time: 44.6s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(1 - z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 - z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r2021314 = x;
        double r2021315 = y;
        double r2021316 = r2021314 + r2021315;
        double r2021317 = 1.0;
        double r2021318 = z;
        double r2021319 = r2021317 - r2021318;
        double r2021320 = r2021316 * r2021319;
        return r2021320;
}
↓
double f(double x, double y, double z) {
        double r2021321 = 1.0;
        double r2021322 = z;
        double r2021323 = r2021321 - r2021322;
        double r2021324 = x;
        double r2021325 = y;
        double r2021326 = r2021324 + r2021325;
        double r2021327 = r2021323 * r2021326;
        return r2021327;
}

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(1 - z\right) \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1.0 z)))