Average Error: 0.0 → 0.0
Time: 1.3s
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 r39921 = x;
        double r39922 = y;
        double r39923 = r39921 + r39922;
        double r39924 = z;
        double r39925 = r39923 + r39924;
        return r39925;
}
↓
double f(double x, double y, double z) {
        double r39926 = x;
        double r39927 = y;
        double r39928 = r39926 + r39927;
        double r39929 = z;
        double r39930 = r39928 + r39929;
        return r39930;
}

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