Average Error: 0.0 → 0.0
Time: 4.6s
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 r35110 = x;
        double r35111 = y;
        double r35112 = r35110 + r35111;
        double r35113 = z;
        double r35114 = 1.0;
        double r35115 = r35113 + r35114;
        double r35116 = r35112 * r35115;
        return r35116;
}
↓
double f(double x, double y, double z) {
        double r35117 = x;
        double r35118 = y;
        double r35119 = r35117 + r35118;
        double r35120 = z;
        double r35121 = 1.0;
        double r35122 = r35120 + r35121;
        double r35123 = r35119 * r35122;
        return r35123;
}

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