Average Error: 0.0 → 0.0
Time: 10.4s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(y + x\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r1812959 = x;
        double r1812960 = y;
        double r1812961 = r1812959 + r1812960;
        double r1812962 = 1.0;
        double r1812963 = z;
        double r1812964 = r1812962 - r1812963;
        double r1812965 = r1812961 * r1812964;
        return r1812965;
}
↓
double f(double x, double y, double z) {
        double r1812966 = y;
        double r1812967 = x;
        double r1812968 = r1812966 + r1812967;
        double r1812969 = 1.0;
        double r1812970 = z;
        double r1812971 = r1812969 - r1812970;
        double r1812972 = r1812968 * r1812971;
        return r1812972;
}

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

Reproduce

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