%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CSR031+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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 : Fri Jul 15 02:01:00 EDT 2022
% Result : Theorem 0.46s 1.16s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CSR031+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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 : Sat Jun 11 03:49:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/1.16 *** allocated 10000 integers for termspace/termends
% 0.46/1.16 *** allocated 10000 integers for clauses
% 0.46/1.16 *** allocated 10000 integers for justifications
% 0.46/1.16 Bliksem 1.12
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Automatic Strategy Selection
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Clauses:
% 0.46/1.16
% 0.46/1.16 { genlmt( c_universalvocabularymt, c_corecyclmt ) }.
% 0.46/1.16 { transitivebinarypredicate( c_genlmt ) }.
% 0.46/1.16 { genlmt( c_corecyclmt, c_logicaltruthmt ) }.
% 0.46/1.16 { ! collection( X ), ! individual( X ) }.
% 0.46/1.16 { disjointwith( c_collection, c_individual ) }.
% 0.46/1.16 { individual( c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith( Y, Z ) }.
% 0.46/1.16 { ! genlinverse( X, Z ), ! genlinverse( Z, Y ), genlpreds( X, Y ) }.
% 0.46/1.16 { arg2isa( c_disjointwith, c_collection ) }.
% 0.46/1.16 { ! disjointwith( Y, X ), collection( X ) }.
% 0.46/1.16 { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith( Y, Z ) }.
% 0.46/1.16 { ! genlinverse( X, Z ), ! genlinverse( Z, Y ), genlpreds( X, Y ) }.
% 0.46/1.16 { ! arg2isa( Y, X ), collection( X ) }.
% 0.46/1.16 { ! arg2isa( X, Y ), relation( X ) }.
% 0.46/1.16 { ! arg2isa( X, Z ), ! genls( Z, Y ), arg2isa( X, Y ) }.
% 0.46/1.16 { ! arg2isa( X, Z ), ! genls( Z, Y ), arg2isa( X, Y ) }.
% 0.46/1.16 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.46/1.16 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.46/1.16 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.46/1.16 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.46/1.16 { ! genlpreds( X, Z ), ! genlpreds( Z, Y ), genlpreds( X, Y ) }.
% 0.46/1.16 { ! predicate( X ), genlpreds( X, X ) }.
% 0.46/1.16 { ! predicate( X ), genlpreds( X, X ) }.
% 0.46/1.16 { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.46/1.16 { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.46/1.16 { ! genlinverse( Z, X ), ! genlpreds( Y, Z ), genlinverse( Y, X ) }.
% 0.46/1.16 { ! genlinverse( X, Z ), ! genlpreds( Z, Y ), genlinverse( X, Y ) }.
% 0.46/1.16 { mtvisible( c_basekb ) }.
% 0.46/1.16 { ! isa( X, c_individual ), individual( X ) }.
% 0.46/1.16 { ! individual( X ), isa( X, c_individual ) }.
% 0.46/1.16 { ! isa( X, c_collection ), collection( X ) }.
% 0.46/1.16 { ! collection( X ), isa( X, c_collection ) }.
% 0.46/1.16 { ! disjointwith( Y, X ), collection( X ) }.
% 0.46/1.16 { ! disjointwith( X, Y ), collection( X ) }.
% 0.46/1.16 { ! disjointwith( X, Y ), disjointwith( Y, X ) }.
% 0.46/1.16 { ! disjointwith( X, Z ), ! genls( Y, Z ), disjointwith( X, Y ) }.
% 0.46/1.16 { ! disjointwith( Z, X ), ! genls( Y, Z ), disjointwith( Y, X ) }.
% 0.46/1.16 { mtvisible( c_logicaltruthmt ) }.
% 0.46/1.16 { ! isa( X, c_transitivebinarypredicate ), transitivebinarypredicate( X ) }
% 0.46/1.16 .
% 0.46/1.16 { ! transitivebinarypredicate( X ), isa( X, c_transitivebinarypredicate ) }
% 0.46/1.16 .
% 0.46/1.16 { ! isa( Y, X ), collection( X ) }.
% 0.46/1.16 { ! isa( Y, X ), collection( X ) }.
% 0.46/1.16 { ! isa( X, Y ), thing( X ) }.
% 0.46/1.16 { ! isa( X, Y ), thing( X ) }.
% 0.46/1.16 { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y ) }.
% 0.46/1.16 { mtvisible( c_corecyclmt ) }.
% 0.46/1.16 { ! mtvisible( Y ), ! genlmt( Y, X ), mtvisible( X ) }.
% 0.46/1.16 { ! genlmt( Y, X ), microtheory( X ) }.
% 0.46/1.16 { ! genlmt( Y, X ), microtheory( X ) }.
% 0.46/1.16 { ! genlmt( X, Y ), microtheory( X ) }.
% 0.46/1.16 { ! genlmt( X, Y ), microtheory( X ) }.
% 0.46/1.16 { ! genlmt( X, Z ), ! genlmt( Z, Y ), genlmt( X, Y ) }.
% 0.46/1.16 { ! microtheory( X ), genlmt( X, X ) }.
% 0.46/1.16 { ! microtheory( X ), genlmt( X, X ) }.
% 0.46/1.16 { mtvisible( c_universalvocabularymt ) }.
% 0.46/1.16 { disjointwith( c_tptptptpcol_16_8398, c_tptpcol_16_18488 ) }.
% 0.46/1.16
% 0.46/1.16 percentage equality = 0.000000, percentage horn = 1.000000
% 0.46/1.16 This is a near-Horn, non-equality problem
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Options Used:
% 0.46/1.16
% 0.46/1.16 useres = 1
% 0.46/1.16 useparamod = 0
% 0.46/1.16 useeqrefl = 0
% 0.46/1.16 useeqfact = 0
% 0.46/1.16 usefactor = 1
% 0.46/1.16 usesimpsplitting = 0
% 0.46/1.16 usesimpdemod = 0
% 0.46/1.16 usesimpres = 4
% 0.46/1.16
% 0.46/1.16 resimpinuse = 1000
% 0.46/1.16 resimpclauses = 20000
% 0.46/1.16 substype = standard
% 0.46/1.16 backwardsubs = 1
% 0.46/1.16 selectoldest = 5
% 0.46/1.16
% 0.46/1.16 litorderings [0] = split
% 0.46/1.16 litorderings [1] = liftord
% 0.46/1.16
% 0.46/1.16 termordering = none
% 0.46/1.16
% 0.46/1.16 litapriori = 1
% 0.46/1.16 termapriori = 0
% 0.46/1.16 litaposteriori = 0
% 0.46/1.16 termaposteriori = 0
% 0.46/1.16 demodaposteriori = 0
% 0.46/1.16 ordereqreflfact = 0
% 0.46/1.16
% 0.46/1.16 litselect = negative
% 0.46/1.16
% 0.46/1.16 maxweight = 30000
% 0.46/1.16 maxdepth = 30000
% 0.46/1.16 maxlength = 115
% 0.46/1.16 maxnrvars = 195
% 0.46/1.16 excuselevel = 0
% 0.46/1.16 increasemaxweight = 0
% 0.46/1.16
% 0.46/1.16 maxselected = 10000000
% 0.46/1.16 maxnrclauses = 10000000
% 0.46/1.16
% 0.46/1.16 showgenerated = 0
% 0.46/1.16 showkept = 0
% 0.46/1.16 showselected = 0
% 0.46/1.16 showdeleted = 0
% 0.46/1.16 showresimp = 1
% 0.46/1.16 showstatus = 2000
% 0.46/1.16
% 0.46/1.16 prologoutput = 0
% 0.46/1.16 nrgoals = 5000000
% 0.46/1.16 totalproof = 1
% 0.46/1.16
% 0.46/1.16 Symbols occurring in the translation:
% 0.46/1.16
% 0.46/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.16 . [1, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.46/1.16 ! [4, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.46/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.16 c_universalvocabularymt [35, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.46/1.16 c_corecyclmt [36, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.46/1.16 genlmt [37, 2] (w:1, o:71, a:1, s:1, b:0),
% 0.46/1.16 c_genlmt [38, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.46/1.16 transitivebinarypredicate [39, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.46/1.16 c_logicaltruthmt [40, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.46/1.16 collection [42, 1] (w:1, o:40, a:1, s:1, b:0),
% 0.46/1.16 individual [43, 1] (w:1, o:41, a:1, s:1, b:0),
% 0.46/1.16 c_collection [44, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.46/1.16 c_individual [45, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.46/1.16 disjointwith [46, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.46/1.16 c_tptptptpcol_16_8398 [47, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.46/1.16 isa [50, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.46/1.16 genlinverse [54, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.46/1.16 genlpreds [55, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.46/1.16 c_disjointwith [56, 0] (w:1, o:24, a:1, s:1, b:0),
% 0.46/1.16 arg2isa [57, 2] (w:1, o:76, a:1, s:1, b:0),
% 0.46/1.16 relation [61, 1] (w:1, o:42, a:1, s:1, b:0),
% 0.46/1.16 genls [64, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.46/1.16 predicate [65, 1] (w:1, o:43, a:1, s:1, b:0),
% 0.46/1.16 binarypredicate [69, 1] (w:1, o:39, a:1, s:1, b:0),
% 0.46/1.16 c_basekb [70, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.46/1.16 mtvisible [71, 1] (w:1, o:44, a:1, s:1, b:0),
% 0.46/1.16 c_transitivebinarypredicate [72, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.46/1.16 thing [73, 1] (w:1, o:45, a:1, s:1, b:0),
% 0.46/1.16 microtheory [76, 1] (w:1, o:46, a:1, s:1, b:0),
% 0.46/1.16 c_tptpcol_16_18488 [77, 0] (w:1, o:8, a:1, s:1, b:0).
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Starting Search:
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Bliksems!, er is een bewijs:
% 0.46/1.16 % SZS status Theorem
% 0.46/1.16 % SZS output start Refutation
% 0.46/1.16
% 0.46/1.16 (3) {G0,W6,D2,L2,V1,M1} I { ! individual( X ), ! collection( X ) }.
% 0.46/1.16 (5) {G0,W2,D2,L1,V0,M1} I { individual( c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 (26) {G0,W6,D2,L2,V2,M1} I { collection( X ), ! disjointwith( X, Y ) }.
% 0.46/1.16 (43) {G0,W3,D2,L1,V0,M1} I { disjointwith( c_tptptptpcol_16_8398,
% 0.46/1.16 c_tptpcol_16_18488 ) }.
% 0.46/1.16 (50) {G1,W2,D2,L1,V0,M1} R(26,43) { collection( c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 (54) {G2,W0,D0,L0,V0,M0} R(50,3);r(5) { }.
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 % SZS output end Refutation
% 0.46/1.16 found a proof!
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Unprocessed initial clauses:
% 0.46/1.16
% 0.46/1.16 (56) {G0,W3,D2,L1,V0,M1} { genlmt( c_universalvocabularymt, c_corecyclmt )
% 0.46/1.16 }.
% 0.46/1.16 (57) {G0,W2,D2,L1,V0,M1} { transitivebinarypredicate( c_genlmt ) }.
% 0.46/1.16 (58) {G0,W3,D2,L1,V0,M1} { genlmt( c_corecyclmt, c_logicaltruthmt ) }.
% 0.46/1.16 (59) {G0,W6,D2,L2,V1,M2} { ! collection( X ), ! individual( X ) }.
% 0.46/1.16 (60) {G0,W3,D2,L1,V0,M1} { disjointwith( c_collection, c_individual ) }.
% 0.46/1.16 (61) {G0,W2,D2,L1,V0,M1} { individual( c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 (62) {G0,W12,D2,L3,V3,M3} { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith(
% 0.46/1.16 Y, Z ) }.
% 0.46/1.16 (63) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlinverse( Z, Y ),
% 0.46/1.16 genlpreds( X, Y ) }.
% 0.46/1.16 (64) {G0,W3,D2,L1,V0,M1} { arg2isa( c_disjointwith, c_collection ) }.
% 0.46/1.16 (65) {G0,W6,D2,L2,V2,M2} { ! disjointwith( Y, X ), collection( X ) }.
% 0.46/1.16 (66) {G0,W12,D2,L3,V3,M3} { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith(
% 0.46/1.16 Y, Z ) }.
% 0.46/1.16 (67) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlinverse( Z, Y ),
% 0.46/1.16 genlpreds( X, Y ) }.
% 0.46/1.16 (68) {G0,W6,D2,L2,V2,M2} { ! arg2isa( Y, X ), collection( X ) }.
% 0.46/1.16 (69) {G0,W6,D2,L2,V2,M2} { ! arg2isa( X, Y ), relation( X ) }.
% 0.46/1.16 (70) {G0,W11,D2,L3,V3,M3} { ! arg2isa( X, Z ), ! genls( Z, Y ), arg2isa( X
% 0.46/1.16 , Y ) }.
% 0.46/1.16 (71) {G0,W11,D2,L3,V3,M3} { ! arg2isa( X, Z ), ! genls( Z, Y ), arg2isa( X
% 0.46/1.16 , Y ) }.
% 0.46/1.16 (72) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.46/1.16 (73) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.46/1.16 (74) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.46/1.16 (75) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.46/1.16 (76) {G0,W11,D2,L3,V3,M3} { ! genlpreds( X, Z ), ! genlpreds( Z, Y ),
% 0.46/1.16 genlpreds( X, Y ) }.
% 0.46/1.16 (77) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.46/1.16 (78) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.46/1.16 (79) {G0,W6,D2,L2,V2,M2} { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.46/1.16 (80) {G0,W6,D2,L2,V2,M2} { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.46/1.16 (81) {G0,W11,D2,L3,V3,M3} { ! genlinverse( Z, X ), ! genlpreds( Y, Z ),
% 0.46/1.16 genlinverse( Y, X ) }.
% 0.46/1.16 (82) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlpreds( Z, Y ),
% 0.46/1.16 genlinverse( X, Y ) }.
% 0.46/1.16 (83) {G0,W2,D2,L1,V0,M1} { mtvisible( c_basekb ) }.
% 0.46/1.16 (84) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_individual ), individual( X ) }.
% 0.46/1.16 (85) {G0,W6,D2,L2,V1,M2} { ! individual( X ), isa( X, c_individual ) }.
% 0.46/1.16 (86) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_collection ), collection( X ) }.
% 0.46/1.16 (87) {G0,W6,D2,L2,V1,M2} { ! collection( X ), isa( X, c_collection ) }.
% 0.46/1.16 (88) {G0,W6,D2,L2,V2,M2} { ! disjointwith( Y, X ), collection( X ) }.
% 0.46/1.16 (89) {G0,W6,D2,L2,V2,M2} { ! disjointwith( X, Y ), collection( X ) }.
% 0.46/1.16 (90) {G0,W7,D2,L2,V2,M2} { ! disjointwith( X, Y ), disjointwith( Y, X )
% 0.46/1.16 }.
% 0.46/1.16 (91) {G0,W11,D2,L3,V3,M3} { ! disjointwith( X, Z ), ! genls( Y, Z ),
% 0.46/1.16 disjointwith( X, Y ) }.
% 0.46/1.16 (92) {G0,W11,D2,L3,V3,M3} { ! disjointwith( Z, X ), ! genls( Y, Z ),
% 0.46/1.16 disjointwith( Y, X ) }.
% 0.46/1.16 (93) {G0,W2,D2,L1,V0,M1} { mtvisible( c_logicaltruthmt ) }.
% 0.46/1.16 (94) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_transitivebinarypredicate ),
% 0.46/1.16 transitivebinarypredicate( X ) }.
% 0.46/1.16 (95) {G0,W6,D2,L2,V1,M2} { ! transitivebinarypredicate( X ), isa( X,
% 0.46/1.16 c_transitivebinarypredicate ) }.
% 0.46/1.16 (96) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.46/1.16 (97) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.46/1.16 (98) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.46/1.16 (99) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.46/1.16 (100) {G0,W11,D2,L3,V3,M3} { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y )
% 0.46/1.16 }.
% 0.46/1.16 (101) {G0,W2,D2,L1,V0,M1} { mtvisible( c_corecyclmt ) }.
% 0.46/1.16 (102) {G0,W9,D2,L3,V2,M3} { ! mtvisible( Y ), ! genlmt( Y, X ), mtvisible
% 0.46/1.16 ( X ) }.
% 0.46/1.16 (103) {G0,W6,D2,L2,V2,M2} { ! genlmt( Y, X ), microtheory( X ) }.
% 0.46/1.16 (104) {G0,W6,D2,L2,V2,M2} { ! genlmt( Y, X ), microtheory( X ) }.
% 0.46/1.16 (105) {G0,W6,D2,L2,V2,M2} { ! genlmt( X, Y ), microtheory( X ) }.
% 0.46/1.16 (106) {G0,W6,D2,L2,V2,M2} { ! genlmt( X, Y ), microtheory( X ) }.
% 0.46/1.16 (107) {G0,W11,D2,L3,V3,M3} { ! genlmt( X, Z ), ! genlmt( Z, Y ), genlmt( X
% 0.46/1.16 , Y ) }.
% 0.46/1.16 (108) {G0,W6,D2,L2,V1,M2} { ! microtheory( X ), genlmt( X, X ) }.
% 0.46/1.16 (109) {G0,W6,D2,L2,V1,M2} { ! microtheory( X ), genlmt( X, X ) }.
% 0.46/1.16 (110) {G0,W2,D2,L1,V0,M1} { mtvisible( c_universalvocabularymt ) }.
% 0.46/1.16 (111) {G0,W3,D2,L1,V0,M1} { disjointwith( c_tptptptpcol_16_8398,
% 0.46/1.16 c_tptpcol_16_18488 ) }.
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Total Proof:
% 0.46/1.16
% 0.46/1.16 subsumption: (3) {G0,W6,D2,L2,V1,M1} I { ! individual( X ), ! collection( X
% 0.46/1.16 ) }.
% 0.46/1.16 parent0: (59) {G0,W6,D2,L2,V1,M2} { ! collection( X ), ! individual( X )
% 0.46/1.16 }.
% 0.46/1.16 substitution0:
% 0.46/1.16 X := X
% 0.46/1.16 end
% 0.46/1.16 permutation0:
% 0.46/1.16 0 ==> 1
% 0.46/1.16 1 ==> 0
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 subsumption: (5) {G0,W2,D2,L1,V0,M1} I { individual( c_tptptptpcol_16_8398
% 0.46/1.16 ) }.
% 0.46/1.16 parent0: (61) {G0,W2,D2,L1,V0,M1} { individual( c_tptptptpcol_16_8398 )
% 0.46/1.16 }.
% 0.46/1.16 substitution0:
% 0.46/1.16 end
% 0.46/1.16 permutation0:
% 0.46/1.16 0 ==> 0
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 subsumption: (26) {G0,W6,D2,L2,V2,M1} I { collection( X ), ! disjointwith(
% 0.46/1.16 X, Y ) }.
% 0.46/1.16 parent0: (89) {G0,W6,D2,L2,V2,M2} { ! disjointwith( X, Y ), collection( X
% 0.46/1.16 ) }.
% 0.46/1.16 substitution0:
% 0.46/1.16 X := X
% 0.46/1.16 Y := Y
% 0.46/1.16 end
% 0.46/1.16 permutation0:
% 0.46/1.16 0 ==> 1
% 0.46/1.16 1 ==> 0
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 subsumption: (43) {G0,W3,D2,L1,V0,M1} I { disjointwith(
% 0.46/1.16 c_tptptptpcol_16_8398, c_tptpcol_16_18488 ) }.
% 0.46/1.16 parent0: (111) {G0,W3,D2,L1,V0,M1} { disjointwith( c_tptptptpcol_16_8398,
% 0.46/1.16 c_tptpcol_16_18488 ) }.
% 0.46/1.16 substitution0:
% 0.46/1.16 end
% 0.46/1.16 permutation0:
% 0.46/1.16 0 ==> 0
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 resolution: (123) {G1,W2,D2,L1,V0,M1} { collection( c_tptptptpcol_16_8398
% 0.46/1.16 ) }.
% 0.46/1.16 parent0[1]: (26) {G0,W6,D2,L2,V2,M1} I { collection( X ), ! disjointwith( X
% 0.46/1.16 , Y ) }.
% 0.46/1.16 parent1[0]: (43) {G0,W3,D2,L1,V0,M1} I { disjointwith(
% 0.46/1.16 c_tptptptpcol_16_8398, c_tptpcol_16_18488 ) }.
% 0.46/1.16 substitution0:
% 0.46/1.16 X := c_tptptptpcol_16_8398
% 0.46/1.16 Y := c_tptpcol_16_18488
% 0.46/1.16 end
% 0.46/1.16 substitution1:
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 subsumption: (50) {G1,W2,D2,L1,V0,M1} R(26,43) { collection(
% 0.46/1.16 c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 parent0: (123) {G1,W2,D2,L1,V0,M1} { collection( c_tptptptpcol_16_8398 )
% 0.46/1.16 }.
% 0.46/1.16 substitution0:
% 0.46/1.16 end
% 0.46/1.16 permutation0:
% 0.46/1.16 0 ==> 0
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 resolution: (124) {G1,W3,D2,L1,V0,M1} { ! individual(
% 0.46/1.16 c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 parent0[1]: (3) {G0,W6,D2,L2,V1,M1} I { ! individual( X ), ! collection( X
% 0.46/1.16 ) }.
% 0.46/1.16 parent1[0]: (50) {G1,W2,D2,L1,V0,M1} R(26,43) { collection(
% 0.46/1.16 c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 substitution0:
% 0.46/1.16 X := c_tptptptpcol_16_8398
% 0.46/1.16 end
% 0.46/1.16 substitution1:
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 resolution: (125) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/1.16 parent0[0]: (124) {G1,W3,D2,L1,V0,M1} { ! individual(
% 0.46/1.16 c_tptptptpcol_16_8398 ) }.
% 0.46/1.16 parent1[0]: (5) {G0,W2,D2,L1,V0,M1} I { individual( c_tptptptpcol_16_8398 )
% 0.46/1.16 }.
% 0.46/1.16 substitution0:
% 0.46/1.16 end
% 0.46/1.16 substitution1:
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 subsumption: (54) {G2,W0,D0,L0,V0,M0} R(50,3);r(5) { }.
% 0.46/1.16 parent0: (125) {G1,W0,D0,L0,V0,M0} { }.
% 0.46/1.16 substitution0:
% 0.46/1.16 end
% 0.46/1.16 permutation0:
% 0.46/1.16 end
% 0.46/1.16
% 0.46/1.16 Proof check complete!
% 0.46/1.16
% 0.46/1.16 Memory use:
% 0.46/1.16
% 0.46/1.16 space for terms: 1418
% 0.46/1.16 space for clauses: 2492
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 clauses generated: 70
% 0.46/1.16 clauses kept: 55
% 0.46/1.16 clauses selected: 23
% 0.46/1.16 clauses deleted: 0
% 0.46/1.16 clauses inuse deleted: 0
% 0.46/1.16
% 0.46/1.16 subsentry: 30
% 0.46/1.16 literals s-matched: 26
% 0.46/1.16 literals matched: 26
% 0.46/1.16 full subsumption: 2
% 0.46/1.16
% 0.46/1.16 checksum: 411843726
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 Bliksem ended
%------------------------------------------------------------------------------