Average Error: 0.0 → 0.0
Time: 1.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 r1170024 = x;
        double r1170025 = y;
        double r1170026 = r1170024 + r1170025;
        double r1170027 = z;
        double r1170028 = r1170026 + r1170027;
        return r1170028;
}

double f(double x, double y, double z) {
        double r1170029 = z;
        double r1170030 = y;
        double r1170031 = x;
        double r1170032 = r1170030 + r1170031;
        double r1170033 = r1170029 + r1170032;
        return r1170033;
}

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