Average Error: 0.0 → 0.0
Time: 10.9s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r46273 = x;
        double r46274 = y;
        double r46275 = r46273 + r46274;
        double r46276 = z;
        double r46277 = 1.0;
        double r46278 = r46276 + r46277;
        double r46279 = r46275 * r46278;
        return r46279;
}
↓
double f(double x, double y, double z) {
        double r46280 = x;
        double r46281 = y;
        double r46282 = r46280 + r46281;
        double r46283 = z;
        double r46284 = 1.0;
        double r46285 = r46283 + r46284;
        double r46286 = r46282 * r46285;
        return r46286;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(y + x\right) \cdot \left(z + 1\right)}\]

  3. Final simplification0.0

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

Reproduce

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