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