Average Error: 0.0 → 0.0
Time: 1.8s
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 r23032 = x;
        double r23033 = y;
        double r23034 = r23032 + r23033;
        double r23035 = z;
        double r23036 = 1.0;
        double r23037 = r23035 + r23036;
        double r23038 = r23034 * r23037;
        return r23038;
}
↓
double f(double x, double y, double z) {
        double r23039 = x;
        double r23040 = y;
        double r23041 = r23039 + r23040;
        double r23042 = z;
        double r23043 = 1.0;
        double r23044 = r23042 + r23043;
        double r23045 = r23041 * r23044;
        return r23045;
}

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