Average Error: 0.0 → 0.0
Time: 799.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 r1166353 = x;
        double r1166354 = y;
        double r1166355 = r1166353 + r1166354;
        double r1166356 = z;
        double r1166357 = r1166355 + r1166356;
        return r1166357;
}

double f(double x, double y, double z) {
        double r1166358 = z;
        double r1166359 = y;
        double r1166360 = x;
        double r1166361 = r1166359 + r1166360;
        double r1166362 = r1166358 + r1166361;
        return r1166362;
}

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