Average Error: 0.0 → 0.0
Time: 5.3s
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 r1612492 = x;
        double r1612493 = y;
        double r1612494 = r1612492 + r1612493;
        double r1612495 = z;
        double r1612496 = r1612494 + r1612495;
        return r1612496;
}

double f(double x, double y, double z) {
        double r1612497 = z;
        double r1612498 = y;
        double r1612499 = x;
        double r1612500 = r1612498 + r1612499;
        double r1612501 = r1612497 + r1612500;
        return r1612501;
}

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