Average Error: 0.0 → 0.0
Time: 480.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 r28324 = x;
        double r28325 = y;
        double r28326 = r28324 + r28325;
        double r28327 = z;
        double r28328 = r28326 + r28327;
        return r28328;
}
↓
double f(double x, double y, double z) {
        double r28329 = x;
        double r28330 = y;
        double r28331 = r28329 + r28330;
        double r28332 = z;
        double r28333 = r28331 + r28332;
        return r28333;
}

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