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