Average Error: 0.0 → 0.0
Time: 367.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 r37933 = x;
        double r37934 = y;
        double r37935 = r37933 + r37934;
        double r37936 = z;
        double r37937 = r37935 + r37936;
        return r37937;
}
↓
double f(double x, double y, double z) {
        double r37938 = x;
        double r37939 = y;
        double r37940 = r37938 + r37939;
        double r37941 = z;
        double r37942 = r37940 + r37941;
        return r37942;
}

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