Average Error: 0.0 → 0.0
Time: 8.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 r960720 = x;
        double r960721 = y;
        double r960722 = r960720 + r960721;
        double r960723 = z;
        double r960724 = 1.0;
        double r960725 = r960723 + r960724;
        double r960726 = r960722 * r960725;
        return r960726;
}
↓
double f(double x, double y, double z) {
        double r960727 = y;
        double r960728 = x;
        double r960729 = r960727 + r960728;
        double r960730 = z;
        double r960731 = 1.0;
        double r960732 = r960730 + r960731;
        double r960733 = r960729 * r960732;
        return r960733;
}

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