Average Error: 0.0 → 0.0
Time: 8.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 r37453 = x;
        double r37454 = y;
        double r37455 = r37453 + r37454;
        double r37456 = z;
        double r37457 = 1.0;
        double r37458 = r37456 + r37457;
        double r37459 = r37455 * r37458;
        return r37459;
}
↓
double f(double x, double y, double z) {
        double r37460 = x;
        double r37461 = y;
        double r37462 = r37460 + r37461;
        double r37463 = z;
        double r37464 = 1.0;
        double r37465 = r37463 + r37464;
        double r37466 = r37462 * r37465;
        return r37466;
}

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. Using strategy rm

  3. Applied distribute-rgt-in0.0

    \[\leadsto \color{blue}{z \cdot \left(x + y\right) + 1 \cdot \left(x + y\right)}\]

  4. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(z + 1\right)\]

Reproduce

herbie shell --seed 2019291 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))