Average Error: 0.0 → 0.0
Time: 1.5s
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 r36636 = x;
        double r36637 = y;
        double r36638 = r36636 + r36637;
        double r36639 = z;
        double r36640 = 1.0;
        double r36641 = r36639 + r36640;
        double r36642 = r36638 * r36641;
        return r36642;
}
↓
double f(double x, double y, double z) {
        double r36643 = x;
        double r36644 = y;
        double r36645 = r36643 + r36644;
        double r36646 = z;
        double r36647 = 1.0;
        double r36648 = r36646 + r36647;
        double r36649 = r36645 * r36648;
        return r36649;
}

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