TSTP Solution File: CSR032+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:01 EDT 2022
% Result : Theorem 0.70s 1.11s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sat Jun 11 03:21:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.11 *** allocated 10000 integers for termspace/termends
% 0.70/1.11 *** allocated 10000 integers for clauses
% 0.70/1.11 *** allocated 10000 integers for justifications
% 0.70/1.11 Bliksem 1.12
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Automatic Strategy Selection
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Clauses:
% 0.70/1.11
% 0.70/1.11 { individual( f_citynamedfn( s_agen, c_france ) ) }.
% 0.70/1.11 { genls( c_trajector_underspecified, c_location_underspecified ) }.
% 0.70/1.11 { ! trajector_underspecified( X ), location_underspecified( X ) }.
% 0.70/1.11 { genls( c_location_underspecified, c_thing ) }.
% 0.70/1.11 { ! location_underspecified( X ), thing( X ) }.
% 0.70/1.11 { genlmt( c_humansociallifemt, c_basekb ) }.
% 0.70/1.11 { transitivebinarypredicate( c_genlmt ) }.
% 0.70/1.11 { genlmt( c_reasoningaboutpossibleantecedentsmt, c_humansociallifemt ) }.
% 0.70/1.11 { genls( c_individual, c_trajector_underspecified ) }.
% 0.70/1.11 { ! individual( X ), trajector_underspecified( X ) }.
% 0.70/1.11 { genlmt( c_basekb, c_universalvocabularymt ) }.
% 0.70/1.11 { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith( Y, Z ) }.
% 0.70/1.11 { ! genlinverse( X, Z ), ! genlinverse( Z, Y ), genlpreds( X, Y ) }.
% 0.70/1.11 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.70/1.11 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.70/1.11 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.70/1.11 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.70/1.11 { ! genlpreds( X, Z ), ! genlpreds( Z, Y ), genlpreds( X, Y ) }.
% 0.70/1.11 { ! predicate( X ), genlpreds( X, X ) }.
% 0.70/1.11 { ! predicate( X ), genlpreds( X, X ) }.
% 0.70/1.11 { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.70/1.11 { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.70/1.11 { ! genlinverse( Z, X ), ! genlpreds( Y, Z ), genlinverse( Y, X ) }.
% 0.70/1.11 { ! genlinverse( X, Z ), ! genlpreds( Z, Y ), genlinverse( X, Y ) }.
% 0.70/1.11 { ! disjointwith( Y, X ), collection( X ) }.
% 0.70/1.11 { ! disjointwith( X, Y ), collection( X ) }.
% 0.70/1.11 { ! disjointwith( X, Y ), disjointwith( Y, X ) }.
% 0.70/1.11 { ! disjointwith( X, Z ), ! genls( Y, Z ), disjointwith( X, Y ) }.
% 0.70/1.11 { ! disjointwith( Z, X ), ! genls( Y, Z ), disjointwith( Y, X ) }.
% 0.70/1.11 { ! isa( X, c_transitivebinarypredicate ), transitivebinarypredicate( X ) }
% 0.70/1.11 .
% 0.70/1.11 { ! transitivebinarypredicate( X ), isa( X, c_transitivebinarypredicate ) }
% 0.70/1.11 .
% 0.70/1.11 { mtvisible( c_basekb ) }.
% 0.70/1.11 { ! mtvisible( Y ), ! genlmt( Y, X ), mtvisible( X ) }.
% 0.70/1.11 { ! genlmt( Y, X ), microtheory( X ) }.
% 0.70/1.11 { ! genlmt( Y, X ), microtheory( X ) }.
% 0.70/1.11 { ! genlmt( X, Y ), microtheory( X ) }.
% 0.70/1.11 { ! genlmt( X, Y ), microtheory( X ) }.
% 0.70/1.11 { ! genlmt( X, Z ), ! genlmt( Z, Y ), genlmt( X, Y ) }.
% 0.70/1.11 { ! microtheory( X ), genlmt( X, X ) }.
% 0.70/1.11 { ! microtheory( X ), genlmt( X, X ) }.
% 0.70/1.11 { ! isa( X, c_thing ), thing( X ) }.
% 0.70/1.11 { ! thing( X ), isa( X, c_thing ) }.
% 0.70/1.11 { ! isa( X, c_location_underspecified ), location_underspecified( X ) }.
% 0.70/1.11 { ! location_underspecified( X ), isa( X, c_location_underspecified ) }.
% 0.70/1.11 { ! isa( X, c_trajector_underspecified ), trajector_underspecified( X ) }.
% 0.70/1.11 { ! trajector_underspecified( X ), isa( X, c_trajector_underspecified ) }.
% 0.70/1.11 { ! genls( Y, X ), collection( X ) }.
% 0.70/1.11 { ! genls( Y, X ), collection( X ) }.
% 0.70/1.11 { ! genls( X, Y ), collection( X ) }.
% 0.70/1.11 { ! genls( X, Y ), collection( X ) }.
% 0.70/1.11 { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y ) }.
% 0.70/1.11 { ! collection( X ), genls( X, X ) }.
% 0.70/1.11 { ! collection( X ), genls( X, X ) }.
% 0.70/1.11 { ! genls( Z, X ), ! genls( Y, Z ), genls( Y, X ) }.
% 0.70/1.11 { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y ) }.
% 0.70/1.11 { ! isa( X, c_individual ), individual( X ) }.
% 0.70/1.11 { ! individual( X ), isa( X, c_individual ) }.
% 0.70/1.11 { natfunction( f_citynamedfn( X, Y ), c_citynamedfn ) }.
% 0.70/1.11 { natargument( f_citynamedfn( X, Y ), n_1, X ) }.
% 0.70/1.11 { natargument( f_citynamedfn( X, Y ), n_2, Y ) }.
% 0.70/1.11 { city( f_citynamedfn( X, Y ) ) }.
% 0.70/1.11 { ! isa( Y, X ), collection( X ) }.
% 0.70/1.11 { ! isa( Y, X ), collection( X ) }.
% 0.70/1.11 { ! isa( X, Y ), thing( X ) }.
% 0.70/1.11 { ! isa( X, Y ), thing( X ) }.
% 0.70/1.11 { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y ) }.
% 0.70/1.11 { mtvisible( c_universalvocabularymt ) }.
% 0.70/1.11 { mtvisible( c_reasoningaboutpossibleantecedentsmt ) }.
% 0.70/1.11 { ! isa( f_citynamedfn( s_agen, c_france ), X ) }.
% 0.70/1.11
% 0.70/1.11 percentage equality = 0.000000, percentage horn = 1.000000
% 0.70/1.11 This is a near-Horn, non-equality problem
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Options Used:
% 0.70/1.11
% 0.70/1.11 useres = 1
% 0.70/1.11 useparamod = 0
% 0.70/1.11 useeqrefl = 0
% 0.70/1.11 useeqfact = 0
% 0.70/1.11 usefactor = 1
% 0.70/1.11 usesimpsplitting = 0
% 0.70/1.11 usesimpdemod = 0
% 0.70/1.11 usesimpres = 4
% 0.70/1.11
% 0.70/1.11 resimpinuse = 1000
% 0.70/1.11 resimpclauses = 20000
% 0.70/1.11 substype = standard
% 0.70/1.11 backwardsubs = 1
% 0.70/1.11 selectoldest = 5
% 0.70/1.11
% 0.70/1.11 litorderings [0] = split
% 0.70/1.11 litorderings [1] = liftord
% 0.70/1.11
% 0.70/1.11 termordering = none
% 0.70/1.11
% 0.70/1.11 litapriori = 1
% 0.70/1.11 termapriori = 0
% 0.70/1.11 litaposteriori = 0
% 0.70/1.11 termaposteriori = 0
% 0.70/1.11 demodaposteriori = 0
% 0.70/1.11 ordereqreflfact = 0
% 0.70/1.11
% 0.70/1.11 litselect = negative
% 0.70/1.11
% 0.70/1.11 maxweight = 30000
% 0.70/1.11 maxdepth = 30000
% 0.70/1.11 maxlength = 115
% 0.70/1.11 maxnrvars = 195
% 0.70/1.11 excuselevel = 0
% 0.70/1.11 increasemaxweight = 0
% 0.70/1.11
% 0.70/1.11 maxselected = 10000000
% 0.70/1.11 maxnrclauses = 10000000
% 0.70/1.11
% 0.70/1.11 showgenerated = 0
% 0.70/1.11 showkept = 0
% 0.70/1.11 showselected = 0
% 0.70/1.11 showdeleted = 0
% 0.70/1.11 showresimp = 1
% 0.70/1.11 showstatus = 2000
% 0.70/1.11
% 0.70/1.11 prologoutput = 0
% 0.70/1.11 nrgoals = 5000000
% 0.70/1.11 totalproof = 1
% 0.70/1.11
% 0.70/1.11 Symbols occurring in the translation:
% 0.70/1.11
% 0.70/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.11 . [1, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.70/1.11 ! [4, 1] (w:1, o:38, a:1, s:1, b:0),
% 0.70/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.11 s_agen [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.70/1.11 c_france [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.70/1.11 f_citynamedfn [37, 2] (w:1, o:78, a:1, s:1, b:0),
% 0.70/1.11 individual [38, 1] (w:1, o:43, a:1, s:1, b:0),
% 0.70/1.11 c_trajector_underspecified [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.70/1.11 c_location_underspecified [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.70/1.11 genls [41, 2] (w:1, o:79, a:1, s:1, b:0),
% 0.70/1.11 trajector_underspecified [43, 1] (w:1, o:44, a:1, s:1, b:0),
% 0.70/1.11 location_underspecified [44, 1] (w:1, o:45, a:1, s:1, b:0),
% 0.70/1.11 c_thing [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.11 thing [46, 1] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.11 c_humansociallifemt [47, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.70/1.11 c_basekb [48, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.70/1.11 genlmt [49, 2] (w:1, o:80, a:1, s:1, b:0),
% 0.70/1.11 c_genlmt [50, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.70/1.11 transitivebinarypredicate [51, 1] (w:1, o:47, a:1, s:1, b:0),
% 0.70/1.11 c_reasoningaboutpossibleantecedentsmt [52, 0] (w:1, o:16, a:1, s:1
% 0.70/1.11 , b:0),
% 0.70/1.11 c_individual [53, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.70/1.11 c_universalvocabularymt [54, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.11 isa [57, 2] (w:1, o:81, a:1, s:1, b:0),
% 0.70/1.11 disjointwith [58, 2] (w:1, o:82, a:1, s:1, b:0),
% 0.70/1.11 genlinverse [62, 2] (w:1, o:83, a:1, s:1, b:0),
% 0.70/1.11 genlpreds [63, 2] (w:1, o:84, a:1, s:1, b:0),
% 0.70/1.11 predicate [66, 1] (w:1, o:48, a:1, s:1, b:0),
% 0.70/1.11 binarypredicate [71, 1] (w:1, o:49, a:1, s:1, b:0),
% 0.70/1.11 collection [74, 1] (w:1, o:50, a:1, s:1, b:0),
% 0.70/1.11 c_transitivebinarypredicate [75, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.70/1.11 mtvisible [76, 1] (w:1, o:51, a:1, s:1, b:0),
% 0.70/1.11 microtheory [79, 1] (w:1, o:52, a:1, s:1, b:0),
% 0.70/1.11 c_citynamedfn [80, 0] (w:1, o:34, a:1, s:1, b:0),
% 0.70/1.11 natfunction [81, 2] (w:1, o:85, a:1, s:1, b:0),
% 0.70/1.11 n_1 [82, 0] (w:1, o:35, a:1, s:1, b:0),
% 0.70/1.11 natargument [83, 3] (w:1, o:86, a:1, s:1, b:0),
% 0.70/1.11 n_2 [84, 0] (w:1, o:36, a:1, s:1, b:0),
% 0.70/1.11 city [85, 1] (w:1, o:53, a:1, s:1, b:0).
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Starting Search:
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Bliksems!, er is een bewijs:
% 0.70/1.11 % SZS status Theorem
% 0.70/1.11 % SZS output start Refutation
% 0.70/1.11
% 0.70/1.11 (0) {G0,W4,D3,L1,V0,M1} I { individual( f_citynamedfn( s_agen, c_france ) )
% 0.70/1.11 }.
% 0.70/1.11 (45) {G0,W6,D2,L2,V1,M1} I { isa( X, c_individual ), ! individual( X ) }.
% 0.70/1.11 (55) {G0,W6,D3,L1,V1,M1} I { ! isa( f_citynamedfn( s_agen, c_france ), X )
% 0.70/1.11 }.
% 0.70/1.11 (69) {G1,W0,D0,L0,V0,M0} R(45,0);r(55) { }.
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 % SZS output end Refutation
% 0.70/1.11 found a proof!
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Unprocessed initial clauses:
% 0.70/1.11
% 0.70/1.11 (71) {G0,W4,D3,L1,V0,M1} { individual( f_citynamedfn( s_agen, c_france ) )
% 0.70/1.11 }.
% 0.70/1.11 (72) {G0,W3,D2,L1,V0,M1} { genls( c_trajector_underspecified,
% 0.70/1.11 c_location_underspecified ) }.
% 0.70/1.11 (73) {G0,W5,D2,L2,V1,M2} { ! trajector_underspecified( X ),
% 0.70/1.11 location_underspecified( X ) }.
% 0.70/1.11 (74) {G0,W3,D2,L1,V0,M1} { genls( c_location_underspecified, c_thing ) }.
% 0.70/1.11 (75) {G0,W5,D2,L2,V1,M2} { ! location_underspecified( X ), thing( X ) }.
% 0.70/1.11 (76) {G0,W3,D2,L1,V0,M1} { genlmt( c_humansociallifemt, c_basekb ) }.
% 0.70/1.11 (77) {G0,W2,D2,L1,V0,M1} { transitivebinarypredicate( c_genlmt ) }.
% 0.70/1.11 (78) {G0,W3,D2,L1,V0,M1} { genlmt( c_reasoningaboutpossibleantecedentsmt,
% 0.70/1.11 c_humansociallifemt ) }.
% 0.70/1.11 (79) {G0,W3,D2,L1,V0,M1} { genls( c_individual, c_trajector_underspecified
% 0.70/1.11 ) }.
% 0.70/1.11 (80) {G0,W5,D2,L2,V1,M2} { ! individual( X ), trajector_underspecified( X
% 0.70/1.11 ) }.
% 0.70/1.11 (81) {G0,W3,D2,L1,V0,M1} { genlmt( c_basekb, c_universalvocabularymt ) }.
% 0.70/1.11 (82) {G0,W12,D2,L3,V3,M3} { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith(
% 0.70/1.11 Y, Z ) }.
% 0.70/1.11 (83) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlinverse( Z, Y ),
% 0.70/1.11 genlpreds( X, Y ) }.
% 0.70/1.11 (84) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.70/1.11 (85) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.70/1.11 (86) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.70/1.11 (87) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.70/1.11 (88) {G0,W11,D2,L3,V3,M3} { ! genlpreds( X, Z ), ! genlpreds( Z, Y ),
% 0.70/1.11 genlpreds( X, Y ) }.
% 0.70/1.11 (89) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.70/1.11 (90) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.70/1.11 (91) {G0,W6,D2,L2,V2,M2} { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.70/1.11 (92) {G0,W6,D2,L2,V2,M2} { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.70/1.11 (93) {G0,W11,D2,L3,V3,M3} { ! genlinverse( Z, X ), ! genlpreds( Y, Z ),
% 0.70/1.11 genlinverse( Y, X ) }.
% 0.70/1.11 (94) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlpreds( Z, Y ),
% 0.70/1.11 genlinverse( X, Y ) }.
% 0.70/1.11 (95) {G0,W6,D2,L2,V2,M2} { ! disjointwith( Y, X ), collection( X ) }.
% 0.70/1.11 (96) {G0,W6,D2,L2,V2,M2} { ! disjointwith( X, Y ), collection( X ) }.
% 0.70/1.11 (97) {G0,W7,D2,L2,V2,M2} { ! disjointwith( X, Y ), disjointwith( Y, X )
% 0.70/1.11 }.
% 0.70/1.11 (98) {G0,W11,D2,L3,V3,M3} { ! disjointwith( X, Z ), ! genls( Y, Z ),
% 0.70/1.11 disjointwith( X, Y ) }.
% 0.70/1.11 (99) {G0,W11,D2,L3,V3,M3} { ! disjointwith( Z, X ), ! genls( Y, Z ),
% 0.70/1.11 disjointwith( Y, X ) }.
% 0.70/1.11 (100) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_transitivebinarypredicate ),
% 0.70/1.11 transitivebinarypredicate( X ) }.
% 0.70/1.11 (101) {G0,W6,D2,L2,V1,M2} { ! transitivebinarypredicate( X ), isa( X,
% 0.70/1.11 c_transitivebinarypredicate ) }.
% 0.70/1.11 (102) {G0,W2,D2,L1,V0,M1} { mtvisible( c_basekb ) }.
% 0.70/1.11 (103) {G0,W9,D2,L3,V2,M3} { ! mtvisible( Y ), ! genlmt( Y, X ), mtvisible
% 0.70/1.11 ( X ) }.
% 0.70/1.11 (104) {G0,W6,D2,L2,V2,M2} { ! genlmt( Y, X ), microtheory( X ) }.
% 0.70/1.11 (105) {G0,W6,D2,L2,V2,M2} { ! genlmt( Y, X ), microtheory( X ) }.
% 0.70/1.11 (106) {G0,W6,D2,L2,V2,M2} { ! genlmt( X, Y ), microtheory( X ) }.
% 0.70/1.11 (107) {G0,W6,D2,L2,V2,M2} { ! genlmt( X, Y ), microtheory( X ) }.
% 0.70/1.11 (108) {G0,W11,D2,L3,V3,M3} { ! genlmt( X, Z ), ! genlmt( Z, Y ), genlmt( X
% 0.70/1.11 , Y ) }.
% 0.70/1.11 (109) {G0,W6,D2,L2,V1,M2} { ! microtheory( X ), genlmt( X, X ) }.
% 0.70/1.11 (110) {G0,W6,D2,L2,V1,M2} { ! microtheory( X ), genlmt( X, X ) }.
% 0.70/1.11 (111) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_thing ), thing( X ) }.
% 0.70/1.11 (112) {G0,W6,D2,L2,V1,M2} { ! thing( X ), isa( X, c_thing ) }.
% 0.70/1.11 (113) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_location_underspecified ),
% 0.70/1.11 location_underspecified( X ) }.
% 0.70/1.11 (114) {G0,W6,D2,L2,V1,M2} { ! location_underspecified( X ), isa( X,
% 0.70/1.11 c_location_underspecified ) }.
% 0.70/1.11 (115) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_trajector_underspecified ),
% 0.70/1.11 trajector_underspecified( X ) }.
% 0.70/1.11 (116) {G0,W6,D2,L2,V1,M2} { ! trajector_underspecified( X ), isa( X,
% 0.70/1.11 c_trajector_underspecified ) }.
% 0.70/1.11 (117) {G0,W6,D2,L2,V2,M2} { ! genls( Y, X ), collection( X ) }.
% 0.70/1.11 (118) {G0,W6,D2,L2,V2,M2} { ! genls( Y, X ), collection( X ) }.
% 0.70/1.11 (119) {G0,W6,D2,L2,V2,M2} { ! genls( X, Y ), collection( X ) }.
% 0.70/1.11 (120) {G0,W6,D2,L2,V2,M2} { ! genls( X, Y ), collection( X ) }.
% 0.70/1.11 (121) {G0,W11,D2,L3,V3,M3} { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y
% 0.70/1.11 ) }.
% 0.70/1.11 (122) {G0,W6,D2,L2,V1,M2} { ! collection( X ), genls( X, X ) }.
% 0.70/1.11 (123) {G0,W6,D2,L2,V1,M2} { ! collection( X ), genls( X, X ) }.
% 0.70/1.11 (124) {G0,W11,D2,L3,V3,M3} { ! genls( Z, X ), ! genls( Y, Z ), genls( Y, X
% 0.70/1.11 ) }.
% 0.70/1.11 (125) {G0,W11,D2,L3,V3,M3} { ! genls( X, Z ), ! genls( Z, Y ), genls( X, Y
% 0.70/1.11 ) }.
% 0.70/1.11 (126) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_individual ), individual( X ) }.
% 0.70/1.11 (127) {G0,W6,D2,L2,V1,M2} { ! individual( X ), isa( X, c_individual ) }.
% 0.70/1.11 (128) {G0,W5,D3,L1,V2,M1} { natfunction( f_citynamedfn( X, Y ),
% 0.70/1.11 c_citynamedfn ) }.
% 0.70/1.11 (129) {G0,W6,D3,L1,V2,M1} { natargument( f_citynamedfn( X, Y ), n_1, X )
% 0.70/1.11 }.
% 0.70/1.11 (130) {G0,W6,D3,L1,V2,M1} { natargument( f_citynamedfn( X, Y ), n_2, Y )
% 0.70/1.11 }.
% 0.70/1.11 (131) {G0,W4,D3,L1,V2,M1} { city( f_citynamedfn( X, Y ) ) }.
% 0.70/1.11 (132) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.70/1.11 (133) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.70/1.11 (134) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.70/1.11 (135) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.70/1.11 (136) {G0,W11,D2,L3,V3,M3} { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y )
% 0.70/1.11 }.
% 0.70/1.11 (137) {G0,W2,D2,L1,V0,M1} { mtvisible( c_universalvocabularymt ) }.
% 0.70/1.11 (138) {G0,W2,D2,L1,V0,M1} { mtvisible(
% 0.70/1.11 c_reasoningaboutpossibleantecedentsmt ) }.
% 0.70/1.11 (139) {G0,W6,D3,L1,V1,M1} { ! isa( f_citynamedfn( s_agen, c_france ), X )
% 0.70/1.11 }.
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Total Proof:
% 0.70/1.11
% 0.70/1.11 subsumption: (0) {G0,W4,D3,L1,V0,M1} I { individual( f_citynamedfn( s_agen
% 0.70/1.11 , c_france ) ) }.
% 0.70/1.11 parent0: (71) {G0,W4,D3,L1,V0,M1} { individual( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ) ) }.
% 0.70/1.11 substitution0:
% 0.70/1.11 end
% 0.70/1.11 permutation0:
% 0.70/1.11 0 ==> 0
% 0.70/1.11 end
% 0.70/1.11
% 0.70/1.11 subsumption: (45) {G0,W6,D2,L2,V1,M1} I { isa( X, c_individual ), !
% 0.70/1.11 individual( X ) }.
% 0.70/1.11 parent0: (127) {G0,W6,D2,L2,V1,M2} { ! individual( X ), isa( X,
% 0.70/1.11 c_individual ) }.
% 0.70/1.11 substitution0:
% 0.70/1.11 X := X
% 0.70/1.11 end
% 0.70/1.11 permutation0:
% 0.70/1.11 0 ==> 1
% 0.70/1.11 1 ==> 0
% 0.70/1.11 end
% 0.70/1.11
% 0.70/1.11 subsumption: (55) {G0,W6,D3,L1,V1,M1} I { ! isa( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ), X ) }.
% 0.70/1.11 parent0: (139) {G0,W6,D3,L1,V1,M1} { ! isa( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ), X ) }.
% 0.70/1.11 substitution0:
% 0.70/1.11 X := X
% 0.70/1.11 end
% 0.70/1.11 permutation0:
% 0.70/1.11 0 ==> 0
% 0.70/1.11 end
% 0.70/1.11
% 0.70/1.11 resolution: (154) {G1,W5,D3,L1,V0,M1} { isa( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ), c_individual ) }.
% 0.70/1.11 parent0[1]: (45) {G0,W6,D2,L2,V1,M1} I { isa( X, c_individual ), !
% 0.70/1.11 individual( X ) }.
% 0.70/1.11 parent1[0]: (0) {G0,W4,D3,L1,V0,M1} I { individual( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ) ) }.
% 0.70/1.11 substitution0:
% 0.70/1.11 X := f_citynamedfn( s_agen, c_france )
% 0.70/1.11 end
% 0.70/1.11 substitution1:
% 0.70/1.11 end
% 0.70/1.11
% 0.70/1.11 resolution: (155) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.11 parent0[0]: (55) {G0,W6,D3,L1,V1,M1} I { ! isa( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ), X ) }.
% 0.70/1.11 parent1[0]: (154) {G1,W5,D3,L1,V0,M1} { isa( f_citynamedfn( s_agen,
% 0.70/1.11 c_france ), c_individual ) }.
% 0.70/1.11 substitution0:
% 0.70/1.11 X := c_individual
% 0.70/1.11 end
% 0.70/1.11 substitution1:
% 0.70/1.11 end
% 0.70/1.11
% 0.70/1.11 subsumption: (69) {G1,W0,D0,L0,V0,M0} R(45,0);r(55) { }.
% 0.70/1.11 parent0: (155) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.11 substitution0:
% 0.70/1.11 end
% 0.70/1.11 permutation0:
% 0.70/1.11 end
% 0.70/1.11
% 0.70/1.11 Proof check complete!
% 0.70/1.11
% 0.70/1.11 Memory use:
% 0.70/1.11
% 0.70/1.11 space for terms: 1688
% 0.70/1.11 space for clauses: 3398
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 clauses generated: 90
% 0.70/1.11 clauses kept: 70
% 0.70/1.11 clauses selected: 43
% 0.70/1.11 clauses deleted: 0
% 0.70/1.11 clauses inuse deleted: 0
% 0.70/1.11
% 0.70/1.11 subsentry: 41
% 0.70/1.11 literals s-matched: 39
% 0.70/1.11 literals matched: 39
% 0.70/1.11 full subsumption: 2
% 0.70/1.11
% 0.70/1.11 checksum: -1410603058
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 Bliksem ended
%------------------------------------------------------------------------------