-- strategy: unique candidates
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 3 candidates of size 2
-- 7 candidates of size 3
-- 8 candidates of size 4
-- 23 candidates of size 5
-- 30 candidates of size 6
-- 82 candidates of size 7
-- tested 84 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: default
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 3 candidates of size 2
-- 7 candidates of size 3
-- 8 candidates of size 4
-- 28 candidates of size 5
-- 35 candidates of size 6
-- 167 candidates of size 7
-- tested 95 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: without reasoning
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 3 candidates of size 2
-- 16 candidates of size 3
-- 17 candidates of size 4
-- 279 candidates of size 5
-- 313 candidates of size 6
-- 5763 candidates of size 7
-- tested 656 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: without descent
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 3 candidates of size 2
-- 7 candidates of size 3
-- 8 candidates of size 4
-- 28 candidates of size 5
-- 35 candidates of size 6
-- 252 candidates of size 7
-- tested 148 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: without ad-hoc
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 6 candidates of size 2
-- 9 candidates of size 3
-- 18 candidates of size 4
-- 31 candidates of size 5
-- 59 candidates of size 6
-- 171 candidates of size 7
-- tested 137 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: only reasoning
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 6 candidates of size 2
-- 9 candidates of size 3
-- 18 candidates of size 4
-- 41 candidates of size 5
-- 64 candidates of size 6
-- 307 candidates of size 7
-- tested 251 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: only descent
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 6 candidates of size 2
-- 18 candidates of size 3
-- 36 candidates of size 4
-- 287 candidates of size 5
-- 571 candidates of size 6
-- 5843 candidates of size 7
-- tested 946 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: only ad-hoc
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 3 candidates of size 2
-- 16 candidates of size 3
-- 17 candidates of size 4
-- 279 candidates of size 5
-- 313 candidates of size 6
-- 6281 candidates of size 7
-- tested 1004 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)

-- strategy: only typed
factorial :: Int -> Int
-- testing 4 combinations of argument values
-- pruning with 27/65 rules
-- 3 candidates of size 1
-- 6 candidates of size 2
-- 18 candidates of size 3
-- 36 candidates of size 4
-- 315 candidates of size 5
-- 585 candidates of size 6
-- 6915 candidates of size 7
-- tested 1876 candidates
factorial 0  =  1
factorial x  =  x * factorial (x - 1)