Average Error: 0.0 → 0.0
Time: 16.1s
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 r3096096 = x;
        double r3096097 = y;
        double r3096098 = r3096096 + r3096097;
        double r3096099 = 1.0;
        double r3096100 = z;
        double r3096101 = r3096099 - r3096100;
        double r3096102 = r3096098 * r3096101;
        return r3096102;
}
↓
double f(double x, double y, double z) {
        double r3096103 = y;
        double r3096104 = x;
        double r3096105 = r3096103 + r3096104;
        double r3096106 = 1.0;
        double r3096107 = z;
        double r3096108 = r3096106 - r3096107;
        double r3096109 = r3096105 * r3096108;
        return r3096109;
}

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