Average Error: 0.0 → 0.0
Time: 657.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 r1237213 = x;
        double r1237214 = y;
        double r1237215 = r1237213 + r1237214;
        double r1237216 = z;
        double r1237217 = r1237215 + r1237216;
        return r1237217;
}

double f(double x, double y, double z) {
        double r1237218 = z;
        double r1237219 = y;
        double r1237220 = x;
        double r1237221 = r1237219 + r1237220;
        double r1237222 = r1237218 + r1237221;
        return r1237222;
}

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