Average Error: 0.0 → 0.0
Time: 12.4s
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 r2870443 = x;
        double r2870444 = y;
        double r2870445 = r2870443 + r2870444;
        double r2870446 = z;
        double r2870447 = 1.0;
        double r2870448 = r2870446 + r2870447;
        double r2870449 = r2870445 * r2870448;
        return r2870449;
}
↓
double f(double x, double y, double z) {
        double r2870450 = y;
        double r2870451 = x;
        double r2870452 = r2870450 + r2870451;
        double r2870453 = z;
        double r2870454 = 1.0;
        double r2870455 = r2870453 + r2870454;
        double r2870456 = r2870452 * r2870455;
        return r2870456;
}

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