Average Error: 0.0 → 0.0
Time: 7.1s
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 r1883519 = x;
        double r1883520 = y;
        double r1883521 = r1883519 + r1883520;
        double r1883522 = 1.0;
        double r1883523 = z;
        double r1883524 = r1883522 - r1883523;
        double r1883525 = r1883521 * r1883524;
        return r1883525;
}
↓
double f(double x, double y, double z) {
        double r1883526 = y;
        double r1883527 = x;
        double r1883528 = r1883526 + r1883527;
        double r1883529 = 1.0;
        double r1883530 = z;
        double r1883531 = r1883529 - r1883530;
        double r1883532 = r1883528 * r1883531;
        return r1883532;
}

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