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