Average Error: 0.0 → 0.0
Time: 945.0ms
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 r2413354 = x;
        double r2413355 = y;
        double r2413356 = r2413354 + r2413355;
        double r2413357 = z;
        double r2413358 = r2413356 + r2413357;
        return r2413358;
}
↓
double f(double x, double y, double z) {
        double r2413359 = x;
        double r2413360 = y;
        double r2413361 = r2413359 + r2413360;
        double r2413362 = z;
        double r2413363 = r2413361 + r2413362;
        return r2413363;
}

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