Average Error: 0.0 → 0.0
Time: 3.2s
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 r4420127 = x;
        double r4420128 = y;
        double r4420129 = r4420127 + r4420128;
        double r4420130 = z;
        double r4420131 = r4420129 + r4420130;
        return r4420131;
}
↓
double f(double x, double y, double z) {
        double r4420132 = x;
        double r4420133 = y;
        double r4420134 = r4420132 + r4420133;
        double r4420135 = z;
        double r4420136 = r4420134 + r4420135;
        return r4420136;
}

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