TRAINING EXAMPLES:
EXAMPLE No. 1 OBJECT 1 black(x11) =. true

EXAMPLE No. 2 OBJECT 1 black(x12) =. true

EXAMPLE No. 3 OBJECT 1 black(x14) =. true

EXAMPLE No. 4 OBJECT 2 black(x21) =. true

EXAMPLE No. 5 OBJECT 3 black(x31) =. true

EXAMPLE No. 6 OBJECT 3 black(x33) =. true

EXAMPLE No. 7 OBJECT 1 white(x13) =. true

EXAMPLE No. 8 OBJECT 2 white(x22) =. true

EXAMPLE No. 9 OBJECT 2 white(x23) =. true

EXAMPLE No. 10 OBJECT 3 white(x32) =. true

EXAMPLE No. 11 OBJECT 3 white(x34) =. true

EXAMPLE No. 12 OBJECT 4 shaded(x41) =. true

EXAMPLE No. 13 OBJECT 4 shaded(x42) =. true

EXAMPLE No. 14 OBJECT 4 shaded(x43) =. true

EXAMPLE No. 15 OBJECT 5 shaded(x51) =. true

EXAMPLE No. 16 OBJECT 5 shaded(x52) =. true

EXAMPLE No. 17 OBJECT 5 shaded(x53) =. true

EXAMPLE No. 18 OBJECT 1 black(x13) =. false

EXAMPLE No. 19 OBJECT 2 black(x22) =. false

EXAMPLE No. 20 OBJECT 2 black(x23) =. false

EXAMPLE No. 21 OBJECT 3 black(x32) =. false

EXAMPLE No. 22 OBJECT 3 black(x34) =. false

EXAMPLE No. 23 OBJECT 4 black(x41) =. false

EXAMPLE No. 24 OBJECT 4 black(x42) =. false

EXAMPLE No. 25 OBJECT 4 black(x43) =. false

EXAMPLE No. 26 OBJECT 4 black(x44) =. false

EXAMPLE No. 27 OBJECT 5 black(x51) =. false

EXAMPLE No. 28 OBJECT 5 black(x52) =. false

EXAMPLE No. 29 OBJECT 5 black(x53) =. false

EXAMPLE No. 30 OBJECT 1 white(x12) =. false

EXAMPLE No. 31 OBJECT 1 white(x11) =. false

EXAMPLE No. 32 OBJECT 1 white(x14) =. false

EXAMPLE No. 33 OBJECT 2 white(x21) =. false

EXAMPLE No. 34 OBJECT 3 white(x31) =. false

EXAMPLE No. 35 OBJECT 3 white(x33) =. false

EXAMPLE No. 36 OBJECT 4 white(x41) =. false

EXAMPLE No. 37 OBJECT 4 white(x42) =. faIse

EXAMPLE No. 38 OBJECT 4 white(x43) =. false

EXAMPLE No. 39 OBJECT 4 white(x44) =. false

EXAMPLE No. 40 OBJECT 5 white(x51) =. false

EXAMPLE No. 41 OBJECT 5 white(x53) =. false

EXAMPLE No. 42 OBJECT 5 white(x54) =. false

EXAMPLE No. 43 OBJECT 1 shaded(x11) =. false

EXAMPLE No. 44 OBJECT 1 shaded(x12) =. false

EXAMPLE No. 45 OBJECT 1 shaded(x13) =. false

EXAMPLE No. 46 OBJECT 1 shaded(x14) =. false

EXAMPLE No. 47 OBJECT 2 shaded(x21) =. false

EXAMPLE No. 48 OBJECT 2 shaded(x22) =. false

EXAMPLE No. 49 OBJECT 2 shaded(x23) =. false

EXAMPLE No. 50 OBJECT 3 shaded(x31) =. false

EXAMPLE No. 51 OBJECT 3 shaded(x32) =. false

EXAMPLE No. 52 OBJECT 3 shaded(x33) =. false

EXAMPLE No. 53 OBJECT 3 shaded(x34) =. false

SEED: object no. 1 for Concept black(_817358) =. true

SEED: object no. 1 for Concept white(_817370) =. true

SEED: object no. 4 for Concept shaded(_817382) =. true

================ Parallel Conquer for Concepts
================ [black(_817358) =. true,white(_817370) =. true,shaded(_817382) =. true]

---------------------- Specialization Step No. 1 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 4
Pos. ex. covered: [[1,[1]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[23]],[5,[27]]]

black(X1) =. true :-
first(X1) =. true.

PS_RULE: 5
Pos. ex. covered: [[1,[1,2,3]],[2,[4]],[3,[5,6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true.

PS_RULE: 6
Pos. ex. covered: [[1,[1,2]],[2,[4]],[3,[5,6]]]
Neg. ex. covered: [[1,[18]],[2,[19]],[3,[21]],[4,[23,24,25]],[5,[27,28]]]

black(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 7
Pos. ex. covered: [[1,[2,3]],[2,[]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[19,20]],[3,[21,22]],[4,[24,25,26]],[5,[28,29]]]

black(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 8
Pos. ex. covered: [[1,[7]],[2,[8,9]],[3,[10,11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 9
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30,31]],[2,[33]],[3,[34,35]],[4,[36,37,38]],[5,[40]]]

white(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 10
Pos. ex. covered: [[1,[7]],[2,[8,9]],[3,[10,11]]]
Neg. ex. covered: [[1,[30,32]],[2,[]],[3,[35]],[4,[37,38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 11
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true.

PS_RULE: 12
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 13
Pos. ex. covered: [[4,[12,13,14]],[5,[15,16]]]
Neg. ex. covered: [[1,[43,44,45]],[2,[47,48]],[3,[50,51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 14
Pos. ex. covered: [[4,[13,14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,45,46]],[2,[48,49]],[3,[51,52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true.

PS_RULE: 15
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[43,44,46]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
crl(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(2,4) cov(3,8) cov(3,11) cov(4,5) cov(5,12) cov(6,15) cov(7,10)
cov(8,6) cov(8,13) cov(8,14) cov(9,9) cov(10,7)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(2,4) cov(3,8) cov(3,11) cov(4,5) cov(5,12) cov(6,15) cov(7,10)
cov(8,6) cov(8,13) cov(8,14)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(6,5) cov(5,6) cov(5,8) cov(5,10) cov(5,13) cov(4,14) cov(3,4)
cov(3,12) cov(3,15) cov(2,11)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(6,5) cov(5,6) cov(5,8) cov(5,10) cov(5,13) cov(4,14) cov(3,4)
cov(3,12) cov(3,15) cov(2,11)

---------------------- Specialization Step No. 2 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 16
Pos. ex. covered: [[1,[1]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
first(X1) =. true,
crl(X1) =. true.

PS_RULE: 17
Pos. ex. covered: [[1,[1]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[23]],[5,[27]]]

black(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 18
Pos. ex. covered: [[1,[1,2]],[2,[4]],[3,[5,6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25]],[5,[28]]]

black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 19
Pos. ex. covered: [[1,[2,3]],[2,[]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 20
Pos. ex. covered: [[1,[1]],[2,[]],[3,[]]]
Neg. ex. covered: [[1,[18]],[2,[]],[3,[21]],[4,[24,25]],[5,[27,28]]]

black(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 21
Pos. ex. covered: [[1,[1,2]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[21]],[4,[23,24]],[5,[27]]]

black(X1) =. true :-
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 22
Pos. ex. covered: [[1,[2]],[2,[]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[19]],[3,[21]],[4,[24,25]],[5,[28]]]

black(X1) =. true :-
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 23
Pos. ex. covered: [[1,[2]],[2,[4]],[3,[5,6]]]
Neg. ex. covered: [[1,[]],[2,[19]],[3,[]],[4,[23]],[5,[]]]

black(X1) =. true :-
next(X2,X1) =. true,
sqr(X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 24
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 25
Pos. ex. covered: [[1,[7]],[2,[8,9]],[3,[10,11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 26
Pos. ex. covered: [[1,[7]],[2,[9]],[3,[11]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 27
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10,11]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
crl(X2) =. true.

PS_RULE: 28
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[35]],[4,[37,38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X3,X1) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 29
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

PS_RULE: 30
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 31
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 32
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 33
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[44]],[2,[47,48]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 34
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 35
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[44,45]],[2,[48]],[3,[51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 36
Pos. ex. covered: [[4,[13,14]],[5,[15,16]]]
Neg. ex. covered: [[1,[43,45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 37
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X1) =. true.

PS_RULE: 38
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true.

PS_RULE: 39
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 40
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[45,46]],[2,[49]],[3,[52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 41
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 16
black(X1) =. true :-
first(X1) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 29
shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,16) cov(0,29) cov(1,25) cov(2,17) cov(2,18) cov(2,23) cov(3,24)
cov(3,27) cov(3,30) cov(3,31) cov(3,36) cov(3,38) cov(3,39) cov(3,41)
cov(4,19) cov(4,21) cov(4,28) cov(5,26) cov(5,32) cov(5,33) cov(5,34)
cov(5,35) cov(5,37) cov(5,40) cov(6,20) cov(6,22)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,16) cov(0,29) cov(1,25) cov(2,17) cov(2,18) cov(2,23) cov(3,24)
cov(3,27) cov(3,30) cov(3,31) cov(3,36) cov(3,38) cov(3,39) cov(3,41)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,18) cov(5,25) cov(4,23) cov(4,27) cov(4,36) cov(3,16) cov(3,17)
cov(3,24) cov(3,31) cov(3,39) cov(3,41) cov(2,29) cov(2,30) cov(2,38)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,18) cov(5,25) cov(4,23) cov(4,27) cov(4,36) cov(3,16) cov(3,17)
cov(3,24) cov(3,31) cov(3,39) cov(3,41)

---------------------- Specialization Step No. 3 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 42
Pos. ex. covered: [[1,[1]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
first(X1) =. true,
crl(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 43
Pos. ex. covered: [[1,[1]],[2,[]],[3,[]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[27]]]

black(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 44
Pos. ex. covered: [[1,[1]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[23]],[5,[27]]]

black(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 45
Pos. ex. covered: [[1,[1]],[2,[]],[3,[]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25]],[5,[28]]]

black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 46
Pos. ex. covered: [[1,[1,2]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 47
Pos. ex. covered: [[1,[2]],[2,[]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25]],[5,[28]]]

black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 48
Pos. ex. covered: [[1,[2]],[2,[4]],[3,[5,6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 49
Pos. ex. covered: [[1,[2]],[2,[]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[19]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X2,X1) =. true,
sqr(X2) =. true,
next(X1,X3) =. true.

PS_RULE: 50
Pos. ex. covered: [[1,[2]],[2,[4]],[3,[5]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[23]],[5,[]]]

black(X1) =. true :-
next(X2,X1) =. true,
sqr(X2) =. true,
next(X3,X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 51
Pos. ex. covered: [[1,[7]],[2,[]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 52
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 53
Pos. ex. covered: [[1,[7]],[2,[9]],[3,[11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 54
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10,11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
crl(X2) =. true.

PS_RULE: 55
Pos. ex. covered: [[1,[7]],[2,[]],[3,[11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
crl(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 56
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
crl(X2) =. true,
next(X3,X1) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 57
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
first(X1) =. true.

PS_RULE: 58
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[48]],[3,[]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 59
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 60
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 61
Pos. ex. covered: [[4,[13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 62
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X1,X3) =. true.

PS_RULE: 63
Pos. ex. covered: [[4,[13]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X3,X2) =. true.

PS_RULE: 64
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
crl(X1) =. true.

PS_RULE: 65
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
first(X2) =. true.

PS_RULE: 66
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[49]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
sqr(X1) =. true.

PS_RULE: 67
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 68
Pos. ex. covered: [[4,[14]],[5,[]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 69
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 42
black(X1) =. true :-
first(X1) =. true,
crl(X1) =. true,
next(X2,X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 46
black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 48
black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 53
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 54
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
crl(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 57
shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
first(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 65
shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
first(X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,42) cov(0,46) cov(0,48) cov(0,53) cov(0,54) cov(0,57) cov(0,65)
cov(1,43) cov(1,49) cov(1,50) cov(1,52) cov(1,56) cov(1,58) cov(1,59)
cov(1,64) cov(1,66) cov(1,67) cov(2,44) cov(2,45) cov(2,47) cov(2,51)
cov(2,55) cov(2,61) cov(2,62) cov(2,63) cov(2,69) cov(3,60) cov(3,68)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,42) cov(0,46) cov(0,48) cov(0,53) cov(0,54) cov(0,57) cov(0,65)
cov(1,43) cov(1,49) cov(1,50) cov(1,52) cov(1,56) cov(1,58) cov(1,59)
cov(1,64) cov(1,66) cov(1,67)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,46) cov(4,48) cov(4,54) cov(3,42) cov(3,50) cov(3,52) cov(3,53)
cov(3,56) cov(3,59) cov(3,67) cov(2,49) cov(2,57) cov(2,64) cov(2,65)
cov(1,43) cov(1,58) cov(1,66)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,46) cov(4,48) cov(4,54) cov(3,42) cov(3,50) cov(3,52) cov(3,53)
cov(3,56) cov(3,59) cov(3,67)

In find_best

POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(4,46) poscov(4,48) poscov(4,54) poscov(3,16) poscov(3,42) poscov(3,53) poscov(2,29)
poscov(2,57) poscov(2,65)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(4,46) poscov(4,48) poscov(4,54)

find_best/1 took 0.002 sec.

**********************************************
CLAUSE 1 ADDED TO THE LOGIC THEORY
black(X1) =. true :-
crl(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

**********************************************

example(2,1,black(x12) =. true,[pos])
example(1,1,black(x11) =. true,[pos])
example(4,2,black(x21) =. true,[pos])
example(5,3,black(x31) =. true,[pos])

The learned theory covers 4/17 examples of concepts to be learned.

SEED: object no. 1 for Concept black(_817358) =. true

SEED: object no. 1 for Concept white(_817370) =. true

SEED: object no. 4 for Concept shaded(_817382) =. true

================ Parallel Conquer for Concepts
================ [black(_817358) =. true,white(_817370) =. true,shaded(_817382) =. true]

---------------------- Specialization Step No. 1 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 73
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true.

PS_RULE: 74
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[19,20]],[3,[21,22]],[4,[24,25,26]],[5,[28,29]]]

black(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 75
Pos. ex. covered: [[1,[7]],[2,[8,9]],[3,[10,11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 76
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30,31]],[2,[33]],[3,[34,35]],[4,[36,37,38]],[5,[40]]]

white(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 77
Pos. ex. covered: [[1,[7]],[2,[8,9]],[3,[10,11]]]
Neg. ex. covered: [[1,[30,32]],[2,[]],[3,[35]],[4,[37,38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 78
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true.

PS_RULE: 79
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 80
Pos. ex. covered: [[4,[12,13,14]],[5,[15,16]]]
Neg. ex. covered: [[1,[43,44,45]],[2,[47,48]],[3,[50,51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 81
Pos. ex. covered: [[4,[13,14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,45,46]],[2,[48,49]],[3,[51,52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true.

PS_RULE: 82
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[43,44,46]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
crl(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,75) cov(3,78) cov(4,73) cov(5,79) cov(6,82) cov(7,77) cov(8,80)
cov(8,81) cov(9,76) cov(10,74)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,75) cov(3,78) cov(4,73) cov(5,79) cov(6,82) cov(7,77) cov(8,80)
cov(8,81) cov(9,76) cov(10,74)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,75) cov(5,77) cov(5,80) cov(4,81) cov(3,76) cov(3,79) cov(3,82)
cov(2,73) cov(2,74) cov(2,78)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,75) cov(5,77) cov(5,80) cov(4,81) cov(3,76) cov(3,79) cov(3,82)
cov(2,73) cov(2,74) cov(2,78)

---------------------- Specialization Step No. 2 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 83
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 84
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[24,25]],[5,[28]]]

black(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 85
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[20]],[3,[22]],[4,[25,26]],[5,[29]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 86
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 87
Pos. ex. covered: [[1,[7]],[2,[8,9]],[3,[10,11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 88
Pos. ex. covered: [[1,[7]],[2,[]],[3,[10]]]
Neg. ex. covered: [[1,[31]],[2,[]],[3,[]],[4,[37,38]],[5,[40]]]

white(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 89
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[35]],[4,[37,38]],[5,[]]]

white(X1) =. true :-
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 90
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
black(X2) =. true.

PS_RULE: 91
Pos. ex. covered: [[1,[7]],[2,[9]],[3,[11]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 92
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10,11]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
crl(X2) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 93
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

PS_RULE: 94
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 95
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 96
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 97
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[44]],[2,[47,48]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 98
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 99
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[44,45]],[2,[48]],[3,[51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 100
Pos. ex. covered: [[4,[13,14]],[5,[15,16]]]
Neg. ex. covered: [[1,[43,45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 101
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X1) =. true.

PS_RULE: 102
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true.

PS_RULE: 103
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 104
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[45,46]],[2,[49]],[3,[52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 105
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 93
shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,93) cov(1,87) cov(1,90) cov(3,86) cov(3,92) cov(3,94) cov(3,95)
cov(3,100) cov(3,102) cov(3,103) cov(3,105) cov(4,83) cov(4,84) cov(4,88)
cov(4,89) cov(5,91) cov(5,96) cov(5,97) cov(5,98) cov(5,99) cov(5,101)
cov(5,104) cov(6,85)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,93) cov(1,87) cov(1,90) cov(3,86) cov(3,92) cov(3,94) cov(3,95)
cov(3,100) cov(3,102) cov(3,103) cov(3,105)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,87) cov(4,92) cov(4,100) cov(3,86) cov(3,90) cov(3,95) cov(3,103)
cov(3,105) cov(2,93) cov(2,94) cov(2,102)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,87) cov(4,92) cov(4,100) cov(3,86) cov(3,90) cov(3,95) cov(3,103)
cov(3,105) cov(2,93) cov(2,94) cov(2,102)

---------------------- Specialization Step No. 3 ----------------------

Clauses for the concept: black(_817358) =. true

Clauses for the concept: white(_817370) =. true

PS_RULE: 106
Pos. ex. covered: [[1,[7]],[2,[]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 107
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 108
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
black(X2) =. true.

PS_RULE: 109
Pos. ex. covered: [[1,[7]],[2,[9]],[3,[11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 110
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10,11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
crl(X2) =. true.

PS_RULE: 111
Pos. ex. covered: [[1,[7]],[2,[]],[3,[]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
black(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 112
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
black(X2) =. true,
crl(X2) =. true.

PS_RULE: 113
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
black(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 114
Pos. ex. covered: [[1,[7]],[2,[]],[3,[11]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
crl(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 115
Pos. ex. covered: [[1,[7]],[2,[8]],[3,[10]]]
Neg. ex. covered: [[1,[30]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
crl(X2) =. true,
next(X3,X1) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 116
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 117
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 118
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 119
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[48]],[3,[]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 120
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 121
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 122
Pos. ex. covered: [[4,[13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 123
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X1,X3) =. true.

PS_RULE: 124
Pos. ex. covered: [[4,[13]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X3,X2) =. true.

PS_RULE: 125
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
crl(X1) =. true.

PS_RULE: 126
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
first(X2) =. true.

PS_RULE: 127
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[49]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
sqr(X1) =. true.

PS_RULE: 128
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 129
Pos. ex. covered: [[4,[14]],[5,[]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 130
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
crl(X1) =. true.

PS_RULE: 131
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true,
next(X2,X3) =. true.

PS_RULE: 132
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true,
next(X3,X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 108
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
black(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 109
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 110
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
crl(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 111
white(X1) =. true :-
next(X1,X2) =. true,
black(X2) =. true,
next(X2,X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 116
shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true,
next(X2,X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 126
shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
first(X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,108) cov(0,109) cov(0,110) cov(0,111) cov(0,116) cov(0,126) cov(1,107)
cov(1,112) cov(1,113) cov(1,115) cov(1,119) cov(1,120) cov(1,125) cov(1,127)
cov(1,128) cov(2,106) cov(2,114) cov(2,117) cov(2,122) cov(2,123) cov(2,124)
cov(2,130) cov(2,131) cov(2,132) cov(3,118) cov(3,121) cov(3,129)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,108) cov(0,109) cov(0,110) cov(0,111) cov(0,116) cov(0,126) cov(1,107)
cov(1,112) cov(1,113) cov(1,115) cov(1,119) cov(1,120) cov(1,125) cov(1,127)
cov(1,128)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,110) cov(3,107) cov(3,108) cov(3,109) cov(3,112) cov(3,113) cov(3,115)
cov(3,120) cov(3,128) cov(2,116) cov(2,125) cov(2,126) cov(1,111) cov(1,119)
cov(1,127)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,110) cov(3,107) cov(3,108) cov(3,109) cov(3,112) cov(3,113) cov(3,115)
cov(3,120) cov(3,128) cov(2,116) cov(2,125) cov(2,126)

In find_best

POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(4,110) poscov(3,108) poscov(3,109) poscov(2,93) poscov(2,116) poscov(2,126) poscov(1,111)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(4,110)

find_best/1 took 0.001 sec.

**********************************************
CLAUSE 2 ADDED TO THE LOGIC THEORY
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
crl(X2) =. true.

**********************************************

example(7,1,white(x13) =. true,[pos])
example(8,2,white(x22) =. true,[pos])
example(11,3,white(x34) =. true,[pos])
example(10,3,white(x32) =. true,[pos])

The learned theory covers 8/17 examples of concepts to be learned.

SEED: object no. 1 for Concept black(_817358) =. true

SEED: object no. 2 for Concept white(_817370) =. true

SEED: object no. 4 for Concept shaded(_817382) =. true

================ Parallel Conquer for Concepts
================ [black(_817358) =. true,white(_817370) =. true,shaded(_817382) =. true]

---------------------- Specialization Step No. 1 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 136
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true.

PS_RULE: 137
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[19,20]],[3,[21,22]],[4,[24,25,26]],[5,[28,29]]]

black(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 138
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 139
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[30,32]],[2,[]],[3,[35]],[4,[37,38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 140
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true.

PS_RULE: 141
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 142
Pos. ex. covered: [[4,[12,13,14]],[5,[15,16]]]
Neg. ex. covered: [[1,[43,44,45]],[2,[47,48]],[3,[50,51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 143
Pos. ex. covered: [[4,[13,14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,45,46]],[2,[48,49]],[3,[51,52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true.

PS_RULE: 144
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[43,44,46]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
crl(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,138) cov(3,140) cov(4,136) cov(5,141) cov(6,144) cov(7,139) cov(8,142)
cov(8,143) cov(10,137)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,138) cov(3,140) cov(4,136) cov(5,141) cov(6,144) cov(7,139) cov(8,142)
cov(8,143) cov(10,137)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,142) cov(4,143) cov(3,141) cov(3,144) cov(2,136) cov(2,137) cov(2,140)
cov(1,138) cov(1,139)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(5,142) cov(4,143) cov(3,141) cov(3,144) cov(2,136) cov(2,137) cov(2,140)
cov(1,138) cov(1,139)

---------------------- Specialization Step No. 2 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 145
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 146
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 147
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[24,25]],[5,[28]]]

black(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 148
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[20]],[3,[22]],[4,[25,26]],[5,[29]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 149
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 150
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 151
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[37,38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 152
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 153
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

PS_RULE: 154
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 155
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 156
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 157
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[44]],[2,[47,48]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 158
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 159
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[44,45]],[2,[48]],[3,[51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 160
Pos. ex. covered: [[4,[13,14]],[5,[15,16]]]
Neg. ex. covered: [[1,[43,45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 161
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X1) =. true.

PS_RULE: 162
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true.

PS_RULE: 163
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 164
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[45,46]],[2,[49]],[3,[52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 165
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 153
shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,153) cov(1,146) cov(1,149) cov(2,150) cov(3,154) cov(3,155) cov(3,160)
cov(3,162) cov(3,163) cov(3,165) cov(4,145) cov(4,147) cov(4,151) cov(5,152)
cov(5,156) cov(5,157) cov(5,158) cov(5,159) cov(5,161) cov(5,164) cov(6,148)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,153) cov(1,146) cov(1,149) cov(2,150) cov(3,154) cov(3,155) cov(3,160)
cov(3,162) cov(3,163) cov(3,165)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,160) cov(3,155) cov(3,163) cov(3,165) cov(2,146) cov(2,153) cov(2,154)
cov(2,162) cov(1,149) cov(1,150)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,160) cov(3,155) cov(3,163) cov(3,165) cov(2,146) cov(2,153) cov(2,154)
cov(2,162) cov(1,149) cov(1,150)

---------------------- Specialization Step No. 3 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 166
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

PS_RULE: 167
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
crl(X1) =. true.

PS_RULE: 168
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: white(_817370) =. true

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 169
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 170
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 171
Pos. ex. covered: [[4,[12]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[47]],[3,[50]]]

shaded(X1) =. true :-
first(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 172
Pos. ex. covered: [[4,[12]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[48]],[3,[]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
sqr(X2) =. true.

PS_RULE: 173
Pos. ex. covered: [[4,[12,13]],[5,[15]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 174
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
next(X1,X3) =. true.

PS_RULE: 175
Pos. ex. covered: [[4,[13]],[5,[15]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 176
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X1,X3) =. true.

PS_RULE: 177
Pos. ex. covered: [[4,[13]],[5,[15]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X3,X2) =. true.

PS_RULE: 178
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
crl(X1) =. true.

PS_RULE: 179
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
sqr(X2) =. true.

PS_RULE: 180
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
sqr(X1) =. true.

PS_RULE: 181
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 182
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[49]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
sqr(X1) =. true.

PS_RULE: 183
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 184
Pos. ex. covered: [[4,[14]],[5,[]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 185
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
crl(X1) =. true.

PS_RULE: 186
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true,
next(X2,X3) =. true.

PS_RULE: 187
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true,
next(X3,X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 167
black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 169
shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true,
next(X2,X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 179
shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
sqr(X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,167) cov(0,169) cov(0,179) cov(1,166) cov(1,168) cov(1,172) cov(1,173)
cov(1,178) cov(1,182) cov(1,183) cov(2,170) cov(2,175) cov(2,176) cov(2,177)
cov(2,180) cov(2,185) cov(2,186) cov(2,187) cov(3,171) cov(3,174) cov(3,181)
cov(3,184)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,167) cov(0,169) cov(0,179) cov(1,166) cov(1,168) cov(1,172) cov(1,173)
cov(1,178) cov(1,182) cov(1,183)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(3,173) cov(3,183) cov(2,166) cov(2,167) cov(2,168) cov(2,169) cov(2,178)
cov(2,179) cov(1,172) cov(1,182)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(3,173) cov(3,183) cov(2,166) cov(2,167) cov(2,168) cov(2,169) cov(2,178)
cov(2,179) cov(1,172) cov(1,182)

In find_best

POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(2,153) poscov(2,167) poscov(2,169) poscov(2,179)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(2,153) poscov(2,167) poscov(2,169) poscov(2,179)

find_best/1 took 0.001 sec.

**********************************************
CLAUSE 3 ADDED TO THE LOGIC THEORY
shaded(X1) =. true :-
first(X1) =. true,
sqr(X1) =. true.

**********************************************

example(12,4,shaded(x41) =. true,[pos])
example(15,5,shaded(x51) =. true,[pos])

The learned theory covers 10/17 examples of concepts to be learned.

SEED: object no. 1 for Concept black(_817358) =. true

SEED: object no. 2 for Concept white(_817370) =. true

SEED: object no. 4 for Concept shaded(_817382) =. true

================ Parallel Conquer for Concepts
================ [black(_817358) =. true,white(_817370) =. true,shaded(_817382) =. true]

---------------------- Specialization Step No. 1 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 191
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true.

PS_RULE: 192
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[19,20]],[3,[21,22]],[4,[24,25,26]],[5,[28,29]]]

black(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 193
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 194
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[30,32]],[2,[]],[3,[35]],[4,[37,38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 195
Pos. ex. covered: [[4,[13,14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,45,46]],[2,[48,49]],[3,[51,52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true.

PS_RULE: 196
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 197
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[43,44,45]],[2,[47,48]],[3,[50,51,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true.

PS_RULE: 198
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[43,44,46]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
crl(X1) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,193) cov(4,191) cov(5,196) cov(6,198) cov(7,194) cov(8,195) cov(8,197)
cov(10,192)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,193) cov(4,191) cov(5,196) cov(6,198) cov(7,194) cov(8,195) cov(8,197)
cov(10,192)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,195) cov(3,197) cov(3,198) cov(2,191) cov(2,192) cov(1,193) cov(1,194)
cov(1,196)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(4,195) cov(3,197) cov(3,198) cov(2,191) cov(2,192) cov(1,193) cov(1,194)
cov(1,196)

---------------------- Specialization Step No. 2 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 199
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 200
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 201
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[24,25]],[5,[28]]]

black(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 202
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[20]],[3,[22]],[4,[25,26]],[5,[29]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 203
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 204
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 205
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[37,38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 206
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 207
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true.

PS_RULE: 208
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true.

PS_RULE: 209
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 210
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48,49]],[3,[51,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X1) =. true.

PS_RULE: 211
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[44,45]],[2,[48]],[3,[51,52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
next(X3,X1) =. true.

PS_RULE: 212
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[45,46]],[2,[49]],[3,[52,53]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 213
Pos. ex. covered: [[4,[14]],[5,[16,17]]]
Neg. ex. covered: [[1,[44,46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true.

PS_RULE: 214
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
sqr(X1) =. true,
next(X2,X1) =. true.

PS_RULE: 215
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
next(X3,X2) =. true.

PS_RULE: 216
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[43,45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true.

PS_RULE: 217
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43,44]],[2,[47]],[3,[50,52]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 207
shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,207) cov(1,200) cov(1,203) cov(2,204) cov(3,208) cov(3,209) cov(3,213)
cov(3,214) cov(3,216) cov(4,199) cov(4,201) cov(4,205) cov(5,206) cov(5,210)
cov(5,211) cov(5,212) cov(5,215) cov(5,217) cov(6,202)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,207) cov(1,200) cov(1,203) cov(2,204) cov(3,208) cov(3,209) cov(3,213)
cov(3,214) cov(3,216) cov(4,199) cov(4,201) cov(4,205)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(3,209) cov(3,213) cov(3,216) cov(2,199) cov(2,200) cov(2,201) cov(2,207)
cov(2,208) cov(1,203) cov(1,204) cov(1,205) cov(1,214)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(3,209) cov(3,213) cov(3,216) cov(2,199) cov(2,200) cov(2,201) cov(2,207)
cov(2,208) cov(1,203) cov(1,204) cov(1,205) cov(1,214)

---------------------- Specialization Step No. 3 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 218
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 219
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25]],[5,[28]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 220
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 221
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

PS_RULE: 222
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 223
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[25]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: white(_817370) =. true

Clauses for the concept: shaded(_817382) =. true

PS_RULE: 224
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
first(X2) =. true.

PS_RULE: 225
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
sqr(X2) =. true.

PS_RULE: 226
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
sqr(X1) =. true.

PS_RULE: 227
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 228
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
sqr(X2) =. true.

PS_RULE: 229
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
sqr(X1) =. true.

PS_RULE: 230
Pos. ex. covered: [[4,[13]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[48]],[3,[51]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 231
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[]],[2,[49]],[3,[]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
sqr(X1) =. true.

PS_RULE: 232
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X3,X1) =. true.

PS_RULE: 233
Pos. ex. covered: [[4,[14]],[5,[]]]
Neg. ex. covered: [[1,[46]],[2,[49]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 234
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
crl(X1) =. true.

PS_RULE: 235
Pos. ex. covered: [[4,[14]],[5,[17]]]
Neg. ex. covered: [[1,[46]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true,
next(X2,X3) =. true.

PS_RULE: 236
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[44]],[2,[]],[3,[52]]]

shaded(X1) =. true :-
next(X1,X2) =. true,
crl(X1) =. true,
next(X3,X1) =. true.

PS_RULE: 237
Pos. ex. covered: [[4,[13,14]],[5,[16]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X1,X3) =. true.

PS_RULE: 238
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
next(X3,X2) =. true.

PS_RULE: 239
Pos. ex. covered: [[4,[13]],[5,[]]]
Neg. ex. covered: [[1,[45]],[2,[]],[3,[51]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
sqr(X1) =. true.

PS_RULE: 240
Pos. ex. covered: [[4,[14]],[5,[16]]]
Neg. ex. covered: [[1,[43]],[2,[]],[3,[]]]

shaded(X1) =. true :-
next(X2,X1) =. true,
crl(X2) =. true,
crl(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 218
black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 224
shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
first(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 225
shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
sqr(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 226
shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
sqr(X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 227
shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true,
next(X3,X1) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 228
shaded(X1) =. true :-
next(X1,X2) =. true,
first(X2) =. true,
sqr(X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,218) cov(0,224) cov(0,225) cov(0,226) cov(0,227) cov(0,228) cov(1,221)
cov(1,222) cov(1,231) cov(1,232) cov(1,240) cov(2,219) cov(2,223) cov(2,229)
cov(2,234) cov(2,235) cov(2,236) cov(2,237) cov(2,238) cov(2,239) cov(3,220)
cov(3,230) cov(3,233)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,218) cov(0,224) cov(0,225) cov(0,226) cov(0,227) cov(0,228) cov(1,221)
cov(1,222) cov(1,231) cov(1,232) cov(1,240)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(3,232) cov(2,218) cov(2,221) cov(2,222) cov(2,224) cov(2,225) cov(2,227)
cov(2,228) cov(2,240) cov(1,226) cov(1,231)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(3,232) cov(2,218) cov(2,221) cov(2,222) cov(2,224) cov(2,225) cov(2,227)
cov(2,228) cov(2,240) cov(1,226) cov(1,231)

In find_best

POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(2,207) poscov(2,218) poscov(2,224) poscov(2,225) poscov(2,227) poscov(2,228) poscov(1,226)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(2,207) poscov(2,218) poscov(2,224) poscov(2,225) poscov(2,227) poscov(2,228)

find_best/1 took 0.001 sec.

**********************************************
CLAUSE 4 ADDED TO THE LOGIC THEORY
shaded(X1) =. true :-
next(X1,X2) =. true,
shaded(X2) =. true.

**********************************************

example(14,4,shaded(x43) =. true,[pos])
example(13,4,shaded(x42) =. true,[pos])
example(17,5,shaded(x53) =. true,[pos])
example(16,5,shaded(x52) =. true,[pos])

The learned theory covers 14/17 examples of concepts to be learned.

SEED: object no. 1 for Concept black(_817358) =. true

SEED: object no. 2 for Concept white(_817370) =. true

The Concept shaded(_817382) =. true is learned.
================ Parallel Conquer for Concepts
================ [black(_817358) =. true,white(_817370) =. true]

---------------------- Specialization Step No. 1 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 243
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true.

PS_RULE: 244
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[19,20]],[3,[21,22]],[4,[24,25,26]],[5,[28,29]]]

black(X1) =. true :-
next(X1,X2) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 245
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 246
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[30,32]],[2,[]],[3,[35]],[4,[37,38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,245) cov(4,243) cov(7,246) cov(10,244)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,245) cov(4,243) cov(7,246) cov(10,244)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(2,243) cov(2,244) cov(1,245) cov(1,246)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(2,243) cov(2,244) cov(1,245) cov(1,246)

---------------------- Specialization Step No. 2 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 247
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[28,29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 248
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 249
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[24,25]],[5,[28]]]

black(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 250
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[20]],[3,[22]],[4,[25,26]],[5,[29]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 251
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 252
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 253
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[37,38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 254
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(1,248) cov(1,251) cov(2,252) cov(4,247) cov(4,249) cov(4,253) cov(5,254)
cov(6,250)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(1,248) cov(1,251) cov(2,252) cov(4,247) cov(4,249) cov(4,253) cov(5,254)
cov(6,250)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(2,247) cov(2,248) cov(2,249) cov(2,250) cov(1,251) cov(1,252) cov(1,253)
cov(1,254)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(2,247) cov(2,248) cov(2,249) cov(2,250) cov(1,251) cov(1,252) cov(1,253)
cov(1,254)

---------------------- Specialization Step No. 3 ----------------------

Clauses for the concept: black(_817358) =. true

PS_RULE: 255
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 256
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25]],[5,[28]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 257
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[25,26]],[5,[29]]]

black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 258
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

PS_RULE: 259
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 260
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[]],[2,[20]],[3,[]],[4,[25]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 261
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

PS_RULE: 262
Pos. ex. covered: [[1,[3]],[3,[]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[22]],[4,[26]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
next(X3,X4) =. true.

PS_RULE: 263
Pos. ex. covered: [[1,[3]],[3,[6]]]
Neg. ex. covered: [[1,[18]],[2,[20]],[3,[]],[4,[]],[5,[]]]

black(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

Clauses for the concept: white(_817370) =. true

PS_RULE: 264
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 265
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 266
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 267
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

PS_RULE: 268
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 269
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 270
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

PS_RULE: 271
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[35]],[4,[38]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
first(X3) =. true.

PS_RULE: 272
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 255
black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 264
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 266
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,255) cov(0,264) cov(0,266) cov(1,258) cov(1,259) cov(1,265) cov(2,256)
cov(2,260) cov(2,261) cov(2,262) cov(2,263) cov(2,267) cov(2,268) cov(2,270)
cov(2,272) cov(3,257) cov(3,269) cov(3,271)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,255) cov(0,264) cov(0,266) cov(1,258) cov(1,259) cov(1,265) cov(2,256)
cov(2,260) cov(2,261) cov(2,262) cov(2,263) cov(2,267) cov(2,268) cov(2,270)
cov(2,272)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(2,255) cov(2,256) cov(2,258) cov(2,259) cov(2,260) cov(2,261) cov(2,263)
cov(1,262) cov(1,264) cov(1,265) cov(1,266) cov(1,267) cov(1,268) cov(1,270)
cov(1,272)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(2,255) cov(2,256) cov(2,258) cov(2,259) cov(2,260) cov(2,261) cov(2,263)
cov(1,262) cov(1,264) cov(1,265) cov(1,266) cov(1,267) cov(1,268) cov(1,270)
cov(1,272)

In find_best

POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(2,255) poscov(1,264) poscov(1,266)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(2,255)

find_best/1 took 0.001 sec.

**********************************************
CLAUSE 5 ADDED TO THE LOGIC THEORY
black(X1) =. true :-
crl(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

**********************************************

example(3,1,black(x14) =. true,[pos])
example(6,3,black(x33) =. true,[pos])

The learned theory covers 16/17 examples of concepts to be learned.

The Concept black(_817358) =. true is learned.

SEED: object no. 2 for Concept white(_817370) =. true

================ Parallel Conquer for Concepts
================ [white(_817370) =. true]

---------------------- Specialization Step No. 1 ----------------------

Clauses for the concept: white(_817370) =. true

PS_RULE: 274
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[36,37]],[5,[40]]]

white(X1) =. true :-
sqr(X1) =. true.

PS_RULE: 275
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[30,32]],[2,[]],[3,[35]],[4,[37,38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,274) cov(7,275)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(3,274) cov(7,275)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,274) cov(1,275)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,274) cov(1,275)

---------------------- Specialization Step No. 2 ----------------------

Clauses for the concept: white(_817370) =. true

PS_RULE: 276
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true.

PS_RULE: 277
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 278
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[37,38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 279
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38,39]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(1,276) cov(2,277) cov(4,278) cov(5,279)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(1,276) cov(2,277) cov(4,278) cov(5,279)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,276) cov(1,277) cov(1,278) cov(1,279)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,276) cov(1,277) cov(1,278) cov(1,279)

---------------------- Specialization Step No. 3 ----------------------

Clauses for the concept: white(_817370) =. true

PS_RULE: 280
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

PS_RULE: 281
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[37]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
sqr(X2) =. true.

PS_RULE: 282
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

PS_RULE: 283
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

PS_RULE: 284
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 285
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 286
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

PS_RULE: 287
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[35]],[4,[38]],[5,[41]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
first(X3) =. true.

PS_RULE: 288
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 280
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 282
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,280) cov(0,282) cov(1,281) cov(2,283) cov(2,284) cov(2,286) cov(2,288)
cov(3,285) cov(3,287)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,280) cov(0,282) cov(1,281) cov(2,283) cov(2,284) cov(2,286) cov(2,288)
cov(3,285) cov(3,287)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,280) cov(1,281) cov(1,282) cov(1,283) cov(1,284) cov(1,285) cov(1,286)
cov(1,287) cov(1,288)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,280) cov(1,281) cov(1,282) cov(1,283) cov(1,284) cov(1,285) cov(1,286)
cov(1,287) cov(1,288)

---------------------- Specialization Step No. 4 ----------------------

Clauses for the concept: white(_817370) =. true

PS_RULE: 289
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

PS_RULE: 290
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 291
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 292
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

PS_RULE: 293
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true,
first(X3) =. true.

PS_RULE: 294
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[]],[4,[]],[5,[]]]

white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

PS_RULE: 295
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

PS_RULE: 296
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

PS_RULE: 297
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true,
first(X3) =. true.

PS_RULE: 298
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

PS_RULE: 299
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

PS_RULE: 300
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[35]],[4,[38]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true,
first(X3) =. true.

PS_RULE: 301
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

PS_RULE: 302
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true,
first(X3) =. true.

PS_RULE: 303
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[32]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true,
crl(X3) =. true.

PS_RULE: 304
Pos. ex. covered: [[2,[9]]]
Neg. ex. covered: [[1,[]],[2,[]],[3,[35]],[4,[]],[5,[]]]

white(X1) =. true :-
next(X1,X2) =. true,
next(X2,X3) =. true,
first(X3) =. true,
crl(X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 289
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true,
sqr(X2) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 290
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true,
next(X2,X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 291
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
sqr(X2) =. true,
next(X2,X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 292
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true,
black(X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 293
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true,
first(X3) =. true.

RULE CONSISTENT AND RANGE-RESTRICTED: 294
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
next(X2,X3) =. true,
crl(X3) =. true.

select_ps_rule

NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,289) cov(0,290) cov(0,291) cov(0,292) cov(0,293) cov(0,294) cov(1,297)
cov(1,302) cov(1,304) cov(2,295) cov(2,296) cov(2,298) cov(2,299) cov(2,300)
cov(2,301) cov(2,303)

BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,289) cov(0,290) cov(0,291) cov(0,292) cov(0,293) cov(0,294) cov(1,297)
cov(1,302) cov(1,304) cov(2,295) cov(2,296) cov(2,298) cov(2,299) cov(2,300)
cov(2,301) cov(2,303)

POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,289) cov(1,290) cov(1,291) cov(1,292) cov(1,293) cov(1,294) cov(1,295)
cov(1,296) cov(1,297) cov(1,298) cov(1,299) cov(1,300) cov(1,301) cov(1,302)
cov(1,303) cov(1,304)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(1,289) cov(1,290) cov(1,291) cov(1,292) cov(1,293) cov(1,294) cov(1,295)
cov(1,296) cov(1,297) cov(1,298) cov(1,299) cov(1,300) cov(1,301) cov(1,302)
cov(1,303) cov(1,304)

In find_best

POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,280) poscov(1,282) poscov(1,289) poscov(1,290) poscov(1,291) poscov(1,292) poscov(1,293)
poscov(1,294)

BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,280) poscov(1,282) poscov(1,289) poscov(1,290) poscov(1,291) poscov(1,292) poscov(1,293)
poscov(1,294)

find_best/1 took 0.002 sec.

**********************************************
CLAUSE 6 ADDED TO THE LOGIC THEORY
white(X1) =. true :-
sqr(X1) =. true,
next(X1,X2) =. true,
white(X2) =. true.

**********************************************

example(9,2,white(x23) =. true,[pos])

The learned theory covers 17/17 examples of concepts to be learned.

The Concept white(_817370) =. true is learned.
End of the learning process

The learning process took 4.356 s.