Average Error: 0.0 → 0.0
Time: 396.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 r30912 = x;
        double r30913 = y;
        double r30914 = r30912 + r30913;
        double r30915 = z;
        double r30916 = r30914 + r30915;
        return r30916;
}
↓
double f(double x, double y, double z) {
        double r30917 = x;
        double r30918 = y;
        double r30919 = r30917 + r30918;
        double r30920 = z;
        double r30921 = r30919 + r30920;
        return r30921;
}

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