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