Average Error: 0.0 → 0.0
Time: 2.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 r31367 = x;
        double r31368 = y;
        double r31369 = r31367 + r31368;
        double r31370 = z;
        double r31371 = 1.0;
        double r31372 = r31370 + r31371;
        double r31373 = r31369 * r31372;
        return r31373;
}
↓
double f(double x, double y, double z) {
        double r31374 = x;
        double r31375 = y;
        double r31376 = r31374 + r31375;
        double r31377 = z;
        double r31378 = 1.0;
        double r31379 = r31377 + r31378;
        double r31380 = r31376 * r31379;
        return r31380;
}

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