Average Error: 0.0 → 0.0
Time: 8.0s
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 r41067 = x;
        double r41068 = y;
        double r41069 = r41067 + r41068;
        double r41070 = z;
        double r41071 = r41069 + r41070;
        return r41071;
}
↓
double f(double x, double y, double z) {
        double r41072 = x;
        double r41073 = y;
        double r41074 = r41072 + r41073;
        double r41075 = z;
        double r41076 = r41074 + r41075;
        return r41076;
}

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