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