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