Main:bigenough2 from A

Average Error: 0.0 → 0.0

Time: 3.2s

Precision: binary64

Cost: 6720

Math

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

↓

\[\mathsf{fma}\left(y, x + z, x\right) \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (+ z x))))

↓

(FPCore (x y z) :precision binary64 (fma y (+ x z) x))

C

double code(double x, double y, double z) {
	return x + (y * (z + x));
}

↓

double code(double x, double y, double z) {
	return fma(y, (x + z), x);
}

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z + x)))
end

↓

function code(x, y, z)
	return fma(y, Float64(x + z), x)
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_] := N[(y * N[(x + z), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 0.0

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

2. Simplified 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   Proof

   [Start] 0.0	\[ x + y \cdot \left(z + x\right) \]
   +-commutative [=>] 0.0	\[ \color{blue}{y \cdot \left(z + x\right) + x} \]
   fma-def [=>] 0.0	\[ \color{blue}{\mathsf{fma}\left(y, z + x, x\right)} \]
   +-commutative [=>] 0.0	\[ \mathsf{fma}\left(y, \color{blue}{x + z}, x\right) \]

3. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(y, x + z, x\right) \]

Alternatives

Alternative 1
Error	24.3
Cost	984

\[\begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+114}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq -430:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -3.9 \cdot 10^{-20}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 2.5 \cdot 10^{-45}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-27}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 2
Error	12.3
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -2.05 \cdot 10^{-21} \lor \neg \left(y \leq 6 \cdot 10^{-45}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3
Error	13.4
Cost	585

\[\begin{array}{l} \mathbf{if}\;x \leq -14000000000 \lor \neg \left(x \leq 1.3 \cdot 10^{-78}\right):\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x + z\right)\\ \end{array} \]

Alternative 4
Error	1.0
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -61 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot z\\ \end{array} \]

Alternative 5
Error	24.4
Cost	456

\[\begin{array}{l} \mathbf{if}\;y \leq -61:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 6
Error	0.0
Cost	448

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

Alternative 7
Error	35.0
Cost	64

\[x \]

Reproduce

herbie shell --seed 2023125 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))