Average Error: 0.0 → 0.0
Time: 8.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 r47993 = x;
        double r47994 = y;
        double r47995 = r47993 + r47994;
        double r47996 = z;
        double r47997 = 1.0;
        double r47998 = r47996 + r47997;
        double r47999 = r47995 * r47998;
        return r47999;
}
↓
double f(double x, double y, double z) {
        double r48000 = x;
        double r48001 = y;
        double r48002 = r48000 + r48001;
        double r48003 = z;
        double r48004 = 1.0;
        double r48005 = r48003 + r48004;
        double r48006 = r48002 * r48005;
        return r48006;
}

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