Average Error: 0.0 → 0.0
Time: 6.2s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1.0\right)\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(y + x\right) \cdot \left(z + 1.0\right)
double f(double x, double y, double z) {
        double r830110 = x;
        double r830111 = y;
        double r830112 = r830110 + r830111;
        double r830113 = z;
        double r830114 = 1.0;
        double r830115 = r830113 + r830114;
        double r830116 = r830112 * r830115;
        return r830116;
}
↓
double f(double x, double y, double z) {
        double r830117 = y;
        double r830118 = x;
        double r830119 = r830117 + r830118;
        double r830120 = z;
        double r830121 = 1.0;
        double r830122 = r830120 + r830121;
        double r830123 = r830119 * r830122;
        return r830123;
}

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.0\right)\]

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(z + 1.0\right)\]

Reproduce

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