TSTP Solution File: SYN961+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN961+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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 : Thu Jul 21 02:58:24 EDT 2022
% Result : Theorem 0.41s 1.04s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN961+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n027.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 : Tue Jul 12 07:06:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.04 *** allocated 10000 integers for termspace/termends
% 0.41/1.04 *** allocated 10000 integers for clauses
% 0.41/1.04 *** allocated 10000 integers for justifications
% 0.41/1.04 Bliksem 1.12
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Automatic Strategy Selection
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Clauses:
% 0.41/1.04
% 0.41/1.04 { p( X ) }.
% 0.41/1.04 { ! p( skol1 ), ! p( skol2 ) }.
% 0.41/1.04
% 0.41/1.04 percentage equality = 0.000000, percentage horn = 1.000000
% 0.41/1.04 This is a near-Horn, non-equality problem
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Options Used:
% 0.41/1.04
% 0.41/1.04 useres = 1
% 0.41/1.04 useparamod = 0
% 0.41/1.04 useeqrefl = 0
% 0.41/1.04 useeqfact = 0
% 0.41/1.04 usefactor = 1
% 0.41/1.04 usesimpsplitting = 0
% 0.41/1.04 usesimpdemod = 0
% 0.41/1.04 usesimpres = 4
% 0.41/1.04
% 0.41/1.04 resimpinuse = 1000
% 0.41/1.04 resimpclauses = 20000
% 0.41/1.04 substype = standard
% 0.41/1.04 backwardsubs = 1
% 0.41/1.04 selectoldest = 5
% 0.41/1.04
% 0.41/1.04 litorderings [0] = split
% 0.41/1.04 litorderings [1] = liftord
% 0.41/1.04
% 0.41/1.04 termordering = none
% 0.41/1.04
% 0.41/1.04 litapriori = 1
% 0.41/1.04 termapriori = 0
% 0.41/1.04 litaposteriori = 0
% 0.41/1.04 termaposteriori = 0
% 0.41/1.04 demodaposteriori = 0
% 0.41/1.04 ordereqreflfact = 0
% 0.41/1.04
% 0.41/1.04 litselect = negative
% 0.41/1.04
% 0.41/1.04 maxweight = 30000
% 0.41/1.04 maxdepth = 30000
% 0.41/1.04 maxlength = 115
% 0.41/1.04 maxnrvars = 195
% 0.41/1.04 excuselevel = 0
% 0.41/1.04 increasemaxweight = 0
% 0.41/1.04
% 0.41/1.04 maxselected = 10000000
% 0.41/1.04 maxnrclauses = 10000000
% 0.41/1.04
% 0.41/1.04 showgenerated = 0
% 0.41/1.04 showkept = 0
% 0.41/1.04 showselected = 0
% 0.41/1.04 showdeleted = 0
% 0.41/1.04 showresimp = 1
% 0.41/1.04 showstatus = 2000
% 0.41/1.04
% 0.41/1.04 prologoutput = 0
% 0.41/1.04 nrgoals = 5000000
% 0.41/1.04 totalproof = 1
% 0.41/1.04
% 0.41/1.04 Symbols occurring in the translation:
% 0.41/1.04
% 0.41/1.04 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.04 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.41/1.04 ! [4, 1] (w:1, o:11, a:1, s:1, b:0),
% 0.41/1.04 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.04 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.04 p [38, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.41/1.04 skol1 [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.41/1.04 skol2 [40, 0] (w:1, o:10, a:1, s:1, b:0).
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Starting Search:
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Bliksems!, er is een bewijs:
% 0.41/1.04 % SZS status Theorem
% 0.41/1.04 % SZS output start Refutation
% 0.41/1.04
% 0.41/1.04 (0) {G0,W2,D2,L1,V1,M1} I { p( X ) }.
% 0.41/1.04 (1) {G1,W3,D2,L1,V0,M1} I;r(0) { ! p( skol2 ) }.
% 0.41/1.04 (2) {G2,W0,D0,L0,V0,M0} S(1);r(0) { }.
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 % SZS output end Refutation
% 0.41/1.04 found a proof!
% 0.41/1.04
% 0.41/1.04
% 0.41/1.04 Unprocessed initial clauses:
% 0.41/1.04
% 0.41/1.04 (4) {G0,W2,D2,L1,V1,M1} { p( X ) }.
% 0.41/1.05 (5) {G0,W6,D2,L2,V0,M2} { ! p( skol1 ), ! p( skol2 ) }.
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Total Proof:
% 0.41/1.05
% 0.41/1.05 subsumption: (0) {G0,W2,D2,L1,V1,M1} I { p( X ) }.
% 0.41/1.05 parent0: (4) {G0,W2,D2,L1,V1,M1} { p( X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 resolution: (6) {G1,W3,D2,L1,V0,M1} { ! p( skol2 ) }.
% 0.41/1.05 parent0[0]: (5) {G0,W6,D2,L2,V0,M2} { ! p( skol1 ), ! p( skol2 ) }.
% 0.41/1.05 parent1[0]: (0) {G0,W2,D2,L1,V1,M1} I { p( X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 X := skol1
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (1) {G1,W3,D2,L1,V0,M1} I;r(0) { ! p( skol2 ) }.
% 0.41/1.05 parent0: (6) {G1,W3,D2,L1,V0,M1} { ! p( skol2 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 resolution: (8) {G1,W0,D0,L0,V0,M0} { }.
% 0.41/1.05 parent0[0]: (1) {G1,W3,D2,L1,V0,M1} I;r(0) { ! p( skol2 ) }.
% 0.41/1.05 parent1[0]: (0) {G0,W2,D2,L1,V1,M1} I { p( X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 X := skol2
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (2) {G2,W0,D0,L0,V0,M0} S(1);r(0) { }.
% 0.41/1.05 parent0: (8) {G1,W0,D0,L0,V0,M0} { }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 Proof check complete!
% 0.41/1.05
% 0.41/1.05 Memory use:
% 0.41/1.05
% 0.41/1.05 space for terms: 34
% 0.41/1.05 space for clauses: 125
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 clauses generated: 3
% 0.41/1.05 clauses kept: 3
% 0.41/1.05 clauses selected: 1
% 0.41/1.05 clauses deleted: 1
% 0.41/1.05 clauses inuse deleted: 0
% 0.41/1.05
% 0.41/1.05 subsentry: 1
% 0.41/1.05 literals s-matched: 0
% 0.41/1.05 literals matched: 0
% 0.41/1.05 full subsumption: 0
% 0.41/1.05
% 0.41/1.05 checksum: -1183
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Bliksem ended
%------------------------------------------------------------------------------