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