Average Error: 0.0 → 0.0
Time: 3.2s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
↓
\[x + \left(y \cdot z + y \cdot \left(-x\right)\right)\]
x + y \cdot \left(z - x\right)
↓
x + \left(y \cdot z + y \cdot \left(-x\right)\right)
double f(double x, double y, double z) {
        double r13159 = x;
        double r13160 = y;
        double r13161 = z;
        double r13162 = r13161 - r13159;
        double r13163 = r13160 * r13162;
        double r13164 = r13159 + r13163;
        return r13164;
}
↓
double f(double x, double y, double z) {
        double r13165 = x;
        double r13166 = y;
        double r13167 = z;
        double r13168 = r13166 * r13167;
        double r13169 = -r13165;
        double r13170 = r13166 * r13169;
        double r13171 = r13168 + r13170;
        double r13172 = r13165 + r13171;
        return r13172;
}

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

    \[x + y \cdot \left(z - x\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto x + y \cdot \color{blue}{\left(z + \left(-x\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto x + \color{blue}{\left(y \cdot z + y \cdot \left(-x\right)\right)}\]

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020057 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))