Average Error: 0.0 → 0.0
Time: 7.8s
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 r38496 = x;
        double r38497 = y;
        double r38498 = r38496 + r38497;
        double r38499 = z;
        double r38500 = 1.0;
        double r38501 = r38499 + r38500;
        double r38502 = r38498 * r38501;
        return r38502;
}
↓
double f(double x, double y, double z) {
        double r38503 = x;
        double r38504 = y;
        double r38505 = r38503 + r38504;
        double r38506 = z;
        double r38507 = 1.0;
        double r38508 = r38506 + r38507;
        double r38509 = r38505 * r38508;
        return r38509;
}

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