Average Error: 0.0 → 0.0
Time: 1.0s
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 r1147997 = x;
        double r1147998 = y;
        double r1147999 = r1147997 + r1147998;
        double r1148000 = z;
        double r1148001 = r1147999 + r1148000;
        return r1148001;
}

double f(double x, double y, double z) {
        double r1148002 = z;
        double r1148003 = y;
        double r1148004 = x;
        double r1148005 = r1148003 + r1148004;
        double r1148006 = r1148002 + r1148005;
        return r1148006;
}

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