Average Error: 0.0 → 0.0
Time: 3.8s
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 r24970 = x;
        double r24971 = y;
        double r24972 = r24970 + r24971;
        double r24973 = z;
        double r24974 = r24972 + r24973;
        return r24974;
}
↓
double f(double x, double y, double z) {
        double r24975 = x;
        double r24976 = y;
        double r24977 = r24975 + r24976;
        double r24978 = z;
        double r24979 = r24977 + r24978;
        return r24979;
}

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