Average Error: 0.0 → 0.0
Time: 1.5s
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 r36092 = x;
        double r36093 = y;
        double r36094 = r36092 + r36093;
        double r36095 = z;
        double r36096 = 1.0;
        double r36097 = r36095 + r36096;
        double r36098 = r36094 * r36097;
        return r36098;
}
↓
double f(double x, double y, double z) {
        double r36099 = x;
        double r36100 = y;
        double r36101 = r36099 + r36100;
        double r36102 = z;
        double r36103 = 1.0;
        double r36104 = r36102 + r36103;
        double r36105 = r36101 * r36104;
        return r36105;
}

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 2019356 +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)))