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