Average Error: 0.0 → 0.0
Time: 10.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 r1219704 = x;
        double r1219705 = y;
        double r1219706 = r1219704 + r1219705;
        double r1219707 = 1.0;
        double r1219708 = z;
        double r1219709 = r1219707 - r1219708;
        double r1219710 = r1219706 * r1219709;
        return r1219710;
}
↓
double f(double x, double y, double z) {
        double r1219711 = y;
        double r1219712 = x;
        double r1219713 = r1219711 + r1219712;
        double r1219714 = 1.0;
        double r1219715 = z;
        double r1219716 = r1219714 - r1219715;
        double r1219717 = r1219713 * r1219716;
        return r1219717;
}

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