Average Error: 0.0 → 0.0
Time: 1.1s
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 r25112 = x;
        double r25113 = y;
        double r25114 = r25112 + r25113;
        double r25115 = z;
        double r25116 = 1.0;
        double r25117 = r25115 + r25116;
        double r25118 = r25114 * r25117;
        return r25118;
}
↓
double f(double x, double y, double z) {
        double r25119 = x;
        double r25120 = y;
        double r25121 = r25119 + r25120;
        double r25122 = z;
        double r25123 = 1.0;
        double r25124 = r25122 + r25123;
        double r25125 = r25121 * r25124;
        return r25125;
}

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