TSTP Solution File: SET959+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.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 : Mon Jul 18 22:53:37 EDT 2022
% Result : Theorem 0.45s 1.09s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n012.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 : Sun Jul 10 17:06:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/1.09 *** allocated 10000 integers for termspace/termends
% 0.45/1.09 *** allocated 10000 integers for clauses
% 0.45/1.09 *** allocated 10000 integers for justifications
% 0.45/1.09 Bliksem 1.12
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09 Automatic Strategy Selection
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09 Clauses:
% 0.45/1.09
% 0.45/1.09 { ! in( X, Y ), ! in( Y, X ) }.
% 0.45/1.09 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.45/1.09 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.45/1.09 ( X ) ) }.
% 0.45/1.09 { ! empty( ordered_pair( X, Y ) ) }.
% 0.45/1.09 { empty( skol1 ) }.
% 0.45/1.09 { ! empty( skol2 ) }.
% 0.45/1.09 { ! in( X, skol3 ), X = ordered_pair( skol6( X ), skol7( X ) ) }.
% 0.45/1.09 { ! in( X, skol5 ), X = ordered_pair( skol8( X ), skol9( X ) ) }.
% 0.45/1.09 { ! in( ordered_pair( X, Y ), skol3 ), in( ordered_pair( X, Y ), skol5 ) }
% 0.45/1.09 .
% 0.45/1.09 { ! in( ordered_pair( X, Y ), skol5 ), in( ordered_pair( X, Y ), skol3 ) }
% 0.45/1.09 .
% 0.45/1.09 { ! skol3 = skol5 }.
% 0.45/1.09 { alpha1( X, Y, skol4( X, Y ) ), in( skol4( X, Y ), Y ), X = Y }.
% 0.45/1.09 { alpha1( X, Y, skol4( X, Y ) ), ! in( skol4( X, Y ), X ), X = Y }.
% 0.45/1.09 { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.45/1.09 { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.45/1.09 { ! in( Z, X ), in( Z, Y ), alpha1( X, Y, Z ) }.
% 0.45/1.09
% 0.45/1.09 percentage equality = 0.241379, percentage horn = 0.812500
% 0.45/1.09 This is a problem with some equality
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09 Options Used:
% 0.45/1.09
% 0.45/1.09 useres = 1
% 0.45/1.09 useparamod = 1
% 0.45/1.09 useeqrefl = 1
% 0.45/1.09 useeqfact = 1
% 0.45/1.09 usefactor = 1
% 0.45/1.09 usesimpsplitting = 0
% 0.45/1.09 usesimpdemod = 5
% 0.45/1.09 usesimpres = 3
% 0.45/1.09
% 0.45/1.09 resimpinuse = 1000
% 0.45/1.09 resimpclauses = 20000
% 0.45/1.09 substype = eqrewr
% 0.45/1.09 backwardsubs = 1
% 0.45/1.09 selectoldest = 5
% 0.45/1.09
% 0.45/1.09 litorderings [0] = split
% 0.45/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.09
% 0.45/1.09 termordering = kbo
% 0.45/1.09
% 0.45/1.09 litapriori = 0
% 0.45/1.09 termapriori = 1
% 0.45/1.09 litaposteriori = 0
% 0.45/1.09 termaposteriori = 0
% 0.45/1.09 demodaposteriori = 0
% 0.45/1.09 ordereqreflfact = 0
% 0.45/1.09
% 0.45/1.09 litselect = negord
% 0.45/1.09
% 0.45/1.09 maxweight = 15
% 0.45/1.09 maxdepth = 30000
% 0.45/1.09 maxlength = 115
% 0.45/1.09 maxnrvars = 195
% 0.45/1.09 excuselevel = 1
% 0.45/1.09 increasemaxweight = 1
% 0.45/1.09
% 0.45/1.09 maxselected = 10000000
% 0.45/1.09 maxnrclauses = 10000000
% 0.45/1.09
% 0.45/1.09 showgenerated = 0
% 0.45/1.09 showkept = 0
% 0.45/1.09 showselected = 0
% 0.45/1.09 showdeleted = 0
% 0.45/1.09 showresimp = 1
% 0.45/1.09 showstatus = 2000
% 0.45/1.09
% 0.45/1.09 prologoutput = 0
% 0.45/1.09 nrgoals = 5000000
% 0.45/1.09 totalproof = 1
% 0.45/1.09
% 0.45/1.09 Symbols occurring in the translation:
% 0.45/1.09
% 0.45/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.09 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.45/1.09 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.45/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.09 in [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.45/1.09 unordered_pair [38, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.45/1.09 ordered_pair [39, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.45/1.09 singleton [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.09 empty [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.45/1.09 alpha1 [45, 3] (w:1, o:54, a:1, s:1, b:1),
% 0.45/1.09 skol1 [46, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.45/1.09 skol2 [47, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.45/1.09 skol3 [48, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.45/1.09 skol4 [49, 2] (w:1, o:53, a:1, s:1, b:1),
% 0.45/1.09 skol5 [50, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.45/1.09 skol6 [51, 1] (w:1, o:22, a:1, s:1, b:1),
% 0.45/1.09 skol7 [52, 1] (w:1, o:23, a:1, s:1, b:1),
% 0.45/1.09 skol8 [53, 1] (w:1, o:24, a:1, s:1, b:1),
% 0.45/1.09 skol9 [54, 1] (w:1, o:25, a:1, s:1, b:1).
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09 Starting Search:
% 0.45/1.09
% 0.45/1.09 *** allocated 15000 integers for clauses
% 0.45/1.09 *** allocated 22500 integers for clauses
% 0.45/1.09
% 0.45/1.09 Bliksems!, er is een bewijs:
% 0.45/1.09 % SZS status Theorem
% 0.45/1.09 % SZS output start Refutation
% 0.45/1.09
% 0.45/1.09 (6) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol3 ), ordered_pair( skol6( X ),
% 0.45/1.09 skol7( X ) ) ==> X }.
% 0.45/1.09 (7) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol5 ), ordered_pair( skol8( X ),
% 0.45/1.09 skol9( X ) ) ==> X }.
% 0.45/1.09 (8) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol3 ), in(
% 0.45/1.09 ordered_pair( X, Y ), skol5 ) }.
% 0.45/1.09 (9) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol5 ), in(
% 0.45/1.09 ordered_pair( X, Y ), skol3 ) }.
% 0.45/1.09 (10) {G0,W3,D2,L1,V0,M1} I { ! skol5 ==> skol3 }.
% 0.45/1.09 (11) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol4( X, Y ) ), in( skol4( X,
% 0.45/1.09 Y ), Y ), X = Y }.
% 0.45/1.09 (12) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol4( X, Y ) ), ! in( skol4( X
% 0.45/1.09 , Y ), X ), X = Y }.
% 0.45/1.09 (13) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.45/1.09 (14) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.73/1.09 (55) {G1,W6,D2,L2,V1,M2} P(7,9);f { ! in( X, skol5 ), in( X, skol3 ) }.
% 0.73/1.09 (71) {G1,W6,D2,L2,V1,M2} P(6,8);f { ! in( X, skol3 ), in( X, skol5 ) }.
% 0.73/1.09 (172) {G2,W7,D2,L2,V2,M2} R(55,14) { ! in( X, skol5 ), ! alpha1( Y, skol3,
% 0.73/1.09 X ) }.
% 0.73/1.09 (227) {G1,W14,D3,L3,V1,M3} P(12,10) { ! X = skol3, alpha1( skol5, X, skol4
% 0.73/1.09 ( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 0.73/1.09 (234) {G3,W5,D3,L1,V0,M1} Q(227);r(172) { ! in( skol4( skol5, skol3 ),
% 0.73/1.09 skol5 ) }.
% 0.73/1.09 (245) {G4,W5,D3,L1,V0,M1} R(234,71) { ! in( skol4( skol5, skol3 ), skol3 )
% 0.73/1.09 }.
% 0.73/1.09 (247) {G4,W6,D3,L1,V1,M1} R(234,13) { ! alpha1( skol5, X, skol4( skol5,
% 0.73/1.09 skol3 ) ) }.
% 0.73/1.09 (248) {G5,W3,D2,L1,V0,M1} R(245,11);r(247) { skol5 ==> skol3 }.
% 0.73/1.09 (262) {G6,W0,D0,L0,V0,M0} S(248);r(10) { }.
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 % SZS output end Refutation
% 0.73/1.09 found a proof!
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Unprocessed initial clauses:
% 0.73/1.09
% 0.73/1.09 (264) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.73/1.09 (265) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 0.73/1.09 ) }.
% 0.73/1.09 (266) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.73/1.09 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.73/1.09 (267) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.73/1.09 (268) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.73/1.09 (269) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.73/1.09 (270) {G0,W10,D4,L2,V1,M2} { ! in( X, skol3 ), X = ordered_pair( skol6( X
% 0.73/1.09 ), skol7( X ) ) }.
% 0.73/1.09 (271) {G0,W10,D4,L2,V1,M2} { ! in( X, skol5 ), X = ordered_pair( skol8( X
% 0.73/1.09 ), skol9( X ) ) }.
% 0.73/1.09 (272) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol3 ), in(
% 0.73/1.09 ordered_pair( X, Y ), skol5 ) }.
% 0.73/1.09 (273) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol5 ), in(
% 0.73/1.09 ordered_pair( X, Y ), skol3 ) }.
% 0.73/1.09 (274) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol5 }.
% 0.73/1.09 (275) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol4( X, Y ) ), in( skol4( X,
% 0.73/1.09 Y ), Y ), X = Y }.
% 0.73/1.09 (276) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol4( X, Y ) ), ! in( skol4( X
% 0.73/1.09 , Y ), X ), X = Y }.
% 0.73/1.09 (277) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.73/1.09 (278) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.73/1.09 (279) {G0,W10,D2,L3,V3,M3} { ! in( Z, X ), in( Z, Y ), alpha1( X, Y, Z )
% 0.73/1.09 }.
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Total Proof:
% 0.73/1.09
% 0.73/1.09 eqswap: (282) {G0,W10,D4,L2,V1,M2} { ordered_pair( skol6( X ), skol7( X )
% 0.73/1.09 ) = X, ! in( X, skol3 ) }.
% 0.73/1.09 parent0[1]: (270) {G0,W10,D4,L2,V1,M2} { ! in( X, skol3 ), X =
% 0.73/1.09 ordered_pair( skol6( X ), skol7( X ) ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (6) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol3 ), ordered_pair(
% 0.73/1.09 skol6( X ), skol7( X ) ) ==> X }.
% 0.73/1.09 parent0: (282) {G0,W10,D4,L2,V1,M2} { ordered_pair( skol6( X ), skol7( X )
% 0.73/1.09 ) = X, ! in( X, skol3 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 1
% 0.73/1.09 1 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 eqswap: (286) {G0,W10,D4,L2,V1,M2} { ordered_pair( skol8( X ), skol9( X )
% 0.73/1.09 ) = X, ! in( X, skol5 ) }.
% 0.73/1.09 parent0[1]: (271) {G0,W10,D4,L2,V1,M2} { ! in( X, skol5 ), X =
% 0.73/1.09 ordered_pair( skol8( X ), skol9( X ) ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (7) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol5 ), ordered_pair(
% 0.73/1.09 skol8( X ), skol9( X ) ) ==> X }.
% 0.73/1.09 parent0: (286) {G0,W10,D4,L2,V1,M2} { ordered_pair( skol8( X ), skol9( X )
% 0.73/1.09 ) = X, ! in( X, skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 1
% 0.73/1.09 1 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (8) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol3
% 0.73/1.09 ), in( ordered_pair( X, Y ), skol5 ) }.
% 0.73/1.09 parent0: (272) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol3 )
% 0.73/1.09 , in( ordered_pair( X, Y ), skol5 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (9) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol5
% 0.73/1.09 ), in( ordered_pair( X, Y ), skol3 ) }.
% 0.73/1.09 parent0: (273) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol5 )
% 0.73/1.09 , in( ordered_pair( X, Y ), skol3 ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 eqswap: (299) {G0,W3,D2,L1,V0,M1} { ! skol5 = skol3 }.
% 0.73/1.09 parent0[0]: (274) {G0,W3,D2,L1,V0,M1} { ! skol3 = skol5 }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (10) {G0,W3,D2,L1,V0,M1} I { ! skol5 ==> skol3 }.
% 0.73/1.09 parent0: (299) {G0,W3,D2,L1,V0,M1} { ! skol5 = skol3 }.
% 0.73/1.09 substitution0:
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (11) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol4( X, Y ) ),
% 0.73/1.09 in( skol4( X, Y ), Y ), X = Y }.
% 0.73/1.09 parent0: (275) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol4( X, Y ) ), in(
% 0.73/1.09 skol4( X, Y ), Y ), X = Y }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 2 ==> 2
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (12) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol4( X, Y ) ), !
% 0.73/1.09 in( skol4( X, Y ), X ), X = Y }.
% 0.73/1.09 parent0: (276) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol4( X, Y ) ), ! in
% 0.73/1.09 ( skol4( X, Y ), X ), X = Y }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 2 ==> 2
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (13) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 0.73/1.09 }.
% 0.73/1.09 parent0: (277) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.73/1.09 substitution0:
% 0.73/1.09 X := X
% 0.73/1.09 Y := Y
% 0.73/1.09 Z := Z
% 0.73/1.09 end
% 0.73/1.09 permutation0:
% 0.73/1.09 0 ==> 0
% 0.73/1.09 1 ==> 1
% 0.73/1.09 end
% 0.73/1.09
% 0.73/1.09 subsumption: (14) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 0.73/1.09 }.
% 0.73/1.09 parent0: (278) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.73/1.09 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 Y := Y
% 0.73/1.10 Z := Z
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 1 ==> 1
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 paramod: (329) {G1,W13,D4,L3,V1,M3} { in( X, skol3 ), ! in( X, skol5 ), !
% 0.73/1.10 in( ordered_pair( skol8( X ), skol9( X ) ), skol5 ) }.
% 0.73/1.10 parent0[1]: (7) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol5 ), ordered_pair(
% 0.73/1.10 skol8( X ), skol9( X ) ) ==> X }.
% 0.73/1.10 parent1[1; 1]: (9) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.73/1.10 skol5 ), in( ordered_pair( X, Y ), skol3 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 X := skol8( X )
% 0.73/1.10 Y := skol9( X )
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 paramod: (330) {G1,W12,D2,L4,V1,M4} { ! in( X, skol5 ), ! in( X, skol5 ),
% 0.73/1.10 in( X, skol3 ), ! in( X, skol5 ) }.
% 0.73/1.10 parent0[1]: (7) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol5 ), ordered_pair(
% 0.73/1.10 skol8( X ), skol9( X ) ) ==> X }.
% 0.73/1.10 parent1[2; 2]: (329) {G1,W13,D4,L3,V1,M3} { in( X, skol3 ), ! in( X, skol5
% 0.73/1.10 ), ! in( ordered_pair( skol8( X ), skol9( X ) ), skol5 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 factor: (332) {G1,W9,D2,L3,V1,M3} { ! in( X, skol5 ), in( X, skol3 ), ! in
% 0.73/1.10 ( X, skol5 ) }.
% 0.73/1.10 parent0[0, 1]: (330) {G1,W12,D2,L4,V1,M4} { ! in( X, skol5 ), ! in( X,
% 0.73/1.10 skol5 ), in( X, skol3 ), ! in( X, skol5 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 factor: (333) {G1,W6,D2,L2,V1,M2} { ! in( X, skol5 ), in( X, skol3 ) }.
% 0.73/1.10 parent0[0, 2]: (332) {G1,W9,D2,L3,V1,M3} { ! in( X, skol5 ), in( X, skol3
% 0.73/1.10 ), ! in( X, skol5 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (55) {G1,W6,D2,L2,V1,M2} P(7,9);f { ! in( X, skol5 ), in( X,
% 0.73/1.10 skol3 ) }.
% 0.73/1.10 parent0: (333) {G1,W6,D2,L2,V1,M2} { ! in( X, skol5 ), in( X, skol3 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 1 ==> 1
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 paramod: (336) {G1,W13,D4,L3,V1,M3} { in( X, skol5 ), ! in( X, skol3 ), !
% 0.73/1.10 in( ordered_pair( skol6( X ), skol7( X ) ), skol3 ) }.
% 0.73/1.10 parent0[1]: (6) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol3 ), ordered_pair(
% 0.73/1.10 skol6( X ), skol7( X ) ) ==> X }.
% 0.73/1.10 parent1[1; 1]: (8) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.73/1.10 skol3 ), in( ordered_pair( X, Y ), skol5 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 X := skol6( X )
% 0.73/1.10 Y := skol7( X )
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 paramod: (337) {G1,W12,D2,L4,V1,M4} { ! in( X, skol3 ), ! in( X, skol3 ),
% 0.73/1.10 in( X, skol5 ), ! in( X, skol3 ) }.
% 0.73/1.10 parent0[1]: (6) {G0,W10,D4,L2,V1,M2} I { ! in( X, skol3 ), ordered_pair(
% 0.73/1.10 skol6( X ), skol7( X ) ) ==> X }.
% 0.73/1.10 parent1[2; 2]: (336) {G1,W13,D4,L3,V1,M3} { in( X, skol5 ), ! in( X, skol3
% 0.73/1.10 ), ! in( ordered_pair( skol6( X ), skol7( X ) ), skol3 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 factor: (339) {G1,W9,D2,L3,V1,M3} { ! in( X, skol3 ), in( X, skol5 ), ! in
% 0.73/1.10 ( X, skol3 ) }.
% 0.73/1.10 parent0[0, 1]: (337) {G1,W12,D2,L4,V1,M4} { ! in( X, skol3 ), ! in( X,
% 0.73/1.10 skol3 ), in( X, skol5 ), ! in( X, skol3 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 factor: (340) {G1,W6,D2,L2,V1,M2} { ! in( X, skol3 ), in( X, skol5 ) }.
% 0.73/1.10 parent0[0, 2]: (339) {G1,W9,D2,L3,V1,M3} { ! in( X, skol3 ), in( X, skol5
% 0.73/1.10 ), ! in( X, skol3 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (71) {G1,W6,D2,L2,V1,M2} P(6,8);f { ! in( X, skol3 ), in( X,
% 0.73/1.10 skol5 ) }.
% 0.73/1.10 parent0: (340) {G1,W6,D2,L2,V1,M2} { ! in( X, skol3 ), in( X, skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 0
% 23.34/23.80 1 ==> 1
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (341) {G1,W7,D2,L2,V2,M2} { ! alpha1( X, skol3, Y ), ! in( Y,
% 23.34/23.80 skol5 ) }.
% 23.34/23.80 parent0[1]: (14) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 23.34/23.80 }.
% 23.34/23.80 parent1[1]: (55) {G1,W6,D2,L2,V1,M2} P(7,9);f { ! in( X, skol5 ), in( X,
% 23.34/23.80 skol3 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 Y := skol3
% 23.34/23.80 Z := Y
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 X := Y
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (172) {G2,W7,D2,L2,V2,M2} R(55,14) { ! in( X, skol5 ), !
% 23.34/23.80 alpha1( Y, skol3, X ) }.
% 23.34/23.80 parent0: (341) {G1,W7,D2,L2,V2,M2} { ! alpha1( X, skol3, Y ), ! in( Y,
% 23.34/23.80 skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := Y
% 23.34/23.80 Y := X
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 1
% 23.34/23.80 1 ==> 0
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 *** allocated 15000 integers for termspace/termends
% 23.34/23.80 *** allocated 22500 integers for termspace/termends
% 23.34/23.80 *** allocated 33750 integers for clauses
% 23.34/23.80 *** allocated 33750 integers for termspace/termends
% 23.34/23.80 *** allocated 15000 integers for justifications
% 23.34/23.80 *** allocated 50625 integers for termspace/termends
% 23.34/23.80 *** allocated 22500 integers for justifications
% 23.34/23.80 *** allocated 50625 integers for clauses
% 23.34/23.80 *** allocated 75937 integers for termspace/termends
% 23.34/23.80 *** allocated 33750 integers for justifications
% 23.34/23.80 *** allocated 113905 integers for termspace/termends
% 23.34/23.80 *** allocated 75937 integers for clauses
% 23.34/23.80 *** allocated 50625 integers for justifications
% 23.34/23.80 *** allocated 170857 integers for termspace/termends
% 23.34/23.80 *** allocated 256285 integers for termspace/termends
% 23.34/23.80 *** allocated 113905 integers for clauses
% 23.34/23.80 *** allocated 75937 integers for justifications
% 23.34/23.80 *** allocated 384427 integers for termspace/termends
% 23.34/23.80 *** allocated 113905 integers for justifications
% 23.34/23.80 *** allocated 170857 integers for clauses
% 23.34/23.80 *** allocated 576640 integers for termspace/termends
% 23.34/23.80 *** allocated 170857 integers for justifications
% 23.34/23.80 *** allocated 256285 integers for clauses
% 23.34/23.80 *** allocated 864960 integers for termspace/termends
% 23.34/23.80 *** allocated 256285 integers for justifications
% 23.34/23.80 *** allocated 384427 integers for clauses
% 23.34/23.80 *** allocated 1297440 integers for termspace/termends
% 23.34/23.80 *** allocated 384427 integers for justifications
% 23.34/23.80 *** allocated 576640 integers for clauses
% 23.34/23.80 eqswap: (343) {G0,W3,D2,L1,V0,M1} { ! skol3 ==> skol5 }.
% 23.34/23.80 parent0[0]: (10) {G0,W3,D2,L1,V0,M1} I { ! skol5 ==> skol3 }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 paramod: (27213) {G1,W14,D3,L3,V1,M3} { ! skol3 ==> X, alpha1( skol5, X,
% 23.34/23.80 skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 parent0[2]: (12) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol4( X, Y ) ), !
% 23.34/23.80 in( skol4( X, Y ), X ), X = Y }.
% 23.34/23.80 parent1[0; 3]: (343) {G0,W3,D2,L1,V0,M1} { ! skol3 ==> skol5 }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := skol5
% 23.34/23.80 Y := X
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 eqswap: (27471) {G1,W14,D3,L3,V1,M3} { ! X ==> skol3, alpha1( skol5, X,
% 23.34/23.80 skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 parent0[0]: (27213) {G1,W14,D3,L3,V1,M3} { ! skol3 ==> X, alpha1( skol5, X
% 23.34/23.80 , skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (227) {G1,W14,D3,L3,V1,M3} P(12,10) { ! X = skol3, alpha1(
% 23.34/23.80 skol5, X, skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 parent0: (27471) {G1,W14,D3,L3,V1,M3} { ! X ==> skol3, alpha1( skol5, X,
% 23.34/23.80 skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 0
% 23.34/23.80 1 ==> 1
% 23.34/23.80 2 ==> 2
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 eqswap: (30370) {G1,W14,D3,L3,V1,M3} { ! skol3 = X, alpha1( skol5, X,
% 23.34/23.80 skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 parent0[0]: (227) {G1,W14,D3,L3,V1,M3} P(12,10) { ! X = skol3, alpha1(
% 23.34/23.80 skol5, X, skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 eqrefl: (30371) {G0,W11,D3,L2,V0,M2} { alpha1( skol5, skol3, skol4( skol5
% 23.34/23.80 , skol3 ) ), ! in( skol4( skol5, skol3 ), skol5 ) }.
% 23.34/23.80 parent0[0]: (30370) {G1,W14,D3,L3,V1,M3} { ! skol3 = X, alpha1( skol5, X,
% 23.34/23.80 skol4( skol5, X ) ), ! in( skol4( skol5, X ), skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := skol3
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (30372) {G1,W10,D3,L2,V0,M2} { ! in( skol4( skol5, skol3 ),
% 23.34/23.80 skol5 ), ! in( skol4( skol5, skol3 ), skol5 ) }.
% 23.34/23.80 parent0[1]: (172) {G2,W7,D2,L2,V2,M2} R(55,14) { ! in( X, skol5 ), ! alpha1
% 23.34/23.80 ( Y, skol3, X ) }.
% 23.34/23.80 parent1[0]: (30371) {G0,W11,D3,L2,V0,M2} { alpha1( skol5, skol3, skol4(
% 23.34/23.80 skol5, skol3 ) ), ! in( skol4( skol5, skol3 ), skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := skol4( skol5, skol3 )
% 23.34/23.80 Y := skol5
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 factor: (30373) {G1,W5,D3,L1,V0,M1} { ! in( skol4( skol5, skol3 ), skol5 )
% 23.34/23.80 }.
% 23.34/23.80 parent0[0, 1]: (30372) {G1,W10,D3,L2,V0,M2} { ! in( skol4( skol5, skol3 )
% 23.34/23.80 , skol5 ), ! in( skol4( skol5, skol3 ), skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (234) {G3,W5,D3,L1,V0,M1} Q(227);r(172) { ! in( skol4( skol5,
% 23.34/23.80 skol3 ), skol5 ) }.
% 23.34/23.80 parent0: (30373) {G1,W5,D3,L1,V0,M1} { ! in( skol4( skol5, skol3 ), skol5
% 23.34/23.80 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 0
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (30374) {G2,W5,D3,L1,V0,M1} { ! in( skol4( skol5, skol3 ),
% 23.34/23.80 skol3 ) }.
% 23.34/23.80 parent0[0]: (234) {G3,W5,D3,L1,V0,M1} Q(227);r(172) { ! in( skol4( skol5,
% 23.34/23.80 skol3 ), skol5 ) }.
% 23.34/23.80 parent1[1]: (71) {G1,W6,D2,L2,V1,M2} P(6,8);f { ! in( X, skol3 ), in( X,
% 23.34/23.80 skol5 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 X := skol4( skol5, skol3 )
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (245) {G4,W5,D3,L1,V0,M1} R(234,71) { ! in( skol4( skol5,
% 23.34/23.80 skol3 ), skol3 ) }.
% 23.34/23.80 parent0: (30374) {G2,W5,D3,L1,V0,M1} { ! in( skol4( skol5, skol3 ), skol3
% 23.34/23.80 ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 0
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (30375) {G1,W6,D3,L1,V1,M1} { ! alpha1( skol5, X, skol4( skol5
% 23.34/23.80 , skol3 ) ) }.
% 23.34/23.80 parent0[0]: (234) {G3,W5,D3,L1,V0,M1} Q(227);r(172) { ! in( skol4( skol5,
% 23.34/23.80 skol3 ), skol5 ) }.
% 23.34/23.80 parent1[1]: (13) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 23.34/23.80 }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 X := skol5
% 23.34/23.80 Y := X
% 23.34/23.80 Z := skol4( skol5, skol3 )
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (247) {G4,W6,D3,L1,V1,M1} R(234,13) { ! alpha1( skol5, X,
% 23.34/23.80 skol4( skol5, skol3 ) ) }.
% 23.34/23.80 parent0: (30375) {G1,W6,D3,L1,V1,M1} { ! alpha1( skol5, X, skol4( skol5,
% 23.34/23.80 skol3 ) ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 0
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 eqswap: (30376) {G0,W14,D3,L3,V2,M3} { Y = X, alpha1( X, Y, skol4( X, Y )
% 23.34/23.80 ), in( skol4( X, Y ), Y ) }.
% 23.34/23.80 parent0[2]: (11) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol4( X, Y ) ), in
% 23.34/23.80 ( skol4( X, Y ), Y ), X = Y }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := X
% 23.34/23.80 Y := Y
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (30377) {G1,W9,D3,L2,V0,M2} { skol3 = skol5, alpha1( skol5,
% 23.34/23.80 skol3, skol4( skol5, skol3 ) ) }.
% 23.34/23.80 parent0[0]: (245) {G4,W5,D3,L1,V0,M1} R(234,71) { ! in( skol4( skol5, skol3
% 23.34/23.80 ), skol3 ) }.
% 23.34/23.80 parent1[2]: (30376) {G0,W14,D3,L3,V2,M3} { Y = X, alpha1( X, Y, skol4( X,
% 23.34/23.80 Y ) ), in( skol4( X, Y ), Y ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 X := skol5
% 23.34/23.80 Y := skol3
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (30378) {G2,W3,D2,L1,V0,M1} { skol3 = skol5 }.
% 23.34/23.80 parent0[0]: (247) {G4,W6,D3,L1,V1,M1} R(234,13) { ! alpha1( skol5, X, skol4
% 23.34/23.80 ( skol5, skol3 ) ) }.
% 23.34/23.80 parent1[1]: (30377) {G1,W9,D3,L2,V0,M2} { skol3 = skol5, alpha1( skol5,
% 23.34/23.80 skol3, skol4( skol5, skol3 ) ) }.
% 23.34/23.80 substitution0:
% 23.34/23.80 X := skol3
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 eqswap: (30379) {G2,W3,D2,L1,V0,M1} { skol5 = skol3 }.
% 23.34/23.80 parent0[0]: (30378) {G2,W3,D2,L1,V0,M1} { skol3 = skol5 }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (248) {G5,W3,D2,L1,V0,M1} R(245,11);r(247) { skol5 ==> skol3
% 23.34/23.80 }.
% 23.34/23.80 parent0: (30379) {G2,W3,D2,L1,V0,M1} { skol5 = skol3 }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 0 ==> 0
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 resolution: (30382) {G1,W0,D0,L0,V0,M0} { }.
% 23.34/23.80 parent0[0]: (10) {G0,W3,D2,L1,V0,M1} I { ! skol5 ==> skol3 }.
% 23.34/23.80 parent1[0]: (248) {G5,W3,D2,L1,V0,M1} R(245,11);r(247) { skol5 ==> skol3
% 23.34/23.80 }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 substitution1:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 subsumption: (262) {G6,W0,D0,L0,V0,M0} S(248);r(10) { }.
% 23.34/23.80 parent0: (30382) {G1,W0,D0,L0,V0,M0} { }.
% 23.34/23.80 substitution0:
% 23.34/23.80 end
% 23.34/23.80 permutation0:
% 23.34/23.80 end
% 23.34/23.80
% 23.34/23.80 Proof check complete!
% 23.34/23.80
% 23.34/23.80 Memory use:
% 23.34/23.80
% 23.34/23.80 space for terms: 4236
% 23.34/23.80 space for clauses: 15077
% 23.34/23.80
% 23.34/23.80
% 23.34/23.80 clauses generated: 603
% 23.34/23.80 clauses kept: 263
% 23.34/23.80 clauses selected: 46
% 23.34/23.80 clauses deleted: 1
% 23.34/23.80 clauses inuse deleted: 0
% 23.34/23.80
% 23.34/23.80 subsentry: 50911084
% 23.34/23.80 literals s-matched: 6090253
% 23.34/23.80 literals matched: 4379935
% 23.34/23.80 full subsumption: 4338814
% 23.34/23.80
% 23.34/23.80 checksum: 884723366
% 23.34/23.80
% 23.34/23.80
% 23.34/23.80 Bliksem ended
%------------------------------------------------------------------------------