TSTP Solution File: SET014-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:19 EDT 2022
% Result : Unsatisfiable 0.69s 1.11s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jul 11 10:24:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10 [
% 0.69/1.10 [ ~( member( X, 'empty_set' ) ) ],
% 0.69/1.10 [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ],
% 0.69/1.10 [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X ) ],
% 0.69/1.10 [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y ) ]
% 0.69/1.10 ,
% 0.69/1.10 [ member( X, Y ), member( X, complement( Y ) ) ],
% 0.69/1.10 [ ~( member( X, Y ) ), ~( member( X, complement( Y ) ) ) ],
% 0.69/1.10 [ ~( member( X, Y ) ), member( X, union( Y, Z ) ) ],
% 0.69/1.10 [ ~( member( X, Y ) ), member( X, union( Z, Y ) ) ],
% 0.69/1.10 [ ~( member( X, union( Y, Z ) ) ), member( X, Y ), member( X, Z ) ],
% 0.69/1.10 [ ~( member( X, Y ) ), ~( member( X, Z ) ), member( X, intersection( Y,
% 0.69/1.10 Z ) ) ],
% 0.69/1.10 [ ~( member( X, intersection( Y, Z ) ) ), member( X, Y ) ],
% 0.69/1.10 [ ~( member( X, intersection( Y, Z ) ) ), member( X, Z ) ],
% 0.69/1.10 [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ],
% 0.69/1.10 [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ],
% 0.69/1.10 [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y, X ) ],
% 0.69/1.10 [ 'equal_sets'( X, X ) ],
% 0.69/1.10 [ ~( 'equal_sets'( X, Y ) ), 'equal_sets'( Y, X ) ],
% 0.69/1.10 [ ~( 'equal_sets'( X, Y ) ), ~( 'equal_sets'( Y, Z ) ), 'equal_sets'( X
% 0.69/1.10 , Z ) ],
% 0.69/1.10 [ 'equal_elements'( X, X ) ],
% 0.69/1.10 [ ~( 'equal_elements'( X, Y ) ), 'equal_elements'( Y, X ) ],
% 0.69/1.10 [ ~( 'equal_elements'( X, Y ) ), ~( 'equal_elements'( Y, Z ) ),
% 0.69/1.10 'equal_elements'( X, Z ) ],
% 0.69/1.10 [ subset( as, cs ) ],
% 0.69/1.10 [ subset( bs, cs ) ],
% 0.69/1.10 [ ~( subset( union( as, bs ), cs ) ) ]
% 0.69/1.10 ] .
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.000000, percentage horn = 0.875000
% 0.69/1.10 This a non-horn, non-equality problem
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 0
% 0.69/1.10 useeqrefl = 0
% 0.69/1.10 useeqfact = 0
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 0
% 0.69/1.10 usesimpres = 3
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = standard
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = liftord
% 0.69/1.10
% 0.69/1.10 termordering = none
% 0.69/1.10
% 0.69/1.10 litapriori = 1
% 0.69/1.10 termapriori = 0
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = none
% 0.69/1.10
% 0.69/1.10 maxweight = 15
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 1
% 0.69/1.10 increasemaxweight = 1
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 1
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:30, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:0, o:24, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 'empty_set' [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.69/1.10 member [41, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.69/1.10 subset [45, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.69/1.10 'member_of_1_not_of_2' [46, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.69/1.11 complement [48, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.69/1.11 union [50, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.69/1.11 intersection [51, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.69/1.11 'equal_sets' [52, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.69/1.11 'equal_elements' [56, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.69/1.11 as [59, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.11 cs [60, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.11 bs [61, 0] (w:1, o:22, a:1, s:1, b:0).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Starting Search:
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksems!, er is een bewijs:
% 0.69/1.11 % SZS status Unsatisfiable
% 0.69/1.11 % SZS output start Refutation
% 0.69/1.11
% 0.69/1.11 clause( 1, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 2, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y ) ]
% 0.69/1.11 )
% 0.69/1.11 .
% 0.69/1.11 clause( 3, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y
% 0.69/1.11 ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 8, [ member( X, Y ), member( X, Z ), ~( member( X, union( Y, Z ) )
% 0.69/1.11 ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 21, [ subset( as, cs ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 22, [ subset( bs, cs ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 23, [ ~( subset( union( as, bs ), cs ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 26, [ ~( member( X, as ) ), member( X, cs ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 27, [ ~( member( X, bs ) ), member( X, cs ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 29, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), union(
% 0.69/1.11 as, bs ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 31, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), cs
% 0.69/1.11 ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 68, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs
% 0.69/1.11 ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 69, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), as
% 0.69/1.11 ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 541, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs )
% 0.69/1.11 ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 545, [] )
% 0.69/1.11 .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 % SZS output end Refutation
% 0.69/1.11 found a proof!
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 initialclauses(
% 0.69/1.11 [ clause( 547, [ ~( member( X, 'empty_set' ) ) ] )
% 0.69/1.11 , clause( 548, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 549, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X
% 0.69/1.11 ) ] )
% 0.69/1.11 , clause( 550, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset(
% 0.69/1.11 X, Y ) ] )
% 0.69/1.11 , clause( 551, [ member( X, Y ), member( X, complement( Y ) ) ] )
% 0.69/1.11 , clause( 552, [ ~( member( X, Y ) ), ~( member( X, complement( Y ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 553, [ ~( member( X, Y ) ), member( X, union( Y, Z ) ) ] )
% 0.69/1.11 , clause( 554, [ ~( member( X, Y ) ), member( X, union( Z, Y ) ) ] )
% 0.69/1.11 , clause( 555, [ ~( member( X, union( Y, Z ) ) ), member( X, Y ), member( X
% 0.69/1.11 , Z ) ] )
% 0.69/1.11 , clause( 556, [ ~( member( X, Y ) ), ~( member( X, Z ) ), member( X,
% 0.69/1.11 intersection( Y, Z ) ) ] )
% 0.69/1.11 , clause( 557, [ ~( member( X, intersection( Y, Z ) ) ), member( X, Y ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 558, [ ~( member( X, intersection( Y, Z ) ) ), member( X, Z ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 559, [ ~( 'equal_sets'( X, Y ) ), subset( X, Y ) ] )
% 0.69/1.11 , clause( 560, [ ~( 'equal_sets'( X, Y ) ), subset( Y, X ) ] )
% 0.69/1.11 , clause( 561, [ ~( subset( X, Y ) ), ~( subset( Y, X ) ), 'equal_sets'( Y
% 0.69/1.11 , X ) ] )
% 0.69/1.11 , clause( 562, [ 'equal_sets'( X, X ) ] )
% 0.69/1.11 , clause( 563, [ ~( 'equal_sets'( X, Y ) ), 'equal_sets'( Y, X ) ] )
% 0.69/1.11 , clause( 564, [ ~( 'equal_sets'( X, Y ) ), ~( 'equal_sets'( Y, Z ) ),
% 0.69/1.11 'equal_sets'( X, Z ) ] )
% 0.69/1.11 , clause( 565, [ 'equal_elements'( X, X ) ] )
% 0.69/1.11 , clause( 566, [ ~( 'equal_elements'( X, Y ) ), 'equal_elements'( Y, X ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 567, [ ~( 'equal_elements'( X, Y ) ), ~( 'equal_elements'( Y, Z )
% 0.69/1.11 ), 'equal_elements'( X, Z ) ] )
% 0.69/1.11 , clause( 568, [ subset( as, cs ) ] )
% 0.69/1.11 , clause( 569, [ subset( bs, cs ) ] )
% 0.69/1.11 , clause( 570, [ ~( subset( union( as, bs ), cs ) ) ] )
% 0.69/1.11 ] ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 1, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ] )
% 0.69/1.11 , clause( 548, [ ~( member( X, Y ) ), ~( subset( Y, Z ) ), member( X, Z ) ]
% 0.69/1.11 )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 2, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 549, [ subset( X, Y ), member( 'member_of_1_not_of_2'( X, Y ), X
% 0.69/1.11 ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.11 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 3, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset( X, Y
% 0.69/1.11 ) ] )
% 0.69/1.11 , clause( 550, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset(
% 0.69/1.11 X, Y ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.11 ), ==>( 1, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 8, [ member( X, Y ), member( X, Z ), ~( member( X, union( Y, Z ) )
% 0.69/1.11 ) ] )
% 0.69/1.11 , clause( 555, [ ~( member( X, union( Y, Z ) ) ), member( X, Y ), member( X
% 0.69/1.11 , Z ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 21, [ subset( as, cs ) ] )
% 0.69/1.11 , clause( 568, [ subset( as, cs ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 22, [ subset( bs, cs ) ] )
% 0.69/1.11 , clause( 569, [ subset( bs, cs ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 23, [ ~( subset( union( as, bs ), cs ) ) ] )
% 0.69/1.11 , clause( 570, [ ~( subset( union( as, bs ), cs ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 587, [ ~( member( X, as ) ), member( X, cs ) ] )
% 0.69/1.11 , clause( 1, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , 2, clause( 21, [ subset( as, cs ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, as ), :=( Z, cs )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 26, [ ~( member( X, as ) ), member( X, cs ) ] )
% 0.69/1.11 , clause( 587, [ ~( member( X, as ) ), member( X, cs ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 588, [ ~( member( X, bs ) ), member( X, cs ) ] )
% 0.69/1.11 , clause( 1, [ ~( member( X, Y ) ), member( X, Z ), ~( subset( Y, Z ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , 2, clause( 22, [ subset( bs, cs ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, bs ), :=( Z, cs )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 27, [ ~( member( X, bs ) ), member( X, cs ) ] )
% 0.69/1.11 , clause( 588, [ ~( member( X, bs ) ), member( X, cs ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 589, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), union(
% 0.69/1.11 as, bs ) ) ] )
% 0.69/1.11 , clause( 23, [ ~( subset( union( as, bs ), cs ) ) ] )
% 0.69/1.11 , 0, clause( 2, [ member( 'member_of_1_not_of_2'( X, Y ), X ), subset( X, Y
% 0.69/1.11 ) ] )
% 0.69/1.11 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, union( as, bs ) ),
% 0.69/1.11 :=( Y, cs )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 29, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), union(
% 0.69/1.11 as, bs ) ) ] )
% 0.69/1.11 , clause( 589, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 union( as, bs ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 590, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), cs
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 23, [ ~( subset( union( as, bs ), cs ) ) ] )
% 0.69/1.11 , 0, clause( 3, [ ~( member( 'member_of_1_not_of_2'( X, Y ), Y ) ), subset(
% 0.69/1.11 X, Y ) ] )
% 0.69/1.11 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, union( as, bs ) ),
% 0.69/1.11 :=( Y, cs )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 31, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), cs
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 590, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 cs ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 591, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 31, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 cs ) ) ] )
% 0.69/1.11 , 0, clause( 27, [ ~( member( X, bs ) ), member( X, cs ) ] )
% 0.69/1.11 , 1, substitution( 0, [] ), substitution( 1, [ :=( X,
% 0.69/1.11 'member_of_1_not_of_2'( union( as, bs ), cs ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 68, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 591, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 bs ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 592, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), as
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 31, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 cs ) ) ] )
% 0.69/1.11 , 0, clause( 26, [ ~( member( X, as ) ), member( X, cs ) ] )
% 0.69/1.11 , 1, substitution( 0, [] ), substitution( 1, [ :=( X,
% 0.69/1.11 'member_of_1_not_of_2'( union( as, bs ), cs ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 69, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ), as
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 592, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 as ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 593, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), as )
% 0.69/1.11 , member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs ) ] )
% 0.69/1.11 , clause( 8, [ member( X, Y ), member( X, Z ), ~( member( X, union( Y, Z )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , 2, clause( 29, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 union( as, bs ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 'member_of_1_not_of_2'( union( as, bs ), cs
% 0.69/1.11 ) ), :=( Y, as ), :=( Z, bs )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 594, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs )
% 0.69/1.11 ] )
% 0.69/1.11 , clause( 69, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 as ) ) ] )
% 0.69/1.11 , 0, clause( 593, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 as ), member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 541, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs )
% 0.69/1.11 ] )
% 0.69/1.11 , clause( 594, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ), bs
% 0.69/1.11 ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 595, [] )
% 0.69/1.11 , clause( 68, [ ~( member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 bs ) ) ] )
% 0.69/1.11 , 0, clause( 541, [ member( 'member_of_1_not_of_2'( union( as, bs ), cs ),
% 0.69/1.11 bs ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 545, [] )
% 0.69/1.11 , clause( 595, [] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 end.
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 6561
% 0.69/1.11 space for clauses: 30842
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 708
% 0.69/1.11 clauses kept: 546
% 0.69/1.11 clauses selected: 71
% 0.69/1.11 clauses deleted: 1
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 1529
% 0.69/1.11 literals s-matched: 631
% 0.69/1.11 literals matched: 631
% 0.69/1.11 full subsumption: 247
% 0.69/1.11
% 0.69/1.11 checksum: 686355898
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------