Average Error: 0.0 → 0.0
Time: 11.0s
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 r2005121 = x;
        double r2005122 = y;
        double r2005123 = r2005121 + r2005122;
        double r2005124 = 1.0;
        double r2005125 = z;
        double r2005126 = r2005124 - r2005125;
        double r2005127 = r2005123 * r2005126;
        return r2005127;
}
↓
double f(double x, double y, double z) {
        double r2005128 = y;
        double r2005129 = x;
        double r2005130 = r2005128 + r2005129;
        double r2005131 = 1.0;
        double r2005132 = z;
        double r2005133 = r2005131 - r2005132;
        double r2005134 = r2005130 * r2005133;
        return r2005134;
}

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 2019171 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1.0 z)))