Average Error: 0.0 → 0.0
Time: 767.0ms
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 r160 = x;
        double r161 = y;
        double r162 = r160 + r161;
        double r163 = z;
        double r164 = r162 + r163;
        return r164;
}
↓
double f(double x, double y, double z) {
        double r165 = x;
        double r166 = y;
        double r167 = r165 + r166;
        double r168 = z;
        double r169 = r167 + r168;
        return r169;
}

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