Average Error: 0.0 → 0.0
Time: 6.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 r27808 = x;
        double r27809 = y;
        double r27810 = r27808 + r27809;
        double r27811 = z;
        double r27812 = 1.0;
        double r27813 = r27811 + r27812;
        double r27814 = r27810 * r27813;
        return r27814;
}
↓
double f(double x, double y, double z) {
        double r27815 = x;
        double r27816 = y;
        double r27817 = r27815 + r27816;
        double r27818 = z;
        double r27819 = 1.0;
        double r27820 = r27818 + r27819;
        double r27821 = r27817 * r27820;
        return r27821;
}

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