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