Average Error: 0.0 → 0.0
Time: 1.6s
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 r24221 = x;
        double r24222 = y;
        double r24223 = r24221 + r24222;
        double r24224 = z;
        double r24225 = 1.0;
        double r24226 = r24224 + r24225;
        double r24227 = r24223 * r24226;
        return r24227;
}
↓
double f(double x, double y, double z) {
        double r24228 = x;
        double r24229 = y;
        double r24230 = r24228 + r24229;
        double r24231 = z;
        double r24232 = 1.0;
        double r24233 = r24231 + r24232;
        double r24234 = r24230 * r24233;
        return r24234;
}

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 2020025 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))