TSTP Solution File: SYN389+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN389+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:50:17 EDT 2022
% Result : Theorem 0.63s 1.01s
% Output : Refutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SYN389+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.09 % Command : bliksem %s
% 0.08/0.28 % Computer : n018.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % DateTime : Mon Jul 11 21:54:14 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.63/1.01 *** allocated 10000 integers for termspace/termends
% 0.63/1.01 *** allocated 10000 integers for clauses
% 0.63/1.01 *** allocated 10000 integers for justifications
% 0.63/1.01 Bliksem 1.12
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Automatic Strategy Selection
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Clauses:
% 0.63/1.01
% 0.63/1.01 { p, p }.
% 0.63/1.01 { ! q, p }.
% 0.63/1.01 { ! p }.
% 0.63/1.01
% 0.63/1.01 percentage equality = 0.000000, percentage horn = 0.500000
% 0.63/1.01 This a non-horn, non-equality problem
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Options Used:
% 0.63/1.01
% 0.63/1.01 useres = 1
% 0.63/1.01 useparamod = 0
% 0.63/1.01 useeqrefl = 0
% 0.63/1.01 useeqfact = 0
% 0.63/1.01 usefactor = 1
% 0.63/1.01 usesimpsplitting = 0
% 0.63/1.01 usesimpdemod = 0
% 0.63/1.01 usesimpres = 3
% 0.63/1.01
% 0.63/1.01 resimpinuse = 1000
% 0.63/1.01 resimpclauses = 20000
% 0.63/1.01 substype = standard
% 0.63/1.01 backwardsubs = 1
% 0.63/1.01 selectoldest = 5
% 0.63/1.01
% 0.63/1.01 litorderings [0] = split
% 0.63/1.01 litorderings [1] = liftord
% 0.63/1.01
% 0.63/1.01 termordering = none
% 0.63/1.01
% 0.63/1.01 litapriori = 1
% 0.63/1.01 termapriori = 0
% 0.63/1.01 litaposteriori = 0
% 0.63/1.01 termaposteriori = 0
% 0.63/1.01 demodaposteriori = 0
% 0.63/1.01 ordereqreflfact = 0
% 0.63/1.01
% 0.63/1.01 litselect = none
% 0.63/1.01
% 0.63/1.01 maxweight = 15
% 0.63/1.01 maxdepth = 30000
% 0.63/1.01 maxlength = 115
% 0.63/1.01 maxnrvars = 195
% 0.63/1.01 excuselevel = 1
% 0.63/1.01 increasemaxweight = 1
% 0.63/1.01
% 0.63/1.01 maxselected = 10000000
% 0.63/1.01 maxnrclauses = 10000000
% 0.63/1.01
% 0.63/1.01 showgenerated = 0
% 0.63/1.01 showkept = 0
% 0.63/1.01 showselected = 0
% 0.63/1.01 showdeleted = 0
% 0.63/1.01 showresimp = 1
% 0.63/1.01 showstatus = 2000
% 0.63/1.01
% 0.63/1.01 prologoutput = 0
% 0.63/1.01 nrgoals = 5000000
% 0.63/1.01 totalproof = 1
% 0.63/1.01
% 0.63/1.01 Symbols occurring in the translation:
% 0.63/1.01
% 0.63/1.01 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.63/1.01 . [1, 2] (w:1, o:13, a:1, s:1, b:0),
% 0.63/1.01 ! [4, 1] (w:0, o:8, a:1, s:1, b:0),
% 0.63/1.01 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.63/1.01 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.63/1.01 p [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.63/1.01 q [36, 0] (w:1, o:7, a:1, s:1, b:0).
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Starting Search:
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Bliksems!, er is een bewijs:
% 0.63/1.01 % SZS status Theorem
% 0.63/1.01 % SZS output start Refutation
% 0.63/1.01
% 0.63/1.01 (0) {G0,W1,D1,L1,V0,M1} I;f { p }.
% 0.63/1.01 (1) {G1,W0,D0,L0,V0,M0} I;r(0) { }.
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 % SZS output end Refutation
% 0.63/1.01 found a proof!
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Unprocessed initial clauses:
% 0.63/1.01
% 0.63/1.01 (3) {G0,W2,D1,L2,V0,M2} { p, p }.
% 0.63/1.01 (4) {G0,W2,D1,L2,V0,M2} { ! q, p }.
% 0.63/1.01 (5) {G0,W1,D1,L1,V0,M1} { ! p }.
% 0.63/1.01
% 0.63/1.01
% 0.63/1.01 Total Proof:
% 0.63/1.01
% 0.63/1.01 factor: (6) {G0,W1,D1,L1,V0,M1} { p }.
% 0.63/1.01 parent0[0, 1]: (3) {G0,W2,D1,L2,V0,M2} { p, p }.
% 0.63/1.02 substitution0:
% 0.63/1.02 end
% 0.63/1.02
% 0.63/1.02 subsumption: (0) {G0,W1,D1,L1,V0,M1} I;f { p }.
% 0.63/1.02 parent0: (6) {G0,W1,D1,L1,V0,M1} { p }.
% 0.63/1.02 substitution0:
% 0.63/1.02 end
% 0.63/1.02 permutation0:
% 0.63/1.02 0 ==> 0
% 0.63/1.02 end
% 0.63/1.02
% 0.63/1.02 resolution: (8) {G1,W0,D0,L0,V0,M0} { }.
% 0.63/1.02 parent0[0]: (5) {G0,W1,D1,L1,V0,M1} { ! p }.
% 0.63/1.02 parent1[0]: (0) {G0,W1,D1,L1,V0,M1} I;f { p }.
% 0.63/1.02 substitution0:
% 0.63/1.02 end
% 0.63/1.02 substitution1:
% 0.63/1.02 end
% 0.63/1.02
% 0.63/1.02 subsumption: (1) {G1,W0,D0,L0,V0,M0} I;r(0) { }.
% 0.63/1.02 parent0: (8) {G1,W0,D0,L0,V0,M0} { }.
% 0.63/1.02 substitution0:
% 0.63/1.02 end
% 0.63/1.02 permutation0:
% 0.63/1.02 end
% 0.63/1.02
% 0.63/1.02 Proof check complete!
% 0.63/1.02
% 0.63/1.02 Memory use:
% 0.63/1.02
% 0.63/1.02 space for terms: 25
% 0.63/1.02 space for clauses: 62
% 0.63/1.02
% 0.63/1.02
% 0.63/1.02 clauses generated: 3
% 0.63/1.02 clauses kept: 2
% 0.63/1.02 clauses selected: 0
% 0.63/1.02 clauses deleted: 0
% 0.63/1.02 clauses inuse deleted: 0
% 0.63/1.02
% 0.63/1.02 subsentry: 2
% 0.63/1.02 literals s-matched: 2
% 0.63/1.02 literals matched: 2
% 0.63/1.02 full subsumption: 0
% 0.63/1.02
% 0.63/1.02 checksum: 9
% 0.63/1.02
% 0.63/1.02
% 0.63/1.02 Bliksem ended
%------------------------------------------------------------------------------