TSTP Solution File: SET625+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET625+3 : TPTP v8.1.0. Released v2.2.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:50:54 EDT 2022
% Result : Theorem 0.43s 1.06s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 10 11:13:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.05 *** allocated 10000 integers for termspace/termends
% 0.43/1.05 *** allocated 10000 integers for clauses
% 0.43/1.05 *** allocated 10000 integers for justifications
% 0.43/1.05 Bliksem 1.12
% 0.43/1.05
% 0.43/1.05
% 0.43/1.05 Automatic Strategy Selection
% 0.43/1.05
% 0.43/1.05
% 0.43/1.05 Clauses:
% 0.43/1.05
% 0.43/1.05 { ! intersect( X, Y ), member( skol1( Z, Y ), Y ) }.
% 0.43/1.05 { ! intersect( X, Y ), member( skol1( X, Y ), X ) }.
% 0.43/1.05 { ! member( Z, X ), ! member( Z, Y ), intersect( X, Y ) }.
% 0.43/1.05 { ! subset( X, Y ), ! member( Z, X ), member( Z, Y ) }.
% 0.43/1.05 { ! member( skol2( Z, Y ), Y ), subset( X, Y ) }.
% 0.43/1.05 { member( skol2( X, Y ), X ), subset( X, Y ) }.
% 0.43/1.05 { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.43/1.05 { subset( X, X ) }.
% 0.43/1.05 { intersect( skol3, skol5 ) }.
% 0.43/1.05 { subset( skol5, skol4 ) }.
% 0.43/1.05 { ! intersect( skol3, skol4 ) }.
% 0.43/1.05
% 0.43/1.05 percentage equality = 0.000000, percentage horn = 0.909091
% 0.43/1.05 This is a near-Horn, non-equality problem
% 0.43/1.05
% 0.43/1.05
% 0.43/1.05 Options Used:
% 0.43/1.05
% 0.43/1.05 useres = 1
% 0.43/1.05 useparamod = 0
% 0.43/1.05 useeqrefl = 0
% 0.43/1.05 useeqfact = 0
% 0.43/1.05 usefactor = 1
% 0.43/1.05 usesimpsplitting = 0
% 0.43/1.05 usesimpdemod = 0
% 0.43/1.05 usesimpres = 4
% 0.43/1.05
% 0.43/1.05 resimpinuse = 1000
% 0.43/1.05 resimpclauses = 20000
% 0.43/1.05 substype = standard
% 0.43/1.06 backwardsubs = 1
% 0.43/1.06 selectoldest = 5
% 0.43/1.06
% 0.43/1.06 litorderings [0] = split
% 0.43/1.06 litorderings [1] = liftord
% 0.43/1.06
% 0.43/1.06 termordering = none
% 0.43/1.06
% 0.43/1.06 litapriori = 1
% 0.43/1.06 termapriori = 0
% 0.43/1.06 litaposteriori = 0
% 0.43/1.06 termaposteriori = 0
% 0.43/1.06 demodaposteriori = 0
% 0.43/1.06 ordereqreflfact = 0
% 0.43/1.06
% 0.43/1.06 litselect = negative
% 0.43/1.06
% 0.43/1.06 maxweight = 30000
% 0.43/1.06 maxdepth = 30000
% 0.43/1.06 maxlength = 115
% 0.43/1.06 maxnrvars = 195
% 0.43/1.06 excuselevel = 0
% 0.43/1.06 increasemaxweight = 0
% 0.43/1.06
% 0.43/1.06 maxselected = 10000000
% 0.43/1.06 maxnrclauses = 10000000
% 0.43/1.06
% 0.43/1.06 showgenerated = 0
% 0.43/1.06 showkept = 0
% 0.43/1.06 showselected = 0
% 0.43/1.06 showdeleted = 0
% 0.43/1.06 showresimp = 1
% 0.43/1.06 showstatus = 2000
% 0.43/1.06
% 0.43/1.06 prologoutput = 0
% 0.43/1.06 nrgoals = 5000000
% 0.43/1.06 totalproof = 1
% 0.43/1.06
% 0.43/1.06 Symbols occurring in the translation:
% 0.43/1.06
% 0.43/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.06 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.06 ! [4, 1] (w:1, o:12, a:1, s:1, b:0),
% 0.43/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 intersect [37, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.43/1.06 member [39, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.43/1.06 subset [40, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.43/1.06 skol1 [41, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.43/1.06 skol2 [42, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.43/1.06 skol3 [43, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.43/1.06 skol4 [44, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.43/1.06 skol5 [45, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Starting Search:
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksems!, er is een bewijs:
% 0.43/1.06 % SZS status Theorem
% 0.43/1.06 % SZS output start Refutation
% 0.43/1.06
% 0.43/1.06 (0) {G0,W9,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), ! intersect( X, Y )
% 0.43/1.06 }.
% 0.43/1.06 (1) {G0,W9,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), ! intersect( X, Y )
% 0.43/1.06 }.
% 0.43/1.06 (2) {G0,W11,D2,L3,V3,M1} I { intersect( X, Y ), ! member( Z, X ), ! member
% 0.43/1.06 ( Z, Y ) }.
% 0.43/1.06 (3) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Y ), member( Z, Y ), ! member( Z
% 0.43/1.06 , X ) }.
% 0.43/1.06 (6) {G0,W7,D2,L2,V2,M1} I { intersect( Y, X ), ! intersect( X, Y ) }.
% 0.43/1.06 (8) {G0,W3,D2,L1,V0,M1} I { intersect( skol3, skol5 ) }.
% 0.43/1.06 (9) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol4 ) }.
% 0.43/1.06 (10) {G0,W4,D2,L1,V0,M1} I { ! intersect( skol3, skol4 ) }.
% 0.43/1.06 (13) {G1,W5,D3,L1,V1,M1} R(0,8) { member( skol1( X, skol5 ), skol5 ) }.
% 0.43/1.06 (18) {G1,W5,D3,L1,V0,M1} R(1,8) { member( skol1( skol3, skol5 ), skol3 )
% 0.43/1.06 }.
% 0.43/1.06 (19) {G2,W9,D3,L2,V1,M1} R(2,18) { intersect( X, skol3 ), ! member( skol1(
% 0.43/1.06 skol3, skol5 ), X ) }.
% 0.43/1.06 (25) {G2,W9,D3,L2,V2,M1} R(3,13) { member( skol1( Y, skol5 ), X ), ! subset
% 0.43/1.06 ( skol5, X ) }.
% 0.43/1.06 (28) {G3,W5,D3,L1,V1,M1} R(25,9) { member( skol1( X, skol5 ), skol4 ) }.
% 0.43/1.06 (36) {G4,W3,D2,L1,V0,M1} R(19,28) { intersect( skol4, skol3 ) }.
% 0.43/1.06 (38) {G5,W0,D0,L0,V0,M0} R(36,6);r(10) { }.
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 % SZS output end Refutation
% 0.43/1.06 found a proof!
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Unprocessed initial clauses:
% 0.43/1.06
% 0.43/1.06 (40) {G0,W9,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol1( Z, Y ), Y )
% 0.43/1.06 }.
% 0.43/1.06 (41) {G0,W9,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol1( X, Y ), X )
% 0.43/1.06 }.
% 0.43/1.06 (42) {G0,W11,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ), intersect
% 0.43/1.06 ( X, Y ) }.
% 0.43/1.06 (43) {G0,W11,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ), member( Z
% 0.43/1.06 , Y ) }.
% 0.43/1.06 (44) {G0,W9,D3,L2,V3,M2} { ! member( skol2( Z, Y ), Y ), subset( X, Y )
% 0.43/1.06 }.
% 0.43/1.06 (45) {G0,W8,D3,L2,V2,M2} { member( skol2( X, Y ), X ), subset( X, Y ) }.
% 0.43/1.06 (46) {G0,W7,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X ) }.
% 0.43/1.06 (47) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.43/1.06 (48) {G0,W3,D2,L1,V0,M1} { intersect( skol3, skol5 ) }.
% 0.43/1.06 (49) {G0,W3,D2,L1,V0,M1} { subset( skol5, skol4 ) }.
% 0.43/1.06 (50) {G0,W4,D2,L1,V0,M1} { ! intersect( skol3, skol4 ) }.
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Total Proof:
% 0.43/1.06
% 0.43/1.06 subsumption: (0) {G0,W9,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), !
% 0.43/1.06 intersect( X, Y ) }.
% 0.43/1.06 parent0: (40) {G0,W9,D3,L2,V3,M2} { ! intersect( X, Y ), member( skol1( Z
% 0.43/1.06 , Y ), Y ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 Z := Z
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 1
% 0.43/1.06 1 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (1) {G0,W9,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), !
% 0.43/1.06 intersect( X, Y ) }.
% 0.43/1.06 parent0: (41) {G0,W9,D3,L2,V2,M2} { ! intersect( X, Y ), member( skol1( X
% 0.43/1.06 , Y ), X ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 1
% 0.43/1.06 1 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (2) {G0,W11,D2,L3,V3,M1} I { intersect( X, Y ), ! member( Z, X
% 0.43/1.06 ), ! member( Z, Y ) }.
% 0.43/1.06 parent0: (42) {G0,W11,D2,L3,V3,M3} { ! member( Z, X ), ! member( Z, Y ),
% 0.43/1.06 intersect( X, Y ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 Z := Z
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 1
% 0.43/1.06 1 ==> 2
% 0.43/1.06 2 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (3) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Y ), member( Z, Y )
% 0.43/1.06 , ! member( Z, X ) }.
% 0.43/1.06 parent0: (43) {G0,W11,D2,L3,V3,M3} { ! subset( X, Y ), ! member( Z, X ),
% 0.43/1.06 member( Z, Y ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 Z := Z
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 1 ==> 2
% 0.43/1.06 2 ==> 1
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (6) {G0,W7,D2,L2,V2,M1} I { intersect( Y, X ), ! intersect( X
% 0.43/1.06 , Y ) }.
% 0.43/1.06 parent0: (46) {G0,W7,D2,L2,V2,M2} { ! intersect( X, Y ), intersect( Y, X )
% 0.43/1.06 }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 1
% 0.43/1.06 1 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (8) {G0,W3,D2,L1,V0,M1} I { intersect( skol3, skol5 ) }.
% 0.43/1.06 parent0: (48) {G0,W3,D2,L1,V0,M1} { intersect( skol3, skol5 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (9) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol4 ) }.
% 0.43/1.06 parent0: (49) {G0,W3,D2,L1,V0,M1} { subset( skol5, skol4 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (10) {G0,W4,D2,L1,V0,M1} I { ! intersect( skol3, skol4 ) }.
% 0.43/1.06 parent0: (50) {G0,W4,D2,L1,V0,M1} { ! intersect( skol3, skol4 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (57) {G1,W5,D3,L1,V1,M1} { member( skol1( X, skol5 ), skol5 )
% 0.43/1.06 }.
% 0.43/1.06 parent0[1]: (0) {G0,W9,D3,L2,V3,M1} I { member( skol1( Z, Y ), Y ), !
% 0.43/1.06 intersect( X, Y ) }.
% 0.43/1.06 parent1[0]: (8) {G0,W3,D2,L1,V0,M1} I { intersect( skol3, skol5 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := skol3
% 0.43/1.06 Y := skol5
% 0.43/1.06 Z := X
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (13) {G1,W5,D3,L1,V1,M1} R(0,8) { member( skol1( X, skol5 ),
% 0.43/1.06 skol5 ) }.
% 0.43/1.06 parent0: (57) {G1,W5,D3,L1,V1,M1} { member( skol1( X, skol5 ), skol5 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (58) {G1,W5,D3,L1,V0,M1} { member( skol1( skol3, skol5 ),
% 0.43/1.06 skol3 ) }.
% 0.43/1.06 parent0[1]: (1) {G0,W9,D3,L2,V2,M1} I { member( skol1( X, Y ), X ), !
% 0.43/1.06 intersect( X, Y ) }.
% 0.43/1.06 parent1[0]: (8) {G0,W3,D2,L1,V0,M1} I { intersect( skol3, skol5 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := skol3
% 0.43/1.06 Y := skol5
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (18) {G1,W5,D3,L1,V0,M1} R(1,8) { member( skol1( skol3, skol5
% 0.43/1.06 ), skol3 ) }.
% 0.43/1.06 parent0: (58) {G1,W5,D3,L1,V0,M1} { member( skol1( skol3, skol5 ), skol3 )
% 0.43/1.06 }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (60) {G1,W9,D3,L2,V1,M2} { intersect( X, skol3 ), ! member(
% 0.43/1.06 skol1( skol3, skol5 ), X ) }.
% 0.43/1.06 parent0[2]: (2) {G0,W11,D2,L3,V3,M1} I { intersect( X, Y ), ! member( Z, X
% 0.43/1.06 ), ! member( Z, Y ) }.
% 0.43/1.06 parent1[0]: (18) {G1,W5,D3,L1,V0,M1} R(1,8) { member( skol1( skol3, skol5 )
% 0.43/1.06 , skol3 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := skol3
% 0.43/1.06 Z := skol1( skol3, skol5 )
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (19) {G2,W9,D3,L2,V1,M1} R(2,18) { intersect( X, skol3 ), !
% 0.43/1.06 member( skol1( skol3, skol5 ), X ) }.
% 0.43/1.06 parent0: (60) {G1,W9,D3,L2,V1,M2} { intersect( X, skol3 ), ! member( skol1
% 0.43/1.06 ( skol3, skol5 ), X ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 1 ==> 1
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (61) {G1,W9,D3,L2,V2,M2} { ! subset( skol5, X ), member( skol1
% 0.43/1.06 ( Y, skol5 ), X ) }.
% 0.43/1.06 parent0[2]: (3) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Y ), member( Z, Y ),
% 0.43/1.06 ! member( Z, X ) }.
% 0.43/1.06 parent1[0]: (13) {G1,W5,D3,L1,V1,M1} R(0,8) { member( skol1( X, skol5 ),
% 0.43/1.06 skol5 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := skol5
% 0.43/1.06 Y := X
% 0.43/1.06 Z := skol1( Y, skol5 )
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 X := Y
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (25) {G2,W9,D3,L2,V2,M1} R(3,13) { member( skol1( Y, skol5 ),
% 0.43/1.06 X ), ! subset( skol5, X ) }.
% 0.43/1.06 parent0: (61) {G1,W9,D3,L2,V2,M2} { ! subset( skol5, X ), member( skol1( Y
% 0.43/1.06 , skol5 ), X ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 1
% 0.43/1.06 1 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (62) {G1,W5,D3,L1,V1,M1} { member( skol1( X, skol5 ), skol4 )
% 0.43/1.06 }.
% 0.43/1.06 parent0[1]: (25) {G2,W9,D3,L2,V2,M1} R(3,13) { member( skol1( Y, skol5 ), X
% 0.43/1.06 ), ! subset( skol5, X ) }.
% 0.43/1.06 parent1[0]: (9) {G0,W3,D2,L1,V0,M1} I { subset( skol5, skol4 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := skol4
% 0.43/1.06 Y := X
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (28) {G3,W5,D3,L1,V1,M1} R(25,9) { member( skol1( X, skol5 ),
% 0.43/1.06 skol4 ) }.
% 0.43/1.06 parent0: (62) {G1,W5,D3,L1,V1,M1} { member( skol1( X, skol5 ), skol4 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (63) {G3,W3,D2,L1,V0,M1} { intersect( skol4, skol3 ) }.
% 0.43/1.06 parent0[1]: (19) {G2,W9,D3,L2,V1,M1} R(2,18) { intersect( X, skol3 ), !
% 0.43/1.06 member( skol1( skol3, skol5 ), X ) }.
% 0.43/1.06 parent1[0]: (28) {G3,W5,D3,L1,V1,M1} R(25,9) { member( skol1( X, skol5 ),
% 0.43/1.06 skol4 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := skol4
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 X := skol3
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (36) {G4,W3,D2,L1,V0,M1} R(19,28) { intersect( skol4, skol3 )
% 0.43/1.06 }.
% 0.43/1.06 parent0: (63) {G3,W3,D2,L1,V0,M1} { intersect( skol4, skol3 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (64) {G1,W3,D2,L1,V0,M1} { intersect( skol3, skol4 ) }.
% 0.43/1.06 parent0[1]: (6) {G0,W7,D2,L2,V2,M1} I { intersect( Y, X ), ! intersect( X,
% 0.43/1.06 Y ) }.
% 0.43/1.06 parent1[0]: (36) {G4,W3,D2,L1,V0,M1} R(19,28) { intersect( skol4, skol3 )
% 0.43/1.06 }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := skol4
% 0.43/1.06 Y := skol3
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 resolution: (65) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.06 parent0[0]: (10) {G0,W4,D2,L1,V0,M1} I { ! intersect( skol3, skol4 ) }.
% 0.43/1.06 parent1[0]: (64) {G1,W3,D2,L1,V0,M1} { intersect( skol3, skol4 ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 substitution1:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (38) {G5,W0,D0,L0,V0,M0} R(36,6);r(10) { }.
% 0.43/1.06 parent0: (65) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.06 substitution0:
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 Proof check complete!
% 0.43/1.06
% 0.43/1.06 Memory use:
% 0.43/1.06
% 0.43/1.06 space for terms: 422
% 0.43/1.06 space for clauses: 2002
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 clauses generated: 59
% 0.43/1.06 clauses kept: 39
% 0.43/1.06 clauses selected: 27
% 0.43/1.06 clauses deleted: 0
% 0.43/1.06 clauses inuse deleted: 0
% 0.43/1.06
% 0.43/1.06 subsentry: 41
% 0.43/1.06 literals s-matched: 30
% 0.43/1.06 literals matched: 20
% 0.43/1.06 full subsumption: 0
% 0.43/1.06
% 0.43/1.06 checksum: 1965559574
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksem ended
%------------------------------------------------------------------------------