Average Error: 0.0 → 0.0
Time: 4.6s
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 r1732714 = x;
        double r1732715 = y;
        double r1732716 = r1732714 + r1732715;
        double r1732717 = z;
        double r1732718 = r1732716 + r1732717;
        return r1732718;
}
↓
double f(double x, double y, double z) {
        double r1732719 = x;
        double r1732720 = y;
        double r1732721 = r1732719 + r1732720;
        double r1732722 = z;
        double r1732723 = r1732721 + r1732722;
        return r1732723;
}

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