Average Error: 0.0 → 0.0
Time: 7.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 r45570 = x;
        double r45571 = y;
        double r45572 = r45570 + r45571;
        double r45573 = z;
        double r45574 = 1.0;
        double r45575 = r45573 + r45574;
        double r45576 = r45572 * r45575;
        return r45576;
}
↓
double f(double x, double y, double z) {
        double r45577 = x;
        double r45578 = y;
        double r45579 = r45577 + r45578;
        double r45580 = z;
        double r45581 = 1.0;
        double r45582 = r45580 + r45581;
        double r45583 = r45579 * r45582;
        return r45583;
}

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