TSTP Solution File: SEU186+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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 : Tue Jul 19 07:11:15 EDT 2022
% Result : Theorem 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n010.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 : Sun Jun 19 15:11:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.07 *** allocated 10000 integers for termspace/termends
% 0.43/1.07 *** allocated 10000 integers for clauses
% 0.43/1.07 *** allocated 10000 integers for justifications
% 0.43/1.07 Bliksem 1.12
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Automatic Strategy Selection
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Clauses:
% 0.43/1.07
% 0.43/1.07 { ! in( X, Y ), ! in( Y, X ) }.
% 0.43/1.07 { ! empty( X ), relation( X ) }.
% 0.43/1.07 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.43/1.07 { ! relation( X ), ! in( Y, X ), Y = ordered_pair( skol1( Y ), skol8( Y ) )
% 0.43/1.07 }.
% 0.43/1.07 { ! skol9( Y ) = ordered_pair( Z, T ), relation( X ) }.
% 0.43/1.07 { in( skol9( X ), X ), relation( X ) }.
% 0.43/1.07 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.43/1.07 ( X ) ) }.
% 0.43/1.07 { && }.
% 0.43/1.07 { && }.
% 0.43/1.07 { && }.
% 0.43/1.07 { && }.
% 0.43/1.07 { && }.
% 0.43/1.07 { element( skol2( X ), X ) }.
% 0.43/1.07 { empty( empty_set ) }.
% 0.43/1.07 { ! empty( ordered_pair( X, Y ) ) }.
% 0.43/1.07 { ! empty( singleton( X ) ) }.
% 0.43/1.07 { ! empty( unordered_pair( X, Y ) ) }.
% 0.43/1.07 { empty( empty_set ) }.
% 0.43/1.07 { relation( empty_set ) }.
% 0.43/1.07 { empty( skol3 ) }.
% 0.43/1.07 { relation( skol3 ) }.
% 0.43/1.07 { empty( skol4 ) }.
% 0.43/1.07 { ! empty( skol5 ) }.
% 0.43/1.07 { relation( skol5 ) }.
% 0.43/1.07 { ! empty( skol6 ) }.
% 0.43/1.07 { ! in( X, Y ), element( X, Y ) }.
% 0.43/1.07 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.43/1.07 { relation( skol7 ) }.
% 0.43/1.07 { ! in( ordered_pair( X, Y ), skol7 ) }.
% 0.43/1.07 { ! skol7 = empty_set }.
% 0.43/1.07 { ! empty( X ), X = empty_set }.
% 0.43/1.07 { ! in( X, Y ), ! empty( Y ) }.
% 0.43/1.07 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.43/1.07
% 0.43/1.07 percentage equality = 0.170732, percentage horn = 0.928571
% 0.43/1.07 This is a problem with some equality
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Options Used:
% 0.43/1.07
% 0.43/1.07 useres = 1
% 0.43/1.07 useparamod = 1
% 0.43/1.07 useeqrefl = 1
% 0.43/1.07 useeqfact = 1
% 0.43/1.07 usefactor = 1
% 0.43/1.07 usesimpsplitting = 0
% 0.43/1.07 usesimpdemod = 5
% 0.43/1.07 usesimpres = 3
% 0.43/1.07
% 0.43/1.07 resimpinuse = 1000
% 0.43/1.07 resimpclauses = 20000
% 0.43/1.07 substype = eqrewr
% 0.43/1.07 backwardsubs = 1
% 0.43/1.07 selectoldest = 5
% 0.43/1.07
% 0.43/1.07 litorderings [0] = split
% 0.43/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.07
% 0.43/1.07 termordering = kbo
% 0.43/1.07
% 0.43/1.07 litapriori = 0
% 0.43/1.07 termapriori = 1
% 0.43/1.07 litaposteriori = 0
% 0.43/1.07 termaposteriori = 0
% 0.43/1.07 demodaposteriori = 0
% 0.43/1.07 ordereqreflfact = 0
% 0.43/1.07
% 0.43/1.07 litselect = negord
% 0.43/1.07
% 0.43/1.07 maxweight = 15
% 0.43/1.07 maxdepth = 30000
% 0.43/1.07 maxlength = 115
% 0.43/1.07 maxnrvars = 195
% 0.43/1.07 excuselevel = 1
% 0.43/1.07 increasemaxweight = 1
% 0.43/1.07
% 0.43/1.07 maxselected = 10000000
% 0.43/1.07 maxnrclauses = 10000000
% 0.43/1.07
% 0.43/1.07 showgenerated = 0
% 0.43/1.07 showkept = 0
% 0.43/1.07 showselected = 0
% 0.43/1.07 showdeleted = 0
% 0.43/1.07 showresimp = 1
% 0.43/1.07 showstatus = 2000
% 0.43/1.07
% 0.43/1.07 prologoutput = 0
% 0.43/1.07 nrgoals = 5000000
% 0.43/1.07 totalproof = 1
% 0.43/1.07
% 0.43/1.07 Symbols occurring in the translation:
% 0.43/1.07
% 0.43/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.07 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 0.43/1.07 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.43/1.07 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.43/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.07 in [37, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.43/1.07 empty [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.07 relation [39, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.43/1.07 unordered_pair [40, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.43/1.07 ordered_pair [43, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.43/1.07 singleton [44, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.43/1.07 element [45, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.43/1.07 empty_set [46, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.43/1.07 skol1 [47, 1] (w:1, o:24, a:1, s:1, b:1),
% 0.43/1.07 skol2 [48, 1] (w:1, o:25, a:1, s:1, b:1),
% 0.43/1.07 skol3 [49, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.43/1.07 skol4 [50, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.43/1.07 skol5 [51, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.43/1.07 skol6 [52, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.43/1.07 skol7 [53, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.43/1.07 skol8 [54, 1] (w:1, o:26, a:1, s:1, b:1),
% 0.43/1.07 skol9 [55, 1] (w:1, o:27, a:1, s:1, b:1).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Starting Search:
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksems!, er is een bewijs:
% 0.43/1.07 % SZS status Theorem
% 0.43/1.07 % SZS output start Refutation
% 0.43/1.07
% 0.43/1.07 (3) {G0,W12,D4,L3,V2,M3} I { ! relation( X ), ! in( Y, X ), ordered_pair(
% 0.43/1.07 skol1( Y ), skol8( Y ) ) ==> Y }.
% 0.43/1.07 (8) {G0,W4,D3,L1,V1,M1} I { element( skol2( X ), X ) }.
% 0.43/1.07 (21) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.43/1.07 (22) {G0,W2,D2,L1,V0,M1} I { relation( skol7 ) }.
% 0.43/1.07 (23) {G0,W5,D3,L1,V2,M1} I { ! in( ordered_pair( X, Y ), skol7 ) }.
% 0.43/1.07 (24) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> empty_set }.
% 0.43/1.07 (25) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.43/1.07 (48) {G1,W2,D2,L1,V0,M1} P(25,24);q { ! empty( skol7 ) }.
% 0.43/1.07 (52) {G1,W8,D2,L3,V2,M3} P(3,23) { ! in( X, skol7 ), ! relation( Y ), ! in
% 0.43/1.07 ( X, Y ) }.
% 0.43/1.07 (53) {G2,W3,D2,L1,V1,M1} F(52);r(22) { ! in( X, skol7 ) }.
% 0.43/1.07 (79) {G3,W3,D2,L1,V1,M1} R(21,53);r(48) { ! element( X, skol7 ) }.
% 0.43/1.07 (93) {G4,W0,D0,L0,V0,M0} R(79,8) { }.
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 % SZS output end Refutation
% 0.43/1.07 found a proof!
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Unprocessed initial clauses:
% 0.43/1.07
% 0.43/1.07 (95) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.43/1.07 (96) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.43/1.07 (97) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.43/1.07 }.
% 0.43/1.07 (98) {G0,W12,D4,L3,V2,M3} { ! relation( X ), ! in( Y, X ), Y =
% 0.43/1.07 ordered_pair( skol1( Y ), skol8( Y ) ) }.
% 0.43/1.07 (99) {G0,W8,D3,L2,V4,M2} { ! skol9( Y ) = ordered_pair( Z, T ), relation(
% 0.43/1.07 X ) }.
% 0.43/1.07 (100) {G0,W6,D3,L2,V1,M2} { in( skol9( X ), X ), relation( X ) }.
% 0.43/1.07 (101) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.43/1.07 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.43/1.07 (102) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.07 (103) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.07 (104) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.07 (105) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.07 (106) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.07 (107) {G0,W4,D3,L1,V1,M1} { element( skol2( X ), X ) }.
% 0.43/1.07 (108) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.43/1.07 (109) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.43/1.07 (110) {G0,W3,D3,L1,V1,M1} { ! empty( singleton( X ) ) }.
% 0.43/1.07 (111) {G0,W4,D3,L1,V2,M1} { ! empty( unordered_pair( X, Y ) ) }.
% 0.43/1.07 (112) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.43/1.07 (113) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.43/1.07 (114) {G0,W2,D2,L1,V0,M1} { empty( skol3 ) }.
% 0.43/1.07 (115) {G0,W2,D2,L1,V0,M1} { relation( skol3 ) }.
% 0.43/1.07 (116) {G0,W2,D2,L1,V0,M1} { empty( skol4 ) }.
% 0.43/1.07 (117) {G0,W2,D2,L1,V0,M1} { ! empty( skol5 ) }.
% 0.43/1.07 (118) {G0,W2,D2,L1,V0,M1} { relation( skol5 ) }.
% 0.43/1.07 (119) {G0,W2,D2,L1,V0,M1} { ! empty( skol6 ) }.
% 0.43/1.07 (120) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.43/1.07 (121) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.43/1.07 (122) {G0,W2,D2,L1,V0,M1} { relation( skol7 ) }.
% 0.43/1.07 (123) {G0,W5,D3,L1,V2,M1} { ! in( ordered_pair( X, Y ), skol7 ) }.
% 0.43/1.07 (124) {G0,W3,D2,L1,V0,M1} { ! skol7 = empty_set }.
% 0.43/1.07 (125) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.43/1.07 (126) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.43/1.07 (127) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Total Proof:
% 0.43/1.07
% 0.43/1.07 eqswap: (129) {G0,W12,D4,L3,V2,M3} { ordered_pair( skol1( X ), skol8( X )
% 0.43/1.07 ) = X, ! relation( Y ), ! in( X, Y ) }.
% 0.43/1.07 parent0[2]: (98) {G0,W12,D4,L3,V2,M3} { ! relation( X ), ! in( Y, X ), Y =
% 0.43/1.07 ordered_pair( skol1( Y ), skol8( Y ) ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := Y
% 0.43/1.07 Y := X
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (3) {G0,W12,D4,L3,V2,M3} I { ! relation( X ), ! in( Y, X ),
% 0.43/1.07 ordered_pair( skol1( Y ), skol8( Y ) ) ==> Y }.
% 0.43/1.07 parent0: (129) {G0,W12,D4,L3,V2,M3} { ordered_pair( skol1( X ), skol8( X )
% 0.43/1.07 ) = X, ! relation( Y ), ! in( X, Y ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := Y
% 0.43/1.07 Y := X
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 2
% 0.43/1.07 1 ==> 0
% 0.43/1.07 2 ==> 1
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (8) {G0,W4,D3,L1,V1,M1} I { element( skol2( X ), X ) }.
% 0.43/1.07 parent0: (107) {G0,W4,D3,L1,V1,M1} { element( skol2( X ), X ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (21) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in
% 0.43/1.07 ( X, Y ) }.
% 0.43/1.07 parent0: (121) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X
% 0.43/1.07 , Y ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 Y := Y
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 1 ==> 1
% 0.43/1.07 2 ==> 2
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol7 ) }.
% 0.43/1.07 parent0: (122) {G0,W2,D2,L1,V0,M1} { relation( skol7 ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (23) {G0,W5,D3,L1,V2,M1} I { ! in( ordered_pair( X, Y ), skol7
% 0.43/1.07 ) }.
% 0.43/1.07 parent0: (123) {G0,W5,D3,L1,V2,M1} { ! in( ordered_pair( X, Y ), skol7 )
% 0.43/1.07 }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 Y := Y
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (24) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> empty_set }.
% 0.43/1.07 parent0: (124) {G0,W3,D2,L1,V0,M1} { ! skol7 = empty_set }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (25) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.43/1.07 parent0: (125) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 1 ==> 1
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 eqswap: (158) {G0,W3,D2,L1,V0,M1} { ! empty_set ==> skol7 }.
% 0.43/1.07 parent0[0]: (24) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> empty_set }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 paramod: (162) {G1,W5,D2,L2,V0,M2} { ! empty_set ==> empty_set, ! empty(
% 0.43/1.07 skol7 ) }.
% 0.43/1.07 parent0[1]: (25) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.43/1.07 parent1[0; 3]: (158) {G0,W3,D2,L1,V0,M1} { ! empty_set ==> skol7 }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := skol7
% 0.43/1.07 end
% 0.43/1.07 substitution1:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 eqrefl: (173) {G0,W2,D2,L1,V0,M1} { ! empty( skol7 ) }.
% 0.43/1.07 parent0[0]: (162) {G1,W5,D2,L2,V0,M2} { ! empty_set ==> empty_set, ! empty
% 0.43/1.07 ( skol7 ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (48) {G1,W2,D2,L1,V0,M1} P(25,24);q { ! empty( skol7 ) }.
% 0.43/1.07 parent0: (173) {G0,W2,D2,L1,V0,M1} { ! empty( skol7 ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 paramod: (175) {G1,W8,D2,L3,V2,M3} { ! in( X, skol7 ), ! relation( Y ), !
% 0.43/1.07 in( X, Y ) }.
% 0.43/1.07 parent0[2]: (3) {G0,W12,D4,L3,V2,M3} I { ! relation( X ), ! in( Y, X ),
% 0.43/1.08 ordered_pair( skol1( Y ), skol8( Y ) ) ==> Y }.
% 0.43/1.08 parent1[0; 2]: (23) {G0,W5,D3,L1,V2,M1} I { ! in( ordered_pair( X, Y ),
% 0.43/1.08 skol7 ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := Y
% 0.43/1.08 Y := X
% 0.43/1.08 end
% 0.43/1.08 substitution1:
% 0.43/1.08 X := skol1( X )
% 0.43/1.08 Y := skol8( X )
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 subsumption: (52) {G1,W8,D2,L3,V2,M3} P(3,23) { ! in( X, skol7 ), !
% 0.43/1.08 relation( Y ), ! in( X, Y ) }.
% 0.43/1.08 parent0: (175) {G1,W8,D2,L3,V2,M3} { ! in( X, skol7 ), ! relation( Y ), !
% 0.43/1.08 in( X, Y ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := X
% 0.43/1.08 Y := Y
% 0.43/1.08 end
% 0.43/1.08 permutation0:
% 0.43/1.08 0 ==> 0
% 0.43/1.08 1 ==> 1
% 0.43/1.08 2 ==> 2
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 factor: (177) {G1,W5,D2,L2,V1,M2} { ! in( X, skol7 ), ! relation( skol7 )
% 0.43/1.08 }.
% 0.43/1.08 parent0[0, 2]: (52) {G1,W8,D2,L3,V2,M3} P(3,23) { ! in( X, skol7 ), !
% 0.43/1.08 relation( Y ), ! in( X, Y ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := X
% 0.43/1.08 Y := skol7
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 resolution: (178) {G1,W3,D2,L1,V1,M1} { ! in( X, skol7 ) }.
% 0.43/1.08 parent0[1]: (177) {G1,W5,D2,L2,V1,M2} { ! in( X, skol7 ), ! relation(
% 0.43/1.08 skol7 ) }.
% 0.43/1.08 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol7 ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := X
% 0.43/1.08 end
% 0.43/1.08 substitution1:
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 subsumption: (53) {G2,W3,D2,L1,V1,M1} F(52);r(22) { ! in( X, skol7 ) }.
% 0.43/1.08 parent0: (178) {G1,W3,D2,L1,V1,M1} { ! in( X, skol7 ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := X
% 0.43/1.08 end
% 0.43/1.08 permutation0:
% 0.43/1.08 0 ==> 0
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 resolution: (179) {G1,W5,D2,L2,V1,M2} { ! element( X, skol7 ), empty(
% 0.43/1.08 skol7 ) }.
% 0.43/1.08 parent0[0]: (53) {G2,W3,D2,L1,V1,M1} F(52);r(22) { ! in( X, skol7 ) }.
% 0.43/1.08 parent1[2]: (21) {G0,W8,D2,L3,V2,M3} I { ! element( X, Y ), empty( Y ), in
% 0.43/1.08 ( X, Y ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := X
% 0.43/1.08 end
% 0.43/1.08 substitution1:
% 0.43/1.08 X := X
% 0.43/1.08 Y := skol7
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 resolution: (180) {G2,W3,D2,L1,V1,M1} { ! element( X, skol7 ) }.
% 0.43/1.08 parent0[0]: (48) {G1,W2,D2,L1,V0,M1} P(25,24);q { ! empty( skol7 ) }.
% 0.43/1.08 parent1[1]: (179) {G1,W5,D2,L2,V1,M2} { ! element( X, skol7 ), empty(
% 0.43/1.08 skol7 ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 end
% 0.43/1.08 substitution1:
% 0.43/1.08 X := X
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 subsumption: (79) {G3,W3,D2,L1,V1,M1} R(21,53);r(48) { ! element( X, skol7
% 0.43/1.08 ) }.
% 0.43/1.08 parent0: (180) {G2,W3,D2,L1,V1,M1} { ! element( X, skol7 ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := X
% 0.43/1.08 end
% 0.43/1.08 permutation0:
% 0.43/1.08 0 ==> 0
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 resolution: (181) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.08 parent0[0]: (79) {G3,W3,D2,L1,V1,M1} R(21,53);r(48) { ! element( X, skol7 )
% 0.43/1.08 }.
% 0.43/1.08 parent1[0]: (8) {G0,W4,D3,L1,V1,M1} I { element( skol2( X ), X ) }.
% 0.43/1.08 substitution0:
% 0.43/1.08 X := skol2( skol7 )
% 0.43/1.08 end
% 0.43/1.08 substitution1:
% 0.43/1.08 X := skol7
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 subsumption: (93) {G4,W0,D0,L0,V0,M0} R(79,8) { }.
% 0.43/1.08 parent0: (181) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.08 substitution0:
% 0.43/1.08 end
% 0.43/1.08 permutation0:
% 0.43/1.08 end
% 0.43/1.08
% 0.43/1.08 Proof check complete!
% 0.43/1.08
% 0.43/1.08 Memory use:
% 0.43/1.08
% 0.43/1.08 space for terms: 1203
% 0.43/1.08 space for clauses: 4995
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 clauses generated: 208
% 0.43/1.08 clauses kept: 94
% 0.43/1.08 clauses selected: 42
% 0.43/1.08 clauses deleted: 0
% 0.43/1.08 clauses inuse deleted: 0
% 0.43/1.08
% 0.43/1.08 subsentry: 611
% 0.43/1.08 literals s-matched: 494
% 0.43/1.08 literals matched: 494
% 0.43/1.08 full subsumption: 16
% 0.43/1.08
% 0.43/1.08 checksum: -1335103497
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 Bliksem ended
%------------------------------------------------------------------------------