Average Error: 0.0 → 0.0
Time: 5.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 r38463 = x;
        double r38464 = y;
        double r38465 = r38463 + r38464;
        double r38466 = z;
        double r38467 = 1.0;
        double r38468 = r38466 + r38467;
        double r38469 = r38465 * r38468;
        return r38469;
}
↓
double f(double x, double y, double z) {
        double r38470 = x;
        double r38471 = y;
        double r38472 = r38470 + r38471;
        double r38473 = z;
        double r38474 = 1.0;
        double r38475 = r38473 + r38474;
        double r38476 = r38472 * r38475;
        return r38476;
}

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 +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)))