Average Error: 0.0 → 0.0
Time: 968.0ms
Precision: 64
\[\left(x + y\right) + z\]
\[z + \left(y + x\right)\]
\left(x + y\right) + z
z + \left(y + x\right)
double f(double x, double y, double z) {
        double r1037211 = x;
        double r1037212 = y;
        double r1037213 = r1037211 + r1037212;
        double r1037214 = z;
        double r1037215 = r1037213 + r1037214;
        return r1037215;
}

double f(double x, double y, double z) {
        double r1037216 = z;
        double r1037217 = y;
        double r1037218 = x;
        double r1037219 = r1037217 + r1037218;
        double r1037220 = r1037216 + r1037219;
        return r1037220;
}

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) + z\]
  2. Final simplification0.0

    \[\leadsto z + \left(y + x\right)\]

Reproduce

herbie shell --seed 2019171 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))