Average Error: 0.0 → 0.0
Time: 1.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 r48876 = x;
        double r48877 = y;
        double r48878 = r48876 + r48877;
        double r48879 = z;
        double r48880 = r48878 + r48879;
        return r48880;
}
↓
double f(double x, double y, double z) {
        double r48881 = x;
        double r48882 = y;
        double r48883 = r48881 + r48882;
        double r48884 = z;
        double r48885 = r48883 + r48884;
        return r48885;
}

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