Average Error: 0.0 → 0.0
Time: 1.2s
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 r24156 = x;
        double r24157 = y;
        double r24158 = r24156 + r24157;
        double r24159 = z;
        double r24160 = 1.0;
        double r24161 = r24159 + r24160;
        double r24162 = r24158 * r24161;
        return r24162;
}
↓
double f(double x, double y, double z) {
        double r24163 = x;
        double r24164 = y;
        double r24165 = r24163 + r24164;
        double r24166 = z;
        double r24167 = 1.0;
        double r24168 = r24166 + r24167;
        double r24169 = r24165 * r24168;
        return r24169;
}

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