Average Error: 0.0 → 0.0
Time: 7.2s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1.0\right)\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot \left(z + 1.0\right)
double f(double x, double y, double z) {
        double r2181536 = x;
        double r2181537 = y;
        double r2181538 = r2181536 + r2181537;
        double r2181539 = z;
        double r2181540 = 1.0;
        double r2181541 = r2181539 + r2181540;
        double r2181542 = r2181538 * r2181541;
        return r2181542;
}
↓
double f(double x, double y, double z) {
        double r2181543 = y;
        double r2181544 = x;
        double r2181545 = r2181543 + r2181544;
        double r2181546 = z;
        double r2181547 = 1.0;
        double r2181548 = r2181546 + r2181547;
        double r2181549 = r2181545 * r2181548;
        return r2181549;
}

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

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(z + 1.0\right)\]

Reproduce

herbie shell --seed 2019168 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))