Average Error: 0.0 → 0.0
Time: 3.5s
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 r25586 = x;
        double r25587 = y;
        double r25588 = r25586 + r25587;
        double r25589 = z;
        double r25590 = 1.0;
        double r25591 = r25589 + r25590;
        double r25592 = r25588 * r25591;
        return r25592;
}
↓
double f(double x, double y, double z) {
        double r25593 = x;
        double r25594 = y;
        double r25595 = r25593 + r25594;
        double r25596 = z;
        double r25597 = 1.0;
        double r25598 = r25596 + r25597;
        double r25599 = r25595 * r25598;
        return r25599;
}

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