TSTP Solution File: REL003+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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 18:59:47 EDT 2022
% Result : Theorem 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Fri Jul 8 13:01:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.71/1.11 *** allocated 10000 integers for termspace/termends
% 0.71/1.11 *** allocated 10000 integers for clauses
% 0.71/1.11 *** allocated 10000 integers for justifications
% 0.71/1.11 Bliksem 1.12
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Automatic Strategy Selection
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Clauses:
% 0.71/1.11
% 0.71/1.11 { join( X, Y ) = join( Y, X ) }.
% 0.71/1.11 { join( X, join( Y, Z ) ) = join( join( X, Y ), Z ) }.
% 0.71/1.11 { X = join( complement( join( complement( X ), complement( Y ) ) ),
% 0.71/1.11 complement( join( complement( X ), Y ) ) ) }.
% 0.71/1.11 { meet( X, Y ) = complement( join( complement( X ), complement( Y ) ) ) }.
% 0.71/1.11 { composition( X, composition( Y, Z ) ) = composition( composition( X, Y )
% 0.71/1.11 , Z ) }.
% 0.71/1.11 { composition( X, one ) = X }.
% 0.71/1.11 { composition( join( X, Y ), Z ) = join( composition( X, Z ), composition(
% 0.71/1.11 Y, Z ) ) }.
% 0.71/1.11 { converse( converse( X ) ) = X }.
% 0.71/1.11 { converse( join( X, Y ) ) = join( converse( X ), converse( Y ) ) }.
% 0.71/1.11 { converse( composition( X, Y ) ) = composition( converse( Y ), converse( X
% 0.71/1.11 ) ) }.
% 0.71/1.11 { join( composition( converse( X ), complement( composition( X, Y ) ) ),
% 0.71/1.11 complement( Y ) ) = complement( Y ) }.
% 0.71/1.11 { top = join( X, complement( X ) ) }.
% 0.71/1.11 { zero = meet( X, complement( X ) ) }.
% 0.71/1.11 { alpha1( skol1, skol2 ), join( converse( skol1 ), converse( skol2 ) ) =
% 0.71/1.11 converse( skol2 ) }.
% 0.71/1.11 { alpha1( skol1, skol2 ), ! join( skol1, skol2 ) = skol2 }.
% 0.71/1.11 { ! alpha1( X, Y ), join( X, Y ) = Y }.
% 0.71/1.11 { ! alpha1( X, Y ), ! join( converse( X ), converse( Y ) ) = converse( Y )
% 0.71/1.11 }.
% 0.71/1.11 { ! join( X, Y ) = Y, join( converse( X ), converse( Y ) ) = converse( Y )
% 0.71/1.11 , alpha1( X, Y ) }.
% 0.71/1.11
% 0.71/1.11 percentage equality = 0.791667, percentage horn = 0.888889
% 0.71/1.11 This is a problem with some equality
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Options Used:
% 0.71/1.11
% 0.71/1.11 useres = 1
% 0.71/1.11 useparamod = 1
% 0.71/1.11 useeqrefl = 1
% 0.71/1.11 useeqfact = 1
% 0.71/1.11 usefactor = 1
% 0.71/1.11 usesimpsplitting = 0
% 0.71/1.11 usesimpdemod = 5
% 0.71/1.11 usesimpres = 3
% 0.71/1.11
% 0.71/1.11 resimpinuse = 1000
% 0.71/1.11 resimpclauses = 20000
% 0.71/1.11 substype = eqrewr
% 0.71/1.11 backwardsubs = 1
% 0.71/1.11 selectoldest = 5
% 0.71/1.11
% 0.71/1.11 litorderings [0] = split
% 0.71/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.11
% 0.71/1.11 termordering = kbo
% 0.71/1.11
% 0.71/1.11 litapriori = 0
% 0.71/1.11 termapriori = 1
% 0.71/1.11 litaposteriori = 0
% 0.71/1.11 termaposteriori = 0
% 0.71/1.11 demodaposteriori = 0
% 0.71/1.11 ordereqreflfact = 0
% 0.71/1.11
% 0.71/1.11 litselect = negord
% 0.71/1.11
% 0.71/1.11 maxweight = 15
% 0.71/1.11 maxdepth = 30000
% 0.71/1.11 maxlength = 115
% 0.71/1.11 maxnrvars = 195
% 0.71/1.11 excuselevel = 1
% 0.71/1.11 increasemaxweight = 1
% 0.71/1.11
% 0.71/1.11 maxselected = 10000000
% 0.71/1.11 maxnrclauses = 10000000
% 0.71/1.11
% 0.71/1.11 showgenerated = 0
% 0.71/1.11 showkept = 0
% 0.71/1.11 showselected = 0
% 0.71/1.11 showdeleted = 0
% 0.71/1.11 showresimp = 1
% 0.71/1.11 showstatus = 2000
% 0.71/1.11
% 0.71/1.11 prologoutput = 0
% 0.71/1.11 nrgoals = 5000000
% 0.71/1.11 totalproof = 1
% 0.71/1.11
% 0.71/1.11 Symbols occurring in the translation:
% 0.71/1.11
% 0.71/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.11 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.11 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.71/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 join [37, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.11 complement [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.11 meet [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.11 composition [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.11 one [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.11 converse [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.11 top [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.11 zero [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.11 alpha1 [46, 2] (w:1, o:48, a:1, s:1, b:1),
% 0.71/1.11 skol1 [47, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.71/1.11 skol2 [48, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Starting Search:
% 0.71/1.11
% 0.71/1.11 *** allocated 15000 integers for clauses
% 0.71/1.11
% 0.71/1.11 Bliksems!, er is een bewijs:
% 0.71/1.11 % SZS status Theorem
% 0.71/1.11 % SZS output start Refutation
% 0.71/1.11
% 0.71/1.11 (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X }.
% 0.71/1.11 (8) {G0,W10,D4,L1,V2,M1} I { join( converse( X ), converse( Y ) ) ==>
% 0.71/1.11 converse( join( X, Y ) ) }.
% 0.71/1.11 (13) {G1,W10,D4,L2,V0,M2} I;d(8) { alpha1( skol1, skol2 ), converse( join(
% 0.71/1.11 skol1, skol2 ) ) ==> converse( skol2 ) }.
% 0.71/1.11 (14) {G0,W8,D3,L2,V0,M2} I { alpha1( skol1, skol2 ), ! join( skol1, skol2 )
% 0.71/1.11 ==> skol2 }.
% 0.71/1.11 (15) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), join( X, Y ) ==> Y }.
% 0.71/1.11 (16) {G1,W3,D2,L1,V2,M1} I;d(8);d(15);q { ! alpha1( X, Y ) }.
% 0.71/1.11 (19) {G2,W5,D3,L1,V0,M1} S(14);r(16) { ! join( skol1, skol2 ) ==> skol2 }.
% 0.71/1.11 (115) {G2,W7,D4,L1,V0,M1} S(13);r(16) { converse( join( skol1, skol2 ) )
% 0.71/1.11 ==> converse( skol2 ) }.
% 0.71/1.11 (122) {G3,W5,D3,L1,V0,M1} P(115,7);d(7) { join( skol1, skol2 ) ==> skol2
% 0.71/1.11 }.
% 0.71/1.11 (123) {G4,W0,D0,L0,V0,M0} S(122);r(19) { }.
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 % SZS output end Refutation
% 0.71/1.11 found a proof!
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Unprocessed initial clauses:
% 0.71/1.11
% 0.71/1.11 (125) {G0,W7,D3,L1,V2,M1} { join( X, Y ) = join( Y, X ) }.
% 0.71/1.11 (126) {G0,W11,D4,L1,V3,M1} { join( X, join( Y, Z ) ) = join( join( X, Y )
% 0.71/1.11 , Z ) }.
% 0.71/1.11 (127) {G0,W14,D6,L1,V2,M1} { X = join( complement( join( complement( X ),
% 0.71/1.11 complement( Y ) ) ), complement( join( complement( X ), Y ) ) ) }.
% 0.71/1.11 (128) {G0,W10,D5,L1,V2,M1} { meet( X, Y ) = complement( join( complement(
% 0.71/1.11 X ), complement( Y ) ) ) }.
% 0.71/1.11 (129) {G0,W11,D4,L1,V3,M1} { composition( X, composition( Y, Z ) ) =
% 0.71/1.11 composition( composition( X, Y ), Z ) }.
% 0.71/1.11 (130) {G0,W5,D3,L1,V1,M1} { composition( X, one ) = X }.
% 0.71/1.11 (131) {G0,W13,D4,L1,V3,M1} { composition( join( X, Y ), Z ) = join(
% 0.71/1.11 composition( X, Z ), composition( Y, Z ) ) }.
% 0.71/1.11 (132) {G0,W5,D4,L1,V1,M1} { converse( converse( X ) ) = X }.
% 0.71/1.11 (133) {G0,W10,D4,L1,V2,M1} { converse( join( X, Y ) ) = join( converse( X
% 0.71/1.11 ), converse( Y ) ) }.
% 0.71/1.11 (134) {G0,W10,D4,L1,V2,M1} { converse( composition( X, Y ) ) = composition
% 0.71/1.11 ( converse( Y ), converse( X ) ) }.
% 0.71/1.11 (135) {G0,W13,D6,L1,V2,M1} { join( composition( converse( X ), complement
% 0.71/1.11 ( composition( X, Y ) ) ), complement( Y ) ) = complement( Y ) }.
% 0.71/1.11 (136) {G0,W6,D4,L1,V1,M1} { top = join( X, complement( X ) ) }.
% 0.71/1.11 (137) {G0,W6,D4,L1,V1,M1} { zero = meet( X, complement( X ) ) }.
% 0.71/1.11 (138) {G0,W11,D4,L2,V0,M2} { alpha1( skol1, skol2 ), join( converse( skol1
% 0.71/1.11 ), converse( skol2 ) ) = converse( skol2 ) }.
% 0.71/1.11 (139) {G0,W8,D3,L2,V0,M2} { alpha1( skol1, skol2 ), ! join( skol1, skol2 )
% 0.71/1.11 = skol2 }.
% 0.71/1.11 (140) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), join( X, Y ) = Y }.
% 0.71/1.11 (141) {G0,W11,D4,L2,V2,M2} { ! alpha1( X, Y ), ! join( converse( X ),
% 0.71/1.11 converse( Y ) ) = converse( Y ) }.
% 0.71/1.11 (142) {G0,W16,D4,L3,V2,M3} { ! join( X, Y ) = Y, join( converse( X ),
% 0.71/1.11 converse( Y ) ) = converse( Y ), alpha1( X, Y ) }.
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Total Proof:
% 0.71/1.11
% 0.71/1.11 subsumption: (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X
% 0.71/1.11 }.
% 0.71/1.11 parent0: (132) {G0,W5,D4,L1,V1,M1} { converse( converse( X ) ) = X }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 eqswap: (157) {G0,W10,D4,L1,V2,M1} { join( converse( X ), converse( Y ) )
% 0.71/1.11 = converse( join( X, Y ) ) }.
% 0.71/1.11 parent0[0]: (133) {G0,W10,D4,L1,V2,M1} { converse( join( X, Y ) ) = join(
% 0.71/1.11 converse( X ), converse( Y ) ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (8) {G0,W10,D4,L1,V2,M1} I { join( converse( X ), converse( Y
% 0.71/1.11 ) ) ==> converse( join( X, Y ) ) }.
% 0.71/1.11 parent0: (157) {G0,W10,D4,L1,V2,M1} { join( converse( X ), converse( Y ) )
% 0.71/1.11 = converse( join( X, Y ) ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 *** allocated 22500 integers for clauses
% 0.71/1.11 paramod: (187) {G1,W10,D4,L2,V0,M2} { converse( join( skol1, skol2 ) ) =
% 0.71/1.11 converse( skol2 ), alpha1( skol1, skol2 ) }.
% 0.71/1.11 parent0[0]: (8) {G0,W10,D4,L1,V2,M1} I { join( converse( X ), converse( Y )
% 0.71/1.11 ) ==> converse( join( X, Y ) ) }.
% 0.71/1.11 parent1[1; 1]: (138) {G0,W11,D4,L2,V0,M2} { alpha1( skol1, skol2 ), join(
% 0.71/1.11 converse( skol1 ), converse( skol2 ) ) = converse( skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := skol1
% 0.71/1.11 Y := skol2
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (13) {G1,W10,D4,L2,V0,M2} I;d(8) { alpha1( skol1, skol2 ),
% 0.71/1.11 converse( join( skol1, skol2 ) ) ==> converse( skol2 ) }.
% 0.71/1.11 parent0: (187) {G1,W10,D4,L2,V0,M2} { converse( join( skol1, skol2 ) ) =
% 0.71/1.11 converse( skol2 ), alpha1( skol1, skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 1
% 0.71/1.11 1 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (14) {G0,W8,D3,L2,V0,M2} I { alpha1( skol1, skol2 ), ! join(
% 0.71/1.11 skol1, skol2 ) ==> skol2 }.
% 0.71/1.11 parent0: (139) {G0,W8,D3,L2,V0,M2} { alpha1( skol1, skol2 ), ! join( skol1
% 0.71/1.11 , skol2 ) = skol2 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 1 ==> 1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (15) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), join( X, Y )
% 0.71/1.11 ==> Y }.
% 0.71/1.11 parent0: (140) {G0,W8,D3,L2,V2,M2} { ! alpha1( X, Y ), join( X, Y ) = Y
% 0.71/1.11 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 1 ==> 1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 paramod: (282) {G1,W10,D4,L2,V2,M2} { ! converse( join( X, Y ) ) =
% 0.71/1.11 converse( Y ), ! alpha1( X, Y ) }.
% 0.71/1.11 parent0[0]: (8) {G0,W10,D4,L1,V2,M1} I { join( converse( X ), converse( Y )
% 0.71/1.11 ) ==> converse( join( X, Y ) ) }.
% 0.71/1.11 parent1[1; 2]: (141) {G0,W11,D4,L2,V2,M2} { ! alpha1( X, Y ), ! join(
% 0.71/1.11 converse( X ), converse( Y ) ) = converse( Y ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 paramod: (283) {G1,W11,D3,L3,V2,M3} { ! converse( Y ) = converse( Y ), !
% 0.71/1.11 alpha1( X, Y ), ! alpha1( X, Y ) }.
% 0.71/1.11 parent0[1]: (15) {G0,W8,D3,L2,V2,M2} I { ! alpha1( X, Y ), join( X, Y ) ==>
% 0.71/1.11 Y }.
% 0.71/1.11 parent1[0; 3]: (282) {G1,W10,D4,L2,V2,M2} { ! converse( join( X, Y ) ) =
% 0.71/1.11 converse( Y ), ! alpha1( X, Y ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 factor: (284) {G1,W8,D3,L2,V2,M2} { ! converse( X ) = converse( X ), !
% 0.71/1.11 alpha1( Y, X ) }.
% 0.71/1.11 parent0[1, 2]: (283) {G1,W11,D3,L3,V2,M3} { ! converse( Y ) = converse( Y
% 0.71/1.11 ), ! alpha1( X, Y ), ! alpha1( X, Y ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := Y
% 0.71/1.11 Y := X
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 eqrefl: (285) {G0,W3,D2,L1,V2,M1} { ! alpha1( Y, X ) }.
% 0.71/1.11 parent0[0]: (284) {G1,W8,D3,L2,V2,M2} { ! converse( X ) = converse( X ), !
% 0.71/1.11 alpha1( Y, X ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (16) {G1,W3,D2,L1,V2,M1} I;d(8);d(15);q { ! alpha1( X, Y ) }.
% 0.71/1.11 parent0: (285) {G0,W3,D2,L1,V2,M1} { ! alpha1( Y, X ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := Y
% 0.71/1.11 Y := X
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 resolution: (287) {G1,W5,D3,L1,V0,M1} { ! join( skol1, skol2 ) ==> skol2
% 0.71/1.11 }.
% 0.71/1.11 parent0[0]: (16) {G1,W3,D2,L1,V2,M1} I;d(8);d(15);q { ! alpha1( X, Y ) }.
% 0.71/1.11 parent1[0]: (14) {G0,W8,D3,L2,V0,M2} I { alpha1( skol1, skol2 ), ! join(
% 0.71/1.11 skol1, skol2 ) ==> skol2 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := skol1
% 0.71/1.11 Y := skol2
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (19) {G2,W5,D3,L1,V0,M1} S(14);r(16) { ! join( skol1, skol2 )
% 0.71/1.11 ==> skol2 }.
% 0.71/1.11 parent0: (287) {G1,W5,D3,L1,V0,M1} { ! join( skol1, skol2 ) ==> skol2 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 resolution: (290) {G2,W7,D4,L1,V0,M1} { converse( join( skol1, skol2 ) )
% 0.71/1.11 ==> converse( skol2 ) }.
% 0.71/1.11 parent0[0]: (16) {G1,W3,D2,L1,V2,M1} I;d(8);d(15);q { ! alpha1( X, Y ) }.
% 0.71/1.11 parent1[0]: (13) {G1,W10,D4,L2,V0,M2} I;d(8) { alpha1( skol1, skol2 ),
% 0.71/1.11 converse( join( skol1, skol2 ) ) ==> converse( skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := skol1
% 0.71/1.11 Y := skol2
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (115) {G2,W7,D4,L1,V0,M1} S(13);r(16) { converse( join( skol1
% 0.71/1.11 , skol2 ) ) ==> converse( skol2 ) }.
% 0.71/1.11 parent0: (290) {G2,W7,D4,L1,V0,M1} { converse( join( skol1, skol2 ) ) ==>
% 0.71/1.11 converse( skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 eqswap: (293) {G0,W5,D4,L1,V1,M1} { X ==> converse( converse( X ) ) }.
% 0.71/1.11 parent0[0]: (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 paramod: (295) {G1,W7,D4,L1,V0,M1} { join( skol1, skol2 ) ==> converse(
% 0.71/1.11 converse( skol2 ) ) }.
% 0.71/1.11 parent0[0]: (115) {G2,W7,D4,L1,V0,M1} S(13);r(16) { converse( join( skol1,
% 0.71/1.11 skol2 ) ) ==> converse( skol2 ) }.
% 0.71/1.11 parent1[0; 5]: (293) {G0,W5,D4,L1,V1,M1} { X ==> converse( converse( X ) )
% 0.71/1.11 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 X := join( skol1, skol2 )
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 paramod: (296) {G1,W5,D3,L1,V0,M1} { join( skol1, skol2 ) ==> skol2 }.
% 0.71/1.11 parent0[0]: (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X }.
% 0.71/1.11 parent1[0; 4]: (295) {G1,W7,D4,L1,V0,M1} { join( skol1, skol2 ) ==>
% 0.71/1.11 converse( converse( skol2 ) ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := skol2
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (122) {G3,W5,D3,L1,V0,M1} P(115,7);d(7) { join( skol1, skol2 )
% 0.71/1.11 ==> skol2 }.
% 0.71/1.11 parent0: (296) {G1,W5,D3,L1,V0,M1} { join( skol1, skol2 ) ==> skol2 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 resolution: (300) {G3,W0,D0,L0,V0,M0} { }.
% 0.71/1.11 parent0[0]: (19) {G2,W5,D3,L1,V0,M1} S(14);r(16) { ! join( skol1, skol2 )
% 0.71/1.11 ==> skol2 }.
% 0.71/1.11 parent1[0]: (122) {G3,W5,D3,L1,V0,M1} P(115,7);d(7) { join( skol1, skol2 )
% 0.71/1.11 ==> skol2 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (123) {G4,W0,D0,L0,V0,M0} S(122);r(19) { }.
% 0.71/1.11 parent0: (300) {G3,W0,D0,L0,V0,M0} { }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 Proof check complete!
% 0.71/1.11
% 0.71/1.11 Memory use:
% 0.71/1.11
% 0.71/1.11 space for terms: 1769
% 0.71/1.11 space for clauses: 13926
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 clauses generated: 442
% 0.71/1.11 clauses kept: 124
% 0.71/1.11 clauses selected: 37
% 0.71/1.11 clauses deleted: 6
% 0.71/1.11 clauses inuse deleted: 0
% 0.71/1.11
% 0.71/1.11 subsentry: 607
% 0.71/1.11 literals s-matched: 291
% 0.71/1.11 literals matched: 291
% 0.71/1.11 full subsumption: 0
% 0.71/1.11
% 0.71/1.11 checksum: 1347854115
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Bliksem ended
%------------------------------------------------------------------------------