Main:bigenough2 from A

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

Alternatives: 9

Speedup: 1.0×

• 21.2% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x + y \cdot \left(z + x\right) \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(z + x\right) \end{array} \]

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Step-by-step derivation

   1. +-commutative 100.0%

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

   2. fma-define 100.0%

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

   3. +-commutative 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 61.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.00052:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 0.006:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{+49}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -0.00052)
   (* y x)
   (if (<= y 0.006) x (if (<= y 5.2e+49) (* y z) (* y x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.00052) {
		tmp = y * x;
	} else if (y <= 0.006) {
		tmp = x;
	} else if (y <= 5.2e+49) {
		tmp = y * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-0.00052d0)) then
        tmp = y * x
    else if (y <= 0.006d0) then
        tmp = x
    else if (y <= 5.2d+49) then
        tmp = y * z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -0.00052) {
		tmp = y * x;
	} else if (y <= 0.006) {
		tmp = x;
	} else if (y <= 5.2e+49) {
		tmp = y * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -0.00052:
		tmp = y * x
	elif y <= 0.006:
		tmp = x
	elif y <= 5.2e+49:
		tmp = y * z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -0.00052)
		tmp = Float64(y * x);
	elseif (y <= 0.006)
		tmp = x;
	elseif (y <= 5.2e+49)
		tmp = Float64(y * z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -0.00052)
		tmp = y * x;
	elseif (y <= 0.006)
		tmp = x;
	elseif (y <= 5.2e+49)
		tmp = y * z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -0.00052], N[(y * x), $MachinePrecision], If[LessEqual[y, 0.006], x, If[LessEqual[y, 5.2e+49], N[(y * z), $MachinePrecision], N[(y * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.19999999999999954e-4 or 5.19999999999999977e49 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 63.9%

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. +-commutative 63.9%

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

   5. Simplified 63.9%

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

   6. Taylor expanded in y around inf 63.4%

      \[\leadsto x \cdot \color{blue}{y} \]

   if -5.19999999999999954e-4 < y < 0.0060000000000000001

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

      4. distribute-lft-in 100.0%

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

      5. associate-+r+ 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in y around 0 71.2%

      \[\leadsto \color{blue}{x} \]

   if 0.0060000000000000001 < y < 5.19999999999999977e49

   1. Initial program 99.9%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 99.9%

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

      2. +-commutative 99.9%

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

      3. +-commutative 99.9%

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

      4. distribute-lft-in 99.9%

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

      5. associate-+r+ 99.9%

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

   6. Applied egg-rr 99.9%

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

   7. Taylor expanded in x around 0 70.1%

      \[\leadsto \color{blue}{y \cdot z} \]
3. Recombined 3 regimes into one program.

4. Final simplification 67.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.00052:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 0.006:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{+49}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0))) (* y (+ x z)) (+ x (* y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-1.0d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = y * (x + z)
    else
        tmp = x + (y * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = y * (x + z)
	else:
		tmp = x + (y * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(y * Float64(x + z));
	else
		tmp = Float64(x + Float64(y * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 1.0)))
		tmp = y * (x + z);
	else
		tmp = x + (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

      4. distribute-lft-in 95.2%

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

      5. associate-+r+ 95.2%

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

   6. Applied egg-rr 95.2%

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

   7. Taylor expanded in y around inf 98.5%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf 98.2%

      \[\leadsto x + \color{blue}{y \cdot z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.3%

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

Alternative 4: 84.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.00023) (not (<= y 0.22))) (* y (+ x z)) (+ x (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00023) || !(y <= 0.22)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-0.00023d0)) .or. (.not. (y <= 0.22d0))) then
        tmp = y * (x + z)
    else
        tmp = x + (y * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00023) || !(y <= 0.22)) {
		tmp = y * (x + z);
	} else {
		tmp = x + (y * x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -0.00023) or not (y <= 0.22):
		tmp = y * (x + z)
	else:
		tmp = x + (y * x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -0.00023) || !(y <= 0.22))
		tmp = Float64(y * Float64(x + z));
	else
		tmp = Float64(x + Float64(y * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -0.00023) || ~((y <= 0.22)))
		tmp = y * (x + z);
	else
		tmp = x + (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -0.00023], N[Not[LessEqual[y, 0.22]], $MachinePrecision]], N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.3000000000000001e-4 or 0.220000000000000001 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

      4. distribute-lft-in 95.3%

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

      5. associate-+r+ 95.3%

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

   6. Applied egg-rr 95.3%

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

   7. Taylor expanded in y around inf 98.5%

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

   if -2.3000000000000001e-4 < y < 0.220000000000000001

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0 73.0%

      \[\leadsto x + \color{blue}{x \cdot y} \]
   4. Step-by-step derivation

      1. *-commutative 73.0%

         \[\leadsto x + \color{blue}{y \cdot x} \]

   5. Simplified 73.0%

      \[\leadsto x + \color{blue}{y \cdot x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.00023 \lor \neg \left(y \leq 0.22\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 84.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.00025) (not (<= y 0.0145))) (* y (+ x z)) (* x (+ y 1.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00025) || !(y <= 0.0145)) {
		tmp = y * (x + z);
	} else {
		tmp = x * (y + 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-0.00025d0)) .or. (.not. (y <= 0.0145d0))) then
        tmp = y * (x + z)
    else
        tmp = x * (y + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00025) || !(y <= 0.0145)) {
		tmp = y * (x + z);
	} else {
		tmp = x * (y + 1.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -0.00025) or not (y <= 0.0145):
		tmp = y * (x + z)
	else:
		tmp = x * (y + 1.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -0.00025) || !(y <= 0.0145))
		tmp = Float64(y * Float64(x + z));
	else
		tmp = Float64(x * Float64(y + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -0.00025) || ~((y <= 0.0145)))
		tmp = y * (x + z);
	else
		tmp = x * (y + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -0.00025], N[Not[LessEqual[y, 0.0145]], $MachinePrecision]], N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision], N[(x * N[(y + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.5000000000000001e-4 or 0.0145000000000000007 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

      4. distribute-lft-in 95.3%

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

      5. associate-+r+ 95.3%

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

   6. Applied egg-rr 95.3%

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

   7. Taylor expanded in y around inf 98.5%

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

   if -2.5000000000000001e-4 < y < 0.0145000000000000007

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 73.0%

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. +-commutative 73.0%

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

   5. Simplified 73.0%

      \[\leadsto \color{blue}{x \cdot \left(y + 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.00025 \lor \neg \left(y \leq 0.0145\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 71.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.3e+184) (not (<= z 3.7e+191))) (* y z) (* x (+ y 1.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.3e+184) || !(z <= 3.7e+191)) {
		tmp = y * z;
	} else {
		tmp = x * (y + 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-1.3d+184)) .or. (.not. (z <= 3.7d+191))) then
        tmp = y * z
    else
        tmp = x * (y + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.3e+184) || !(z <= 3.7e+191)) {
		tmp = y * z;
	} else {
		tmp = x * (y + 1.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.3e+184) or not (z <= 3.7e+191):
		tmp = y * z
	else:
		tmp = x * (y + 1.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.3e+184) || !(z <= 3.7e+191))
		tmp = Float64(y * z);
	else
		tmp = Float64(x * Float64(y + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.3e+184) || ~((z <= 3.7e+191)))
		tmp = y * z;
	else
		tmp = x * (y + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.3e+184], N[Not[LessEqual[z, 3.7e+191]], $MachinePrecision]], N[(y * z), $MachinePrecision], N[(x * N[(y + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.29999999999999997e184 or 3.70000000000000019e191 < z

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

      4. distribute-lft-in 94.7%

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

      5. associate-+r+ 94.7%

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

   6. Applied egg-rr 94.7%

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

   7. Taylor expanded in x around 0 77.9%

      \[\leadsto \color{blue}{y \cdot z} \]

   if -1.29999999999999997e184 < z < 3.70000000000000019e191

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 77.6%

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. +-commutative 77.6%

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

   5. Simplified 77.6%

      \[\leadsto \color{blue}{x \cdot \left(y + 1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 77.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.3 \cdot 10^{+184} \lor \neg \left(z \leq 3.7 \cdot 10^{+191}\right):\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y + 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 60.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.00052) (not (<= y 1.0))) (* y x) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00052) || !(y <= 1.0)) {
		tmp = y * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-0.00052d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = y * x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00052) || !(y <= 1.0)) {
		tmp = y * x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -0.00052) or not (y <= 1.0):
		tmp = y * x
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -0.00052) || !(y <= 1.0))
		tmp = Float64(y * x);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -0.00052) || ~((y <= 1.0)))
		tmp = y * x;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -0.00052], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(y * x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if y < -5.19999999999999954e-4 or 1 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 60.8%

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. +-commutative 60.8%

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

   5. Simplified 60.8%

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

   6. Taylor expanded in y around inf 59.3%

      \[\leadsto x \cdot \color{blue}{y} \]

   if -5.19999999999999954e-4 < y < 1

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

      3. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. fma-undefine 100.0%

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

      2. +-commutative 100.0%

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

      3. +-commutative 100.0%

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

      4. distribute-lft-in 100.0%

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

      5. associate-+r+ 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in y around 0 71.2%

      \[\leadsto \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 65.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.00052 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(x + z\right) \end{array} \]

FPCore

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

C

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 * (x + z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto x + y \cdot \left(x + z\right) \]
4. Add Preprocessing

Alternative 9: 36.6% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

function code(x, y, z)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Step-by-step derivation

   1. +-commutative 100.0%

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

   2. fma-define 100.0%

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

   3. +-commutative 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. fma-undefine 100.0%

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

   2. +-commutative 100.0%

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

   3. +-commutative 100.0%

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

   4. distribute-lft-in 97.6%

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

   5. associate-+r+ 97.6%

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

6. Applied egg-rr 97.6%

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

7. Taylor expanded in y around 0 37.7%

   \[\leadsto \color{blue}{x} \]
8. Add Preprocessing

Reproduce

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