Average Error: 0.0 → 0.0
Time: 755.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 r1487153 = x;
        double r1487154 = y;
        double r1487155 = r1487153 + r1487154;
        double r1487156 = z;
        double r1487157 = r1487155 + r1487156;
        return r1487157;
}

double f(double x, double y, double z) {
        double r1487158 = z;
        double r1487159 = y;
        double r1487160 = x;
        double r1487161 = r1487159 + r1487160;
        double r1487162 = r1487158 + r1487161;
        return r1487162;
}

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))