Average Error: 0.0 → 0.0
Time: 4.5s
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 r1703250 = x;
        double r1703251 = y;
        double r1703252 = r1703250 + r1703251;
        double r1703253 = z;
        double r1703254 = r1703252 + r1703253;
        return r1703254;
}
↓
double f(double x, double y, double z) {
        double r1703255 = x;
        double r1703256 = y;
        double r1703257 = r1703255 + r1703256;
        double r1703258 = z;
        double r1703259 = r1703257 + r1703258;
        return r1703259;
}

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