Main:bigenough2 from A

Average Error: 0.0 → 0.0

Time: 1.7s

Precision: binary64

Cost: 448

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (z + x))
end function

↓

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + (y * (x + z))
end function

Java

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

↓

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

Python

def code(x, y, z):
	return x + (y * (z + x))

↓

def code(x, y, z):
	return x + (y * (x + z))

Julia

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

↓

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

MATLAB

function tmp = code(x, y, z)
	tmp = x + (y * (z + x));
end

↓

function tmp = code(x, y, z)
	tmp = x + (y * (x + z));
end

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

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

2. Final simplification 0.0

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

Alternatives

Alternative 1
Error	16.8
Cost	584

\[\begin{array}{l} t_0 := x + x \cdot y\\ \mathbf{if}\;x \leq -3.1 \cdot 10^{-224}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 7 \cdot 10^{-153}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 2
Error	7.7
Cost	584

\[\begin{array}{l} t_0 := x + y \cdot z\\ \mathbf{if}\;z \leq -2.7 \cdot 10^{-16}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 1.32 \cdot 10^{-117}:\\ \;\;\;\;x + x \cdot y\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 3
Error	23.8
Cost	456

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

Alternative 4
Error	23.9
Cost	456

\[\begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;y \leq 6.1 \cdot 10^{-59}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 5
Error	34.7
Cost	64

\[x \]

Reproduce

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