TSTP Solution File: SET924+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET924+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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:23 EDT 2022
% Result : Theorem 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET924+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n024.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 15:35:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.70/1.10 *** allocated 10000 integers for termspace/termends
% 0.70/1.10 *** allocated 10000 integers for clauses
% 0.70/1.10 *** allocated 10000 integers for justifications
% 0.70/1.10 Bliksem 1.12
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Automatic Strategy Selection
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Clauses:
% 0.70/1.10
% 0.70/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.70/1.10 { empty( skol1 ) }.
% 0.70/1.10 { ! empty( skol2 ) }.
% 0.70/1.10 { alpha1( skol3, skol4 ), ! in( skol3, skol4 ) }.
% 0.70/1.10 { alpha1( skol3, skol4 ), ! set_difference( singleton( skol3 ), skol4 ) =
% 0.70/1.10 singleton( skol3 ) }.
% 0.70/1.10 { ! alpha1( X, Y ), set_difference( singleton( X ), Y ) = singleton( X ) }
% 0.70/1.10 .
% 0.70/1.10 { ! alpha1( X, Y ), in( X, Y ) }.
% 0.70/1.10 { ! set_difference( singleton( X ), Y ) = singleton( X ), ! in( X, Y ),
% 0.70/1.10 alpha1( X, Y ) }.
% 0.70/1.10 { ! set_difference( singleton( X ), Y ) = singleton( X ), ! in( X, Y ) }.
% 0.70/1.10 { in( X, Y ), set_difference( singleton( X ), Y ) = singleton( X ) }.
% 0.70/1.10
% 0.70/1.10 percentage equality = 0.263158, percentage horn = 0.900000
% 0.70/1.10 This is a problem with some equality
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Options Used:
% 0.70/1.10
% 0.70/1.10 useres = 1
% 0.70/1.10 useparamod = 1
% 0.70/1.10 useeqrefl = 1
% 0.70/1.10 useeqfact = 1
% 0.70/1.10 usefactor = 1
% 0.70/1.10 usesimpsplitting = 0
% 0.70/1.10 usesimpdemod = 5
% 0.70/1.10 usesimpres = 3
% 0.70/1.10
% 0.70/1.10 resimpinuse = 1000
% 0.70/1.10 resimpclauses = 20000
% 0.70/1.10 substype = eqrewr
% 0.70/1.10 backwardsubs = 1
% 0.70/1.10 selectoldest = 5
% 0.70/1.10
% 0.70/1.10 litorderings [0] = split
% 0.70/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.10
% 0.70/1.10 termordering = kbo
% 0.70/1.10
% 0.70/1.10 litapriori = 0
% 0.70/1.10 termapriori = 1
% 0.70/1.10 litaposteriori = 0
% 0.70/1.10 termaposteriori = 0
% 0.70/1.10 demodaposteriori = 0
% 0.70/1.10 ordereqreflfact = 0
% 0.70/1.10
% 0.70/1.10 litselect = negord
% 0.70/1.10
% 0.70/1.10 maxweight = 15
% 0.70/1.10 maxdepth = 30000
% 0.70/1.10 maxlength = 115
% 0.70/1.10 maxnrvars = 195
% 0.70/1.10 excuselevel = 1
% 0.70/1.10 increasemaxweight = 1
% 0.70/1.10
% 0.70/1.10 maxselected = 10000000
% 0.70/1.10 maxnrclauses = 10000000
% 0.70/1.10
% 0.70/1.10 showgenerated = 0
% 0.70/1.10 showkept = 0
% 0.70/1.10 showselected = 0
% 0.70/1.10 showdeleted = 0
% 0.70/1.10 showresimp = 1
% 0.70/1.10 showstatus = 2000
% 0.70/1.10
% 0.70/1.10 prologoutput = 0
% 0.70/1.10 nrgoals = 5000000
% 0.70/1.10 totalproof = 1
% 0.70/1.10
% 0.70/1.10 Symbols occurring in the translation:
% 0.70/1.10
% 0.70/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.10 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.70/1.10 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.70/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.10 in [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.70/1.10 empty [38, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.70/1.10 singleton [39, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.70/1.10 set_difference [40, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.70/1.10 alpha1 [41, 2] (w:1, o:45, a:1, s:1, b:1),
% 0.70/1.10 skol1 [42, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.70/1.10 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.70/1.10 skol3 [44, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.70/1.10 skol4 [45, 0] (w:1, o:11, a:1, s:1, b:1).
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Starting Search:
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksems!, er is een bewijs:
% 0.70/1.10 % SZS status Theorem
% 0.70/1.10 % SZS output start Refutation
% 0.70/1.10
% 0.70/1.10 (3) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), ! in( skol3, skol4 )
% 0.70/1.10 }.
% 0.70/1.10 (4) {G0,W10,D4,L2,V0,M2} I { alpha1( skol3, skol4 ), ! set_difference(
% 0.70/1.10 singleton( skol3 ), skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 (5) {G0,W10,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference( singleton( X
% 0.70/1.10 ), Y ) ==> singleton( X ) }.
% 0.70/1.10 (6) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), in( X, Y ) }.
% 0.70/1.10 (8) {G0,W10,D4,L2,V2,M2} I { ! set_difference( singleton( X ), Y ) ==>
% 0.70/1.10 singleton( X ), ! in( X, Y ) }.
% 0.70/1.10 (9) {G0,W10,D4,L2,V2,M2} I { in( X, Y ), set_difference( singleton( X ), Y
% 0.70/1.10 ) ==> singleton( X ) }.
% 0.70/1.10 (14) {G1,W3,D2,L1,V0,M1} R(9,3);r(4) { alpha1( skol3, skol4 ) }.
% 0.70/1.10 (20) {G2,W3,D2,L1,V0,M1} R(14,6) { in( skol3, skol4 ) }.
% 0.70/1.10 (22) {G2,W7,D4,L1,V0,M1} R(5,14) { set_difference( singleton( skol3 ),
% 0.70/1.10 skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 (24) {G3,W0,D0,L0,V0,M0} R(8,22);r(20) { }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 % SZS output end Refutation
% 0.70/1.10 found a proof!
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Unprocessed initial clauses:
% 0.70/1.10
% 0.70/1.10 (26) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.70/1.10 (27) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.70/1.10 (28) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.70/1.10 (29) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), ! in( skol3, skol4 )
% 0.70/1.10 }.
% 0.70/1.10 (30) {G0,W10,D4,L2,V0,M2} { alpha1( skol3, skol4 ), ! set_difference(
% 0.70/1.10 singleton( skol3 ), skol4 ) = singleton( skol3 ) }.
% 0.70/1.10 (31) {G0,W10,D4,L2,V2,M2} { ! alpha1( X, Y ), set_difference( singleton( X
% 0.70/1.10 ), Y ) = singleton( X ) }.
% 0.70/1.10 (32) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), in( X, Y ) }.
% 0.70/1.10 (33) {G0,W13,D4,L3,V2,M3} { ! set_difference( singleton( X ), Y ) =
% 0.70/1.10 singleton( X ), ! in( X, Y ), alpha1( X, Y ) }.
% 0.70/1.10 (34) {G0,W10,D4,L2,V2,M2} { ! set_difference( singleton( X ), Y ) =
% 0.70/1.10 singleton( X ), ! in( X, Y ) }.
% 0.70/1.10 (35) {G0,W10,D4,L2,V2,M2} { in( X, Y ), set_difference( singleton( X ), Y
% 0.70/1.10 ) = singleton( X ) }.
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Total Proof:
% 0.70/1.10
% 0.70/1.10 subsumption: (3) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), ! in(
% 0.70/1.10 skol3, skol4 ) }.
% 0.70/1.10 parent0: (29) {G0,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), ! in( skol3,
% 0.70/1.10 skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (4) {G0,W10,D4,L2,V0,M2} I { alpha1( skol3, skol4 ), !
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 parent0: (30) {G0,W10,D4,L2,V0,M2} { alpha1( skol3, skol4 ), !
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ) = singleton( skol3 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (5) {G0,W10,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference
% 0.70/1.10 ( singleton( X ), Y ) ==> singleton( X ) }.
% 0.70/1.10 parent0: (31) {G0,W10,D4,L2,V2,M2} { ! alpha1( X, Y ), set_difference(
% 0.70/1.10 singleton( X ), Y ) = singleton( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (6) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), in( X, Y ) }.
% 0.70/1.10 parent0: (32) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), in( X, Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (8) {G0,W10,D4,L2,V2,M2} I { ! set_difference( singleton( X )
% 0.70/1.10 , Y ) ==> singleton( X ), ! in( X, Y ) }.
% 0.70/1.10 parent0: (34) {G0,W10,D4,L2,V2,M2} { ! set_difference( singleton( X ), Y )
% 0.70/1.10 = singleton( X ), ! in( X, Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (9) {G0,W10,D4,L2,V2,M2} I { in( X, Y ), set_difference(
% 0.70/1.10 singleton( X ), Y ) ==> singleton( X ) }.
% 0.70/1.10 parent0: (35) {G0,W10,D4,L2,V2,M2} { in( X, Y ), set_difference( singleton
% 0.70/1.10 ( X ), Y ) = singleton( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 1 ==> 1
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (56) {G0,W10,D4,L2,V2,M2} { singleton( X ) ==> set_difference(
% 0.70/1.10 singleton( X ), Y ), in( X, Y ) }.
% 0.70/1.10 parent0[1]: (9) {G0,W10,D4,L2,V2,M2} I { in( X, Y ), set_difference(
% 0.70/1.10 singleton( X ), Y ) ==> singleton( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (57) {G0,W10,D4,L2,V0,M2} { ! singleton( skol3 ) ==>
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ), alpha1( skol3, skol4 ) }.
% 0.70/1.10 parent0[1]: (4) {G0,W10,D4,L2,V0,M2} I { alpha1( skol3, skol4 ), !
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (58) {G1,W10,D4,L2,V0,M2} { alpha1( skol3, skol4 ), singleton
% 0.70/1.10 ( skol3 ) ==> set_difference( singleton( skol3 ), skol4 ) }.
% 0.70/1.10 parent0[1]: (3) {G0,W6,D2,L2,V0,M2} I { alpha1( skol3, skol4 ), ! in( skol3
% 0.70/1.10 , skol4 ) }.
% 0.70/1.10 parent1[1]: (56) {G0,W10,D4,L2,V2,M2} { singleton( X ) ==> set_difference
% 0.70/1.10 ( singleton( X ), Y ), in( X, Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 X := skol3
% 0.70/1.10 Y := skol4
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (59) {G1,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), alpha1(
% 0.70/1.10 skol3, skol4 ) }.
% 0.70/1.10 parent0[0]: (57) {G0,W10,D4,L2,V0,M2} { ! singleton( skol3 ) ==>
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ), alpha1( skol3, skol4 ) }.
% 0.70/1.10 parent1[1]: (58) {G1,W10,D4,L2,V0,M2} { alpha1( skol3, skol4 ), singleton
% 0.70/1.10 ( skol3 ) ==> set_difference( singleton( skol3 ), skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 factor: (60) {G1,W3,D2,L1,V0,M1} { alpha1( skol3, skol4 ) }.
% 0.70/1.10 parent0[0, 1]: (59) {G1,W6,D2,L2,V0,M2} { alpha1( skol3, skol4 ), alpha1(
% 0.70/1.10 skol3, skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (14) {G1,W3,D2,L1,V0,M1} R(9,3);r(4) { alpha1( skol3, skol4 )
% 0.70/1.10 }.
% 0.70/1.10 parent0: (60) {G1,W3,D2,L1,V0,M1} { alpha1( skol3, skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (61) {G1,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.70/1.10 parent0[0]: (6) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), in( X, Y ) }.
% 0.70/1.10 parent1[0]: (14) {G1,W3,D2,L1,V0,M1} R(9,3);r(4) { alpha1( skol3, skol4 )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := skol3
% 0.70/1.10 Y := skol4
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (20) {G2,W3,D2,L1,V0,M1} R(14,6) { in( skol3, skol4 ) }.
% 0.70/1.10 parent0: (61) {G1,W3,D2,L1,V0,M1} { in( skol3, skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (62) {G0,W10,D4,L2,V2,M2} { singleton( X ) ==> set_difference(
% 0.70/1.10 singleton( X ), Y ), ! alpha1( X, Y ) }.
% 0.70/1.10 parent0[1]: (5) {G0,W10,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference(
% 0.70/1.10 singleton( X ), Y ) ==> singleton( X ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (63) {G1,W7,D4,L1,V0,M1} { singleton( skol3 ) ==>
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ) }.
% 0.70/1.10 parent0[1]: (62) {G0,W10,D4,L2,V2,M2} { singleton( X ) ==> set_difference
% 0.70/1.10 ( singleton( X ), Y ), ! alpha1( X, Y ) }.
% 0.70/1.10 parent1[0]: (14) {G1,W3,D2,L1,V0,M1} R(9,3);r(4) { alpha1( skol3, skol4 )
% 0.70/1.10 }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := skol3
% 0.70/1.10 Y := skol4
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (64) {G1,W7,D4,L1,V0,M1} { set_difference( singleton( skol3 ),
% 0.70/1.10 skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 parent0[0]: (63) {G1,W7,D4,L1,V0,M1} { singleton( skol3 ) ==>
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (22) {G2,W7,D4,L1,V0,M1} R(5,14) { set_difference( singleton(
% 0.70/1.10 skol3 ), skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 parent0: (64) {G1,W7,D4,L1,V0,M1} { set_difference( singleton( skol3 ),
% 0.70/1.10 skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 0 ==> 0
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (65) {G0,W10,D4,L2,V2,M2} { ! singleton( X ) ==> set_difference(
% 0.70/1.10 singleton( X ), Y ), ! in( X, Y ) }.
% 0.70/1.10 parent0[0]: (8) {G0,W10,D4,L2,V2,M2} I { ! set_difference( singleton( X ),
% 0.70/1.10 Y ) ==> singleton( X ), ! in( X, Y ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := X
% 0.70/1.10 Y := Y
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 eqswap: (66) {G2,W7,D4,L1,V0,M1} { singleton( skol3 ) ==> set_difference(
% 0.70/1.10 singleton( skol3 ), skol4 ) }.
% 0.70/1.10 parent0[0]: (22) {G2,W7,D4,L1,V0,M1} R(5,14) { set_difference( singleton(
% 0.70/1.10 skol3 ), skol4 ) ==> singleton( skol3 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (67) {G1,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.70/1.10 parent0[0]: (65) {G0,W10,D4,L2,V2,M2} { ! singleton( X ) ==>
% 0.70/1.10 set_difference( singleton( X ), Y ), ! in( X, Y ) }.
% 0.70/1.10 parent1[0]: (66) {G2,W7,D4,L1,V0,M1} { singleton( skol3 ) ==>
% 0.70/1.10 set_difference( singleton( skol3 ), skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 X := skol3
% 0.70/1.10 Y := skol4
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 resolution: (68) {G2,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 parent0[0]: (67) {G1,W3,D2,L1,V0,M1} { ! in( skol3, skol4 ) }.
% 0.70/1.10 parent1[0]: (20) {G2,W3,D2,L1,V0,M1} R(14,6) { in( skol3, skol4 ) }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 substitution1:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 subsumption: (24) {G3,W0,D0,L0,V0,M0} R(8,22);r(20) { }.
% 0.70/1.10 parent0: (68) {G2,W0,D0,L0,V0,M0} { }.
% 0.70/1.10 substitution0:
% 0.70/1.10 end
% 0.70/1.10 permutation0:
% 0.70/1.10 end
% 0.70/1.10
% 0.70/1.10 Proof check complete!
% 0.70/1.10
% 0.70/1.10 Memory use:
% 0.70/1.10
% 0.70/1.10 space for terms: 351
% 0.70/1.10 space for clauses: 1493
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 clauses generated: 100
% 0.70/1.10 clauses kept: 25
% 0.70/1.10 clauses selected: 21
% 0.70/1.10 clauses deleted: 2
% 0.70/1.10 clauses inuse deleted: 0
% 0.70/1.10
% 0.70/1.10 subsentry: 150
% 0.70/1.10 literals s-matched: 83
% 0.70/1.10 literals matched: 83
% 0.70/1.10 full subsumption: 2
% 0.70/1.10
% 0.70/1.10 checksum: 2520050
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 Bliksem ended
%------------------------------------------------------------------------------