Average Error: 0.0 → 0.0
Time: 7.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 r46654 = x;
        double r46655 = y;
        double r46656 = r46654 + r46655;
        double r46657 = z;
        double r46658 = 1.0;
        double r46659 = r46657 + r46658;
        double r46660 = r46656 * r46659;
        return r46660;
}
↓
double f(double x, double y, double z) {
        double r46661 = x;
        double r46662 = y;
        double r46663 = r46661 + r46662;
        double r46664 = z;
        double r46665 = 1.0;
        double r46666 = r46664 + r46665;
        double r46667 = r46663 * r46666;
        return r46667;
}

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