Average Error: 0.0 → 0.0
Time: 7.4s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r32153 = x;
        double r32154 = y;
        double r32155 = r32153 + r32154;
        double r32156 = z;
        double r32157 = 1.0;
        double r32158 = r32156 + r32157;
        double r32159 = r32155 * r32158;
        return r32159;
}
↓
double f(double x, double y, double z) {
        double r32160 = y;
        double r32161 = x;
        double r32162 = r32160 + r32161;
        double r32163 = z;
        double r32164 = 1.0;
        double r32165 = r32163 + r32164;
        double r32166 = r32162 * r32165;
        return r32166;
}

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(y + x\right) \cdot \left(z + 1\right)\]

Reproduce

herbie shell --seed 2019196 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))