Average Error: 0.0 → 0.0
Time: 2.7s
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 r31633 = x;
        double r31634 = y;
        double r31635 = r31633 + r31634;
        double r31636 = z;
        double r31637 = r31635 + r31636;
        return r31637;
}
↓
double f(double x, double y, double z) {
        double r31638 = x;
        double r31639 = y;
        double r31640 = r31638 + r31639;
        double r31641 = z;
        double r31642 = r31640 + r31641;
        return r31642;
}

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