Average Error: 0.0 → 0.0
Time: 7.2s
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 r46259 = x;
        double r46260 = y;
        double r46261 = r46259 + r46260;
        double r46262 = z;
        double r46263 = 1.0;
        double r46264 = r46262 + r46263;
        double r46265 = r46261 * r46264;
        return r46265;
}
↓
double f(double x, double y, double z) {
        double r46266 = x;
        double r46267 = y;
        double r46268 = r46266 + r46267;
        double r46269 = z;
        double r46270 = 1.0;
        double r46271 = r46269 + r46270;
        double r46272 = r46268 * r46271;
        return r46272;
}

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

Reproduce

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