Average Error: 0.0 → 0.0
Time: 8.4s
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 r28799 = x;
        double r28800 = y;
        double r28801 = r28799 + r28800;
        double r28802 = z;
        double r28803 = 1.0;
        double r28804 = r28802 + r28803;
        double r28805 = r28801 * r28804;
        return r28805;
}
↓
double f(double x, double y, double z) {
        double r28806 = x;
        double r28807 = y;
        double r28808 = r28806 + r28807;
        double r28809 = z;
        double r28810 = 1.0;
        double r28811 = r28809 + r28810;
        double r28812 = r28808 * r28811;
        return r28812;
}

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