TSTP Solution File: SET009-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Mon Jul 18 22:45:11 EDT 2022
% Result : Unsatisfiable 0.51s 1.13s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SET009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % DateTime : Sun Jul 10 08:20:17 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.51/1.13 *** allocated 10000 integers for termspace/termends
% 0.51/1.13 *** allocated 10000 integers for clauses
% 0.51/1.13 *** allocated 10000 integers for justifications
% 0.51/1.13 Bliksem 1.12
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 Automatic Strategy Selection
% 0.51/1.13
% 0.51/1.13 Clauses:
% 0.51/1.13 [
% 0.51/1.13 [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ],
% 0.51/1.13 [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X ) ],
% 0.51/1.13 [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y ) ]
% 0.51/1.13 ,
% 0.51/1.13 [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ],
% 0.51/1.13 [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ],
% 0.51/1.13 [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y, X ) ],
% 0.51/1.13 [ ~( difference( X, Y, Z ) ), ~( member( T, Z ) ), member( T, X ) ],
% 0.51/1.13 [ ~( member( X, Y ) ), ~( member( X, Z ) ), ~( difference( T, Y, Z ) ) ]
% 0.51/1.13 ,
% 0.51/1.13 [ ~( member( X, Y ) ), ~( difference( Y, Z, T ) ), member( X, T ),
% 0.51/1.13 member( X, Z ) ],
% 0.51/1.13 [ difference( X, Y, Z ), member( k( X, Y, Z ), X ), member( k( X, Y, Z )
% 0.51/1.13 , Z ) ],
% 0.51/1.13 [ ~( member( k( X, Y, Z ), Y ) ), member( k( X, Y, Z ), Z ), difference(
% 0.51/1.13 X, Y, Z ) ],
% 0.51/1.13 [ ~( member( k( X, Y, Z ), Z ) ), ~( member( k( X, Y, Z ), X ) ), member(
% 0.51/1.13 k( X, Y, Z ), Y ), difference( X, Y, Z ) ],
% 0.51/1.13 [ subset( d, a ) ],
% 0.51/1.13 [ difference( b, a, bDa ) ],
% 0.51/1.13 [ difference( b, d, bDd ) ],
% 0.51/1.13 [ ~( subset( bDa, bDd ) ) ]
% 0.51/1.13 ] .
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 percentage equality = 0.000000, percentage horn = 0.687500
% 0.51/1.13 This a non-horn, non-equality problem
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 Options Used:
% 0.51/1.13
% 0.51/1.13 useres = 1
% 0.51/1.13 useparamod = 0
% 0.51/1.13 useeqrefl = 0
% 0.51/1.13 useeqfact = 0
% 0.51/1.13 usefactor = 1
% 0.51/1.13 usesimpsplitting = 0
% 0.51/1.13 usesimpdemod = 0
% 0.51/1.13 usesimpres = 3
% 0.51/1.13
% 0.51/1.13 resimpinuse = 1000
% 0.51/1.13 resimpclauses = 20000
% 0.51/1.13 substype = standard
% 0.51/1.13 backwardsubs = 1
% 0.51/1.13 selectoldest = 5
% 0.51/1.13
% 0.51/1.13 litorderings [0] = split
% 0.51/1.13 litorderings [1] = liftord
% 0.51/1.13
% 0.51/1.13 termordering = none
% 0.51/1.13
% 0.51/1.13 litapriori = 1
% 0.51/1.13 termapriori = 0
% 0.51/1.13 litaposteriori = 0
% 0.51/1.13 termaposteriori = 0
% 0.51/1.13 demodaposteriori = 0
% 0.51/1.13 ordereqreflfact = 0
% 0.51/1.13
% 0.51/1.13 litselect = none
% 0.51/1.13
% 0.51/1.13 maxweight = 15
% 0.51/1.13 maxdepth = 30000
% 0.51/1.13 maxlength = 115
% 0.51/1.13 maxnrvars = 195
% 0.51/1.13 excuselevel = 1
% 0.51/1.13 increasemaxweight = 1
% 0.51/1.13
% 0.51/1.13 maxselected = 10000000
% 0.51/1.13 maxnrclauses = 10000000
% 0.51/1.13
% 0.51/1.13 showgenerated = 0
% 0.51/1.13 showkept = 0
% 0.51/1.13 showselected = 0
% 0.51/1.13 showdeleted = 0
% 0.51/1.13 showresimp = 1
% 0.51/1.13 showstatus = 2000
% 0.51/1.13
% 0.51/1.13 prologoutput = 1
% 0.51/1.13 nrgoals = 5000000
% 0.51/1.13 totalproof = 1
% 0.51/1.13
% 0.51/1.13 Symbols occurring in the translation:
% 0.51/1.13
% 0.51/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.51/1.13 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.51/1.13 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 0.51/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.51/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.51/1.13 member [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.51/1.13 subset [43, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.51/1.13 'member_of_1_not_of_2' [44, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.51/1.13 'equal_sets' [45, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.51/1.13 difference [49, 3] (w:1, o:55, a:1, s:1, b:0),
% 0.51/1.13 k [51, 3] (w:1, o:56, a:1, s:1, b:0),
% 0.51/1.13 d [52, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.51/1.13 a [53, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.51/1.13 b [54, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.51/1.13 bDa [55, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.51/1.13 bDd [56, 0] (w:1, o:20, a:1, s:1, b:0).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 Starting Search:
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 Bliksems!, er is een bewijs:
% 0.51/1.13 % SZS status Unsatisfiable
% 0.51/1.13 % SZS output start Refutation
% 0.51/1.13
% 0.51/1.13 clause( 0, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 1, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y ) ]
% 0.51/1.13 )
% 0.51/1.13 .
% 0.51/1.13 clause( 2, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y
% 0.51/1.13 ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 6, [ ~( member( T, Z ) ), member( T, X ), ~( difference( X, Y, Z )
% 0.51/1.13 ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 7, [ ~( member( X, Y ) ), ~( member( X, Z ) ), ~( difference( T, Y
% 0.51/1.13 , Z ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 8, [ ~( member( X, Y ) ), member( X, T ), member( X, Z ), ~(
% 0.51/1.13 difference( Y, Z, T ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 12, [ subset( d, a ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 13, [ difference( b, a, bDa ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 14, [ difference( b, d, bDd ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 15, [ ~( subset( bDa, bDd ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 21, [ ~( member( X, d ) ), member( X, a ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 23, [ member( 'member_of_1_not_of_2'( bDa, bDd ), bDa ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 25, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), bDd ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 26, [ member( X, b ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 28, [ member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 29, [ ~( member( X, a ) ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 32, [ ~( member( X, b ) ), member( X, d ), member( X, bDd ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 33, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), a ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 34, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 41, [ member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 .
% 0.51/1.13 clause( 42, [] )
% 0.51/1.13 .
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 % SZS output end Refutation
% 0.51/1.13 found a proof!
% 0.51/1.13
% 0.51/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.51/1.13
% 0.51/1.13 initialclauses(
% 0.51/1.13 [ clause( 44, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.51/1.13 )
% 0.51/1.13 , clause( 45, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X )
% 0.51/1.13 ] )
% 0.51/1.13 , clause( 46, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X
% 0.51/1.13 , Y ) ] )
% 0.51/1.13 , clause( 47, [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ] )
% 0.51/1.13 , clause( 48, [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ] )
% 0.51/1.13 , clause( 49, [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y,
% 0.51/1.13 X ) ] )
% 0.51/1.13 , clause( 50, [ ~( difference( X, Y, Z ) ), ~( member( T, Z ) ), member( T
% 0.51/1.13 , X ) ] )
% 0.51/1.13 , clause( 51, [ ~( member( X, Y ) ), ~( member( X, Z ) ), ~( difference( T
% 0.51/1.13 , Y, Z ) ) ] )
% 0.51/1.13 , clause( 52, [ ~( member( X, Y ) ), ~( difference( Y, Z, T ) ), member( X
% 0.51/1.13 , T ), member( X, Z ) ] )
% 0.51/1.13 , clause( 53, [ difference( X, Y, Z ), member( k( X, Y, Z ), X ), member( k(
% 0.51/1.13 X, Y, Z ), Z ) ] )
% 0.51/1.13 , clause( 54, [ ~( member( k( X, Y, Z ), Y ) ), member( k( X, Y, Z ), Z ),
% 0.51/1.13 difference( X, Y, Z ) ] )
% 0.51/1.13 , clause( 55, [ ~( member( k( X, Y, Z ), Z ) ), ~( member( k( X, Y, Z ), X
% 0.51/1.13 ) ), member( k( X, Y, Z ), Y ), difference( X, Y, Z ) ] )
% 0.51/1.13 , clause( 56, [ subset( d, a ) ] )
% 0.51/1.13 , clause( 57, [ difference( b, a, bDa ) ] )
% 0.51/1.13 , clause( 58, [ difference( b, d, bDd ) ] )
% 0.51/1.13 , clause( 59, [ ~( subset( bDa, bDd ) ) ] )
% 0.51/1.13 ] ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 0, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ] )
% 0.51/1.13 , clause( 44, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.51/1.13 )
% 0.51/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.51/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 1, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y ) ]
% 0.51/1.13 )
% 0.51/1.13 , clause( 45, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X )
% 0.51/1.13 ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.51/1.13 ), ==>( 1, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 2, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y
% 0.51/1.13 ) ] )
% 0.51/1.13 , clause( 46, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X
% 0.51/1.13 , Y ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.51/1.13 ), ==>( 1, 1 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 6, [ ~( member( T, Z ) ), member( T, X ), ~( difference( X, Y, Z )
% 0.51/1.13 ) ] )
% 0.51/1.13 , clause( 50, [ ~( difference( X, Y, Z ) ), ~( member( T, Z ) ), member( T
% 0.51/1.13 , X ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.51/1.13 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 7, [ ~( member( X, Y ) ), ~( member( X, Z ) ), ~( difference( T, Y
% 0.51/1.13 , Z ) ) ] )
% 0.51/1.13 , clause( 51, [ ~( member( X, Y ) ), ~( member( X, Z ) ), ~( difference( T
% 0.51/1.13 , Y, Z ) ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.51/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 8, [ ~( member( X, Y ) ), member( X, T ), member( X, Z ), ~(
% 0.51/1.13 difference( Y, Z, T ) ) ] )
% 0.51/1.13 , clause( 52, [ ~( member( X, Y ) ), ~( difference( Y, Z, T ) ), member( X
% 0.51/1.13 , T ), member( X, Z ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.51/1.13 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 3 ), ==>( 2, 1 ), ==>( 3, 2 )] )
% 0.51/1.13 ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 12, [ subset( d, a ) ] )
% 0.51/1.13 , clause( 56, [ subset( d, a ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 13, [ difference( b, a, bDa ) ] )
% 0.51/1.13 , clause( 57, [ difference( b, a, bDa ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 14, [ difference( b, d, bDd ) ] )
% 0.51/1.13 , clause( 58, [ difference( b, d, bDd ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 15, [ ~( subset( bDa, bDd ) ) ] )
% 0.51/1.13 , clause( 59, [ ~( subset( bDa, bDd ) ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 86, [ ~( member( X, d ) ), member( X, a ) ] )
% 0.51/1.13 , clause( 0, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ]
% 0.51/1.13 )
% 0.51/1.13 , 2, clause( 12, [ subset( d, a ) ] )
% 0.51/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, d ), :=( Z, a )] ),
% 0.51/1.13 substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 21, [ ~( member( X, d ) ), member( X, a ) ] )
% 0.51/1.13 , clause( 86, [ ~( member( X, d ) ), member( X, a ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.51/1.13 1 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 87, [ member( 'member_of_1_not_of_2'( bDa, bDd ), bDa ) ] )
% 0.51/1.13 , clause( 15, [ ~( subset( bDa, bDd ) ) ] )
% 0.51/1.13 , 0, clause( 1, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y
% 0.51/1.13 ) ] )
% 0.51/1.13 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, bDa ), :=( Y, bDd )] )
% 0.51/1.13 ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 23, [ member( 'member_of_1_not_of_2'( bDa, bDd ), bDa ) ] )
% 0.51/1.13 , clause( 87, [ member( 'member_of_1_not_of_2'( bDa, bDd ), bDa ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 88, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), bDd ) ) ] )
% 0.51/1.13 , clause( 15, [ ~( subset( bDa, bDd ) ) ] )
% 0.51/1.13 , 0, clause( 2, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset(
% 0.51/1.13 X, Y ) ] )
% 0.51/1.13 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, bDa ), :=( Y, bDd )] )
% 0.51/1.13 ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 25, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), bDd ) ) ] )
% 0.51/1.13 , clause( 88, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), bDd ) ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 89, [ ~( member( X, bDa ) ), member( X, b ) ] )
% 0.51/1.13 , clause( 6, [ ~( member( T, Z ) ), member( T, X ), ~( difference( X, Y, Z
% 0.51/1.13 ) ) ] )
% 0.51/1.13 , 2, clause( 13, [ difference( b, a, bDa ) ] )
% 0.51/1.13 , 0, substitution( 0, [ :=( X, b ), :=( Y, a ), :=( Z, bDa ), :=( T, X )] )
% 0.51/1.13 , substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 26, [ member( X, b ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 , clause( 89, [ ~( member( X, bDa ) ), member( X, b ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.51/1.13 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 90, [ member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ] )
% 0.51/1.13 , clause( 26, [ member( X, b ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 , 1, clause( 23, [ member( 'member_of_1_not_of_2'( bDa, bDd ), bDa ) ] )
% 0.51/1.13 , 0, substitution( 0, [ :=( X, 'member_of_1_not_of_2'( bDa, bDd ) )] ),
% 0.51/1.13 substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 28, [ member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ] )
% 0.51/1.13 , clause( 90, [ member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 91, [ ~( member( X, a ) ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 , clause( 7, [ ~( member( X, Y ) ), ~( member( X, Z ) ), ~( difference( T,
% 0.51/1.13 Y, Z ) ) ] )
% 0.51/1.13 , 2, clause( 13, [ difference( b, a, bDa ) ] )
% 0.51/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, a ), :=( Z, bDa ), :=( T, b )] )
% 0.51/1.13 , substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 29, [ ~( member( X, a ) ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 , clause( 91, [ ~( member( X, a ) ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.51/1.13 1 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 92, [ ~( member( X, b ) ), member( X, bDd ), member( X, d ) ] )
% 0.51/1.13 , clause( 8, [ ~( member( X, Y ) ), member( X, T ), member( X, Z ), ~(
% 0.51/1.13 difference( Y, Z, T ) ) ] )
% 0.51/1.13 , 3, clause( 14, [ difference( b, d, bDd ) ] )
% 0.51/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, b ), :=( Z, d ), :=( T, bDd )] )
% 0.51/1.13 , substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 32, [ ~( member( X, b ) ), member( X, d ), member( X, bDd ) ] )
% 0.51/1.13 , clause( 92, [ ~( member( X, b ) ), member( X, bDd ), member( X, d ) ] )
% 0.51/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.51/1.13 2 ), ==>( 2, 1 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 93, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), a ) ) ] )
% 0.51/1.13 , clause( 29, [ ~( member( X, a ) ), ~( member( X, bDa ) ) ] )
% 0.51/1.13 , 1, clause( 23, [ member( 'member_of_1_not_of_2'( bDa, bDd ), bDa ) ] )
% 0.51/1.13 , 0, substitution( 0, [ :=( X, 'member_of_1_not_of_2'( bDa, bDd ) )] ),
% 0.51/1.13 substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 33, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), a ) ) ] )
% 0.51/1.13 , clause( 93, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), a ) ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 94, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ) ] )
% 0.51/1.13 , clause( 33, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), a ) ) ] )
% 0.51/1.13 , 0, clause( 21, [ ~( member( X, d ) ), member( X, a ) ] )
% 0.51/1.13 , 1, substitution( 0, [] ), substitution( 1, [ :=( X,
% 0.51/1.13 'member_of_1_not_of_2'( bDa, bDd ) )] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 34, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ) ] )
% 0.51/1.13 , clause( 94, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 95, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ), member(
% 0.51/1.13 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 , clause( 25, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), bDd ) ) ] )
% 0.51/1.13 , 0, clause( 32, [ ~( member( X, b ) ), member( X, d ), member( X, bDd ) ]
% 0.51/1.13 )
% 0.51/1.13 , 2, substitution( 0, [] ), substitution( 1, [ :=( X,
% 0.51/1.13 'member_of_1_not_of_2'( bDa, bDd ) )] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 96, [ member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 , clause( 95, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ),
% 0.51/1.13 member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 , 0, clause( 28, [ member( 'member_of_1_not_of_2'( bDa, bDd ), b ) ] )
% 0.51/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 41, [ member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 , clause( 96, [ member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 resolution(
% 0.51/1.13 clause( 97, [] )
% 0.51/1.13 , clause( 34, [ ~( member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ) ] )
% 0.51/1.13 , 0, clause( 41, [ member( 'member_of_1_not_of_2'( bDa, bDd ), d ) ] )
% 0.51/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 subsumption(
% 0.51/1.13 clause( 42, [] )
% 0.51/1.13 , clause( 97, [] )
% 0.51/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 end.
% 0.51/1.13
% 0.51/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.51/1.13
% 0.51/1.13 Memory use:
% 0.51/1.13
% 0.51/1.13 space for terms: 874
% 0.51/1.13 space for clauses: 2186
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 clauses generated: 64
% 0.51/1.13 clauses kept: 43
% 0.51/1.13 clauses selected: 28
% 0.51/1.13 clauses deleted: 1
% 0.51/1.13 clauses inuse deleted: 0
% 0.51/1.13
% 0.51/1.13 subsentry: 41
% 0.51/1.13 literals s-matched: 14
% 0.51/1.13 literals matched: 14
% 0.51/1.13 full subsumption: 2
% 0.51/1.13
% 0.51/1.13 checksum: 529530218
% 0.51/1.13
% 0.51/1.13
% 0.51/1.13 Bliksem ended
%------------------------------------------------------------------------------