Average Error: 0.0 → 0.0
Time: 1.0s
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 r26584 = x;
        double r26585 = y;
        double r26586 = r26584 + r26585;
        double r26587 = z;
        double r26588 = 1.0;
        double r26589 = r26587 + r26588;
        double r26590 = r26586 * r26589;
        return r26590;
}
↓
double f(double x, double y, double z) {
        double r26591 = x;
        double r26592 = y;
        double r26593 = r26591 + r26592;
        double r26594 = z;
        double r26595 = 1.0;
        double r26596 = r26594 + r26595;
        double r26597 = r26593 * r26596;
        return r26597;
}

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