Average Error: 0.0 → 0.0
Time: 777.0ms
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 r25149 = x;
        double r25150 = y;
        double r25151 = r25149 + r25150;
        double r25152 = z;
        double r25153 = 1.0;
        double r25154 = r25152 + r25153;
        double r25155 = r25151 * r25154;
        return r25155;
}
↓
double f(double x, double y, double z) {
        double r25156 = x;
        double r25157 = y;
        double r25158 = r25156 + r25157;
        double r25159 = z;
        double r25160 = 1.0;
        double r25161 = r25159 + r25160;
        double r25162 = r25158 * r25161;
        return r25162;
}

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