Listed on Makoto Kamada s site: http://hpcgi2.nifty.com/m_kamada/f/phin10.cgi?p=641#P64060L

PFGW Version 3.3.5.20100908.Win_Stable [GWNUM 25.14]
Primality testing (10^12812+5*10^9609+7*10^6406+5*10^3203+1-10^11211-2*10^8008-2*10^4805-10^1602)/3541 [N-1/N+1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Generic modular reduction using generic reduction FFT length 4K on A 42549-bit number
Running N-1 test using base 17
Generic modular reduction using generic reduction FFT length 4K on A 42549-bit number
Running N-1 test using base 23
Generic modular reduction using generic reduction FFT length 4K on A 42549-bit number
Running N+1 test using discriminant 31, base 1+sqrt(31)
Generic modular reduction using generic reduction FFT length 4K on A 42549-bit number
Calling N+1 BLS with factored part 0.08% and helper 0.05% (0.28% proof)
(10^12812+5*10^9609+7*10^6406+5*10^3203+1-10^11211-2*10^8008-2*10^4805-10^1602)/3541 is Fermat and Lucas PRP! (209.1538s+0.0830s)

To be completed...