Average Error: 0.0 → 0.0
Time: 459.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 r19011 = x;
        double r19012 = y;
        double r19013 = r19011 + r19012;
        double r19014 = z;
        double r19015 = r19013 + r19014;
        return r19015;
}
↓
double f(double x, double y, double z) {
        double r19016 = x;
        double r19017 = y;
        double r19018 = r19016 + r19017;
        double r19019 = z;
        double r19020 = r19018 + r19019;
        return r19020;
}

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