Average Error: 0.0 → 0.0
Time: 1.3s
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 r53453 = x;
        double r53454 = y;
        double r53455 = r53453 + r53454;
        double r53456 = z;
        double r53457 = 1.0;
        double r53458 = r53456 + r53457;
        double r53459 = r53455 * r53458;
        return r53459;
}
↓
double f(double x, double y, double z) {
        double r53460 = x;
        double r53461 = y;
        double r53462 = r53460 + r53461;
        double r53463 = z;
        double r53464 = 1.0;
        double r53465 = r53463 + r53464;
        double r53466 = r53462 * r53465;
        return r53466;
}

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