TSTP Solution File: REL014+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : REL014+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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 19:00:06 EDT 2022
% Result : Theorem 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : REL014+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.34 % Computer : n027.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 : Fri Jul 8 11:34:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { join( X, Y ) = join( Y, X ) }.
% 0.69/1.10 { join( X, join( Y, Z ) ) = join( join( X, Y ), Z ) }.
% 0.69/1.10 { X = join( complement( join( complement( X ), complement( Y ) ) ),
% 0.69/1.10 complement( join( complement( X ), Y ) ) ) }.
% 0.69/1.10 { meet( X, Y ) = complement( join( complement( X ), complement( Y ) ) ) }.
% 0.69/1.10 { composition( X, composition( Y, Z ) ) = composition( composition( X, Y )
% 0.69/1.10 , Z ) }.
% 0.69/1.10 { composition( X, one ) = X }.
% 0.69/1.10 { composition( join( X, Y ), Z ) = join( composition( X, Z ), composition(
% 0.69/1.10 Y, Z ) ) }.
% 0.69/1.10 { converse( converse( X ) ) = X }.
% 0.69/1.10 { converse( join( X, Y ) ) = join( converse( X ), converse( Y ) ) }.
% 0.69/1.10 { converse( composition( X, Y ) ) = composition( converse( Y ), converse( X
% 0.69/1.10 ) ) }.
% 0.69/1.10 { join( composition( converse( X ), complement( composition( X, Y ) ) ),
% 0.69/1.10 complement( Y ) ) = complement( Y ) }.
% 0.69/1.10 { top = join( X, complement( X ) ) }.
% 0.69/1.10 { zero = meet( X, complement( X ) ) }.
% 0.69/1.10 { ! composition( skol1, one ) = skol1, ! composition( one, skol1 ) = skol1
% 0.69/1.10 }.
% 0.69/1.10
% 0.69/1.10 percentage equality = 1.000000, percentage horn = 1.000000
% 0.69/1.10 This is a pure equality problem
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 1
% 0.69/1.10 useeqrefl = 1
% 0.69/1.10 useeqfact = 1
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 5
% 0.69/1.10 usesimpres = 3
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = eqrewr
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.10
% 0.69/1.10 termordering = kbo
% 0.69/1.10
% 0.69/1.10 litapriori = 0
% 0.69/1.10 termapriori = 1
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negord
% 0.69/1.10
% 0.69/1.10 maxweight = 15
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 1
% 0.69/1.10 increasemaxweight = 1
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 0
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 join [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.69/1.10 complement [39, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.69/1.10 meet [40, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.69/1.10 composition [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.10 one [42, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.69/1.10 converse [43, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.10 top [44, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.69/1.10 zero [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.10 skol1 [46, 0] (w:1, o:10, a:1, s:1, b:1).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10 *** allocated 15000 integers for clauses
% 0.69/1.10 *** allocated 22500 integers for clauses
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Theorem
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 (5) {G0,W5,D3,L1,V1,M1} I { composition( X, one ) ==> X }.
% 0.69/1.10 (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X }.
% 0.69/1.10 (9) {G0,W10,D4,L1,V2,M1} I { composition( converse( Y ), converse( X ) )
% 0.69/1.10 ==> converse( composition( X, Y ) ) }.
% 0.69/1.10 (13) {G1,W5,D3,L1,V0,M1} I;d(5);q { ! composition( one, skol1 ) ==> skol1
% 0.69/1.10 }.
% 0.69/1.10 (16) {G1,W10,D5,L1,V2,M1} P(7,9) { converse( composition( converse( X ), Y
% 0.69/1.10 ) ) ==> composition( converse( Y ), X ) }.
% 0.69/1.10 (162) {G2,W6,D4,L1,V1,M1} P(5,16);d(7) { composition( converse( one ), X )
% 0.69/1.10 ==> X }.
% 0.69/1.10 (168) {G3,W4,D3,L1,V0,M1} P(162,5) { converse( one ) ==> one }.
% 0.69/1.10 (169) {G4,W5,D3,L1,V1,M1} P(168,162) { composition( one, X ) ==> X }.
% 0.69/1.10 (173) {G5,W0,D0,L0,V0,M0} R(169,13) { }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Unprocessed initial clauses:
% 0.69/1.10
% 0.69/1.10 (175) {G0,W7,D3,L1,V2,M1} { join( X, Y ) = join( Y, X ) }.
% 0.69/1.10 (176) {G0,W11,D4,L1,V3,M1} { join( X, join( Y, Z ) ) = join( join( X, Y )
% 0.69/1.10 , Z ) }.
% 0.69/1.10 (177) {G0,W14,D6,L1,V2,M1} { X = join( complement( join( complement( X ),
% 0.69/1.10 complement( Y ) ) ), complement( join( complement( X ), Y ) ) ) }.
% 0.69/1.10 (178) {G0,W10,D5,L1,V2,M1} { meet( X, Y ) = complement( join( complement(
% 0.69/1.10 X ), complement( Y ) ) ) }.
% 0.69/1.10 (179) {G0,W11,D4,L1,V3,M1} { composition( X, composition( Y, Z ) ) =
% 0.69/1.10 composition( composition( X, Y ), Z ) }.
% 0.69/1.10 (180) {G0,W5,D3,L1,V1,M1} { composition( X, one ) = X }.
% 0.69/1.10 (181) {G0,W13,D4,L1,V3,M1} { composition( join( X, Y ), Z ) = join(
% 0.69/1.10 composition( X, Z ), composition( Y, Z ) ) }.
% 0.69/1.10 (182) {G0,W5,D4,L1,V1,M1} { converse( converse( X ) ) = X }.
% 0.69/1.10 (183) {G0,W10,D4,L1,V2,M1} { converse( join( X, Y ) ) = join( converse( X
% 0.69/1.10 ), converse( Y ) ) }.
% 0.69/1.10 (184) {G0,W10,D4,L1,V2,M1} { converse( composition( X, Y ) ) = composition
% 0.69/1.10 ( converse( Y ), converse( X ) ) }.
% 0.69/1.10 (185) {G0,W13,D6,L1,V2,M1} { join( composition( converse( X ), complement
% 0.69/1.10 ( composition( X, Y ) ) ), complement( Y ) ) = complement( Y ) }.
% 0.69/1.10 (186) {G0,W6,D4,L1,V1,M1} { top = join( X, complement( X ) ) }.
% 0.69/1.10 (187) {G0,W6,D4,L1,V1,M1} { zero = meet( X, complement( X ) ) }.
% 0.69/1.10 (188) {G0,W10,D3,L2,V0,M2} { ! composition( skol1, one ) = skol1, !
% 0.69/1.10 composition( one, skol1 ) = skol1 }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Total Proof:
% 0.69/1.10
% 0.69/1.10 subsumption: (5) {G0,W5,D3,L1,V1,M1} I { composition( X, one ) ==> X }.
% 0.69/1.10 parent0: (180) {G0,W5,D3,L1,V1,M1} { composition( X, one ) = X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X
% 0.69/1.10 }.
% 0.69/1.10 parent0: (182) {G0,W5,D4,L1,V1,M1} { converse( converse( X ) ) = X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (209) {G0,W10,D4,L1,V2,M1} { composition( converse( Y ), converse
% 0.69/1.10 ( X ) ) = converse( composition( X, Y ) ) }.
% 0.69/1.10 parent0[0]: (184) {G0,W10,D4,L1,V2,M1} { converse( composition( X, Y ) ) =
% 0.69/1.10 composition( converse( Y ), converse( X ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (9) {G0,W10,D4,L1,V2,M1} I { composition( converse( Y ),
% 0.69/1.10 converse( X ) ) ==> converse( composition( X, Y ) ) }.
% 0.69/1.10 parent0: (209) {G0,W10,D4,L1,V2,M1} { composition( converse( Y ), converse
% 0.69/1.10 ( X ) ) = converse( composition( X, Y ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (241) {G1,W8,D3,L2,V0,M2} { ! skol1 = skol1, ! composition( one,
% 0.69/1.10 skol1 ) = skol1 }.
% 0.69/1.10 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { composition( X, one ) ==> X }.
% 0.69/1.10 parent1[0; 2]: (188) {G0,W10,D3,L2,V0,M2} { ! composition( skol1, one ) =
% 0.69/1.10 skol1, ! composition( one, skol1 ) = skol1 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := skol1
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqrefl: (242) {G0,W5,D3,L1,V0,M1} { ! composition( one, skol1 ) = skol1
% 0.69/1.10 }.
% 0.69/1.10 parent0[0]: (241) {G1,W8,D3,L2,V0,M2} { ! skol1 = skol1, ! composition(
% 0.69/1.10 one, skol1 ) = skol1 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (13) {G1,W5,D3,L1,V0,M1} I;d(5);q { ! composition( one, skol1
% 0.69/1.10 ) ==> skol1 }.
% 0.69/1.10 parent0: (242) {G0,W5,D3,L1,V0,M1} { ! composition( one, skol1 ) = skol1
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (245) {G0,W10,D4,L1,V2,M1} { converse( composition( Y, X ) ) ==>
% 0.69/1.10 composition( converse( X ), converse( Y ) ) }.
% 0.69/1.10 parent0[0]: (9) {G0,W10,D4,L1,V2,M1} I { composition( converse( Y ),
% 0.69/1.10 converse( X ) ) ==> converse( composition( X, Y ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := Y
% 0.69/1.10 Y := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (247) {G1,W10,D5,L1,V2,M1} { converse( composition( converse( X )
% 0.69/1.10 , Y ) ) ==> composition( converse( Y ), X ) }.
% 0.69/1.10 parent0[0]: (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X }.
% 0.69/1.10 parent1[0; 9]: (245) {G0,W10,D4,L1,V2,M1} { converse( composition( Y, X )
% 0.69/1.10 ) ==> composition( converse( X ), converse( Y ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := Y
% 0.69/1.10 Y := converse( X )
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (16) {G1,W10,D5,L1,V2,M1} P(7,9) { converse( composition(
% 0.69/1.10 converse( X ), Y ) ) ==> composition( converse( Y ), X ) }.
% 0.69/1.10 parent0: (247) {G1,W10,D5,L1,V2,M1} { converse( composition( converse( X )
% 0.69/1.10 , Y ) ) ==> composition( converse( Y ), X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (251) {G1,W10,D5,L1,V2,M1} { composition( converse( Y ), X ) ==>
% 0.69/1.10 converse( composition( converse( X ), Y ) ) }.
% 0.69/1.10 parent0[0]: (16) {G1,W10,D5,L1,V2,M1} P(7,9) { converse( composition(
% 0.69/1.10 converse( X ), Y ) ) ==> composition( converse( Y ), X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (254) {G1,W8,D4,L1,V1,M1} { composition( converse( one ), X ) ==>
% 0.69/1.10 converse( converse( X ) ) }.
% 0.69/1.10 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { composition( X, one ) ==> X }.
% 0.69/1.10 parent1[0; 6]: (251) {G1,W10,D5,L1,V2,M1} { composition( converse( Y ), X
% 0.69/1.10 ) ==> converse( composition( converse( X ), Y ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := converse( X )
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := X
% 0.69/1.10 Y := one
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (255) {G1,W6,D4,L1,V1,M1} { composition( converse( one ), X ) ==>
% 0.69/1.10 X }.
% 0.69/1.10 parent0[0]: (7) {G0,W5,D4,L1,V1,M1} I { converse( converse( X ) ) ==> X }.
% 0.69/1.10 parent1[0; 5]: (254) {G1,W8,D4,L1,V1,M1} { composition( converse( one ), X
% 0.69/1.10 ) ==> converse( converse( X ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (162) {G2,W6,D4,L1,V1,M1} P(5,16);d(7) { composition( converse
% 0.69/1.10 ( one ), X ) ==> X }.
% 0.69/1.10 parent0: (255) {G1,W6,D4,L1,V1,M1} { composition( converse( one ), X ) ==>
% 0.69/1.10 X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (257) {G2,W6,D4,L1,V1,M1} { X ==> composition( converse( one ), X
% 0.69/1.10 ) }.
% 0.69/1.10 parent0[0]: (162) {G2,W6,D4,L1,V1,M1} P(5,16);d(7) { composition( converse
% 0.69/1.10 ( one ), X ) ==> X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (259) {G1,W4,D3,L1,V0,M1} { one ==> converse( one ) }.
% 0.69/1.10 parent0[0]: (5) {G0,W5,D3,L1,V1,M1} I { composition( X, one ) ==> X }.
% 0.69/1.10 parent1[0; 2]: (257) {G2,W6,D4,L1,V1,M1} { X ==> composition( converse(
% 0.69/1.10 one ), X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := converse( one )
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := one
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (260) {G1,W4,D3,L1,V0,M1} { converse( one ) ==> one }.
% 0.69/1.10 parent0[0]: (259) {G1,W4,D3,L1,V0,M1} { one ==> converse( one ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (168) {G3,W4,D3,L1,V0,M1} P(162,5) { converse( one ) ==> one
% 0.69/1.10 }.
% 0.69/1.10 parent0: (260) {G1,W4,D3,L1,V0,M1} { converse( one ) ==> one }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (262) {G2,W6,D4,L1,V1,M1} { X ==> composition( converse( one ), X
% 0.69/1.10 ) }.
% 0.69/1.10 parent0[0]: (162) {G2,W6,D4,L1,V1,M1} P(5,16);d(7) { composition( converse
% 0.69/1.10 ( one ), X ) ==> X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (263) {G3,W5,D3,L1,V1,M1} { X ==> composition( one, X ) }.
% 0.69/1.10 parent0[0]: (168) {G3,W4,D3,L1,V0,M1} P(162,5) { converse( one ) ==> one
% 0.69/1.10 }.
% 0.69/1.10 parent1[0; 3]: (262) {G2,W6,D4,L1,V1,M1} { X ==> composition( converse(
% 0.69/1.10 one ), X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (264) {G3,W5,D3,L1,V1,M1} { composition( one, X ) ==> X }.
% 0.69/1.10 parent0[0]: (263) {G3,W5,D3,L1,V1,M1} { X ==> composition( one, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (169) {G4,W5,D3,L1,V1,M1} P(168,162) { composition( one, X )
% 0.69/1.10 ==> X }.
% 0.69/1.10 parent0: (264) {G3,W5,D3,L1,V1,M1} { composition( one, X ) ==> X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (265) {G4,W5,D3,L1,V1,M1} { X ==> composition( one, X ) }.
% 0.69/1.10 parent0[0]: (169) {G4,W5,D3,L1,V1,M1} P(168,162) { composition( one, X )
% 0.69/1.10 ==> X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (266) {G1,W5,D3,L1,V0,M1} { ! skol1 ==> composition( one, skol1 )
% 0.69/1.10 }.
% 0.69/1.10 parent0[0]: (13) {G1,W5,D3,L1,V0,M1} I;d(5);q { ! composition( one, skol1 )
% 0.69/1.10 ==> skol1 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (267) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 parent0[0]: (266) {G1,W5,D3,L1,V0,M1} { ! skol1 ==> composition( one,
% 0.69/1.10 skol1 ) }.
% 0.69/1.10 parent1[0]: (265) {G4,W5,D3,L1,V1,M1} { X ==> composition( one, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := skol1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (173) {G5,W0,D0,L0,V0,M0} R(169,13) { }.
% 0.69/1.10 parent0: (267) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 Proof check complete!
% 0.69/1.10
% 0.69/1.10 Memory use:
% 0.69/1.10
% 0.69/1.10 space for terms: 2345
% 0.69/1.10 space for clauses: 20260
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 clauses generated: 660
% 0.69/1.10 clauses kept: 174
% 0.69/1.10 clauses selected: 47
% 0.69/1.10 clauses deleted: 2
% 0.69/1.10 clauses inuse deleted: 0
% 0.69/1.10
% 0.69/1.10 subsentry: 365
% 0.69/1.10 literals s-matched: 196
% 0.69/1.10 literals matched: 196
% 0.69/1.10 full subsumption: 0
% 0.69/1.10
% 0.69/1.10 checksum: -2097825835
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksem ended
%------------------------------------------------------------------------------