TSTP Solution File: SET957+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:36 EDT 2022
% Result : Theorem 0.86s 1.23s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET957+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sun Jul 10 07:50:43 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.86/1.23 *** allocated 10000 integers for termspace/termends
% 0.86/1.23 *** allocated 10000 integers for clauses
% 0.86/1.23 *** allocated 10000 integers for justifications
% 0.86/1.23 Bliksem 1.12
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 Automatic Strategy Selection
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 Clauses:
% 0.86/1.23
% 0.86/1.23 { ! in( X, Y ), ! in( Y, X ) }.
% 0.86/1.23 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.86/1.23 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.86/1.23 ( X ) ) }.
% 0.86/1.23 { ! empty( ordered_pair( X, Y ) ) }.
% 0.86/1.23 { empty( skol1 ) }.
% 0.86/1.23 { ! empty( skol2 ) }.
% 0.86/1.23 { subset( X, X ) }.
% 0.86/1.23 { ! subset( X, cartesian_product2( Y, Z ) ), ! in( T, X ), in( skol6( U, Z
% 0.86/1.23 , W ), Z ) }.
% 0.86/1.23 { ! subset( X, cartesian_product2( Y, Z ) ), ! in( T, X ), in( skol3( Y, Z
% 0.86/1.23 , T ), Y ) }.
% 0.86/1.23 { ! subset( X, cartesian_product2( Y, Z ) ), ! in( T, X ), T = ordered_pair
% 0.86/1.23 ( skol3( Y, Z, T ), skol6( Y, Z, T ) ) }.
% 0.86/1.23 { subset( skol4, cartesian_product2( skol8, skol9 ) ) }.
% 0.86/1.23 { subset( skol7, cartesian_product2( skol10, skol11 ) ) }.
% 0.86/1.23 { ! in( ordered_pair( X, Y ), skol4 ), in( ordered_pair( X, Y ), skol7 ) }
% 0.86/1.23 .
% 0.86/1.23 { ! in( ordered_pair( X, Y ), skol7 ), in( ordered_pair( X, Y ), skol4 ) }
% 0.86/1.23 .
% 0.86/1.23 { ! skol4 = skol7 }.
% 0.86/1.23 { alpha1( X, Y, skol5( X, Y ) ), in( skol5( X, Y ), Y ), X = Y }.
% 0.86/1.23 { alpha1( X, Y, skol5( X, Y ) ), ! in( skol5( X, Y ), X ), X = Y }.
% 0.86/1.23 { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.86/1.23 { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.86/1.23 { ! in( Z, X ), in( Z, Y ), alpha1( X, Y, Z ) }.
% 0.86/1.23
% 0.86/1.23 percentage equality = 0.162162, percentage horn = 0.850000
% 0.86/1.23 This is a problem with some equality
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 Options Used:
% 0.86/1.23
% 0.86/1.23 useres = 1
% 0.86/1.23 useparamod = 1
% 0.86/1.23 useeqrefl = 1
% 0.86/1.23 useeqfact = 1
% 0.86/1.23 usefactor = 1
% 0.86/1.23 usesimpsplitting = 0
% 0.86/1.23 usesimpdemod = 5
% 0.86/1.23 usesimpres = 3
% 0.86/1.23
% 0.86/1.23 resimpinuse = 1000
% 0.86/1.23 resimpclauses = 20000
% 0.86/1.23 substype = eqrewr
% 0.86/1.23 backwardsubs = 1
% 0.86/1.23 selectoldest = 5
% 0.86/1.23
% 0.86/1.23 litorderings [0] = split
% 0.86/1.23 litorderings [1] = extend the termordering, first sorting on arguments
% 0.86/1.23
% 0.86/1.23 termordering = kbo
% 0.86/1.23
% 0.86/1.23 litapriori = 0
% 0.86/1.23 termapriori = 1
% 0.86/1.23 litaposteriori = 0
% 0.86/1.23 termaposteriori = 0
% 0.86/1.23 demodaposteriori = 0
% 0.86/1.23 ordereqreflfact = 0
% 0.86/1.23
% 0.86/1.23 litselect = negord
% 0.86/1.23
% 0.86/1.23 maxweight = 15
% 0.86/1.23 maxdepth = 30000
% 0.86/1.23 maxlength = 115
% 0.86/1.23 maxnrvars = 195
% 0.86/1.23 excuselevel = 1
% 0.86/1.23 increasemaxweight = 1
% 0.86/1.23
% 0.86/1.23 maxselected = 10000000
% 0.86/1.23 maxnrclauses = 10000000
% 0.86/1.23
% 0.86/1.23 showgenerated = 0
% 0.86/1.23 showkept = 0
% 0.86/1.23 showselected = 0
% 0.86/1.23 showdeleted = 0
% 0.86/1.23 showresimp = 1
% 0.86/1.23 showstatus = 2000
% 0.86/1.23
% 0.86/1.23 prologoutput = 0
% 0.86/1.23 nrgoals = 5000000
% 0.86/1.23 totalproof = 1
% 0.86/1.23
% 0.86/1.23 Symbols occurring in the translation:
% 0.86/1.23
% 0.86/1.23 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.86/1.23 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.86/1.23 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.86/1.23 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.86/1.23 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.86/1.23 in [37, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.86/1.23 unordered_pair [38, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.86/1.23 ordered_pair [39, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.86/1.23 singleton [40, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.86/1.23 empty [41, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.86/1.23 subset [42, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.86/1.23 cartesian_product2 [45, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.86/1.23 alpha1 [50, 3] (w:1, o:59, a:1, s:1, b:1),
% 0.86/1.23 skol1 [51, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.86/1.23 skol2 [52, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.86/1.23 skol3 [53, 3] (w:1, o:60, a:1, s:1, b:1),
% 0.86/1.23 skol4 [54, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.86/1.23 skol5 [55, 2] (w:1, o:58, a:1, s:1, b:1),
% 0.86/1.23 skol6 [56, 3] (w:1, o:61, a:1, s:1, b:1),
% 0.86/1.23 skol7 [57, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.86/1.23 skol8 [58, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.86/1.23 skol9 [59, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.86/1.23 skol10 [60, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.86/1.23 skol11 [61, 0] (w:1, o:16, a:1, s:1, b:1).
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 Starting Search:
% 0.86/1.23
% 0.86/1.23 *** allocated 15000 integers for clauses
% 0.86/1.23 *** allocated 22500 integers for clauses
% 0.86/1.23 *** allocated 33750 integers for clauses
% 0.86/1.23 *** allocated 15000 integers for termspace/termends
% 0.86/1.23 *** allocated 50625 integers for clauses
% 0.86/1.23 *** allocated 22500 integers for termspace/termends
% 0.86/1.23 Resimplifying inuse:
% 0.86/1.23 Done
% 0.86/1.23
% 0.86/1.23 *** allocated 75937 integers for clauses
% 0.86/1.23 *** allocated 33750 integers for termspace/termends
% 0.86/1.23
% 0.86/1.23 Bliksems!, er is een bewijs:
% 0.86/1.23 % SZS status Theorem
% 0.86/1.23 % SZS output start Refutation
% 0.86/1.23
% 0.86/1.23 (9) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2( Y, Z ) ), !
% 0.86/1.23 in( T, X ), ordered_pair( skol3( Y, Z, T ), skol6( Y, Z, T ) ) ==> T }.
% 0.86/1.23 (10) {G0,W5,D3,L1,V0,M1} I { subset( skol4, cartesian_product2( skol8,
% 0.86/1.23 skol9 ) ) }.
% 0.86/1.23 (11) {G0,W5,D3,L1,V0,M1} I { subset( skol7, cartesian_product2( skol10,
% 0.86/1.23 skol11 ) ) }.
% 0.86/1.23 (12) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol4 ), in(
% 0.86/1.23 ordered_pair( X, Y ), skol7 ) }.
% 0.86/1.23 (13) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol7 ), in(
% 0.86/1.23 ordered_pair( X, Y ), skol4 ) }.
% 0.86/1.23 (14) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> skol4 }.
% 0.86/1.23 (15) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), in( skol5( X,
% 0.86/1.23 Y ), Y ), X = Y }.
% 0.86/1.23 (16) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), ! in( skol5( X
% 0.86/1.23 , Y ), X ), X = Y }.
% 0.86/1.23 (17) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.86/1.23 (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.86/1.23 (120) {G1,W14,D4,L2,V1,M2} R(9,10) { ! in( X, skol4 ), ordered_pair( skol3
% 0.86/1.23 ( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X }.
% 0.86/1.23 (180) {G1,W14,D3,L4,V4,M4} P(9,13) { ! in( Z, skol7 ), in( Z, skol4 ), !
% 0.86/1.23 subset( T, cartesian_product2( X, Y ) ), ! in( Z, T ) }.
% 0.86/1.23 (181) {G2,W11,D3,L3,V3,M3} F(180) { ! in( X, skol7 ), in( X, skol4 ), !
% 0.86/1.23 subset( skol7, cartesian_product2( Y, Z ) ) }.
% 0.86/1.23 (267) {G1,W14,D3,L3,V1,M3} P(15,14) { ! X = skol4, alpha1( skol7, X, skol5
% 0.86/1.23 ( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 0.86/1.23 (274) {G2,W11,D3,L2,V0,M2} Q(267) { alpha1( skol7, skol4, skol5( skol7,
% 0.86/1.23 skol4 ) ), in( skol5( skol7, skol4 ), skol4 ) }.
% 0.86/1.23 (346) {G1,W14,D3,L3,V1,M3} P(16,14) { ! X = skol4, alpha1( skol7, X, skol5
% 0.86/1.23 ( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 0.86/1.23 (353) {G2,W11,D3,L2,V0,M2} Q(346) { alpha1( skol7, skol4, skol5( skol7,
% 0.86/1.23 skol4 ) ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 0.86/1.23 (740) {G3,W10,D3,L2,V0,M2} R(353,18) { ! in( skol5( skol7, skol4 ), skol7 )
% 0.86/1.23 , ! in( skol5( skol7, skol4 ), skol4 ) }.
% 0.86/1.23 (777) {G3,W10,D3,L2,V0,M2} R(274,17) { in( skol5( skol7, skol4 ), skol4 ),
% 0.86/1.23 in( skol5( skol7, skol4 ), skol7 ) }.
% 0.86/1.23 (1298) {G3,W6,D2,L2,V1,M2} R(181,11) { ! in( X, skol7 ), in( X, skol4 ) }.
% 0.86/1.23 (1326) {G4,W5,D3,L1,V0,M1} R(1298,777);f { in( skol5( skol7, skol4 ), skol4
% 0.86/1.23 ) }.
% 0.86/1.23 (1333) {G4,W5,D3,L1,V0,M1} R(1298,740);f { ! in( skol5( skol7, skol4 ),
% 0.86/1.23 skol7 ) }.
% 0.86/1.23 (1577) {G2,W6,D2,L2,V1,M2} P(120,12);f { ! in( X, skol4 ), in( X, skol7 )
% 0.86/1.23 }.
% 0.86/1.23 (1583) {G5,W0,D0,L0,V0,M0} R(1577,1333);r(1326) { }.
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 % SZS output end Refutation
% 0.86/1.23 found a proof!
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 Unprocessed initial clauses:
% 0.86/1.23
% 0.86/1.23 (1585) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.86/1.23 (1586) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 0.86/1.23 ) }.
% 0.86/1.23 (1587) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.86/1.23 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.86/1.23 (1588) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.86/1.23 (1589) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.86/1.23 (1590) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.86/1.23 (1591) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.86/1.23 (1592) {G0,W14,D3,L3,V6,M3} { ! subset( X, cartesian_product2( Y, Z ) ), !
% 0.86/1.23 in( T, X ), in( skol6( U, Z, W ), Z ) }.
% 0.86/1.23 (1593) {G0,W14,D3,L3,V4,M3} { ! subset( X, cartesian_product2( Y, Z ) ), !
% 0.86/1.23 in( T, X ), in( skol3( Y, Z, T ), Y ) }.
% 0.86/1.23 (1594) {G0,W19,D4,L3,V4,M3} { ! subset( X, cartesian_product2( Y, Z ) ), !
% 0.86/1.23 in( T, X ), T = ordered_pair( skol3( Y, Z, T ), skol6( Y, Z, T ) ) }.
% 0.86/1.23 (1595) {G0,W5,D3,L1,V0,M1} { subset( skol4, cartesian_product2( skol8,
% 0.86/1.23 skol9 ) ) }.
% 0.86/1.23 (1596) {G0,W5,D3,L1,V0,M1} { subset( skol7, cartesian_product2( skol10,
% 0.86/1.23 skol11 ) ) }.
% 0.86/1.23 (1597) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol4 ), in(
% 0.86/1.23 ordered_pair( X, Y ), skol7 ) }.
% 0.86/1.23 (1598) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol7 ), in(
% 0.86/1.23 ordered_pair( X, Y ), skol4 ) }.
% 0.86/1.23 (1599) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol7 }.
% 0.86/1.23 (1600) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), in( skol5( X
% 0.86/1.23 , Y ), Y ), X = Y }.
% 0.86/1.23 (1601) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), ! in( skol5(
% 0.86/1.23 X, Y ), X ), X = Y }.
% 0.86/1.23 (1602) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.86/1.23 (1603) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 0.86/1.23 (1604) {G0,W10,D2,L3,V3,M3} { ! in( Z, X ), in( Z, Y ), alpha1( X, Y, Z )
% 0.86/1.23 }.
% 0.86/1.23
% 0.86/1.23
% 0.86/1.23 Total Proof:
% 0.86/1.23
% 0.86/1.23 eqswap: (1607) {G0,W19,D4,L3,V4,M3} { ordered_pair( skol3( Y, Z, X ),
% 0.86/1.23 skol6( Y, Z, X ) ) = X, ! subset( T, cartesian_product2( Y, Z ) ), ! in(
% 0.86/1.23 X, T ) }.
% 0.86/1.23 parent0[2]: (1594) {G0,W19,D4,L3,V4,M3} { ! subset( X, cartesian_product2
% 0.86/1.23 ( Y, Z ) ), ! in( T, X ), T = ordered_pair( skol3( Y, Z, T ), skol6( Y, Z
% 0.86/1.23 , T ) ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := T
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 0.86/1.23 T := X
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (9) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2(
% 0.86/1.23 Y, Z ) ), ! in( T, X ), ordered_pair( skol3( Y, Z, T ), skol6( Y, Z, T )
% 0.86/1.23 ) ==> T }.
% 0.86/1.23 parent0: (1607) {G0,W19,D4,L3,V4,M3} { ordered_pair( skol3( Y, Z, X ),
% 0.86/1.23 skol6( Y, Z, X ) ) = X, ! subset( T, cartesian_product2( Y, Z ) ), ! in(
% 0.86/1.23 X, T ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := T
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 0.86/1.23 T := X
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 2
% 0.86/1.23 1 ==> 0
% 0.86/1.23 2 ==> 1
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (10) {G0,W5,D3,L1,V0,M1} I { subset( skol4, cartesian_product2
% 0.86/1.23 ( skol8, skol9 ) ) }.
% 0.86/1.23 parent0: (1595) {G0,W5,D3,L1,V0,M1} { subset( skol4, cartesian_product2(
% 0.86/1.23 skol8, skol9 ) ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (11) {G0,W5,D3,L1,V0,M1} I { subset( skol7, cartesian_product2
% 0.86/1.23 ( skol10, skol11 ) ) }.
% 0.86/1.23 parent0: (1596) {G0,W5,D3,L1,V0,M1} { subset( skol7, cartesian_product2(
% 0.86/1.23 skol10, skol11 ) ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (12) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.86/1.23 skol4 ), in( ordered_pair( X, Y ), skol7 ) }.
% 0.86/1.23 parent0: (1597) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol4 )
% 0.86/1.23 , in( ordered_pair( X, Y ), skol7 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 1
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (13) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.86/1.23 skol7 ), in( ordered_pair( X, Y ), skol4 ) }.
% 0.86/1.23 parent0: (1598) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol7 )
% 0.86/1.23 , in( ordered_pair( X, Y ), skol4 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 1
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 eqswap: (1623) {G0,W3,D2,L1,V0,M1} { ! skol7 = skol4 }.
% 0.86/1.23 parent0[0]: (1599) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol7 }.
% 0.86/1.23 substitution0:
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (14) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> skol4 }.
% 0.86/1.23 parent0: (1623) {G0,W3,D2,L1,V0,M1} { ! skol7 = skol4 }.
% 0.86/1.23 substitution0:
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (15) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ),
% 0.86/1.23 in( skol5( X, Y ), Y ), X = Y }.
% 0.86/1.23 parent0: (1600) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), in(
% 0.86/1.23 skol5( X, Y ), Y ), X = Y }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 1
% 0.86/1.23 2 ==> 2
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (16) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), !
% 0.86/1.23 in( skol5( X, Y ), X ), X = Y }.
% 0.86/1.23 parent0: (1601) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), ! in
% 0.86/1.23 ( skol5( X, Y ), X ), X = Y }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 1
% 0.86/1.23 2 ==> 2
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (17) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 0.86/1.23 }.
% 0.86/1.23 parent0: (1602) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 1
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 0.86/1.23 }.
% 0.86/1.23 parent0: (1603) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 0.86/1.23 }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 1
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 eqswap: (1647) {G0,W19,D4,L3,V4,M3} { Z ==> ordered_pair( skol3( X, Y, Z )
% 0.86/1.23 , skol6( X, Y, Z ) ), ! subset( T, cartesian_product2( X, Y ) ), ! in( Z
% 0.86/1.23 , T ) }.
% 0.86/1.23 parent0[2]: (9) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2( Y
% 0.86/1.23 , Z ) ), ! in( T, X ), ordered_pair( skol3( Y, Z, T ), skol6( Y, Z, T ) )
% 0.86/1.23 ==> T }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := T
% 0.86/1.23 Y := X
% 0.86/1.23 Z := Y
% 0.86/1.23 T := Z
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 resolution: (1648) {G1,W14,D4,L2,V1,M2} { X ==> ordered_pair( skol3( skol8
% 0.86/1.23 , skol9, X ), skol6( skol8, skol9, X ) ), ! in( X, skol4 ) }.
% 0.86/1.23 parent0[1]: (1647) {G0,W19,D4,L3,V4,M3} { Z ==> ordered_pair( skol3( X, Y
% 0.86/1.23 , Z ), skol6( X, Y, Z ) ), ! subset( T, cartesian_product2( X, Y ) ), !
% 0.86/1.23 in( Z, T ) }.
% 0.86/1.23 parent1[0]: (10) {G0,W5,D3,L1,V0,M1} I { subset( skol4, cartesian_product2
% 0.86/1.23 ( skol8, skol9 ) ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := skol8
% 0.86/1.23 Y := skol9
% 0.86/1.23 Z := X
% 0.86/1.23 T := skol4
% 0.86/1.23 end
% 0.86/1.23 substitution1:
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 eqswap: (1649) {G1,W14,D4,L2,V1,M2} { ordered_pair( skol3( skol8, skol9, X
% 0.86/1.23 ), skol6( skol8, skol9, X ) ) ==> X, ! in( X, skol4 ) }.
% 0.86/1.23 parent0[0]: (1648) {G1,W14,D4,L2,V1,M2} { X ==> ordered_pair( skol3( skol8
% 0.86/1.23 , skol9, X ), skol6( skol8, skol9, X ) ), ! in( X, skol4 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (120) {G1,W14,D4,L2,V1,M2} R(9,10) { ! in( X, skol4 ),
% 0.86/1.23 ordered_pair( skol3( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X
% 0.86/1.23 }.
% 0.86/1.23 parent0: (1649) {G1,W14,D4,L2,V1,M2} { ordered_pair( skol3( skol8, skol9,
% 0.86/1.23 X ), skol6( skol8, skol9, X ) ) ==> X, ! in( X, skol4 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 1
% 0.86/1.23 1 ==> 0
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 paramod: (1652) {G1,W22,D4,L4,V4,M4} { in( Z, skol4 ), ! subset( T,
% 0.86/1.23 cartesian_product2( X, Y ) ), ! in( Z, T ), ! in( ordered_pair( skol3( X
% 0.86/1.23 , Y, Z ), skol6( X, Y, Z ) ), skol7 ) }.
% 0.86/1.23 parent0[2]: (9) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2( Y
% 0.86/1.23 , Z ) ), ! in( T, X ), ordered_pair( skol3( Y, Z, T ), skol6( Y, Z, T ) )
% 0.86/1.23 ==> T }.
% 0.86/1.23 parent1[1; 1]: (13) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 0.86/1.23 skol7 ), in( ordered_pair( X, Y ), skol4 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := T
% 0.86/1.23 Y := X
% 0.86/1.23 Z := Y
% 0.86/1.23 T := Z
% 0.86/1.23 end
% 0.86/1.23 substitution1:
% 0.86/1.23 X := skol3( X, Y, Z )
% 0.86/1.23 Y := skol6( X, Y, Z )
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 paramod: (1653) {G1,W22,D3,L6,V5,M6} { ! in( Z, skol7 ), ! subset( T,
% 0.86/1.23 cartesian_product2( X, Y ) ), ! in( Z, T ), in( Z, skol4 ), ! subset( U,
% 0.86/1.23 cartesian_product2( X, Y ) ), ! in( Z, U ) }.
% 0.86/1.23 parent0[2]: (9) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2( Y
% 0.86/1.23 , Z ) ), ! in( T, X ), ordered_pair( skol3( Y, Z, T ), skol6( Y, Z, T ) )
% 0.86/1.23 ==> T }.
% 0.86/1.23 parent1[3; 2]: (1652) {G1,W22,D4,L4,V4,M4} { in( Z, skol4 ), ! subset( T,
% 0.86/1.23 cartesian_product2( X, Y ) ), ! in( Z, T ), ! in( ordered_pair( skol3( X
% 0.86/1.23 , Y, Z ), skol6( X, Y, Z ) ), skol7 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := T
% 0.86/1.23 Y := X
% 0.86/1.23 Z := Y
% 0.86/1.23 T := Z
% 0.86/1.23 end
% 0.86/1.23 substitution1:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 0.86/1.23 T := U
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 factor: (1655) {G1,W17,D3,L5,V4,M5} { ! in( X, skol7 ), ! subset( Y,
% 0.86/1.23 cartesian_product2( Z, T ) ), ! in( X, Y ), in( X, skol4 ), ! in( X, Y )
% 0.86/1.23 }.
% 0.86/1.23 parent0[1, 4]: (1653) {G1,W22,D3,L6,V5,M6} { ! in( Z, skol7 ), ! subset( T
% 0.86/1.23 , cartesian_product2( X, Y ) ), ! in( Z, T ), in( Z, skol4 ), ! subset( U
% 0.86/1.23 , cartesian_product2( X, Y ) ), ! in( Z, U ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := Z
% 0.86/1.23 Y := T
% 0.86/1.23 Z := X
% 0.86/1.23 T := Y
% 0.86/1.23 U := Y
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 factor: (1657) {G1,W14,D3,L4,V4,M4} { ! in( X, skol7 ), ! subset( Y,
% 0.86/1.23 cartesian_product2( Z, T ) ), ! in( X, Y ), in( X, skol4 ) }.
% 0.86/1.23 parent0[2, 4]: (1655) {G1,W17,D3,L5,V4,M5} { ! in( X, skol7 ), ! subset( Y
% 0.86/1.23 , cartesian_product2( Z, T ) ), ! in( X, Y ), in( X, skol4 ), ! in( X, Y
% 0.86/1.23 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 0.86/1.23 T := T
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (180) {G1,W14,D3,L4,V4,M4} P(9,13) { ! in( Z, skol7 ), in( Z,
% 0.86/1.23 skol4 ), ! subset( T, cartesian_product2( X, Y ) ), ! in( Z, T ) }.
% 0.86/1.23 parent0: (1657) {G1,W14,D3,L4,V4,M4} { ! in( X, skol7 ), ! subset( Y,
% 0.86/1.23 cartesian_product2( Z, T ) ), ! in( X, Y ), in( X, skol4 ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := Z
% 0.86/1.23 Y := T
% 0.86/1.23 Z := X
% 0.86/1.23 T := Y
% 0.86/1.23 end
% 0.86/1.23 permutation0:
% 0.86/1.23 0 ==> 0
% 0.86/1.23 1 ==> 2
% 0.86/1.23 2 ==> 3
% 0.86/1.23 3 ==> 1
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 factor: (1660) {G1,W11,D3,L3,V3,M3} { ! in( X, skol7 ), in( X, skol4 ), !
% 0.86/1.23 subset( skol7, cartesian_product2( Y, Z ) ) }.
% 0.86/1.23 parent0[0, 3]: (180) {G1,W14,D3,L4,V4,M4} P(9,13) { ! in( Z, skol7 ), in( Z
% 0.86/1.23 , skol4 ), ! subset( T, cartesian_product2( X, Y ) ), ! in( Z, T ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := Y
% 0.86/1.23 Y := Z
% 0.86/1.23 Z := X
% 0.86/1.23 T := skol7
% 0.86/1.23 end
% 0.86/1.23
% 0.86/1.23 subsumption: (181) {G2,W11,D3,L3,V3,M3} F(180) { ! in( X, skol7 ), in( X,
% 0.86/1.23 skol4 ), ! subset( skol7, cartesian_product2( Y, Z ) ) }.
% 0.86/1.23 parent0: (1660) {G1,W11,D3,L3,V3,M3} { ! in( X, skol7 ), in( X, skol4 ), !
% 0.86/1.23 subset( skol7, cartesian_product2( Y, Z ) ) }.
% 0.86/1.23 substitution0:
% 0.86/1.23 X := X
% 0.86/1.23 Y := Y
% 0.86/1.23 Z := Z
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 2 ==> 2
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 *** allocated 113905 integers for clauses
% 35.23/35.69 *** allocated 50625 integers for termspace/termends
% 35.23/35.69 *** allocated 15000 integers for justifications
% 35.23/35.69 *** allocated 75937 integers for termspace/termends
% 35.23/35.69 *** allocated 22500 integers for justifications
% 35.23/35.69 *** allocated 113905 integers for termspace/termends
% 35.23/35.69 *** allocated 33750 integers for justifications
% 35.23/35.69 *** allocated 170857 integers for termspace/termends
% 35.23/35.69 *** allocated 50625 integers for justifications
% 35.23/35.69 *** allocated 170857 integers for clauses
% 35.23/35.69 *** allocated 75937 integers for justifications
% 35.23/35.69 *** allocated 256285 integers for termspace/termends
% 35.23/35.69 *** allocated 113905 integers for justifications
% 35.23/35.69 *** allocated 384427 integers for termspace/termends
% 35.23/35.69 *** allocated 256285 integers for clauses
% 35.23/35.69 *** allocated 170857 integers for justifications
% 35.23/35.69 *** allocated 576640 integers for termspace/termends
% 35.23/35.69 *** allocated 384427 integers for clauses
% 35.23/35.69 *** allocated 256285 integers for justifications
% 35.23/35.69 *** allocated 864960 integers for termspace/termends
% 35.23/35.69 *** allocated 384427 integers for justifications
% 35.23/35.69 *** allocated 1297440 integers for termspace/termends
% 35.23/35.69 *** allocated 576640 integers for clauses
% 35.23/35.69 eqswap: (1662) {G0,W3,D2,L1,V0,M1} { ! skol4 ==> skol7 }.
% 35.23/35.69 parent0[0]: (14) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> skol4 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 paramod: (7980) {G1,W14,D3,L3,V1,M3} { ! skol4 ==> X, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 parent0[2]: (15) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), in
% 35.23/35.69 ( skol5( X, Y ), Y ), X = Y }.
% 35.23/35.69 parent1[0; 3]: (1662) {G0,W3,D2,L1,V0,M1} { ! skol4 ==> skol7 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol7
% 35.23/35.69 Y := X
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 eqswap: (8226) {G1,W14,D3,L3,V1,M3} { ! X ==> skol4, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 parent0[0]: (7980) {G1,W14,D3,L3,V1,M3} { ! skol4 ==> X, alpha1( skol7, X
% 35.23/35.69 , skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (267) {G1,W14,D3,L3,V1,M3} P(15,14) { ! X = skol4, alpha1(
% 35.23/35.69 skol7, X, skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 parent0: (8226) {G1,W14,D3,L3,V1,M3} { ! X ==> skol4, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 2 ==> 2
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 eqswap: (21413) {G1,W14,D3,L3,V1,M3} { ! skol4 = X, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 parent0[0]: (267) {G1,W14,D3,L3,V1,M3} P(15,14) { ! X = skol4, alpha1(
% 35.23/35.69 skol7, X, skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 eqrefl: (21414) {G0,W11,D3,L2,V0,M2} { alpha1( skol7, skol4, skol5( skol7
% 35.23/35.69 , skol4 ) ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 parent0[0]: (21413) {G1,W14,D3,L3,V1,M3} { ! skol4 = X, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), in( skol5( skol7, X ), X ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol4
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (274) {G2,W11,D3,L2,V0,M2} Q(267) { alpha1( skol7, skol4,
% 35.23/35.69 skol5( skol7, skol4 ) ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 parent0: (21414) {G0,W11,D3,L2,V0,M2} { alpha1( skol7, skol4, skol5( skol7
% 35.23/35.69 , skol4 ) ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 *** allocated 1946160 integers for termspace/termends
% 35.23/35.69 *** allocated 864960 integers for clauses
% 35.23/35.69 *** allocated 2919240 integers for termspace/termends
% 35.23/35.69 *** allocated 1297440 integers for clauses
% 35.23/35.69 eqswap: (21416) {G0,W3,D2,L1,V0,M1} { ! skol4 ==> skol7 }.
% 35.23/35.69 parent0[0]: (14) {G0,W3,D2,L1,V0,M1} I { ! skol7 ==> skol4 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 paramod: (48286) {G1,W14,D3,L3,V1,M3} { ! skol4 ==> X, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 parent0[2]: (16) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), !
% 35.23/35.69 in( skol5( X, Y ), X ), X = Y }.
% 35.23/35.69 parent1[0; 3]: (21416) {G0,W3,D2,L1,V0,M1} { ! skol4 ==> skol7 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol7
% 35.23/35.69 Y := X
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 eqswap: (48544) {G1,W14,D3,L3,V1,M3} { ! X ==> skol4, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 parent0[0]: (48286) {G1,W14,D3,L3,V1,M3} { ! skol4 ==> X, alpha1( skol7, X
% 35.23/35.69 , skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (346) {G1,W14,D3,L3,V1,M3} P(16,14) { ! X = skol4, alpha1(
% 35.23/35.69 skol7, X, skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 parent0: (48544) {G1,W14,D3,L3,V1,M3} { ! X ==> skol4, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 2 ==> 2
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 eqswap: (51443) {G1,W14,D3,L3,V1,M3} { ! skol4 = X, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 parent0[0]: (346) {G1,W14,D3,L3,V1,M3} P(16,14) { ! X = skol4, alpha1(
% 35.23/35.69 skol7, X, skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 eqrefl: (51444) {G0,W11,D3,L2,V0,M2} { alpha1( skol7, skol4, skol5( skol7
% 35.23/35.69 , skol4 ) ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 parent0[0]: (51443) {G1,W14,D3,L3,V1,M3} { ! skol4 = X, alpha1( skol7, X,
% 35.23/35.69 skol5( skol7, X ) ), ! in( skol5( skol7, X ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol4
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (353) {G2,W11,D3,L2,V0,M2} Q(346) { alpha1( skol7, skol4,
% 35.23/35.69 skol5( skol7, skol4 ) ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 parent0: (51444) {G0,W11,D3,L2,V0,M2} { alpha1( skol7, skol4, skol5( skol7
% 35.23/35.69 , skol4 ) ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51445) {G1,W10,D3,L2,V0,M2} { ! in( skol5( skol7, skol4 ),
% 35.23/35.69 skol4 ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 parent0[0]: (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 35.23/35.69 }.
% 35.23/35.69 parent1[0]: (353) {G2,W11,D3,L2,V0,M2} Q(346) { alpha1( skol7, skol4, skol5
% 35.23/35.69 ( skol7, skol4 ) ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol7
% 35.23/35.69 Y := skol4
% 35.23/35.69 Z := skol5( skol7, skol4 )
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (740) {G3,W10,D3,L2,V0,M2} R(353,18) { ! in( skol5( skol7,
% 35.23/35.69 skol4 ), skol7 ), ! in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 parent0: (51445) {G1,W10,D3,L2,V0,M2} { ! in( skol5( skol7, skol4 ), skol4
% 35.23/35.69 ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 1
% 35.23/35.69 1 ==> 0
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51446) {G1,W10,D3,L2,V0,M2} { in( skol5( skol7, skol4 ),
% 35.23/35.69 skol7 ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 parent0[0]: (17) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 35.23/35.69 }.
% 35.23/35.69 parent1[0]: (274) {G2,W11,D3,L2,V0,M2} Q(267) { alpha1( skol7, skol4, skol5
% 35.23/35.69 ( skol7, skol4 ) ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol7
% 35.23/35.69 Y := skol4
% 35.23/35.69 Z := skol5( skol7, skol4 )
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (777) {G3,W10,D3,L2,V0,M2} R(274,17) { in( skol5( skol7, skol4
% 35.23/35.69 ), skol4 ), in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 parent0: (51446) {G1,W10,D3,L2,V0,M2} { in( skol5( skol7, skol4 ), skol7 )
% 35.23/35.69 , in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 1
% 35.23/35.69 1 ==> 0
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51447) {G1,W6,D2,L2,V1,M2} { ! in( X, skol7 ), in( X, skol4 )
% 35.23/35.69 }.
% 35.23/35.69 parent0[2]: (181) {G2,W11,D3,L3,V3,M3} F(180) { ! in( X, skol7 ), in( X,
% 35.23/35.69 skol4 ), ! subset( skol7, cartesian_product2( Y, Z ) ) }.
% 35.23/35.69 parent1[0]: (11) {G0,W5,D3,L1,V0,M1} I { subset( skol7, cartesian_product2
% 35.23/35.69 ( skol10, skol11 ) ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 Y := skol10
% 35.23/35.69 Z := skol11
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (1298) {G3,W6,D2,L2,V1,M2} R(181,11) { ! in( X, skol7 ), in( X
% 35.23/35.69 , skol4 ) }.
% 35.23/35.69 parent0: (51447) {G1,W6,D2,L2,V1,M2} { ! in( X, skol7 ), in( X, skol4 )
% 35.23/35.69 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51448) {G4,W10,D3,L2,V0,M2} { in( skol5( skol7, skol4 ),
% 35.23/35.69 skol4 ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 parent0[0]: (1298) {G3,W6,D2,L2,V1,M2} R(181,11) { ! in( X, skol7 ), in( X
% 35.23/35.69 , skol4 ) }.
% 35.23/35.69 parent1[1]: (777) {G3,W10,D3,L2,V0,M2} R(274,17) { in( skol5( skol7, skol4
% 35.23/35.69 ), skol4 ), in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := skol5( skol7, skol4 )
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 factor: (51449) {G4,W5,D3,L1,V0,M1} { in( skol5( skol7, skol4 ), skol4 )
% 35.23/35.69 }.
% 35.23/35.69 parent0[0, 1]: (51448) {G4,W10,D3,L2,V0,M2} { in( skol5( skol7, skol4 ),
% 35.23/35.69 skol4 ), in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (1326) {G4,W5,D3,L1,V0,M1} R(1298,777);f { in( skol5( skol7,
% 35.23/35.69 skol4 ), skol4 ) }.
% 35.23/35.69 parent0: (51449) {G4,W5,D3,L1,V0,M1} { in( skol5( skol7, skol4 ), skol4 )
% 35.23/35.69 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51450) {G4,W10,D3,L2,V0,M2} { ! in( skol5( skol7, skol4 ),
% 35.23/35.69 skol7 ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 parent0[1]: (740) {G3,W10,D3,L2,V0,M2} R(353,18) { ! in( skol5( skol7,
% 35.23/35.69 skol4 ), skol7 ), ! in( skol5( skol7, skol4 ), skol4 ) }.
% 35.23/35.69 parent1[1]: (1298) {G3,W6,D2,L2,V1,M2} R(181,11) { ! in( X, skol7 ), in( X
% 35.23/35.69 , skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 X := skol5( skol7, skol4 )
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 factor: (51451) {G4,W5,D3,L1,V0,M1} { ! in( skol5( skol7, skol4 ), skol7 )
% 35.23/35.69 }.
% 35.23/35.69 parent0[0, 1]: (51450) {G4,W10,D3,L2,V0,M2} { ! in( skol5( skol7, skol4 )
% 35.23/35.69 , skol7 ), ! in( skol5( skol7, skol4 ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (1333) {G4,W5,D3,L1,V0,M1} R(1298,740);f { ! in( skol5( skol7
% 35.23/35.69 , skol4 ), skol7 ) }.
% 35.23/35.69 parent0: (51451) {G4,W5,D3,L1,V0,M1} { ! in( skol5( skol7, skol4 ), skol7
% 35.23/35.69 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 paramod: (51454) {G1,W17,D4,L3,V1,M3} { in( X, skol7 ), ! in( X, skol4 ),
% 35.23/35.69 ! in( ordered_pair( skol3( skol8, skol9, X ), skol6( skol8, skol9, X ) )
% 35.23/35.69 , skol4 ) }.
% 35.23/35.69 parent0[1]: (120) {G1,W14,D4,L2,V1,M2} R(9,10) { ! in( X, skol4 ),
% 35.23/35.69 ordered_pair( skol3( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X
% 35.23/35.69 }.
% 35.23/35.69 parent1[1; 1]: (12) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 35.23/35.69 skol4 ), in( ordered_pair( X, Y ), skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 X := skol3( skol8, skol9, X )
% 35.23/35.69 Y := skol6( skol8, skol9, X )
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 paramod: (51455) {G2,W12,D2,L4,V1,M4} { ! in( X, skol4 ), ! in( X, skol4 )
% 35.23/35.69 , in( X, skol7 ), ! in( X, skol4 ) }.
% 35.23/35.69 parent0[1]: (120) {G1,W14,D4,L2,V1,M2} R(9,10) { ! in( X, skol4 ),
% 35.23/35.69 ordered_pair( skol3( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X
% 35.23/35.69 }.
% 35.23/35.69 parent1[2; 2]: (51454) {G1,W17,D4,L3,V1,M3} { in( X, skol7 ), ! in( X,
% 35.23/35.69 skol4 ), ! in( ordered_pair( skol3( skol8, skol9, X ), skol6( skol8,
% 35.23/35.69 skol9, X ) ), skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 factor: (51457) {G2,W9,D2,L3,V1,M3} { ! in( X, skol4 ), in( X, skol7 ), !
% 35.23/35.69 in( X, skol4 ) }.
% 35.23/35.69 parent0[0, 1]: (51455) {G2,W12,D2,L4,V1,M4} { ! in( X, skol4 ), ! in( X,
% 35.23/35.69 skol4 ), in( X, skol7 ), ! in( X, skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 factor: (51458) {G2,W6,D2,L2,V1,M2} { ! in( X, skol4 ), in( X, skol7 ) }.
% 35.23/35.69 parent0[0, 2]: (51457) {G2,W9,D2,L3,V1,M3} { ! in( X, skol4 ), in( X,
% 35.23/35.69 skol7 ), ! in( X, skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (1577) {G2,W6,D2,L2,V1,M2} P(120,12);f { ! in( X, skol4 ), in
% 35.23/35.69 ( X, skol7 ) }.
% 35.23/35.69 parent0: (51458) {G2,W6,D2,L2,V1,M2} { ! in( X, skol4 ), in( X, skol7 )
% 35.23/35.69 }.
% 35.23/35.69 substitution0:
% 35.23/35.69 X := X
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 0 ==> 0
% 35.23/35.69 1 ==> 1
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51459) {G3,W5,D3,L1,V0,M1} { ! in( skol5( skol7, skol4 ),
% 35.23/35.69 skol4 ) }.
% 35.23/35.69 parent0[0]: (1333) {G4,W5,D3,L1,V0,M1} R(1298,740);f { ! in( skol5( skol7,
% 35.23/35.69 skol4 ), skol7 ) }.
% 35.23/35.69 parent1[1]: (1577) {G2,W6,D2,L2,V1,M2} P(120,12);f { ! in( X, skol4 ), in(
% 35.23/35.69 X, skol7 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 X := skol5( skol7, skol4 )
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 resolution: (51460) {G4,W0,D0,L0,V0,M0} { }.
% 35.23/35.69 parent0[0]: (51459) {G3,W5,D3,L1,V0,M1} { ! in( skol5( skol7, skol4 ),
% 35.23/35.69 skol4 ) }.
% 35.23/35.69 parent1[0]: (1326) {G4,W5,D3,L1,V0,M1} R(1298,777);f { in( skol5( skol7,
% 35.23/35.69 skol4 ), skol4 ) }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 substitution1:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 subsumption: (1583) {G5,W0,D0,L0,V0,M0} R(1577,1333);r(1326) { }.
% 35.23/35.69 parent0: (51460) {G4,W0,D0,L0,V0,M0} { }.
% 35.23/35.69 substitution0:
% 35.23/35.69 end
% 35.23/35.69 permutation0:
% 35.23/35.69 end
% 35.23/35.69
% 35.23/35.69 Proof check complete!
% 35.23/35.69
% 35.23/35.69 Memory use:
% 35.23/35.69
% 35.23/35.69 space for terms: 24674
% 35.23/35.69 space for clauses: 71425
% 35.23/35.69
% 35.23/35.69
% 35.23/35.69 clauses generated: 19360
% 35.23/35.69 clauses kept: 1584
% 35.23/35.69 clauses selected: 338
% 35.23/35.69 clauses deleted: 34
% 35.23/35.69 clauses inuse deleted: 0
% 35.23/35.69
% 35.23/35.69 subsentry: 78297403
% 35.23/35.69 literals s-matched: 9778808
% 35.23/35.69 literals matched: 7038173
% 35.23/35.69 full subsumption: 6943341
% 35.23/35.69
% 35.23/35.69 checksum: 1099021118
% 35.23/35.69
% 35.23/35.69
% 35.23/35.69 Bliksem ended
%------------------------------------------------------------------------------