fib(Int).
fib(n < 2) :- 1.
fib(n) :-
  fib(n - 1) + fib(n - 2).

370
283
240
201
190
179
152
151
156
128
160
147
158
166
168
127
178

*Besides which* according to this code
>>> pprint.pprint(min([(6+5+k+sum([sum(divmod(j-30, k)) for j in [ord(i) for i in "Hello, World!"]]),k)for k in range(2, 52)]))
(115, 13)
Using base 13 and subtracting 30 is still better

for b in range(1,21):print sum(map(lambda c: (ord(c)-30) // b + (ord(c)-30) % b,"Hello, World"))

zero?(Int).
zero?(0).

fib(Int) :- Int.

fib(0) :- 1.
fib(1) :- 1.
fib(n) :-
  fib(n - 1) + fib(n - 2).

>>> print(min([(22+k+sum([(121-j)//k+(j-121)%k for j in [ord(i) for i in "Hello, World!"]]),k) for k in range(1, 31)]))
(99, 13)
>>> print([((121-j)//13,(j-121)%13) for j in [ord(i) for i in "Hello, World!"]])
[(3, 3), (1, 6), (1, 0), (1, 0), (0, 3), (5, 1), (6, 2), (2, 5), (0, 3), (0, 6), (1, 0), (1, 5), (6, 3)]

>>> print([((121-j)//13,(121-j)%13) for j in [ord(i) for i in "Hello, World!"]])
[(3, 10), (1, 7), (1, 0), (1, 0), (0, 10), (5, 12), (6, 11), (2, 8), (0, 10), (0, 7), (1, 0), (1, 8), (6, 10)]
>>> print([((117-j)//9,(117-j)%9) for j in [ord(i) for i in "Hello, World!"]])
[(5, 0), (1, 7), (1, 0), (1, 0), (0, 6), (8, 1), (9, 4), (3, 3), (0, 6), (0, 3), (1, 0), (1, 8), (9, 3)]

sorted_helper([Int], Int).
sorted_helper(coll, n) :-
  coll[n] < coll[n + 1].

sorted?([Int]).
sorted?(coll) :-
  indices = (count(coll) - 1) |> range;
  indices |> map({ |a| sorted_helper(coll, a) }) |> reduce(&).

sorted_helper([Int], Int).
sorted_helper(coll, n) :-
  coll[n] < coll[n + 1].

sorted?([Int]).
sorted?(coll) :-
  indices = [0...count(coll) - 1];
  indices
    |> map({ |n| sorted_helper(coll, n) })
    |> reduce(&).

sorted_helper([Int], Int).
sorted_helper(coll, n) :-
  coll[n] < coll[n + 1].

[['define', 'lambda', ['lambda', ['define', 'if'], ['char', ['minus', ['mult', 6, 19], ['mult', 'define', 13], 'if']]]], ['plus', ['lambda', 3, 3], ['lambda', 1, 0], ['lambda', 0, 6], ['lambda', 0, 6], ['lambda', 0, 3], ['lambda', 5, 5], ['lambda', 6, 4], ['lambda', 2, 1], ['lambda', 0, 3], ['lambda', 0, 0], ['lambda', 0, 6], ['lambda', 1, 1], ['lambda', 6, 3]]]

from collections import defaultdict
from itertools import izip
import copy
import operator
import os
import sys

to_english = defaultdict(lambda:None,\
    {'()': 'lambda',
     '()()': 'define',
     '(())': 'plus',
     '(()())': 'minus',
     '()(())': 'mult',
     '(())()': 'div',
     '()()()': 'if',
     '(())(())': 'equal',
     '()(())()': 'LE',
     '()(()())': 'not',
     '((()))': 'empty',
     '((()))()': 'cons',
     '((()))(())': 'car',
     '((()))()()': 'cdr',
     '(())(())()': 'char',

sorted([]).
sorted([_]).
sorted([H,I|T]) :-
  H < I, sorted([I|T]).

last([X], X).
last([_|T], X) :-
    last(T, X).

?- throw(stupid).
ERROR: Unhandled exception: stupid

?- X.
% ... 1,000,000 ............ 10,000,000 years later
%
%       >> 42 << (last release gives the question)

052631578947368421
105263157894736842
157894736842105263
210526315789473684
263157894736842105
315789473684210526
368421052631578947
421052631578947368
473684210526315789

A
KL
UVW
EFGH
OPQRS
YZABCD
IJKLMNO
STUVWXYZ
CDEFGHIJK
MNOPQRSTUV

A
CD

A
DE
GHI