Average Error: 0.0 → 0.0
Time: 1.2s
Precision: 64
\[\left(x + y\right) + z\]
\[z + \left(y + x\right)\]
\left(x + y\right) + z
z + \left(y + x\right)
double f(double x, double y, double z) {
        double r1943562 = x;
        double r1943563 = y;
        double r1943564 = r1943562 + r1943563;
        double r1943565 = z;
        double r1943566 = r1943564 + r1943565;
        return r1943566;
}

double f(double x, double y, double z) {
        double r1943567 = z;
        double r1943568 = y;
        double r1943569 = x;
        double r1943570 = r1943568 + r1943569;
        double r1943571 = r1943567 + r1943570;
        return r1943571;
}

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 z + \left(y + x\right)\]

Reproduce

herbie shell --seed 2019174 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))