Average Error: 0.0 → 0.0
Time: 30.2s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(y + x\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r2176186 = x;
        double r2176187 = y;
        double r2176188 = r2176186 + r2176187;
        double r2176189 = 1.0;
        double r2176190 = z;
        double r2176191 = r2176189 - r2176190;
        double r2176192 = r2176188 * r2176191;
        return r2176192;
}
↓
double f(double x, double y, double z) {
        double r2176193 = y;
        double r2176194 = x;
        double r2176195 = r2176193 + r2176194;
        double r2176196 = 1.0;
        double r2176197 = z;
        double r2176198 = r2176196 - r2176197;
        double r2176199 = r2176195 * r2176198;
        return r2176199;
}

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

Reproduce

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