TSTP Solution File: CSR051+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:21 EDT 2022
% Result : Theorem 0.68s 1.10s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n025.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 : Thu Jun 9 19:48:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.10 *** allocated 10000 integers for termspace/termends
% 0.68/1.10 *** allocated 10000 integers for clauses
% 0.68/1.10 *** allocated 10000 integers for justifications
% 0.68/1.10 Bliksem 1.12
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Automatic Strategy Selection
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Clauses:
% 0.68/1.10
% 0.68/1.10 { ! mtvisible( c_tptp_member3356_mt ), marriagelicensedocument(
% 0.68/1.10 c_tptpmarriagelicensedocument ) }.
% 0.68/1.10 { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith( Y, Z ) }.
% 0.68/1.10 { ! genlinverse( X, Z ), ! genlinverse( Z, Y ), genlpreds( X, Y ) }.
% 0.68/1.10 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.68/1.10 { ! genlpreds( Y, X ), predicate( X ) }.
% 0.68/1.10 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.68/1.10 { ! genlpreds( X, Y ), predicate( X ) }.
% 0.68/1.10 { ! genlpreds( X, Z ), ! genlpreds( Z, Y ), genlpreds( X, Y ) }.
% 0.68/1.10 { ! predicate( X ), genlpreds( X, X ) }.
% 0.68/1.10 { ! predicate( X ), genlpreds( X, X ) }.
% 0.68/1.10 { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.68/1.10 { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.68/1.10 { ! genlinverse( Z, X ), ! genlpreds( Y, Z ), genlinverse( Y, X ) }.
% 0.68/1.10 { ! genlinverse( X, Z ), ! genlpreds( Z, Y ), genlinverse( X, Y ) }.
% 0.68/1.10 { ! disjointwith( Y, X ), collection( X ) }.
% 0.68/1.10 { ! disjointwith( X, Y ), collection( X ) }.
% 0.68/1.10 { ! disjointwith( X, Y ), disjointwith( Y, X ) }.
% 0.68/1.10 { ! disjointwith( X, Z ), ! genls( Y, Z ), disjointwith( X, Y ) }.
% 0.68/1.10 { ! disjointwith( Z, X ), ! genls( Y, Z ), disjointwith( Y, X ) }.
% 0.68/1.10 { mtvisible( c_basekb ) }.
% 0.68/1.10 { ! isa( X, c_marriagelicensedocument ), marriagelicensedocument( X ) }.
% 0.68/1.10 { ! marriagelicensedocument( X ), isa( X, c_marriagelicensedocument ) }.
% 0.68/1.10 { ! isa( Y, X ), collection( X ) }.
% 0.68/1.10 { ! isa( Y, X ), collection( X ) }.
% 0.68/1.10 { ! isa( X, Y ), thing( X ) }.
% 0.68/1.10 { ! isa( X, Y ), thing( X ) }.
% 0.68/1.10 { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y ) }.
% 0.68/1.10 { mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 { ! marriagelicensedocument( X ) }.
% 0.68/1.10
% 0.68/1.10 percentage equality = 0.000000, percentage horn = 1.000000
% 0.68/1.10 This is a near-Horn, non-equality problem
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Options Used:
% 0.68/1.10
% 0.68/1.10 useres = 1
% 0.68/1.10 useparamod = 0
% 0.68/1.10 useeqrefl = 0
% 0.68/1.10 useeqfact = 0
% 0.68/1.10 usefactor = 1
% 0.68/1.10 usesimpsplitting = 0
% 0.68/1.10 usesimpdemod = 0
% 0.68/1.10 usesimpres = 4
% 0.68/1.10
% 0.68/1.10 resimpinuse = 1000
% 0.68/1.10 resimpclauses = 20000
% 0.68/1.10 substype = standard
% 0.68/1.10 backwardsubs = 1
% 0.68/1.10 selectoldest = 5
% 0.68/1.10
% 0.68/1.10 litorderings [0] = split
% 0.68/1.10 litorderings [1] = liftord
% 0.68/1.10
% 0.68/1.10 termordering = none
% 0.68/1.10
% 0.68/1.10 litapriori = 1
% 0.68/1.10 termapriori = 0
% 0.68/1.10 litaposteriori = 0
% 0.68/1.10 termaposteriori = 0
% 0.68/1.10 demodaposteriori = 0
% 0.68/1.10 ordereqreflfact = 0
% 0.68/1.10
% 0.68/1.10 litselect = negative
% 0.68/1.10
% 0.68/1.10 maxweight = 30000
% 0.68/1.10 maxdepth = 30000
% 0.68/1.10 maxlength = 115
% 0.68/1.10 maxnrvars = 195
% 0.68/1.10 excuselevel = 0
% 0.68/1.10 increasemaxweight = 0
% 0.68/1.10
% 0.68/1.10 maxselected = 10000000
% 0.68/1.10 maxnrclauses = 10000000
% 0.68/1.10
% 0.68/1.10 showgenerated = 0
% 0.68/1.10 showkept = 0
% 0.68/1.10 showselected = 0
% 0.68/1.10 showdeleted = 0
% 0.68/1.10 showresimp = 1
% 0.68/1.10 showstatus = 2000
% 0.68/1.10
% 0.68/1.10 prologoutput = 0
% 0.68/1.10 nrgoals = 5000000
% 0.68/1.10 totalproof = 1
% 0.68/1.10
% 0.68/1.10 Symbols occurring in the translation:
% 0.68/1.10
% 0.68/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.10 . [1, 2] (w:1, o:35, a:1, s:1, b:0),
% 0.68/1.10 ! [4, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.10 c_tptp_member3356_mt [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.68/1.10 mtvisible [36, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.68/1.10 c_tptpmarriagelicensedocument [37, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.68/1.10 marriagelicensedocument [38, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.68/1.10 isa [42, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.68/1.10 disjointwith [43, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.68/1.10 genlinverse [47, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.68/1.10 genlpreds [48, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.68/1.10 predicate [51, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.68/1.10 binarypredicate [56, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.68/1.10 collection [59, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.68/1.10 genls [60, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.68/1.10 c_basekb [61, 0] (w:1, o:22, a:1, s:1, b:0),
% 0.68/1.10 c_marriagelicensedocument [62, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.68/1.10 thing [63, 1] (w:1, o:34, a:1, s:1, b:0).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Starting Search:
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Bliksems!, er is een bewijs:
% 0.68/1.10 % SZS status Theorem
% 0.68/1.10 % SZS output start Refutation
% 0.68/1.10
% 0.68/1.10 (0) {G0,W5,D2,L2,V0,M1} I { marriagelicensedocument(
% 0.68/1.10 c_tptpmarriagelicensedocument ), ! mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 (22) {G0,W2,D2,L1,V0,M1} I { mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 (23) {G0,W3,D2,L1,V1,M1} I { ! marriagelicensedocument( X ) }.
% 0.68/1.10 (26) {G1,W0,D0,L0,V0,M0} S(0);r(23);r(22) { }.
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 % SZS output end Refutation
% 0.68/1.10 found a proof!
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Unprocessed initial clauses:
% 0.68/1.10
% 0.68/1.10 (28) {G0,W5,D2,L2,V0,M2} { ! mtvisible( c_tptp_member3356_mt ),
% 0.68/1.10 marriagelicensedocument( c_tptpmarriagelicensedocument ) }.
% 0.68/1.10 (29) {G0,W12,D2,L3,V3,M3} { ! isa( X, Y ), ! isa( X, Z ), ! disjointwith(
% 0.68/1.10 Y, Z ) }.
% 0.68/1.10 (30) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlinverse( Z, Y ),
% 0.68/1.10 genlpreds( X, Y ) }.
% 0.68/1.10 (31) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.68/1.10 (32) {G0,W6,D2,L2,V2,M2} { ! genlpreds( Y, X ), predicate( X ) }.
% 0.68/1.10 (33) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.68/1.10 (34) {G0,W6,D2,L2,V2,M2} { ! genlpreds( X, Y ), predicate( X ) }.
% 0.68/1.10 (35) {G0,W11,D2,L3,V3,M3} { ! genlpreds( X, Z ), ! genlpreds( Z, Y ),
% 0.68/1.10 genlpreds( X, Y ) }.
% 0.68/1.10 (36) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.68/1.10 (37) {G0,W6,D2,L2,V1,M2} { ! predicate( X ), genlpreds( X, X ) }.
% 0.68/1.10 (38) {G0,W6,D2,L2,V2,M2} { ! genlinverse( Y, X ), binarypredicate( X ) }.
% 0.68/1.10 (39) {G0,W6,D2,L2,V2,M2} { ! genlinverse( X, Y ), binarypredicate( X ) }.
% 0.68/1.10 (40) {G0,W11,D2,L3,V3,M3} { ! genlinverse( Z, X ), ! genlpreds( Y, Z ),
% 0.68/1.10 genlinverse( Y, X ) }.
% 0.68/1.10 (41) {G0,W11,D2,L3,V3,M3} { ! genlinverse( X, Z ), ! genlpreds( Z, Y ),
% 0.68/1.10 genlinverse( X, Y ) }.
% 0.68/1.10 (42) {G0,W6,D2,L2,V2,M2} { ! disjointwith( Y, X ), collection( X ) }.
% 0.68/1.10 (43) {G0,W6,D2,L2,V2,M2} { ! disjointwith( X, Y ), collection( X ) }.
% 0.68/1.10 (44) {G0,W7,D2,L2,V2,M2} { ! disjointwith( X, Y ), disjointwith( Y, X )
% 0.68/1.10 }.
% 0.68/1.10 (45) {G0,W11,D2,L3,V3,M3} { ! disjointwith( X, Z ), ! genls( Y, Z ),
% 0.68/1.10 disjointwith( X, Y ) }.
% 0.68/1.10 (46) {G0,W11,D2,L3,V3,M3} { ! disjointwith( Z, X ), ! genls( Y, Z ),
% 0.68/1.10 disjointwith( Y, X ) }.
% 0.68/1.10 (47) {G0,W2,D2,L1,V0,M1} { mtvisible( c_basekb ) }.
% 0.68/1.10 (48) {G0,W6,D2,L2,V1,M2} { ! isa( X, c_marriagelicensedocument ),
% 0.68/1.10 marriagelicensedocument( X ) }.
% 0.68/1.10 (49) {G0,W6,D2,L2,V1,M2} { ! marriagelicensedocument( X ), isa( X,
% 0.68/1.10 c_marriagelicensedocument ) }.
% 0.68/1.10 (50) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.68/1.10 (51) {G0,W6,D2,L2,V2,M2} { ! isa( Y, X ), collection( X ) }.
% 0.68/1.10 (52) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.68/1.10 (53) {G0,W6,D2,L2,V2,M2} { ! isa( X, Y ), thing( X ) }.
% 0.68/1.10 (54) {G0,W11,D2,L3,V3,M3} { ! isa( X, Z ), ! genls( Z, Y ), isa( X, Y )
% 0.68/1.10 }.
% 0.68/1.10 (55) {G0,W2,D2,L1,V0,M1} { mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 (56) {G0,W3,D2,L1,V1,M1} { ! marriagelicensedocument( X ) }.
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Total Proof:
% 0.68/1.10
% 0.68/1.10 subsumption: (0) {G0,W5,D2,L2,V0,M1} I { marriagelicensedocument(
% 0.68/1.10 c_tptpmarriagelicensedocument ), ! mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 parent0: (28) {G0,W5,D2,L2,V0,M2} { ! mtvisible( c_tptp_member3356_mt ),
% 0.68/1.10 marriagelicensedocument( c_tptpmarriagelicensedocument ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 1
% 0.68/1.10 1 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (22) {G0,W2,D2,L1,V0,M1} I { mtvisible( c_tptp_member3356_mt )
% 0.68/1.10 }.
% 0.68/1.10 parent0: (55) {G0,W2,D2,L1,V0,M1} { mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (23) {G0,W3,D2,L1,V1,M1} I { ! marriagelicensedocument( X )
% 0.68/1.10 }.
% 0.68/1.10 parent0: (56) {G0,W3,D2,L1,V1,M1} { ! marriagelicensedocument( X ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (63) {G1,W3,D2,L1,V0,M1} { ! mtvisible( c_tptp_member3356_mt )
% 0.68/1.10 }.
% 0.68/1.10 parent0[0]: (23) {G0,W3,D2,L1,V1,M1} I { ! marriagelicensedocument( X ) }.
% 0.68/1.10 parent1[0]: (0) {G0,W5,D2,L2,V0,M1} I { marriagelicensedocument(
% 0.68/1.10 c_tptpmarriagelicensedocument ), ! mtvisible( c_tptp_member3356_mt ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := c_tptpmarriagelicensedocument
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (64) {G1,W0,D0,L0,V0,M0} { }.
% 0.68/1.10 parent0[0]: (63) {G1,W3,D2,L1,V0,M1} { ! mtvisible( c_tptp_member3356_mt )
% 0.68/1.10 }.
% 0.68/1.10 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { mtvisible( c_tptp_member3356_mt )
% 0.68/1.10 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (26) {G1,W0,D0,L0,V0,M0} S(0);r(23);r(22) { }.
% 0.68/1.10 parent0: (64) {G1,W0,D0,L0,V0,M0} { }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 Proof check complete!
% 0.68/1.10
% 0.68/1.10 Memory use:
% 0.68/1.10
% 0.68/1.10 space for terms: 804
% 0.68/1.10 space for clauses: 1193
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 clauses generated: 33
% 0.68/1.10 clauses kept: 27
% 0.68/1.10 clauses selected: 3
% 0.68/1.10 clauses deleted: 1
% 0.68/1.10 clauses inuse deleted: 0
% 0.68/1.10
% 0.68/1.10 subsentry: 15
% 0.68/1.10 literals s-matched: 13
% 0.68/1.10 literals matched: 13
% 0.68/1.10 full subsumption: 0
% 0.68/1.10
% 0.68/1.10 checksum: 2012183937
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Bliksem ended
%------------------------------------------------------------------------------