Average Error: 0.0 → 0.0
Time: 12.7s
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 r2790059 = x;
        double r2790060 = y;
        double r2790061 = r2790059 + r2790060;
        double r2790062 = 1.0;
        double r2790063 = z;
        double r2790064 = r2790062 - r2790063;
        double r2790065 = r2790061 * r2790064;
        return r2790065;
}
↓
double f(double x, double y, double z) {
        double r2790066 = y;
        double r2790067 = x;
        double r2790068 = r2790066 + r2790067;
        double r2790069 = 1.0;
        double r2790070 = z;
        double r2790071 = r2790069 - r2790070;
        double r2790072 = r2790068 * r2790071;
        return r2790072;
}

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