Average Error: 0.0 → 0.0
Time: 17.0s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r1966602 = x;
        double r1966603 = y;
        double r1966604 = r1966602 + r1966603;
        double r1966605 = z;
        double r1966606 = 1.0;
        double r1966607 = r1966605 + r1966606;
        double r1966608 = r1966604 * r1966607;
        return r1966608;
}
↓
double f(double x, double y, double z) {
        double r1966609 = y;
        double r1966610 = x;
        double r1966611 = r1966609 + r1966610;
        double r1966612 = z;
        double r1966613 = 1.0;
        double r1966614 = r1966612 + r1966613;
        double r1966615 = r1966611 * r1966614;
        return r1966615;
}

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\right)\]

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(z + 1\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)))