Average Error: 0.0 → 0.0
Time: 3.1s
Precision: 64
\[\left(x + y\right) + z\]
↓
\[\left(x + y\right) + z\]
\left(x + y\right) + z
↓
\left(x + y\right) + z
double f(double x, double y, double z) {
        double r6285146 = x;
        double r6285147 = y;
        double r6285148 = r6285146 + r6285147;
        double r6285149 = z;
        double r6285150 = r6285148 + r6285149;
        return r6285150;
}
↓
double f(double x, double y, double z) {
        double r6285151 = x;
        double r6285152 = y;
        double r6285153 = r6285151 + r6285152;
        double r6285154 = z;
        double r6285155 = r6285153 + r6285154;
        return r6285155;
}

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 \left(x + y\right) + z\]

Reproduce

herbie shell --seed 2019173 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))