TSTP Solution File: CSR069+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CSR069+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n032.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:41 EDT 2022
% Result : Theorem 0.50s 0.90s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : CSR069+1 : TPTP v8.1.0. Released v3.4.0.
% 0.05/0.10 % Command : bliksem %s
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % DateTime : Sat Jun 11 00:54:39 EDT 2022
% 0.08/0.30 % CPUTime :
% 0.50/0.90 *** allocated 10000 integers for termspace/termends
% 0.50/0.90 *** allocated 10000 integers for clauses
% 0.50/0.90 *** allocated 10000 integers for justifications
% 0.50/0.90 Bliksem 1.12
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Automatic Strategy Selection
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Clauses:
% 0.50/0.90
% 0.50/0.90 { ! mtvisible( c_tptpgeo_member1_mt ), borderson( c_georegion_l4_x38_y24,
% 0.50/0.90 c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith( Y, Z ) }.
% 0.50/0.90 { ! genlinverse( X, Z ), ! genlinverse( Z, Y ), genlpreds( X, Y ) }.
% 0.50/0.90 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.50/0.90 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.50/0.90 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.50/0.90 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.50/0.90 { ! genlpreds( X, Z ), ! genlpreds( Z, Y ), genlpreds( X, Y ) }.
% 0.50/0.90 { ! predicate( X ), genlpreds( X, X ) }.
% 0.50/0.90 { ! predicate( X ), genlpreds( X, X ) }.
% 0.50/0.90 { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.50/0.90 { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.50/0.90 { ! genlinverse( Z, X ), ! genlpreds( Y, Z ), genlinverse( Y, X ) }.
% 0.50/0.90 { ! genlinverse( X, Z ), ! genlpreds( Z, Y ), genlinverse( X, Y ) }.
% 0.50/0.90 { ! disjointwith( Y, X ), collection( X ) }.
% 0.50/0.90 { ! disjointwith( X, Y ), collection( X ) }.
% 0.50/0.90 { ! disjointwith( X, Y ), disjointwith( Y, X ) }.
% 0.50/0.90 { ! disjointwith( X, Z ), ! genls( Y, Z ), disjointwith( X, Y ) }.
% 0.50/0.90 { ! disjointwith( Z, X ), ! genls( Y, Z ), disjointwith( Y, X ) }.
% 0.50/0.90 { ! isa( Y, X ), collection( X ) }.
% 0.50/0.90 { ! isa( Y, X ), collection( X ) }.
% 0.50/0.90 { ! isa( X, Y ), thing( X ) }.
% 0.50/0.90 { ! isa( X, Y ), thing( X ) }.
% 0.50/0.90 { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y ) }.
% 0.50/0.90 { mtvisible( c_basekb ) }.
% 0.50/0.90 { ! borderson( Y, X ), geographicalregion( X ) }.
% 0.50/0.90 { ! borderson( X, Y ), geographicalregion( X ) }.
% 0.50/0.90 { ! borderson( X, Y ), borderson( Y, X ) }.
% 0.50/0.90 { ! borderson( X, X ) }.
% 0.50/0.90 { mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 { ! borderson( c_georegion_l4_x38_y24, c_georegion_l4_x39_y24 ) }.
% 0.50/0.90
% 0.50/0.90 percentage equality = 0.000000, percentage horn = 1.000000
% 0.50/0.90 This is a near-Horn, non-equality problem
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Options Used:
% 0.50/0.90
% 0.50/0.90 useres = 1
% 0.50/0.90 useparamod = 0
% 0.50/0.90 useeqrefl = 0
% 0.50/0.90 useeqfact = 0
% 0.50/0.90 usefactor = 1
% 0.50/0.90 usesimpsplitting = 0
% 0.50/0.90 usesimpdemod = 0
% 0.50/0.90 usesimpres = 4
% 0.50/0.90
% 0.50/0.90 resimpinuse = 1000
% 0.50/0.90 resimpclauses = 20000
% 0.50/0.90 substype = standard
% 0.50/0.90 backwardsubs = 1
% 0.50/0.90 selectoldest = 5
% 0.50/0.90
% 0.50/0.90 litorderings [0] = split
% 0.50/0.90 litorderings [1] = liftord
% 0.50/0.90
% 0.50/0.90 termordering = none
% 0.50/0.90
% 0.50/0.90 litapriori = 1
% 0.50/0.90 termapriori = 0
% 0.50/0.90 litaposteriori = 0
% 0.50/0.90 termaposteriori = 0
% 0.50/0.90 demodaposteriori = 0
% 0.50/0.90 ordereqreflfact = 0
% 0.50/0.90
% 0.50/0.90 litselect = negative
% 0.50/0.90
% 0.50/0.90 maxweight = 30000
% 0.50/0.90 maxdepth = 30000
% 0.50/0.90 maxlength = 115
% 0.50/0.90 maxnrvars = 195
% 0.50/0.90 excuselevel = 0
% 0.50/0.90 increasemaxweight = 0
% 0.50/0.90
% 0.50/0.90 maxselected = 10000000
% 0.50/0.90 maxnrclauses = 10000000
% 0.50/0.90
% 0.50/0.90 showgenerated = 0
% 0.50/0.90 showkept = 0
% 0.50/0.90 showselected = 0
% 0.50/0.90 showdeleted = 0
% 0.50/0.90 showresimp = 1
% 0.50/0.90 showstatus = 2000
% 0.50/0.90
% 0.50/0.90 prologoutput = 0
% 0.50/0.90 nrgoals = 5000000
% 0.50/0.90 totalproof = 1
% 0.50/0.90
% 0.50/0.90 Symbols occurring in the translation:
% 0.50/0.90
% 0.50/0.90 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.50/0.90 . [1, 2] (w:1, o:35, a:1, s:1, b:0),
% 0.50/0.90 ! [4, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.50/0.90 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.50/0.90 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.50/0.90 c_tptpgeo_member1_mt [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.50/0.90 mtvisible [36, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.50/0.90 c_georegion_l4_x38_y24 [37, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.50/0.90 c_georegion_l4_x39_y24 [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.50/0.90 borderson [39, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.50/0.90 isa [43, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.50/0.90 disjointwith [44, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.50/0.90 genlinverse [48, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.50/0.90 genlpreds [49, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.50/0.90 predicate [52, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.50/0.90 binarypredicate [57, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.50/0.90 collection [60, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.50/0.90 genls [61, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.50/0.90 thing [62, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.50/0.90 c_basekb [63, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.50/0.90 geographicalregion [64, 1] (w:1, o:34, a:1, s:1, b:0).
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Starting Search:
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Bliksems!, er is een bewijs:
% 0.50/0.90 % SZS status Theorem
% 0.50/0.90 % SZS output start Refutation
% 0.50/0.90
% 0.50/0.90 (0) {G0,W6,D2,L2,V0,M1} I { borderson( c_georegion_l4_x38_y24,
% 0.50/0.90 c_georegion_l4_x39_y24 ), ! mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 (24) {G0,W2,D2,L1,V0,M1} I { mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 (25) {G0,W4,D2,L1,V0,M1} I { ! borderson( c_georegion_l4_x38_y24,
% 0.50/0.90 c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 (28) {G1,W0,D0,L0,V0,M0} S(0);r(25);r(24) { }.
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 % SZS output end Refutation
% 0.50/0.90 found a proof!
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Unprocessed initial clauses:
% 0.50/0.90
% 0.50/0.90 (30) {G0,W6,D2,L2,V0,M2} { ! mtvisible( c_tptpgeo_member1_mt ), borderson
% 0.50/0.90 ( c_georegion_l4_x38_y24, c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 (31) {G0,W12,D2,L3,V3,M3} { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith(
% 0.50/0.90 Y, Z ) }.
% 0.50/0.90 (32) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlinverse( Z, Y ),
% 0.50/0.90 genlpreds( X, Y ) }.
% 0.50/0.90 (33) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.50/0.90 (34) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.50/0.90 (35) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.50/0.90 (36) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.50/0.90 (37) {G0,W11,D2,L3,V3,M3} { ! genlpreds( X, Z ), ! genlpreds( Z, Y ),
% 0.50/0.90 genlpreds( X, Y ) }.
% 0.50/0.90 (38) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.50/0.90 (39) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.50/0.90 (40) {G0,W6,D2,L2,V2,M2} { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.50/0.90 (41) {G0,W6,D2,L2,V2,M2} { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.50/0.90 (42) {G0,W11,D2,L3,V3,M3} { ! genlinverse( Z, X ), ! genlpreds( Y, Z ),
% 0.50/0.90 genlinverse( Y, X ) }.
% 0.50/0.90 (43) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlpreds( Z, Y ),
% 0.50/0.90 genlinverse( X, Y ) }.
% 0.50/0.90 (44) {G0,W6,D2,L2,V2,M2} { ! disjointwith( Y, X ), collection( X ) }.
% 0.50/0.90 (45) {G0,W6,D2,L2,V2,M2} { ! disjointwith( X, Y ), collection( X ) }.
% 0.50/0.90 (46) {G0,W7,D2,L2,V2,M2} { ! disjointwith( X, Y ), disjointwith( Y, X )
% 0.50/0.90 }.
% 0.50/0.90 (47) {G0,W11,D2,L3,V3,M3} { ! disjointwith( X, Z ), ! genls( Y, Z ),
% 0.50/0.90 disjointwith( X, Y ) }.
% 0.50/0.90 (48) {G0,W11,D2,L3,V3,M3} { ! disjointwith( Z, X ), ! genls( Y, Z ),
% 0.50/0.90 disjointwith( Y, X ) }.
% 0.50/0.90 (49) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.50/0.90 (50) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.50/0.90 (51) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.50/0.90 (52) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.50/0.90 (53) {G0,W11,D2,L3,V3,M3} { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y )
% 0.50/0.90 }.
% 0.50/0.90 (54) {G0,W2,D2,L1,V0,M1} { mtvisible( c_basekb ) }.
% 0.50/0.90 (55) {G0,W6,D2,L2,V2,M2} { ! borderson( Y, X ), geographicalregion( X )
% 0.50/0.90 }.
% 0.50/0.90 (56) {G0,W6,D2,L2,V2,M2} { ! borderson( X, Y ), geographicalregion( X )
% 0.50/0.90 }.
% 0.50/0.90 (57) {G0,W7,D2,L2,V2,M2} { ! borderson( X, Y ), borderson( Y, X ) }.
% 0.50/0.90 (58) {G0,W4,D2,L1,V1,M1} { ! borderson( X, X ) }.
% 0.50/0.90 (59) {G0,W2,D2,L1,V0,M1} { mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 (60) {G0,W4,D2,L1,V0,M1} { ! borderson( c_georegion_l4_x38_y24,
% 0.50/0.90 c_georegion_l4_x39_y24 ) }.
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Total Proof:
% 0.50/0.90
% 0.50/0.90 subsumption: (0) {G0,W6,D2,L2,V0,M1} I { borderson( c_georegion_l4_x38_y24
% 0.50/0.90 , c_georegion_l4_x39_y24 ), ! mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 parent0: (30) {G0,W6,D2,L2,V0,M2} { ! mtvisible( c_tptpgeo_member1_mt ),
% 0.50/0.90 borderson( c_georegion_l4_x38_y24, c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 substitution0:
% 0.50/0.90 end
% 0.50/0.90 permutation0:
% 0.50/0.90 0 ==> 1
% 0.50/0.90 1 ==> 0
% 0.50/0.90 end
% 0.50/0.90
% 0.50/0.90 subsumption: (24) {G0,W2,D2,L1,V0,M1} I { mtvisible( c_tptpgeo_member1_mt )
% 0.50/0.90 }.
% 0.50/0.90 parent0: (59) {G0,W2,D2,L1,V0,M1} { mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 substitution0:
% 0.50/0.90 end
% 0.50/0.90 permutation0:
% 0.50/0.90 0 ==> 0
% 0.50/0.90 end
% 0.50/0.90
% 0.50/0.90 subsumption: (25) {G0,W4,D2,L1,V0,M1} I { ! borderson(
% 0.50/0.90 c_georegion_l4_x38_y24, c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 parent0: (60) {G0,W4,D2,L1,V0,M1} { ! borderson( c_georegion_l4_x38_y24,
% 0.50/0.90 c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 substitution0:
% 0.50/0.90 end
% 0.50/0.90 permutation0:
% 0.50/0.90 0 ==> 0
% 0.50/0.90 end
% 0.50/0.90
% 0.50/0.90 resolution: (67) {G1,W3,D2,L1,V0,M1} { ! mtvisible( c_tptpgeo_member1_mt )
% 0.50/0.90 }.
% 0.50/0.90 parent0[0]: (25) {G0,W4,D2,L1,V0,M1} I { ! borderson(
% 0.50/0.90 c_georegion_l4_x38_y24, c_georegion_l4_x39_y24 ) }.
% 0.50/0.90 parent1[0]: (0) {G0,W6,D2,L2,V0,M1} I { borderson( c_georegion_l4_x38_y24,
% 0.50/0.90 c_georegion_l4_x39_y24 ), ! mtvisible( c_tptpgeo_member1_mt ) }.
% 0.50/0.90 substitution0:
% 0.50/0.90 end
% 0.50/0.90 substitution1:
% 0.50/0.90 end
% 0.50/0.90
% 0.50/0.90 resolution: (68) {G1,W0,D0,L0,V0,M0} { }.
% 0.50/0.90 parent0[0]: (67) {G1,W3,D2,L1,V0,M1} { ! mtvisible( c_tptpgeo_member1_mt )
% 0.50/0.90 }.
% 0.50/0.90 parent1[0]: (24) {G0,W2,D2,L1,V0,M1} I { mtvisible( c_tptpgeo_member1_mt )
% 0.50/0.90 }.
% 0.50/0.90 substitution0:
% 0.50/0.90 end
% 0.50/0.90 substitution1:
% 0.50/0.90 end
% 0.50/0.90
% 0.50/0.90 subsumption: (28) {G1,W0,D0,L0,V0,M0} S(0);r(25);r(24) { }.
% 0.50/0.90 parent0: (68) {G1,W0,D0,L0,V0,M0} { }.
% 0.50/0.90 substitution0:
% 0.50/0.90 end
% 0.50/0.90 permutation0:
% 0.50/0.90 end
% 0.50/0.90
% 0.50/0.90 Proof check complete!
% 0.50/0.90
% 0.50/0.90 Memory use:
% 0.50/0.90
% 0.50/0.90 space for terms: 856
% 0.50/0.90 space for clauses: 1271
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 clauses generated: 35
% 0.50/0.90 clauses kept: 29
% 0.50/0.90 clauses selected: 5
% 0.50/0.90 clauses deleted: 1
% 0.50/0.90 clauses inuse deleted: 0
% 0.50/0.90
% 0.50/0.90 subsentry: 17
% 0.50/0.90 literals s-matched: 15
% 0.50/0.90 literals matched: 15
% 0.50/0.90 full subsumption: 0
% 0.50/0.90
% 0.50/0.90 checksum: -1361156879
% 0.50/0.90
% 0.50/0.90
% 0.50/0.90 Bliksem ended
%------------------------------------------------------------------------------