Average Error: 0.0 → 0.0
Time: 9.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 r12184 = x;
        double r12185 = y;
        double r12186 = z;
        double r12187 = r12186 - r12184;
        double r12188 = r12185 * r12187;
        double r12189 = r12184 + r12188;
        return r12189;
}
↓
double f(double x, double y, double z) {
        double r12190 = x;
        double r12191 = y;
        double r12192 = z;
        double r12193 = r12191 * r12192;
        double r12194 = -r12190;
        double r12195 = r12191 * r12194;
        double r12196 = r12193 + r12195;
        double r12197 = r12190 + r12196;
        return r12197;
}

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 2019322 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))