Experiments

Intro ] ackermann-long ] ackermann-short ]
crx-long ] crx-short ] member-long ]
member-short ] ncm-long ] ncm-short ]
[ qs44-long ] qs44-short ] sort-long ]
sort-short ]

data ] [ Up: Report ]

FOIL 6.4   [January 1996]
--------

Relation *elt

Relation *append

Relation *components

Relation sort

Relation *partition

----------
sort:

State (65/4225, 541.4 bits available)

Best literal A=B (3.0 bits)

State (16/65, 173.5 bits available)

	Save clause ending with A=[] (cover 1, accuracy 100%)

	Save append(A,A,A) (1,1 value 6.0)
	Save not(components(A,C,D)) (1,1 value 6.0)

Best literal A=[] (2.6 bits)

Clause 0: sort(A,B) :- B=[], A=[].

State (64/4224, 534.8 bits available)

Determinate literals
	components(A,C,D)
	components(B,C,D) ->components(B,E,F)

State (64/4096, 534.8 bits available)

Determinate literals
	sort(D,G)
	partition(C,D,G,H) ->partition(C,D,H,I)

State (64/4096, 534.8 bits available)

Determinate literals
	sort(H,J)
	sort(I,J) ->sort(I,K)
	components(J,C,G) ->components(L,C,G)
	components(J,C,H) ->components(M,C,H)
	components(J,C,I) ->components(N,C,I)
	components(J,E,I) ->components(O,E,I)
	append(H,I,J) ->append(H,I,P)
	append(I,H,J) ->append(I,H,Q)
	partition(C,G,J,K) ->partition(C,G,R,S) R=J R=K (no new vars)

State (64/3040, 534.8 bits available)

Determinate literals
	components(R,C,J)
	components(R,C,K) ->components(S,C,K)
	components(R,C,P) ->components(T,C,P)
	components(R,C,Q) ->components(U,C,Q)
	components(R,E,K) ->components(V,E,K)
	append(H,K,R) ->append(H,K,W)
	append(H,N,R) ->append(H,N,X)
	append(I,J,R) ->append(I,J,Y)
	append(I,M,R) ->append(I,M,Z)
	append(J,I,R) ->append(J,I,AA)
	append(J,N,R) ->append(J,N,AB)
	append(K,H,R) ->append(K,H,AC)
	append(K,J,R) ->append(K,J,AD)
	append(K,M,R) ->append(K,M,AE)
	append(M,I,R) ->append(M,I,AF) AF=T (no new vars)
	append(M,K,R) ->append(M,K,AF)
	append(N,H,R) ->append(N,H,AG) AG=U (no new vars)
	append(N,J,R) ->append(N,J,AG)

State (64/3040, 534.8 bits available)

	Save clause ending with append(J,S,B) (cover 64, accuracy 100%)

Best literal append(J,S,B) (18.7 bits)

Clause 1: sort(A,B) :- components(A,C,D), partition(C,D,E,F), sort(E,G), sort(F,H), components(I,C,H), append(G,I,B).

sort([],[]).
sort(A,B) :- components(A,C,D), partition(C,D,E,F), sort(E,G), sort(F,H), components(I,C,H), append(G,I,B).

Time 17.0 secs
 

by: Keith A. Pray
Last Modified: July 4, 2004 9:03 AM
© 2004 - 1975 Keith A. Pray.
All rights reserved.