Average Error: 0.0 → 0.0
Time: 11.9s
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 r35588 = x;
        double r35589 = y;
        double r35590 = r35588 + r35589;
        double r35591 = z;
        double r35592 = 1.0;
        double r35593 = r35591 + r35592;
        double r35594 = r35590 * r35593;
        return r35594;
}
↓
double f(double x, double y, double z) {
        double r35595 = x;
        double r35596 = y;
        double r35597 = r35595 + r35596;
        double r35598 = z;
        double r35599 = 1.0;
        double r35600 = r35598 + r35599;
        double r35601 = r35597 * r35600;
        return r35601;
}

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