Average Error: 0.0 → 0.0
Time: 7.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 r25893 = x;
        double r25894 = y;
        double r25895 = r25893 + r25894;
        double r25896 = z;
        double r25897 = 1.0;
        double r25898 = r25896 + r25897;
        double r25899 = r25895 * r25898;
        return r25899;
}
↓
double f(double x, double y, double z) {
        double r25900 = x;
        double r25901 = y;
        double r25902 = r25900 + r25901;
        double r25903 = z;
        double r25904 = 1.0;
        double r25905 = r25903 + r25904;
        double r25906 = r25902 * r25905;
        return r25906;
}

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