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