Average Error: 0.0 → 0.0
Time: 13.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(1 + z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(1 + z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r671266 = x;
        double r671267 = y;
        double r671268 = r671266 + r671267;
        double r671269 = z;
        double r671270 = 1.0;
        double r671271 = r671269 + r671270;
        double r671272 = r671268 * r671271;
        return r671272;
}
↓
double f(double x, double y, double z) {
        double r671273 = 1.0;
        double r671274 = z;
        double r671275 = r671273 + r671274;
        double r671276 = x;
        double r671277 = y;
        double r671278 = r671276 + r671277;
        double r671279 = r671275 * r671278;
        return r671279;
}

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

Reproduce

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