Average Error: 0.0 → 0.0
Time: 6.1s
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 r42928 = x;
        double r42929 = y;
        double r42930 = r42928 + r42929;
        double r42931 = z;
        double r42932 = 1.0;
        double r42933 = r42931 + r42932;
        double r42934 = r42930 * r42933;
        return r42934;
}
↓
double f(double x, double y, double z) {
        double r42935 = x;
        double r42936 = y;
        double r42937 = r42935 + r42936;
        double r42938 = z;
        double r42939 = 1.0;
        double r42940 = r42938 + r42939;
        double r42941 = r42937 * r42940;
        return r42941;
}

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 2019298 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))