TSTP Solution File: SET956+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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 1.09s 1.48s
% Output : Refutation 1.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Mon Jul 11 01:43:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.09/1.48 *** allocated 10000 integers for termspace/termends
% 1.09/1.48 *** allocated 10000 integers for clauses
% 1.09/1.48 *** allocated 10000 integers for justifications
% 1.09/1.48 Bliksem 1.12
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Automatic Strategy Selection
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Clauses:
% 1.09/1.48
% 1.09/1.48 { ! in( X, Y ), ! in( Y, X ) }.
% 1.09/1.48 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 1.09/1.48 { ! subset( X, Y ), ! in( Z, X ), in( Z, Y ) }.
% 1.09/1.48 { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 1.09/1.48 { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 1.09/1.48 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 1.09/1.48 ( X ) ) }.
% 1.09/1.48 { ! empty( ordered_pair( X, Y ) ) }.
% 1.09/1.48 { empty( skol2 ) }.
% 1.09/1.48 { ! empty( skol3 ) }.
% 1.09/1.48 { subset( X, X ) }.
% 1.09/1.48 { ! subset( X, cartesian_product2( Y, Z ) ), ! in( T, X ), in( skol6( U, Z
% 1.09/1.48 , W ), Z ) }.
% 1.09/1.48 { ! subset( X, cartesian_product2( Y, Z ) ), ! in( T, X ), in( skol4( Y, Z
% 1.09/1.48 , T ), Y ) }.
% 1.09/1.48 { ! subset( X, cartesian_product2( Y, Z ) ), ! in( T, X ), T = ordered_pair
% 1.09/1.48 ( skol4( Y, Z, T ), skol6( Y, Z, T ) ) }.
% 1.09/1.48 { subset( skol5, cartesian_product2( skol8, skol9 ) ) }.
% 1.09/1.48 { ! in( ordered_pair( X, Y ), skol5 ), in( ordered_pair( X, Y ), skol7 ) }
% 1.09/1.48 .
% 1.09/1.48 { ! subset( skol5, skol7 ) }.
% 1.09/1.48
% 1.09/1.48 percentage equality = 0.107143, percentage horn = 0.937500
% 1.09/1.48 This is a problem with some equality
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Options Used:
% 1.09/1.48
% 1.09/1.48 useres = 1
% 1.09/1.48 useparamod = 1
% 1.09/1.48 useeqrefl = 1
% 1.09/1.48 useeqfact = 1
% 1.09/1.48 usefactor = 1
% 1.09/1.48 usesimpsplitting = 0
% 1.09/1.48 usesimpdemod = 5
% 1.09/1.48 usesimpres = 3
% 1.09/1.48
% 1.09/1.48 resimpinuse = 1000
% 1.09/1.48 resimpclauses = 20000
% 1.09/1.48 substype = eqrewr
% 1.09/1.48 backwardsubs = 1
% 1.09/1.48 selectoldest = 5
% 1.09/1.48
% 1.09/1.48 litorderings [0] = split
% 1.09/1.48 litorderings [1] = extend the termordering, first sorting on arguments
% 1.09/1.48
% 1.09/1.48 termordering = kbo
% 1.09/1.48
% 1.09/1.48 litapriori = 0
% 1.09/1.48 termapriori = 1
% 1.09/1.48 litaposteriori = 0
% 1.09/1.48 termaposteriori = 0
% 1.09/1.48 demodaposteriori = 0
% 1.09/1.48 ordereqreflfact = 0
% 1.09/1.48
% 1.09/1.48 litselect = negord
% 1.09/1.48
% 1.09/1.48 maxweight = 15
% 1.09/1.48 maxdepth = 30000
% 1.09/1.48 maxlength = 115
% 1.09/1.48 maxnrvars = 195
% 1.09/1.48 excuselevel = 1
% 1.09/1.48 increasemaxweight = 1
% 1.09/1.48
% 1.09/1.48 maxselected = 10000000
% 1.09/1.48 maxnrclauses = 10000000
% 1.09/1.48
% 1.09/1.48 showgenerated = 0
% 1.09/1.48 showkept = 0
% 1.09/1.48 showselected = 0
% 1.09/1.48 showdeleted = 0
% 1.09/1.48 showresimp = 1
% 1.09/1.48 showstatus = 2000
% 1.09/1.48
% 1.09/1.48 prologoutput = 0
% 1.09/1.48 nrgoals = 5000000
% 1.09/1.48 totalproof = 1
% 1.09/1.48
% 1.09/1.48 Symbols occurring in the translation:
% 1.09/1.48
% 1.09/1.48 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.09/1.48 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 1.09/1.48 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.09/1.48 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.09/1.48 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.09/1.48 in [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 1.09/1.48 unordered_pair [38, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.09/1.48 subset [39, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.09/1.48 ordered_pair [41, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.09/1.48 singleton [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.09/1.48 empty [43, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.09/1.48 cartesian_product2 [45, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.09/1.48 skol1 [48, 2] (w:1, o:54, a:1, s:1, b:1),
% 1.09/1.48 skol2 [49, 0] (w:1, o:12, a:1, s:1, b:1),
% 1.09/1.48 skol3 [50, 0] (w:1, o:13, a:1, s:1, b:1),
% 1.09/1.48 skol4 [51, 3] (w:1, o:55, a:1, s:1, b:1),
% 1.09/1.48 skol5 [52, 0] (w:1, o:14, a:1, s:1, b:1),
% 1.09/1.48 skol6 [53, 3] (w:1, o:56, a:1, s:1, b:1),
% 1.09/1.48 skol7 [54, 0] (w:1, o:15, a:1, s:1, b:1),
% 1.09/1.48 skol8 [55, 0] (w:1, o:16, a:1, s:1, b:1),
% 1.09/1.48 skol9 [56, 0] (w:1, o:17, a:1, s:1, b:1).
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Starting Search:
% 1.09/1.48
% 1.09/1.48 *** allocated 15000 integers for clauses
% 1.09/1.48 *** allocated 22500 integers for clauses
% 1.09/1.48 *** allocated 33750 integers for clauses
% 1.09/1.48 *** allocated 15000 integers for termspace/termends
% 1.09/1.48 *** allocated 50625 integers for clauses
% 1.09/1.48 *** allocated 22500 integers for termspace/termends
% 1.09/1.48 Resimplifying inuse:
% 1.09/1.48 Done
% 1.09/1.48
% 1.09/1.48 *** allocated 75937 integers for clauses
% 1.09/1.48 *** allocated 33750 integers for termspace/termends
% 1.09/1.48 *** allocated 113905 integers for clauses
% 1.09/1.48
% 1.09/1.48 Intermediate Status:
% 1.09/1.48 Generated: 7724
% 1.09/1.48 Kept: 2035
% 1.09/1.48 Inuse: 205
% 1.09/1.48 Deleted: 7
% 1.09/1.48 Deletedinuse: 1
% 1.09/1.48
% 1.09/1.48 Resimplifying inuse:
% 1.09/1.48 Done
% 1.09/1.48
% 1.09/1.48 *** allocated 50625 integers for termspace/termends
% 1.09/1.48 *** allocated 170857 integers for clauses
% 1.09/1.48 Resimplifying inuse:
% 1.09/1.48 Done
% 1.09/1.48
% 1.09/1.48 *** allocated 75937 integers for termspace/termends
% 1.09/1.48 *** allocated 256285 integers for clauses
% 1.09/1.48
% 1.09/1.48 Intermediate Status:
% 1.09/1.48 Generated: 20010
% 1.09/1.48 Kept: 4046
% 1.09/1.48 Inuse: 340
% 1.09/1.48 Deleted: 9
% 1.09/1.48 Deletedinuse: 1
% 1.09/1.48
% 1.09/1.48 Resimplifying inuse:
% 1.09/1.48 Done
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Bliksems!, er is een bewijs:
% 1.09/1.48 % SZS status Theorem
% 1.09/1.48 % SZS output start Refutation
% 1.09/1.48
% 1.09/1.48 (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 1.09/1.48 (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 1.09/1.48 (12) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2( Y, Z ) ), !
% 1.09/1.48 in( T, X ), ordered_pair( skol4( Y, Z, T ), skol6( Y, Z, T ) ) ==> T }.
% 1.09/1.48 (13) {G0,W5,D3,L1,V0,M1} I { subset( skol5, cartesian_product2( skol8,
% 1.09/1.48 skol9 ) ) }.
% 1.09/1.48 (14) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ), skol5 ), in(
% 1.09/1.48 ordered_pair( X, Y ), skol7 ) }.
% 1.09/1.48 (15) {G0,W3,D2,L1,V0,M1} I { ! subset( skol5, skol7 ) }.
% 1.09/1.48 (17) {G1,W5,D3,L1,V1,M1} R(3,15) { ! in( skol1( X, skol7 ), skol7 ) }.
% 1.09/1.48 (36) {G1,W5,D3,L1,V0,M1} R(4,15) { in( skol1( skol5, skol7 ), skol5 ) }.
% 1.09/1.48 (138) {G1,W14,D4,L2,V1,M2} R(12,13) { ! in( X, skol5 ), ordered_pair( skol4
% 1.09/1.48 ( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X }.
% 1.09/1.48 (4355) {G2,W6,D2,L2,V1,M2} P(138,14);f { ! in( X, skol5 ), in( X, skol7 )
% 1.09/1.48 }.
% 1.09/1.48 (4522) {G3,W0,D0,L0,V0,M0} R(4355,36);r(17) { }.
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 % SZS output end Refutation
% 1.09/1.48 found a proof!
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Unprocessed initial clauses:
% 1.09/1.48
% 1.09/1.48 (4524) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 1.09/1.48 (4525) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 1.09/1.48 ) }.
% 1.09/1.48 (4526) {G0,W9,D2,L3,V3,M3} { ! subset( X, Y ), ! in( Z, X ), in( Z, Y )
% 1.09/1.48 }.
% 1.09/1.48 (4527) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X, Y ) }.
% 1.09/1.48 (4528) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y ) }.
% 1.09/1.48 (4529) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 1.09/1.48 unordered_pair( X, Y ), singleton( X ) ) }.
% 1.09/1.48 (4530) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 1.09/1.48 (4531) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 1.09/1.48 (4532) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 1.09/1.48 (4533) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 1.09/1.48 (4534) {G0,W14,D3,L3,V6,M3} { ! subset( X, cartesian_product2( Y, Z ) ), !
% 1.09/1.48 in( T, X ), in( skol6( U, Z, W ), Z ) }.
% 1.09/1.48 (4535) {G0,W14,D3,L3,V4,M3} { ! subset( X, cartesian_product2( Y, Z ) ), !
% 1.09/1.48 in( T, X ), in( skol4( Y, Z, T ), Y ) }.
% 1.09/1.48 (4536) {G0,W19,D4,L3,V4,M3} { ! subset( X, cartesian_product2( Y, Z ) ), !
% 1.09/1.48 in( T, X ), T = ordered_pair( skol4( Y, Z, T ), skol6( Y, Z, T ) ) }.
% 1.09/1.48 (4537) {G0,W5,D3,L1,V0,M1} { subset( skol5, cartesian_product2( skol8,
% 1.09/1.48 skol9 ) ) }.
% 1.09/1.48 (4538) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol5 ), in(
% 1.09/1.48 ordered_pair( X, Y ), skol7 ) }.
% 1.09/1.48 (4539) {G0,W3,D2,L1,V0,M1} { ! subset( skol5, skol7 ) }.
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Total Proof:
% 1.09/1.48
% 1.09/1.48 subsumption: (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset(
% 1.09/1.48 X, Y ) }.
% 1.09/1.48 parent0: (4527) {G0,W8,D3,L2,V3,M2} { ! in( skol1( Z, Y ), Y ), subset( X
% 1.09/1.48 , Y ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 Y := Y
% 1.09/1.48 Z := Z
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 1 ==> 1
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X
% 1.09/1.48 , Y ) }.
% 1.09/1.48 parent0: (4528) {G0,W8,D3,L2,V2,M2} { in( skol1( X, Y ), X ), subset( X, Y
% 1.09/1.48 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 Y := Y
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 1 ==> 1
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 eqswap: (4544) {G0,W19,D4,L3,V4,M3} { ordered_pair( skol4( Y, Z, X ),
% 1.09/1.48 skol6( Y, Z, X ) ) = X, ! subset( T, cartesian_product2( Y, Z ) ), ! in(
% 1.09/1.48 X, T ) }.
% 1.09/1.48 parent0[2]: (4536) {G0,W19,D4,L3,V4,M3} { ! subset( X, cartesian_product2
% 1.09/1.48 ( Y, Z ) ), ! in( T, X ), T = ordered_pair( skol4( Y, Z, T ), skol6( Y, Z
% 1.09/1.48 , T ) ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := T
% 1.09/1.48 Y := Y
% 1.09/1.48 Z := Z
% 1.09/1.48 T := X
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (12) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2
% 1.09/1.48 ( Y, Z ) ), ! in( T, X ), ordered_pair( skol4( Y, Z, T ), skol6( Y, Z, T
% 1.09/1.48 ) ) ==> T }.
% 1.09/1.48 parent0: (4544) {G0,W19,D4,L3,V4,M3} { ordered_pair( skol4( Y, Z, X ),
% 1.09/1.48 skol6( Y, Z, X ) ) = X, ! subset( T, cartesian_product2( Y, Z ) ), ! in(
% 1.09/1.48 X, T ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := T
% 1.09/1.48 Y := Y
% 1.09/1.48 Z := Z
% 1.09/1.48 T := X
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 2
% 1.09/1.48 1 ==> 0
% 1.09/1.48 2 ==> 1
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (13) {G0,W5,D3,L1,V0,M1} I { subset( skol5, cartesian_product2
% 1.09/1.48 ( skol8, skol9 ) ) }.
% 1.09/1.48 parent0: (4537) {G0,W5,D3,L1,V0,M1} { subset( skol5, cartesian_product2(
% 1.09/1.48 skol8, skol9 ) ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (14) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 1.09/1.48 skol5 ), in( ordered_pair( X, Y ), skol7 ) }.
% 1.09/1.48 parent0: (4538) {G0,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ), skol5 )
% 1.09/1.48 , in( ordered_pair( X, Y ), skol7 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 Y := Y
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 1 ==> 1
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { ! subset( skol5, skol7 ) }.
% 1.09/1.48 parent0: (4539) {G0,W3,D2,L1,V0,M1} { ! subset( skol5, skol7 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 resolution: (4554) {G1,W5,D3,L1,V1,M1} { ! in( skol1( X, skol7 ), skol7 )
% 1.09/1.48 }.
% 1.09/1.48 parent0[0]: (15) {G0,W3,D2,L1,V0,M1} I { ! subset( skol5, skol7 ) }.
% 1.09/1.48 parent1[1]: (3) {G0,W8,D3,L2,V3,M2} I { ! in( skol1( Z, Y ), Y ), subset( X
% 1.09/1.48 , Y ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 X := skol5
% 1.09/1.48 Y := skol7
% 1.09/1.48 Z := X
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (17) {G1,W5,D3,L1,V1,M1} R(3,15) { ! in( skol1( X, skol7 ),
% 1.09/1.48 skol7 ) }.
% 1.09/1.48 parent0: (4554) {G1,W5,D3,L1,V1,M1} { ! in( skol1( X, skol7 ), skol7 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 resolution: (4555) {G1,W5,D3,L1,V0,M1} { in( skol1( skol5, skol7 ), skol5
% 1.09/1.48 ) }.
% 1.09/1.48 parent0[0]: (15) {G0,W3,D2,L1,V0,M1} I { ! subset( skol5, skol7 ) }.
% 1.09/1.48 parent1[1]: (4) {G0,W8,D3,L2,V2,M2} I { in( skol1( X, Y ), X ), subset( X,
% 1.09/1.48 Y ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 X := skol5
% 1.09/1.48 Y := skol7
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (36) {G1,W5,D3,L1,V0,M1} R(4,15) { in( skol1( skol5, skol7 ),
% 1.09/1.48 skol5 ) }.
% 1.09/1.48 parent0: (4555) {G1,W5,D3,L1,V0,M1} { in( skol1( skol5, skol7 ), skol5 )
% 1.09/1.48 }.
% 1.09/1.48 substitution0:
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 eqswap: (4556) {G0,W19,D4,L3,V4,M3} { Z ==> ordered_pair( skol4( X, Y, Z )
% 1.09/1.48 , skol6( X, Y, Z ) ), ! subset( T, cartesian_product2( X, Y ) ), ! in( Z
% 1.09/1.48 , T ) }.
% 1.09/1.48 parent0[2]: (12) {G0,W19,D4,L3,V4,M3} I { ! subset( X, cartesian_product2(
% 1.09/1.48 Y, Z ) ), ! in( T, X ), ordered_pair( skol4( Y, Z, T ), skol6( Y, Z, T )
% 1.09/1.48 ) ==> T }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := T
% 1.09/1.48 Y := X
% 1.09/1.48 Z := Y
% 1.09/1.48 T := Z
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 resolution: (4557) {G1,W14,D4,L2,V1,M2} { X ==> ordered_pair( skol4( skol8
% 1.09/1.48 , skol9, X ), skol6( skol8, skol9, X ) ), ! in( X, skol5 ) }.
% 1.09/1.48 parent0[1]: (4556) {G0,W19,D4,L3,V4,M3} { Z ==> ordered_pair( skol4( X, Y
% 1.09/1.48 , Z ), skol6( X, Y, Z ) ), ! subset( T, cartesian_product2( X, Y ) ), !
% 1.09/1.48 in( Z, T ) }.
% 1.09/1.48 parent1[0]: (13) {G0,W5,D3,L1,V0,M1} I { subset( skol5, cartesian_product2
% 1.09/1.48 ( skol8, skol9 ) ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := skol8
% 1.09/1.48 Y := skol9
% 1.09/1.48 Z := X
% 1.09/1.48 T := skol5
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 eqswap: (4558) {G1,W14,D4,L2,V1,M2} { ordered_pair( skol4( skol8, skol9, X
% 1.09/1.48 ), skol6( skol8, skol9, X ) ) ==> X, ! in( X, skol5 ) }.
% 1.09/1.48 parent0[0]: (4557) {G1,W14,D4,L2,V1,M2} { X ==> ordered_pair( skol4( skol8
% 1.09/1.48 , skol9, X ), skol6( skol8, skol9, X ) ), ! in( X, skol5 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (138) {G1,W14,D4,L2,V1,M2} R(12,13) { ! in( X, skol5 ),
% 1.09/1.48 ordered_pair( skol4( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X
% 1.09/1.48 }.
% 1.09/1.48 parent0: (4558) {G1,W14,D4,L2,V1,M2} { ordered_pair( skol4( skol8, skol9,
% 1.09/1.48 X ), skol6( skol8, skol9, X ) ) ==> X, ! in( X, skol5 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 1
% 1.09/1.48 1 ==> 0
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 paramod: (4561) {G1,W17,D4,L3,V1,M3} { in( X, skol7 ), ! in( X, skol5 ), !
% 1.09/1.48 in( ordered_pair( skol4( skol8, skol9, X ), skol6( skol8, skol9, X ) ),
% 1.09/1.48 skol5 ) }.
% 1.09/1.48 parent0[1]: (138) {G1,W14,D4,L2,V1,M2} R(12,13) { ! in( X, skol5 ),
% 1.09/1.48 ordered_pair( skol4( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X
% 1.09/1.48 }.
% 1.09/1.48 parent1[1; 1]: (14) {G0,W10,D3,L2,V2,M2} I { ! in( ordered_pair( X, Y ),
% 1.09/1.48 skol5 ), in( ordered_pair( X, Y ), skol7 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 X := skol4( skol8, skol9, X )
% 1.09/1.48 Y := skol6( skol8, skol9, X )
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 paramod: (4562) {G2,W12,D2,L4,V1,M4} { ! in( X, skol5 ), ! in( X, skol5 )
% 1.09/1.48 , in( X, skol7 ), ! in( X, skol5 ) }.
% 1.09/1.48 parent0[1]: (138) {G1,W14,D4,L2,V1,M2} R(12,13) { ! in( X, skol5 ),
% 1.09/1.48 ordered_pair( skol4( skol8, skol9, X ), skol6( skol8, skol9, X ) ) ==> X
% 1.09/1.48 }.
% 1.09/1.48 parent1[2; 2]: (4561) {G1,W17,D4,L3,V1,M3} { in( X, skol7 ), ! in( X,
% 1.09/1.48 skol5 ), ! in( ordered_pair( skol4( skol8, skol9, X ), skol6( skol8,
% 1.09/1.48 skol9, X ) ), skol5 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 factor: (4564) {G2,W9,D2,L3,V1,M3} { ! in( X, skol5 ), in( X, skol7 ), !
% 1.09/1.48 in( X, skol5 ) }.
% 1.09/1.48 parent0[0, 1]: (4562) {G2,W12,D2,L4,V1,M4} { ! in( X, skol5 ), ! in( X,
% 1.09/1.48 skol5 ), in( X, skol7 ), ! in( X, skol5 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 factor: (4565) {G2,W6,D2,L2,V1,M2} { ! in( X, skol5 ), in( X, skol7 ) }.
% 1.09/1.48 parent0[0, 2]: (4564) {G2,W9,D2,L3,V1,M3} { ! in( X, skol5 ), in( X, skol7
% 1.09/1.48 ), ! in( X, skol5 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (4355) {G2,W6,D2,L2,V1,M2} P(138,14);f { ! in( X, skol5 ), in
% 1.09/1.48 ( X, skol7 ) }.
% 1.09/1.48 parent0: (4565) {G2,W6,D2,L2,V1,M2} { ! in( X, skol5 ), in( X, skol7 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := X
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 0 ==> 0
% 1.09/1.48 1 ==> 1
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 resolution: (4566) {G2,W5,D3,L1,V0,M1} { in( skol1( skol5, skol7 ), skol7
% 1.09/1.48 ) }.
% 1.09/1.48 parent0[0]: (4355) {G2,W6,D2,L2,V1,M2} P(138,14);f { ! in( X, skol5 ), in(
% 1.09/1.48 X, skol7 ) }.
% 1.09/1.48 parent1[0]: (36) {G1,W5,D3,L1,V0,M1} R(4,15) { in( skol1( skol5, skol7 ),
% 1.09/1.48 skol5 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := skol1( skol5, skol7 )
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 resolution: (4567) {G2,W0,D0,L0,V0,M0} { }.
% 1.09/1.48 parent0[0]: (17) {G1,W5,D3,L1,V1,M1} R(3,15) { ! in( skol1( X, skol7 ),
% 1.09/1.48 skol7 ) }.
% 1.09/1.48 parent1[0]: (4566) {G2,W5,D3,L1,V0,M1} { in( skol1( skol5, skol7 ), skol7
% 1.09/1.48 ) }.
% 1.09/1.48 substitution0:
% 1.09/1.48 X := skol5
% 1.09/1.48 end
% 1.09/1.48 substitution1:
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 subsumption: (4522) {G3,W0,D0,L0,V0,M0} R(4355,36);r(17) { }.
% 1.09/1.48 parent0: (4567) {G2,W0,D0,L0,V0,M0} { }.
% 1.09/1.48 substitution0:
% 1.09/1.48 end
% 1.09/1.48 permutation0:
% 1.09/1.48 end
% 1.09/1.48
% 1.09/1.48 Proof check complete!
% 1.09/1.48
% 1.09/1.48 Memory use:
% 1.09/1.48
% 1.09/1.48 space for terms: 70667
% 1.09/1.48 space for clauses: 193195
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 clauses generated: 23128
% 1.09/1.48 clauses kept: 4523
% 1.09/1.48 clauses selected: 368
% 1.09/1.48 clauses deleted: 17
% 1.09/1.48 clauses inuse deleted: 3
% 1.09/1.48
% 1.09/1.48 subsentry: 173303
% 1.09/1.48 literals s-matched: 74388
% 1.09/1.48 literals matched: 72527
% 1.09/1.48 full subsumption: 29262
% 1.09/1.48
% 1.09/1.48 checksum: -2091322660
% 1.09/1.48
% 1.09/1.48
% 1.09/1.48 Bliksem ended
%------------------------------------------------------------------------------