Average Error: 0.0 → 0.0
Time: 7.8s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r3040048 = x;
        double r3040049 = y;
        double r3040050 = r3040048 + r3040049;
        double r3040051 = 1.0;
        double r3040052 = z;
        double r3040053 = r3040051 - r3040052;
        double r3040054 = r3040050 * r3040053;
        return r3040054;
}
↓
double f(double x, double y, double z) {
        double r3040055 = x;
        double r3040056 = y;
        double r3040057 = r3040055 + r3040056;
        double r3040058 = 1.0;
        double r3040059 = z;
        double r3040060 = r3040058 - r3040059;
        double r3040061 = r3040057 * r3040060;
        return r3040061;
}

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(1 - z\right)\]

  2. Final simplification0.0

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

Reproduce

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