TSTP Solution File: SET971+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET971+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:41 EDT 2022
% Result : Theorem 0.79s 1.15s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET971+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sun Jul 10 08:33:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.79/1.15 *** allocated 10000 integers for termspace/termends
% 0.79/1.15 *** allocated 10000 integers for clauses
% 0.79/1.15 *** allocated 10000 integers for justifications
% 0.79/1.15 Bliksem 1.12
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Automatic Strategy Selection
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Clauses:
% 0.79/1.15
% 0.79/1.15 { set_intersection2( X, Y ) = set_intersection2( Y, X ) }.
% 0.79/1.15 { set_intersection2( X, X ) = X }.
% 0.79/1.15 { empty( skol1 ) }.
% 0.79/1.15 { ! empty( skol2 ) }.
% 0.79/1.15 { subset( X, X ) }.
% 0.79/1.15 { cartesian_product2( set_intersection2( X, Y ), set_intersection2( Z, T )
% 0.79/1.15 ) = set_intersection2( cartesian_product2( X, Z ), cartesian_product2( Y
% 0.79/1.15 , T ) ) }.
% 0.79/1.15 { subset( skol3, skol4 ) }.
% 0.79/1.15 { subset( skol5, skol6 ) }.
% 0.79/1.15 { ! set_intersection2( cartesian_product2( skol3, skol6 ),
% 0.79/1.15 cartesian_product2( skol4, skol5 ) ) = cartesian_product2( skol3, skol5 )
% 0.79/1.15 }.
% 0.79/1.15 { ! subset( X, Y ), set_intersection2( X, Y ) = X }.
% 0.79/1.15
% 0.79/1.15 percentage equality = 0.454545, percentage horn = 1.000000
% 0.79/1.15 This is a problem with some equality
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Options Used:
% 0.79/1.15
% 0.79/1.15 useres = 1
% 0.79/1.15 useparamod = 1
% 0.79/1.15 useeqrefl = 1
% 0.79/1.15 useeqfact = 1
% 0.79/1.15 usefactor = 1
% 0.79/1.15 usesimpsplitting = 0
% 0.79/1.15 usesimpdemod = 5
% 0.79/1.15 usesimpres = 3
% 0.79/1.15
% 0.79/1.15 resimpinuse = 1000
% 0.79/1.15 resimpclauses = 20000
% 0.79/1.15 substype = eqrewr
% 0.79/1.15 backwardsubs = 1
% 0.79/1.15 selectoldest = 5
% 0.79/1.15
% 0.79/1.15 litorderings [0] = split
% 0.79/1.15 litorderings [1] = extend the termordering, first sorting on arguments
% 0.79/1.15
% 0.79/1.15 termordering = kbo
% 0.79/1.15
% 0.79/1.15 litapriori = 0
% 0.79/1.15 termapriori = 1
% 0.79/1.15 litaposteriori = 0
% 0.79/1.15 termaposteriori = 0
% 0.79/1.15 demodaposteriori = 0
% 0.79/1.15 ordereqreflfact = 0
% 0.79/1.15
% 0.79/1.15 litselect = negord
% 0.79/1.15
% 0.79/1.15 maxweight = 15
% 0.79/1.15 maxdepth = 30000
% 0.79/1.15 maxlength = 115
% 0.79/1.15 maxnrvars = 195
% 0.79/1.15 excuselevel = 1
% 0.79/1.15 increasemaxweight = 1
% 0.79/1.15
% 0.79/1.15 maxselected = 10000000
% 0.79/1.15 maxnrclauses = 10000000
% 0.79/1.15
% 0.79/1.15 showgenerated = 0
% 0.79/1.15 showkept = 0
% 0.79/1.15 showselected = 0
% 0.79/1.15 showdeleted = 0
% 0.79/1.15 showresimp = 1
% 0.79/1.15 showstatus = 2000
% 0.79/1.15
% 0.79/1.15 prologoutput = 0
% 0.79/1.15 nrgoals = 5000000
% 0.79/1.15 totalproof = 1
% 0.79/1.15
% 0.79/1.15 Symbols occurring in the translation:
% 0.79/1.15
% 0.79/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.79/1.15 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.79/1.15 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.79/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.79/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.79/1.15 set_intersection2 [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.79/1.15 empty [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.79/1.15 subset [39, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.79/1.15 cartesian_product2 [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.79/1.15 skol1 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.79/1.15 skol2 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.79/1.15 skol3 [45, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.79/1.15 skol4 [46, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.79/1.15 skol5 [47, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.79/1.15 skol6 [48, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Starting Search:
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Bliksems!, er is een bewijs:
% 0.79/1.15 % SZS status Theorem
% 0.79/1.15 % SZS output start Refutation
% 0.79/1.15
% 0.79/1.15 (0) {G0,W7,D3,L1,V2,M1} I { set_intersection2( X, Y ) = set_intersection2(
% 0.79/1.15 Y, X ) }.
% 0.79/1.15 (5) {G0,W15,D4,L1,V4,M1} I { cartesian_product2( set_intersection2( X, Y )
% 0.79/1.15 , set_intersection2( Z, T ) ) ==> set_intersection2( cartesian_product2(
% 0.79/1.15 X, Z ), cartesian_product2( Y, T ) ) }.
% 0.79/1.15 (6) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.79/1.15 (7) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol6 ) }.
% 0.79/1.15 (8) {G0,W11,D4,L1,V0,M1} I { ! set_intersection2( cartesian_product2( skol3
% 0.79/1.15 , skol6 ), cartesian_product2( skol4, skol5 ) ) ==> cartesian_product2(
% 0.79/1.15 skol3, skol5 ) }.
% 0.79/1.15 (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_intersection2( X, Y ) ==>
% 0.79/1.15 X }.
% 0.79/1.15 (10) {G1,W5,D3,L1,V0,M1} R(9,6) { set_intersection2( skol3, skol4 ) ==>
% 0.79/1.15 skol3 }.
% 0.79/1.15 (11) {G1,W5,D3,L1,V0,M1} R(9,7) { set_intersection2( skol5, skol6 ) ==>
% 0.79/1.15 skol5 }.
% 0.79/1.15 (27) {G2,W5,D3,L1,V0,M1} P(11,0) { set_intersection2( skol6, skol5 ) ==>
% 0.79/1.15 skol5 }.
% 0.79/1.15 (29) {G3,W13,D4,L1,V2,M1} P(27,5) { set_intersection2( cartesian_product2(
% 0.79/1.15 X, skol6 ), cartesian_product2( Y, skol5 ) ) ==> cartesian_product2(
% 0.79/1.15 set_intersection2( X, Y ), skol5 ) }.
% 0.79/1.15 (31) {G4,W0,D0,L0,V0,M0} S(8);d(29);d(10);q { }.
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 % SZS output end Refutation
% 0.79/1.15 found a proof!
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Unprocessed initial clauses:
% 0.79/1.15
% 0.79/1.15 (33) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) = set_intersection2(
% 0.79/1.15 Y, X ) }.
% 0.79/1.15 (34) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, X ) = X }.
% 0.79/1.15 (35) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.79/1.15 (36) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.79/1.15 (37) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.79/1.15 (38) {G0,W15,D4,L1,V4,M1} { cartesian_product2( set_intersection2( X, Y )
% 0.79/1.15 , set_intersection2( Z, T ) ) = set_intersection2( cartesian_product2( X
% 0.79/1.15 , Z ), cartesian_product2( Y, T ) ) }.
% 0.79/1.15 (39) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.79/1.15 (40) {G0,W3,D2,L1,V0,M1} { subset( skol5, skol6 ) }.
% 0.79/1.15 (41) {G0,W11,D4,L1,V0,M1} { ! set_intersection2( cartesian_product2( skol3
% 0.79/1.15 , skol6 ), cartesian_product2( skol4, skol5 ) ) = cartesian_product2(
% 0.79/1.15 skol3, skol5 ) }.
% 0.79/1.15 (42) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_intersection2( X, Y ) = X
% 0.79/1.15 }.
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Total Proof:
% 0.79/1.15
% 0.79/1.15 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { set_intersection2( X, Y ) =
% 0.79/1.15 set_intersection2( Y, X ) }.
% 0.79/1.15 parent0: (33) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) =
% 0.79/1.15 set_intersection2( Y, X ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (5) {G0,W15,D4,L1,V4,M1} I { cartesian_product2(
% 0.79/1.15 set_intersection2( X, Y ), set_intersection2( Z, T ) ) ==>
% 0.79/1.15 set_intersection2( cartesian_product2( X, Z ), cartesian_product2( Y, T )
% 0.79/1.15 ) }.
% 0.79/1.15 parent0: (38) {G0,W15,D4,L1,V4,M1} { cartesian_product2( set_intersection2
% 0.79/1.15 ( X, Y ), set_intersection2( Z, T ) ) = set_intersection2(
% 0.79/1.15 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 Z := Z
% 0.79/1.15 T := T
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (6) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.79/1.15 parent0: (39) {G0,W3,D2,L1,V0,M1} { subset( skol3, skol4 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (7) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol6 ) }.
% 0.79/1.15 parent0: (40) {G0,W3,D2,L1,V0,M1} { subset( skol5, skol6 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (8) {G0,W11,D4,L1,V0,M1} I { ! set_intersection2(
% 0.79/1.15 cartesian_product2( skol3, skol6 ), cartesian_product2( skol4, skol5 ) )
% 0.79/1.15 ==> cartesian_product2( skol3, skol5 ) }.
% 0.79/1.15 parent0: (41) {G0,W11,D4,L1,V0,M1} { ! set_intersection2(
% 0.79/1.15 cartesian_product2( skol3, skol6 ), cartesian_product2( skol4, skol5 ) )
% 0.79/1.15 = cartesian_product2( skol3, skol5 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ),
% 0.79/1.15 set_intersection2( X, Y ) ==> X }.
% 0.79/1.15 parent0: (42) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), set_intersection2( X
% 0.79/1.15 , Y ) = X }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 1 ==> 1
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (56) {G0,W8,D3,L2,V2,M2} { X ==> set_intersection2( X, Y ), !
% 0.79/1.15 subset( X, Y ) }.
% 0.79/1.15 parent0[1]: (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_intersection2
% 0.79/1.15 ( X, Y ) ==> X }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 resolution: (57) {G1,W5,D3,L1,V0,M1} { skol3 ==> set_intersection2( skol3
% 0.79/1.15 , skol4 ) }.
% 0.79/1.15 parent0[1]: (56) {G0,W8,D3,L2,V2,M2} { X ==> set_intersection2( X, Y ), !
% 0.79/1.15 subset( X, Y ) }.
% 0.79/1.15 parent1[0]: (6) {G0,W3,D2,L1,V0,M1} I { subset( skol3, skol4 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := skol3
% 0.79/1.15 Y := skol4
% 0.79/1.15 end
% 0.79/1.15 substitution1:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (58) {G1,W5,D3,L1,V0,M1} { set_intersection2( skol3, skol4 ) ==>
% 0.79/1.15 skol3 }.
% 0.79/1.15 parent0[0]: (57) {G1,W5,D3,L1,V0,M1} { skol3 ==> set_intersection2( skol3
% 0.79/1.15 , skol4 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (10) {G1,W5,D3,L1,V0,M1} R(9,6) { set_intersection2( skol3,
% 0.79/1.15 skol4 ) ==> skol3 }.
% 0.79/1.15 parent0: (58) {G1,W5,D3,L1,V0,M1} { set_intersection2( skol3, skol4 ) ==>
% 0.79/1.15 skol3 }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (59) {G0,W8,D3,L2,V2,M2} { X ==> set_intersection2( X, Y ), !
% 0.79/1.15 subset( X, Y ) }.
% 0.79/1.15 parent0[1]: (9) {G0,W8,D3,L2,V2,M2} I { ! subset( X, Y ), set_intersection2
% 0.79/1.15 ( X, Y ) ==> X }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 resolution: (60) {G1,W5,D3,L1,V0,M1} { skol5 ==> set_intersection2( skol5
% 0.79/1.15 , skol6 ) }.
% 0.79/1.15 parent0[1]: (59) {G0,W8,D3,L2,V2,M2} { X ==> set_intersection2( X, Y ), !
% 0.79/1.15 subset( X, Y ) }.
% 0.79/1.15 parent1[0]: (7) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol6 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := skol5
% 0.79/1.15 Y := skol6
% 0.79/1.15 end
% 0.79/1.15 substitution1:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (61) {G1,W5,D3,L1,V0,M1} { set_intersection2( skol5, skol6 ) ==>
% 0.79/1.15 skol5 }.
% 0.79/1.15 parent0[0]: (60) {G1,W5,D3,L1,V0,M1} { skol5 ==> set_intersection2( skol5
% 0.79/1.15 , skol6 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (11) {G1,W5,D3,L1,V0,M1} R(9,7) { set_intersection2( skol5,
% 0.79/1.15 skol6 ) ==> skol5 }.
% 0.79/1.15 parent0: (61) {G1,W5,D3,L1,V0,M1} { set_intersection2( skol5, skol6 ) ==>
% 0.79/1.15 skol5 }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (62) {G1,W5,D3,L1,V0,M1} { skol5 ==> set_intersection2( skol5,
% 0.79/1.15 skol6 ) }.
% 0.79/1.15 parent0[0]: (11) {G1,W5,D3,L1,V0,M1} R(9,7) { set_intersection2( skol5,
% 0.79/1.15 skol6 ) ==> skol5 }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 paramod: (63) {G1,W5,D3,L1,V0,M1} { skol5 ==> set_intersection2( skol6,
% 0.79/1.15 skol5 ) }.
% 0.79/1.15 parent0[0]: (0) {G0,W7,D3,L1,V2,M1} I { set_intersection2( X, Y ) =
% 0.79/1.15 set_intersection2( Y, X ) }.
% 0.79/1.15 parent1[0; 2]: (62) {G1,W5,D3,L1,V0,M1} { skol5 ==> set_intersection2(
% 0.79/1.15 skol5, skol6 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := skol5
% 0.79/1.15 Y := skol6
% 0.79/1.15 end
% 0.79/1.15 substitution1:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (66) {G1,W5,D3,L1,V0,M1} { set_intersection2( skol6, skol5 ) ==>
% 0.79/1.15 skol5 }.
% 0.79/1.15 parent0[0]: (63) {G1,W5,D3,L1,V0,M1} { skol5 ==> set_intersection2( skol6
% 0.79/1.15 , skol5 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (27) {G2,W5,D3,L1,V0,M1} P(11,0) { set_intersection2( skol6,
% 0.79/1.15 skol5 ) ==> skol5 }.
% 0.79/1.15 parent0: (66) {G1,W5,D3,L1,V0,M1} { set_intersection2( skol6, skol5 ) ==>
% 0.79/1.15 skol5 }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqswap: (68) {G0,W15,D4,L1,V4,M1} { set_intersection2( cartesian_product2
% 0.79/1.15 ( X, Z ), cartesian_product2( Y, T ) ) ==> cartesian_product2(
% 0.79/1.15 set_intersection2( X, Y ), set_intersection2( Z, T ) ) }.
% 0.79/1.15 parent0[0]: (5) {G0,W15,D4,L1,V4,M1} I { cartesian_product2(
% 0.79/1.15 set_intersection2( X, Y ), set_intersection2( Z, T ) ) ==>
% 0.79/1.15 set_intersection2( cartesian_product2( X, Z ), cartesian_product2( Y, T )
% 0.79/1.15 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 Z := Z
% 0.79/1.15 T := T
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 paramod: (70) {G1,W13,D4,L1,V2,M1} { set_intersection2( cartesian_product2
% 0.79/1.15 ( X, skol6 ), cartesian_product2( Y, skol5 ) ) ==> cartesian_product2(
% 0.79/1.15 set_intersection2( X, Y ), skol5 ) }.
% 0.79/1.15 parent0[0]: (27) {G2,W5,D3,L1,V0,M1} P(11,0) { set_intersection2( skol6,
% 0.79/1.15 skol5 ) ==> skol5 }.
% 0.79/1.15 parent1[0; 12]: (68) {G0,W15,D4,L1,V4,M1} { set_intersection2(
% 0.79/1.15 cartesian_product2( X, Z ), cartesian_product2( Y, T ) ) ==>
% 0.79/1.15 cartesian_product2( set_intersection2( X, Y ), set_intersection2( Z, T )
% 0.79/1.15 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 substitution1:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 Z := skol6
% 0.79/1.15 T := skol5
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (29) {G3,W13,D4,L1,V2,M1} P(27,5) { set_intersection2(
% 0.79/1.15 cartesian_product2( X, skol6 ), cartesian_product2( Y, skol5 ) ) ==>
% 0.79/1.15 cartesian_product2( set_intersection2( X, Y ), skol5 ) }.
% 0.79/1.15 parent0: (70) {G1,W13,D4,L1,V2,M1} { set_intersection2( cartesian_product2
% 0.79/1.15 ( X, skol6 ), cartesian_product2( Y, skol5 ) ) ==> cartesian_product2(
% 0.79/1.15 set_intersection2( X, Y ), skol5 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := X
% 0.79/1.15 Y := Y
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 0 ==> 0
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 paramod: (76) {G1,W9,D4,L1,V0,M1} { ! cartesian_product2(
% 0.79/1.15 set_intersection2( skol3, skol4 ), skol5 ) ==> cartesian_product2( skol3
% 0.79/1.15 , skol5 ) }.
% 0.79/1.15 parent0[0]: (29) {G3,W13,D4,L1,V2,M1} P(27,5) { set_intersection2(
% 0.79/1.15 cartesian_product2( X, skol6 ), cartesian_product2( Y, skol5 ) ) ==>
% 0.79/1.15 cartesian_product2( set_intersection2( X, Y ), skol5 ) }.
% 0.79/1.15 parent1[0; 2]: (8) {G0,W11,D4,L1,V0,M1} I { ! set_intersection2(
% 0.79/1.15 cartesian_product2( skol3, skol6 ), cartesian_product2( skol4, skol5 ) )
% 0.79/1.15 ==> cartesian_product2( skol3, skol5 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 X := skol3
% 0.79/1.15 Y := skol4
% 0.79/1.15 end
% 0.79/1.15 substitution1:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 paramod: (77) {G2,W7,D3,L1,V0,M1} { ! cartesian_product2( skol3, skol5 )
% 0.79/1.15 ==> cartesian_product2( skol3, skol5 ) }.
% 0.79/1.15 parent0[0]: (10) {G1,W5,D3,L1,V0,M1} R(9,6) { set_intersection2( skol3,
% 0.79/1.15 skol4 ) ==> skol3 }.
% 0.79/1.15 parent1[0; 3]: (76) {G1,W9,D4,L1,V0,M1} { ! cartesian_product2(
% 0.79/1.15 set_intersection2( skol3, skol4 ), skol5 ) ==> cartesian_product2( skol3
% 0.79/1.15 , skol5 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 substitution1:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 eqrefl: (78) {G0,W0,D0,L0,V0,M0} { }.
% 0.79/1.15 parent0[0]: (77) {G2,W7,D3,L1,V0,M1} { ! cartesian_product2( skol3, skol5
% 0.79/1.15 ) ==> cartesian_product2( skol3, skol5 ) }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 subsumption: (31) {G4,W0,D0,L0,V0,M0} S(8);d(29);d(10);q { }.
% 0.79/1.15 parent0: (78) {G0,W0,D0,L0,V0,M0} { }.
% 0.79/1.15 substitution0:
% 0.79/1.15 end
% 0.79/1.15 permutation0:
% 0.79/1.15 end
% 0.79/1.15
% 0.79/1.15 Proof check complete!
% 0.79/1.15
% 0.79/1.15 Memory use:
% 0.79/1.15
% 0.79/1.15 space for terms: 483
% 0.79/1.15 space for clauses: 3124
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 clauses generated: 100
% 0.79/1.15 clauses kept: 32
% 0.79/1.15 clauses selected: 15
% 0.79/1.15 clauses deleted: 1
% 0.79/1.15 clauses inuse deleted: 0
% 0.79/1.15
% 0.79/1.15 subsentry: 149
% 0.79/1.15 literals s-matched: 71
% 0.79/1.15 literals matched: 71
% 0.79/1.15 full subsumption: 0
% 0.79/1.15
% 0.79/1.15 checksum: 1878529682
% 0.79/1.15
% 0.79/1.15
% 0.79/1.15 Bliksem ended
%------------------------------------------------------------------------------