Average Error: 0.0 → 0.0
Time: 827.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 r40794 = x;
        double r40795 = y;
        double r40796 = r40794 + r40795;
        double r40797 = z;
        double r40798 = r40796 + r40797;
        return r40798;
}
↓
double f(double x, double y, double z) {
        double r40799 = x;
        double r40800 = y;
        double r40801 = r40799 + r40800;
        double r40802 = z;
        double r40803 = r40801 + r40802;
        return r40803;
}

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