Average Error: 0.0 → 0.0
Time: 17.3s
Precision: 64
\[\left(x + y\right) \cdot \left(1.0 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1.0 - z\right)\]
\left(x + y\right) \cdot \left(1.0 - z\right)
↓
\left(y + x\right) \cdot \left(1.0 - z\right)
double f(double x, double y, double z) {
        double r1367205 = x;
        double r1367206 = y;
        double r1367207 = r1367205 + r1367206;
        double r1367208 = 1.0;
        double r1367209 = z;
        double r1367210 = r1367208 - r1367209;
        double r1367211 = r1367207 * r1367210;
        return r1367211;
}
↓
double f(double x, double y, double z) {
        double r1367212 = y;
        double r1367213 = x;
        double r1367214 = r1367212 + r1367213;
        double r1367215 = 1.0;
        double r1367216 = z;
        double r1367217 = r1367215 - r1367216;
        double r1367218 = r1367214 * r1367217;
        return r1367218;
}

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.0 - z\right)\]

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(1.0 - z\right)\]

Reproduce

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