Average Error: 0.0 → 0.0
Time: 18.5s
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 r3021934 = x;
        double r3021935 = y;
        double r3021936 = r3021934 + r3021935;
        double r3021937 = 1.0;
        double r3021938 = z;
        double r3021939 = r3021937 - r3021938;
        double r3021940 = r3021936 * r3021939;
        return r3021940;
}
↓
double f(double x, double y, double z) {
        double r3021941 = y;
        double r3021942 = x;
        double r3021943 = r3021941 + r3021942;
        double r3021944 = 1.0;
        double r3021945 = z;
        double r3021946 = r3021944 - r3021945;
        double r3021947 = r3021943 * r3021946;
        return r3021947;
}

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)))