Average Error: 0.0 → 0.0
Time: 366.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 r26331 = x;
        double r26332 = y;
        double r26333 = r26331 + r26332;
        double r26334 = z;
        double r26335 = r26333 + r26334;
        return r26335;
}
↓
double f(double x, double y, double z) {
        double r26336 = x;
        double r26337 = y;
        double r26338 = r26336 + r26337;
        double r26339 = z;
        double r26340 = r26338 + r26339;
        return r26340;
}

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