TSTP Solution File: SEU162+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU162+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n006.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 : Tue Jul 19 07:11:03 EDT 2022
% Result : Theorem 0.43s 1.03s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU162+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n006.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 : Sun Jun 19 05:05:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.03 *** allocated 10000 integers for termspace/termends
% 0.43/1.03 *** allocated 10000 integers for clauses
% 0.43/1.03 *** allocated 10000 integers for justifications
% 0.43/1.03 Bliksem 1.12
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Automatic Strategy Selection
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Clauses:
% 0.43/1.03
% 0.43/1.03 { ! in( X, Y ), ! in( Y, X ) }.
% 0.43/1.03 { && }.
% 0.43/1.03 { && }.
% 0.43/1.03 { ! disjoint( singleton( X ), Y ), ! in( X, Y ) }.
% 0.43/1.03 { in( X, Y ), disjoint( singleton( X ), Y ) }.
% 0.43/1.03 { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 0.43/1.03 { alpha1( skol1, skol2 ), ! in( skol2, skol1 ) }.
% 0.43/1.03 { alpha1( skol1, skol2 ), ! set_difference( skol1, singleton( skol2 ) ) =
% 0.43/1.03 skol1 }.
% 0.43/1.03 { ! alpha1( X, Y ), set_difference( X, singleton( Y ) ) = X }.
% 0.43/1.03 { ! alpha1( X, Y ), in( Y, X ) }.
% 0.43/1.03 { ! set_difference( X, singleton( Y ) ) = X, ! in( Y, X ), alpha1( X, Y ) }
% 0.43/1.03 .
% 0.43/1.03 { ! disjoint( X, Y ), set_difference( X, Y ) = X }.
% 0.43/1.03 { ! set_difference( X, Y ) = X, disjoint( X, Y ) }.
% 0.43/1.03
% 0.43/1.03 percentage equality = 0.208333, percentage horn = 0.916667
% 0.43/1.03 This is a problem with some equality
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Options Used:
% 0.43/1.03
% 0.43/1.03 useres = 1
% 0.43/1.03 useparamod = 1
% 0.43/1.03 useeqrefl = 1
% 0.43/1.03 useeqfact = 1
% 0.43/1.03 usefactor = 1
% 0.43/1.03 usesimpsplitting = 0
% 0.43/1.03 usesimpdemod = 5
% 0.43/1.03 usesimpres = 3
% 0.43/1.03
% 0.43/1.03 resimpinuse = 1000
% 0.43/1.03 resimpclauses = 20000
% 0.43/1.03 substype = eqrewr
% 0.43/1.03 backwardsubs = 1
% 0.43/1.03 selectoldest = 5
% 0.43/1.03
% 0.43/1.03 litorderings [0] = split
% 0.43/1.03 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.03
% 0.43/1.03 termordering = kbo
% 0.43/1.03
% 0.43/1.03 litapriori = 0
% 0.43/1.03 termapriori = 1
% 0.43/1.03 litaposteriori = 0
% 0.43/1.03 termaposteriori = 0
% 0.43/1.03 demodaposteriori = 0
% 0.43/1.03 ordereqreflfact = 0
% 0.43/1.03
% 0.43/1.03 litselect = negord
% 0.43/1.03
% 0.43/1.03 maxweight = 15
% 0.43/1.03 maxdepth = 30000
% 0.43/1.03 maxlength = 115
% 0.43/1.03 maxnrvars = 195
% 0.43/1.03 excuselevel = 1
% 0.43/1.03 increasemaxweight = 1
% 0.43/1.03
% 0.43/1.03 maxselected = 10000000
% 0.43/1.03 maxnrclauses = 10000000
% 0.43/1.03
% 0.43/1.03 showgenerated = 0
% 0.43/1.03 showkept = 0
% 0.43/1.03 showselected = 0
% 0.43/1.03 showdeleted = 0
% 0.43/1.03 showresimp = 1
% 0.43/1.03 showstatus = 2000
% 0.43/1.03
% 0.43/1.03 prologoutput = 0
% 0.43/1.03 nrgoals = 5000000
% 0.43/1.03 totalproof = 1
% 0.43/1.03
% 0.43/1.03 Symbols occurring in the translation:
% 0.43/1.03
% 0.43/1.03 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.03 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.43/1.03 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.43/1.03 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.43/1.03 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.03 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.03 in [37, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.43/1.03 singleton [38, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.43/1.03 disjoint [39, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.43/1.03 set_difference [40, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.43/1.03 alpha1 [41, 2] (w:1, o:43, a:1, s:1, b:1),
% 0.43/1.03 skol1 [42, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.43/1.03 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Starting Search:
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Bliksems!, er is een bewijs:
% 0.43/1.03 % SZS status Theorem
% 0.43/1.03 % SZS output start Refutation
% 0.43/1.03
% 0.43/1.03 (2) {G0,W7,D3,L2,V2,M2} I { ! disjoint( singleton( X ), Y ), ! in( X, Y )
% 0.43/1.03 }.
% 0.43/1.03 (3) {G0,W7,D3,L2,V2,M2} I { in( X, Y ), disjoint( singleton( X ), Y ) }.
% 0.43/1.03 (4) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 0.43/1.03 (5) {G0,W6,D2,L2,V0,M2} I { alpha1( skol1, skol2 ), ! in( skol2, skol1 )
% 0.43/1.03 }.
% 0.43/1.03 (6) {G0,W9,D4,L2,V0,M2} I { alpha1( skol1, skol2 ), ! set_difference( skol1
% 0.43/1.03 , singleton( skol2 ) ) ==> skol1 }.
% 0.43/1.03 (7) {G0,W9,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference( X, singleton
% 0.43/1.03 ( Y ) ) ==> X }.
% 0.43/1.03 (8) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), in( Y, X ) }.
% 0.43/1.03 (10) {G0,W8,D3,L2,V2,M2} I { ! disjoint( X, Y ), set_difference( X, Y ) ==>
% 0.43/1.03 X }.
% 0.43/1.03 (11) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==> X, disjoint( X, Y
% 0.43/1.03 ) }.
% 0.43/1.03 (21) {G1,W7,D3,L2,V2,M2} R(2,4) { ! in( X, Y ), ! disjoint( Y, singleton( X
% 0.43/1.03 ) ) }.
% 0.43/1.03 (30) {G2,W7,D3,L2,V2,M2} R(21,8) { ! disjoint( X, singleton( Y ) ), !
% 0.43/1.03 alpha1( X, Y ) }.
% 0.43/1.03 (31) {G3,W4,D3,L1,V0,M1} R(30,6);d(10);q { ! disjoint( skol1, singleton(
% 0.43/1.03 skol2 ) ) }.
% 0.43/1.03 (33) {G4,W4,D3,L1,V0,M1} R(31,4) { ! disjoint( singleton( skol2 ), skol1 )
% 0.43/1.03 }.
% 0.43/1.03 (34) {G5,W3,D2,L1,V0,M1} R(33,3) { in( skol2, skol1 ) }.
% 0.43/1.03 (35) {G6,W6,D4,L1,V0,M1} R(7,5);r(34) { set_difference( skol1, singleton(
% 0.43/1.03 skol2 ) ) ==> skol1 }.
% 0.43/1.03 (55) {G7,W0,D0,L0,V0,M0} R(11,35);r(31) { }.
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 % SZS output end Refutation
% 0.43/1.03 found a proof!
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Unprocessed initial clauses:
% 0.43/1.03
% 0.43/1.03 (57) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.43/1.03 (58) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.03 (59) {G0,W1,D1,L1,V0,M1} { && }.
% 0.43/1.03 (60) {G0,W7,D3,L2,V2,M2} { ! disjoint( singleton( X ), Y ), ! in( X, Y )
% 0.43/1.03 }.
% 0.43/1.03 (61) {G0,W7,D3,L2,V2,M2} { in( X, Y ), disjoint( singleton( X ), Y ) }.
% 0.43/1.03 (62) {G0,W6,D2,L2,V2,M2} { ! disjoint( X, Y ), disjoint( Y, X ) }.
% 0.43/1.03 (63) {G0,W6,D2,L2,V0,M2} { alpha1( skol1, skol2 ), ! in( skol2, skol1 )
% 0.43/1.03 }.
% 0.43/1.03 (64) {G0,W9,D4,L2,V0,M2} { alpha1( skol1, skol2 ), ! set_difference( skol1
% 0.43/1.03 , singleton( skol2 ) ) = skol1 }.
% 0.43/1.03 (65) {G0,W9,D4,L2,V2,M2} { ! alpha1( X, Y ), set_difference( X, singleton
% 0.43/1.03 ( Y ) ) = X }.
% 0.43/1.03 (66) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), in( Y, X ) }.
% 0.43/1.03 (67) {G0,W12,D4,L3,V2,M3} { ! set_difference( X, singleton( Y ) ) = X, !
% 0.43/1.03 in( Y, X ), alpha1( X, Y ) }.
% 0.43/1.03 (68) {G0,W8,D3,L2,V2,M2} { ! disjoint( X, Y ), set_difference( X, Y ) = X
% 0.43/1.03 }.
% 0.43/1.03 (69) {G0,W8,D3,L2,V2,M2} { ! set_difference( X, Y ) = X, disjoint( X, Y )
% 0.43/1.03 }.
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Total Proof:
% 0.43/1.03
% 0.43/1.03 subsumption: (2) {G0,W7,D3,L2,V2,M2} I { ! disjoint( singleton( X ), Y ), !
% 0.43/1.03 in( X, Y ) }.
% 0.43/1.03 parent0: (60) {G0,W7,D3,L2,V2,M2} { ! disjoint( singleton( X ), Y ), ! in
% 0.43/1.03 ( X, Y ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (3) {G0,W7,D3,L2,V2,M2} I { in( X, Y ), disjoint( singleton( X
% 0.43/1.03 ), Y ) }.
% 0.43/1.03 parent0: (61) {G0,W7,D3,L2,V2,M2} { in( X, Y ), disjoint( singleton( X ),
% 0.43/1.03 Y ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (4) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), disjoint( Y, X
% 0.43/1.03 ) }.
% 0.43/1.03 parent0: (62) {G0,W6,D2,L2,V2,M2} { ! disjoint( X, Y ), disjoint( Y, X )
% 0.43/1.03 }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (5) {G0,W6,D2,L2,V0,M2} I { alpha1( skol1, skol2 ), ! in(
% 0.43/1.03 skol2, skol1 ) }.
% 0.43/1.03 parent0: (63) {G0,W6,D2,L2,V0,M2} { alpha1( skol1, skol2 ), ! in( skol2,
% 0.43/1.03 skol1 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (6) {G0,W9,D4,L2,V0,M2} I { alpha1( skol1, skol2 ), !
% 0.43/1.03 set_difference( skol1, singleton( skol2 ) ) ==> skol1 }.
% 0.43/1.03 parent0: (64) {G0,W9,D4,L2,V0,M2} { alpha1( skol1, skol2 ), !
% 0.43/1.03 set_difference( skol1, singleton( skol2 ) ) = skol1 }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (7) {G0,W9,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference(
% 0.43/1.03 X, singleton( Y ) ) ==> X }.
% 0.43/1.03 parent0: (65) {G0,W9,D4,L2,V2,M2} { ! alpha1( X, Y ), set_difference( X,
% 0.43/1.03 singleton( Y ) ) = X }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (8) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), in( Y, X ) }.
% 0.43/1.03 parent0: (66) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), in( Y, X ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (10) {G0,W8,D3,L2,V2,M2} I { ! disjoint( X, Y ),
% 0.43/1.03 set_difference( X, Y ) ==> X }.
% 0.43/1.03 parent0: (68) {G0,W8,D3,L2,V2,M2} { ! disjoint( X, Y ), set_difference( X
% 0.43/1.03 , Y ) = X }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (11) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==> X,
% 0.43/1.03 disjoint( X, Y ) }.
% 0.43/1.03 parent0: (69) {G0,W8,D3,L2,V2,M2} { ! set_difference( X, Y ) = X, disjoint
% 0.43/1.03 ( X, Y ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (93) {G1,W7,D3,L2,V2,M2} { ! in( X, Y ), ! disjoint( Y,
% 0.43/1.03 singleton( X ) ) }.
% 0.43/1.03 parent0[0]: (2) {G0,W7,D3,L2,V2,M2} I { ! disjoint( singleton( X ), Y ), !
% 0.43/1.03 in( X, Y ) }.
% 0.43/1.03 parent1[1]: (4) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), disjoint( Y, X
% 0.43/1.03 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 X := Y
% 0.43/1.03 Y := singleton( X )
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (21) {G1,W7,D3,L2,V2,M2} R(2,4) { ! in( X, Y ), ! disjoint( Y
% 0.43/1.03 , singleton( X ) ) }.
% 0.43/1.03 parent0: (93) {G1,W7,D3,L2,V2,M2} { ! in( X, Y ), ! disjoint( Y, singleton
% 0.43/1.03 ( X ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (94) {G1,W7,D3,L2,V2,M2} { ! disjoint( Y, singleton( X ) ), !
% 0.43/1.03 alpha1( Y, X ) }.
% 0.43/1.03 parent0[0]: (21) {G1,W7,D3,L2,V2,M2} R(2,4) { ! in( X, Y ), ! disjoint( Y,
% 0.43/1.03 singleton( X ) ) }.
% 0.43/1.03 parent1[1]: (8) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), in( Y, X ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 X := Y
% 0.43/1.03 Y := X
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (30) {G2,W7,D3,L2,V2,M2} R(21,8) { ! disjoint( X, singleton( Y
% 0.43/1.03 ) ), ! alpha1( X, Y ) }.
% 0.43/1.03 parent0: (94) {G1,W7,D3,L2,V2,M2} { ! disjoint( Y, singleton( X ) ), !
% 0.43/1.03 alpha1( Y, X ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := Y
% 0.43/1.03 Y := X
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 1 ==> 1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 eqswap: (95) {G0,W9,D4,L2,V0,M2} { ! skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ), alpha1( skol1, skol2 ) }.
% 0.43/1.03 parent0[1]: (6) {G0,W9,D4,L2,V0,M2} I { alpha1( skol1, skol2 ), !
% 0.43/1.03 set_difference( skol1, singleton( skol2 ) ) ==> skol1 }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (97) {G1,W10,D4,L2,V0,M2} { ! disjoint( skol1, singleton(
% 0.43/1.03 skol2 ) ), ! skol1 ==> set_difference( skol1, singleton( skol2 ) ) }.
% 0.43/1.03 parent0[1]: (30) {G2,W7,D3,L2,V2,M2} R(21,8) { ! disjoint( X, singleton( Y
% 0.43/1.03 ) ), ! alpha1( X, Y ) }.
% 0.43/1.03 parent1[1]: (95) {G0,W9,D4,L2,V0,M2} { ! skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ), alpha1( skol1, skol2 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := skol1
% 0.43/1.03 Y := skol2
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 paramod: (98) {G1,W11,D3,L3,V0,M3} { ! skol1 ==> skol1, ! disjoint( skol1
% 0.43/1.03 , singleton( skol2 ) ), ! disjoint( skol1, singleton( skol2 ) ) }.
% 0.43/1.03 parent0[1]: (10) {G0,W8,D3,L2,V2,M2} I { ! disjoint( X, Y ), set_difference
% 0.43/1.03 ( X, Y ) ==> X }.
% 0.43/1.03 parent1[1; 3]: (97) {G1,W10,D4,L2,V0,M2} { ! disjoint( skol1, singleton(
% 0.43/1.03 skol2 ) ), ! skol1 ==> set_difference( skol1, singleton( skol2 ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := skol1
% 0.43/1.03 Y := singleton( skol2 )
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 factor: (99) {G1,W7,D3,L2,V0,M2} { ! skol1 ==> skol1, ! disjoint( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 parent0[1, 2]: (98) {G1,W11,D3,L3,V0,M3} { ! skol1 ==> skol1, ! disjoint(
% 0.43/1.03 skol1, singleton( skol2 ) ), ! disjoint( skol1, singleton( skol2 ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 eqrefl: (100) {G0,W4,D3,L1,V0,M1} { ! disjoint( skol1, singleton( skol2 )
% 0.43/1.03 ) }.
% 0.43/1.03 parent0[0]: (99) {G1,W7,D3,L2,V0,M2} { ! skol1 ==> skol1, ! disjoint(
% 0.43/1.03 skol1, singleton( skol2 ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (31) {G3,W4,D3,L1,V0,M1} R(30,6);d(10);q { ! disjoint( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 parent0: (100) {G0,W4,D3,L1,V0,M1} { ! disjoint( skol1, singleton( skol2 )
% 0.43/1.03 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (101) {G1,W4,D3,L1,V0,M1} { ! disjoint( singleton( skol2 ),
% 0.43/1.03 skol1 ) }.
% 0.43/1.03 parent0[0]: (31) {G3,W4,D3,L1,V0,M1} R(30,6);d(10);q { ! disjoint( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 parent1[1]: (4) {G0,W6,D2,L2,V2,M2} I { ! disjoint( X, Y ), disjoint( Y, X
% 0.43/1.03 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 X := singleton( skol2 )
% 0.43/1.03 Y := skol1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (33) {G4,W4,D3,L1,V0,M1} R(31,4) { ! disjoint( singleton(
% 0.43/1.03 skol2 ), skol1 ) }.
% 0.43/1.03 parent0: (101) {G1,W4,D3,L1,V0,M1} { ! disjoint( singleton( skol2 ), skol1
% 0.43/1.03 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (102) {G1,W3,D2,L1,V0,M1} { in( skol2, skol1 ) }.
% 0.43/1.03 parent0[0]: (33) {G4,W4,D3,L1,V0,M1} R(31,4) { ! disjoint( singleton( skol2
% 0.43/1.03 ), skol1 ) }.
% 0.43/1.03 parent1[1]: (3) {G0,W7,D3,L2,V2,M2} I { in( X, Y ), disjoint( singleton( X
% 0.43/1.03 ), Y ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 X := skol2
% 0.43/1.03 Y := skol1
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (34) {G5,W3,D2,L1,V0,M1} R(33,3) { in( skol2, skol1 ) }.
% 0.43/1.03 parent0: (102) {G1,W3,D2,L1,V0,M1} { in( skol2, skol1 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 eqswap: (103) {G0,W9,D4,L2,V2,M2} { X ==> set_difference( X, singleton( Y
% 0.43/1.03 ) ), ! alpha1( X, Y ) }.
% 0.43/1.03 parent0[1]: (7) {G0,W9,D4,L2,V2,M2} I { ! alpha1( X, Y ), set_difference( X
% 0.43/1.03 , singleton( Y ) ) ==> X }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (104) {G1,W9,D4,L2,V0,M2} { skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ), ! in( skol2, skol1 ) }.
% 0.43/1.03 parent0[1]: (103) {G0,W9,D4,L2,V2,M2} { X ==> set_difference( X, singleton
% 0.43/1.03 ( Y ) ), ! alpha1( X, Y ) }.
% 0.43/1.03 parent1[0]: (5) {G0,W6,D2,L2,V0,M2} I { alpha1( skol1, skol2 ), ! in( skol2
% 0.43/1.03 , skol1 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := skol1
% 0.43/1.03 Y := skol2
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (105) {G2,W6,D4,L1,V0,M1} { skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 parent0[1]: (104) {G1,W9,D4,L2,V0,M2} { skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ), ! in( skol2, skol1 ) }.
% 0.43/1.03 parent1[0]: (34) {G5,W3,D2,L1,V0,M1} R(33,3) { in( skol2, skol1 ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 eqswap: (106) {G2,W6,D4,L1,V0,M1} { set_difference( skol1, singleton(
% 0.43/1.03 skol2 ) ) ==> skol1 }.
% 0.43/1.03 parent0[0]: (105) {G2,W6,D4,L1,V0,M1} { skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (35) {G6,W6,D4,L1,V0,M1} R(7,5);r(34) { set_difference( skol1
% 0.43/1.03 , singleton( skol2 ) ) ==> skol1 }.
% 0.43/1.03 parent0: (106) {G2,W6,D4,L1,V0,M1} { set_difference( skol1, singleton(
% 0.43/1.03 skol2 ) ) ==> skol1 }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 0 ==> 0
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 eqswap: (107) {G0,W8,D3,L2,V2,M2} { ! X ==> set_difference( X, Y ),
% 0.43/1.03 disjoint( X, Y ) }.
% 0.43/1.03 parent0[0]: (11) {G0,W8,D3,L2,V2,M2} I { ! set_difference( X, Y ) ==> X,
% 0.43/1.03 disjoint( X, Y ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := X
% 0.43/1.03 Y := Y
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 eqswap: (108) {G6,W6,D4,L1,V0,M1} { skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 parent0[0]: (35) {G6,W6,D4,L1,V0,M1} R(7,5);r(34) { set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ) ==> skol1 }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (109) {G1,W4,D3,L1,V0,M1} { disjoint( skol1, singleton( skol2
% 0.43/1.03 ) ) }.
% 0.43/1.03 parent0[0]: (107) {G0,W8,D3,L2,V2,M2} { ! X ==> set_difference( X, Y ),
% 0.43/1.03 disjoint( X, Y ) }.
% 0.43/1.03 parent1[0]: (108) {G6,W6,D4,L1,V0,M1} { skol1 ==> set_difference( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 X := skol1
% 0.43/1.03 Y := singleton( skol2 )
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 resolution: (110) {G2,W0,D0,L0,V0,M0} { }.
% 0.43/1.03 parent0[0]: (31) {G3,W4,D3,L1,V0,M1} R(30,6);d(10);q { ! disjoint( skol1,
% 0.43/1.03 singleton( skol2 ) ) }.
% 0.43/1.03 parent1[0]: (109) {G1,W4,D3,L1,V0,M1} { disjoint( skol1, singleton( skol2
% 0.43/1.03 ) ) }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 substitution1:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 subsumption: (55) {G7,W0,D0,L0,V0,M0} R(11,35);r(31) { }.
% 0.43/1.03 parent0: (110) {G2,W0,D0,L0,V0,M0} { }.
% 0.43/1.03 substitution0:
% 0.43/1.03 end
% 0.43/1.03 permutation0:
% 0.43/1.03 end
% 0.43/1.03
% 0.43/1.03 Proof check complete!
% 0.43/1.03
% 0.43/1.03 Memory use:
% 0.43/1.03
% 0.43/1.03 space for terms: 640
% 0.43/1.03 space for clauses: 3288
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 clauses generated: 177
% 0.43/1.03 clauses kept: 56
% 0.43/1.03 clauses selected: 36
% 0.43/1.03 clauses deleted: 0
% 0.43/1.03 clauses inuse deleted: 0
% 0.43/1.03
% 0.43/1.03 subsentry: 273
% 0.43/1.03 literals s-matched: 185
% 0.43/1.03 literals matched: 185
% 0.43/1.03 full subsumption: 7
% 0.43/1.03
% 0.43/1.03 checksum: 2008079956
% 0.43/1.03
% 0.43/1.03
% 0.43/1.03 Bliksem ended
%------------------------------------------------------------------------------