Average Error: 0.0 → 0.0
Time: 774.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 r1561916 = x;
        double r1561917 = y;
        double r1561918 = r1561916 + r1561917;
        double r1561919 = z;
        double r1561920 = r1561918 + r1561919;
        return r1561920;
}

double f(double x, double y, double z) {
        double r1561921 = z;
        double r1561922 = y;
        double r1561923 = x;
        double r1561924 = r1561922 + r1561923;
        double r1561925 = r1561921 + r1561924;
        return r1561925;
}

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