Average Error: 0.0 → 0.0
Time: 9.6s
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 r625257 = x;
        double r625258 = y;
        double r625259 = r625257 + r625258;
        double r625260 = 1.0;
        double r625261 = z;
        double r625262 = r625260 - r625261;
        double r625263 = r625259 * r625262;
        return r625263;
}
↓
double f(double x, double y, double z) {
        double r625264 = y;
        double r625265 = x;
        double r625266 = r625264 + r625265;
        double r625267 = 1.0;
        double r625268 = z;
        double r625269 = r625267 - r625268;
        double r625270 = r625266 * r625269;
        return r625270;
}

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