TSTP Solution File: SET930+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET930+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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:27 EDT 2022
% Result : Theorem 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET930+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n009.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 : Sat Jul 9 21:19:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10
% 0.71/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.10 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.71/1.10 { empty( empty_set ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( X, Y ), Z ) = singleton( X ), ! in( X,
% 0.71/1.10 Z ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( X, Y ), Z ) = singleton( X ), alpha1( X
% 0.71/1.10 , Y, Z ) }.
% 0.71/1.10 { in( X, Z ), ! alpha1( X, Y, Z ), set_difference( unordered_pair( X, Y ),
% 0.71/1.10 Z ) = singleton( X ) }.
% 0.71/1.10 { ! alpha1( X, Y, Z ), in( Y, Z ), X = Y }.
% 0.71/1.10 { ! in( Y, Z ), alpha1( X, Y, Z ) }.
% 0.71/1.10 { ! X = Y, alpha1( X, Y, Z ) }.
% 0.71/1.10 { empty( skol1 ) }.
% 0.71/1.10 { ! empty( skol2 ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( X, Y ), Z ) = unordered_pair( X, Y ), !
% 0.71/1.10 in( X, Z ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( X, Y ), Z ) = unordered_pair( X, Y ), !
% 0.71/1.10 in( Y, Z ) }.
% 0.71/1.10 { in( X, Z ), in( Y, Z ), set_difference( unordered_pair( X, Y ), Z ) =
% 0.71/1.10 unordered_pair( X, Y ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( X, Y ), Z ) = empty_set, in( X, Z ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( X, Y ), Z ) = empty_set, in( Y, Z ) }.
% 0.71/1.10 { ! in( X, Z ), ! in( Y, Z ), set_difference( unordered_pair( X, Y ), Z ) =
% 0.71/1.10 empty_set }.
% 0.71/1.10 { ! set_difference( unordered_pair( skol3, skol4 ), skol5 ) = empty_set }.
% 0.71/1.10 { ! set_difference( unordered_pair( skol3, skol4 ), skol5 ) = singleton(
% 0.71/1.10 skol3 ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( skol3, skol4 ), skol5 ) = singleton(
% 0.71/1.10 skol4 ) }.
% 0.71/1.10 { ! set_difference( unordered_pair( skol3, skol4 ), skol5 ) =
% 0.71/1.10 unordered_pair( skol3, skol4 ) }.
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.421053, percentage horn = 0.857143
% 0.71/1.10 This is a problem with some equality
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 1
% 0.71/1.10 useeqrefl = 1
% 0.71/1.10 useeqfact = 1
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 5
% 0.71/1.10 usesimpres = 3
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = eqrewr
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.10
% 0.71/1.10 termordering = kbo
% 0.71/1.10
% 0.71/1.10 litapriori = 0
% 0.71/1.10 termapriori = 1
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negord
% 0.71/1.10
% 0.71/1.10 maxweight = 15
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 1
% 0.71/1.10 increasemaxweight = 1
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 0
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 in [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.71/1.10 unordered_pair [38, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.10 empty_set [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.71/1.10 empty [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.10 set_difference [42, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.10 singleton [43, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.10 alpha1 [44, 3] (w:1, o:49, a:1, s:1, b:1),
% 0.71/1.10 skol1 [45, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.71/1.10 skol2 [46, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.71/1.10 skol3 [47, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.71/1.10 skol4 [48, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.71/1.10 skol5 [49, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10 *** allocated 15000 integers for clauses
% 0.71/1.10 *** allocated 22500 integers for clauses
% 0.71/1.10 *** allocated 33750 integers for clauses
% 0.71/1.10 *** allocated 50625 integers for clauses
% 0.71/1.10 *** allocated 15000 integers for termspace/termends
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Theorem
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 (1) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.71/1.10 }.
% 0.71/1.10 (5) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), ! alpha1( X, Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> singleton( X ) }.
% 0.71/1.10 (7) {G0,W7,D2,L2,V3,M2} I { ! in( Y, Z ), alpha1( X, Y, Z ) }.
% 0.71/1.10 (13) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), in( Y, Z ), set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ) ==> unordered_pair( X, Y ) }.
% 0.71/1.10 (16) {G0,W13,D4,L3,V3,M3} I { ! in( X, Z ), ! in( Y, Z ), set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ) ==> empty_set }.
% 0.71/1.10 (17) {G0,W7,D4,L1,V0,M1} I { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) ==> empty_set }.
% 0.71/1.10 (18) {G0,W8,D4,L1,V0,M1} I { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) ==> singleton( skol3 ) }.
% 0.71/1.10 (19) {G0,W8,D4,L1,V0,M1} I { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 (20) {G0,W9,D4,L1,V0,M1} I { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) ==> unordered_pair( skol3, skol4 ) }.
% 0.71/1.10 (26) {G1,W7,D4,L1,V0,M1} P(1,17) { ! set_difference( unordered_pair( skol4
% 0.71/1.10 , skol3 ), skol5 ) ==> empty_set }.
% 0.71/1.10 (28) {G1,W8,D4,L1,V0,M1} P(1,19) { ! set_difference( unordered_pair( skol4
% 0.71/1.10 , skol3 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 (31) {G1,W9,D4,L1,V0,M1} P(1,20) { ! set_difference( unordered_pair( skol4
% 0.71/1.10 , skol3 ), skol5 ) ==> unordered_pair( skol4, skol3 ) }.
% 0.71/1.10 (32) {G1,W7,D2,L2,V0,M2} R(5,18) { in( skol3, skol5 ), ! alpha1( skol3,
% 0.71/1.10 skol4, skol5 ) }.
% 0.71/1.10 (33) {G2,W7,D2,L2,V0,M2} R(5,28) { in( skol4, skol5 ), ! alpha1( skol4,
% 0.71/1.10 skol3, skol5 ) }.
% 0.71/1.10 (44) {G2,W6,D2,L2,V0,M2} R(32,7) { in( skol3, skol5 ), ! in( skol4, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 (399) {G3,W3,D2,L1,V0,M1} R(13,31);r(44) { in( skol3, skol5 ) }.
% 0.71/1.10 (415) {G4,W4,D2,L1,V1,M1} R(399,7) { alpha1( X, skol3, skol5 ) }.
% 0.71/1.10 (543) {G3,W3,D2,L1,V0,M1} R(16,26);r(44) { ! in( skol4, skol5 ) }.
% 0.71/1.10 (807) {G5,W0,D0,L0,V0,M0} S(33);r(543);r(415) { }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Unprocessed initial clauses:
% 0.71/1.10
% 0.71/1.10 (809) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.71/1.10 (810) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 0.71/1.10 ) }.
% 0.71/1.10 (811) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.71/1.10 (812) {G0,W11,D4,L2,V3,M2} { ! set_difference( unordered_pair( X, Y ), Z )
% 0.71/1.10 = singleton( X ), ! in( X, Z ) }.
% 0.71/1.10 (813) {G0,W12,D4,L2,V3,M2} { ! set_difference( unordered_pair( X, Y ), Z )
% 0.71/1.10 = singleton( X ), alpha1( X, Y, Z ) }.
% 0.71/1.10 (814) {G0,W15,D4,L3,V3,M3} { in( X, Z ), ! alpha1( X, Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) = singleton( X ) }.
% 0.71/1.10 (815) {G0,W10,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), in( Y, Z ), X = Y }.
% 0.71/1.10 (816) {G0,W7,D2,L2,V3,M2} { ! in( Y, Z ), alpha1( X, Y, Z ) }.
% 0.71/1.10 (817) {G0,W7,D2,L2,V3,M2} { ! X = Y, alpha1( X, Y, Z ) }.
% 0.71/1.10 (818) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.71/1.10 (819) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.71/1.10 (820) {G0,W12,D4,L2,V3,M2} { ! set_difference( unordered_pair( X, Y ), Z )
% 0.71/1.10 = unordered_pair( X, Y ), ! in( X, Z ) }.
% 0.71/1.10 (821) {G0,W12,D4,L2,V3,M2} { ! set_difference( unordered_pair( X, Y ), Z )
% 0.71/1.10 = unordered_pair( X, Y ), ! in( Y, Z ) }.
% 0.71/1.10 (822) {G0,W15,D4,L3,V3,M3} { in( X, Z ), in( Y, Z ), set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ) = unordered_pair( X, Y ) }.
% 0.71/1.10 (823) {G0,W10,D4,L2,V3,M2} { ! set_difference( unordered_pair( X, Y ), Z )
% 0.71/1.10 = empty_set, in( X, Z ) }.
% 0.71/1.10 (824) {G0,W10,D4,L2,V3,M2} { ! set_difference( unordered_pair( X, Y ), Z )
% 0.71/1.10 = empty_set, in( Y, Z ) }.
% 0.71/1.10 (825) {G0,W13,D4,L3,V3,M3} { ! in( X, Z ), ! in( Y, Z ), set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ) = empty_set }.
% 0.71/1.10 (826) {G0,W7,D4,L1,V0,M1} { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) = empty_set }.
% 0.71/1.10 (827) {G0,W8,D4,L1,V0,M1} { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) = singleton( skol3 ) }.
% 0.71/1.10 (828) {G0,W8,D4,L1,V0,M1} { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) = singleton( skol4 ) }.
% 0.71/1.10 (829) {G0,W9,D4,L1,V0,M1} { ! set_difference( unordered_pair( skol3, skol4
% 0.71/1.10 ), skol5 ) = unordered_pair( skol3, skol4 ) }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Total Proof:
% 0.71/1.10
% 0.71/1.10 subsumption: (1) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.71/1.10 unordered_pair( Y, X ) }.
% 0.71/1.10 parent0: (810) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) =
% 0.71/1.10 unordered_pair( Y, X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (5) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), ! alpha1( X, Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> singleton( X ) }.
% 0.71/1.10 parent0: (814) {G0,W15,D4,L3,V3,M3} { in( X, Z ), ! alpha1( X, Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) = singleton( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (7) {G0,W7,D2,L2,V3,M2} I { ! in( Y, Z ), alpha1( X, Y, Z )
% 0.71/1.10 }.
% 0.71/1.10 parent0: (816) {G0,W7,D2,L2,V3,M2} { ! in( Y, Z ), alpha1( X, Y, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (13) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), in( Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> unordered_pair( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 parent0: (822) {G0,W15,D4,L3,V3,M3} { in( X, Z ), in( Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) = unordered_pair( X, Y ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (16) {G0,W13,D4,L3,V3,M3} I { ! in( X, Z ), ! in( Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> empty_set }.
% 0.71/1.10 parent0: (825) {G0,W13,D4,L3,V3,M3} { ! in( X, Z ), ! in( Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) = empty_set }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (17) {G0,W7,D4,L1,V0,M1} I { ! set_difference( unordered_pair
% 0.71/1.10 ( skol3, skol4 ), skol5 ) ==> empty_set }.
% 0.71/1.10 parent0: (826) {G0,W7,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) = empty_set }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (18) {G0,W8,D4,L1,V0,M1} I { ! set_difference( unordered_pair
% 0.71/1.10 ( skol3, skol4 ), skol5 ) ==> singleton( skol3 ) }.
% 0.71/1.10 parent0: (827) {G0,W8,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) = singleton( skol3 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (19) {G0,W8,D4,L1,V0,M1} I { ! set_difference( unordered_pair
% 0.71/1.10 ( skol3, skol4 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 parent0: (828) {G0,W8,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) = singleton( skol4 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (20) {G0,W9,D4,L1,V0,M1} I { ! set_difference( unordered_pair
% 0.71/1.10 ( skol3, skol4 ), skol5 ) ==> unordered_pair( skol3, skol4 ) }.
% 0.71/1.10 parent0: (829) {G0,W9,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) = unordered_pair( skol3, skol4 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (941) {G0,W7,D4,L1,V0,M1} { ! empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (17) {G0,W7,D4,L1,V0,M1} I { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) ==> empty_set }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 paramod: (942) {G1,W7,D4,L1,V0,M1} { ! empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (1) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.71/1.10 unordered_pair( Y, X ) }.
% 0.71/1.10 parent1[0; 4]: (941) {G0,W7,D4,L1,V0,M1} { ! empty_set ==> set_difference
% 0.71/1.10 ( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := skol4
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (945) {G1,W7,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol4, skol3 ), skol5 ) ==> empty_set }.
% 0.71/1.10 parent0[0]: (942) {G1,W7,D4,L1,V0,M1} { ! empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (26) {G1,W7,D4,L1,V0,M1} P(1,17) { ! set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) ==> empty_set }.
% 0.71/1.10 parent0: (945) {G1,W7,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol4, skol3 ), skol5 ) ==> empty_set }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (946) {G0,W8,D4,L1,V0,M1} { ! singleton( skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (19) {G0,W8,D4,L1,V0,M1} I { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 paramod: (947) {G1,W8,D4,L1,V0,M1} { ! singleton( skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (1) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.71/1.10 unordered_pair( Y, X ) }.
% 0.71/1.10 parent1[0; 5]: (946) {G0,W8,D4,L1,V0,M1} { ! singleton( skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := skol4
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (950) {G1,W8,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol4, skol3 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 parent0[0]: (947) {G1,W8,D4,L1,V0,M1} { ! singleton( skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (28) {G1,W8,D4,L1,V0,M1} P(1,19) { ! set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 parent0: (950) {G1,W8,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol4, skol3 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (951) {G0,W9,D4,L1,V0,M1} { ! unordered_pair( skol3, skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (20) {G0,W9,D4,L1,V0,M1} I { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) ==> unordered_pair( skol3, skol4 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 paramod: (953) {G1,W9,D4,L1,V0,M1} { ! unordered_pair( skol3, skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (1) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.71/1.10 unordered_pair( Y, X ) }.
% 0.71/1.10 parent1[0; 6]: (951) {G0,W9,D4,L1,V0,M1} { ! unordered_pair( skol3, skol4
% 0.71/1.10 ) ==> set_difference( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := skol4
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 paramod: (954) {G1,W9,D4,L1,V0,M1} { ! unordered_pair( skol4, skol3 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (1) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.71/1.10 unordered_pair( Y, X ) }.
% 0.71/1.10 parent1[0; 2]: (953) {G1,W9,D4,L1,V0,M1} { ! unordered_pair( skol3, skol4
% 0.71/1.10 ) ==> set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := skol4
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (957) {G1,W9,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol4, skol3 ), skol5 ) ==> unordered_pair( skol4, skol3 ) }.
% 0.71/1.10 parent0[0]: (954) {G1,W9,D4,L1,V0,M1} { ! unordered_pair( skol4, skol3 )
% 0.71/1.10 ==> set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (31) {G1,W9,D4,L1,V0,M1} P(1,20) { ! set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) ==> unordered_pair( skol4, skol3
% 0.71/1.10 ) }.
% 0.71/1.10 parent0: (957) {G1,W9,D4,L1,V0,M1} { ! set_difference( unordered_pair(
% 0.71/1.10 skol4, skol3 ), skol5 ) ==> unordered_pair( skol4, skol3 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (960) {G0,W15,D4,L3,V3,M3} { singleton( X ) ==> set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ), in( X, Z ), ! alpha1( X, Y, Z ) }.
% 0.71/1.10 parent0[2]: (5) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), ! alpha1( X, Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> singleton( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (961) {G0,W8,D4,L1,V0,M1} { ! singleton( skol3 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (18) {G0,W8,D4,L1,V0,M1} I { ! set_difference( unordered_pair(
% 0.71/1.10 skol3, skol4 ), skol5 ) ==> singleton( skol3 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (962) {G1,W7,D2,L2,V0,M2} { in( skol3, skol5 ), ! alpha1(
% 0.71/1.10 skol3, skol4, skol5 ) }.
% 0.71/1.10 parent0[0]: (961) {G0,W8,D4,L1,V0,M1} { ! singleton( skol3 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol3, skol4 ), skol5 ) }.
% 0.71/1.10 parent1[0]: (960) {G0,W15,D4,L3,V3,M3} { singleton( X ) ==> set_difference
% 0.71/1.10 ( unordered_pair( X, Y ), Z ), in( X, Z ), ! alpha1( X, Y, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := skol4
% 0.71/1.10 Z := skol5
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (32) {G1,W7,D2,L2,V0,M2} R(5,18) { in( skol3, skol5 ), !
% 0.71/1.10 alpha1( skol3, skol4, skol5 ) }.
% 0.71/1.10 parent0: (962) {G1,W7,D2,L2,V0,M2} { in( skol3, skol5 ), ! alpha1( skol3,
% 0.71/1.10 skol4, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (963) {G0,W15,D4,L3,V3,M3} { singleton( X ) ==> set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ), in( X, Z ), ! alpha1( X, Y, Z ) }.
% 0.71/1.10 parent0[2]: (5) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), ! alpha1( X, Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> singleton( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (964) {G1,W8,D4,L1,V0,M1} { ! singleton( skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (28) {G1,W8,D4,L1,V0,M1} P(1,19) { ! set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) ==> singleton( skol4 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (965) {G1,W7,D2,L2,V0,M2} { in( skol4, skol5 ), ! alpha1(
% 0.71/1.10 skol4, skol3, skol5 ) }.
% 0.71/1.10 parent0[0]: (964) {G1,W8,D4,L1,V0,M1} { ! singleton( skol4 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent1[0]: (963) {G0,W15,D4,L3,V3,M3} { singleton( X ) ==> set_difference
% 0.71/1.10 ( unordered_pair( X, Y ), Z ), in( X, Z ), ! alpha1( X, Y, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol4
% 0.71/1.10 Y := skol3
% 0.71/1.10 Z := skol5
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (33) {G2,W7,D2,L2,V0,M2} R(5,28) { in( skol4, skol5 ), !
% 0.71/1.10 alpha1( skol4, skol3, skol5 ) }.
% 0.71/1.10 parent0: (965) {G1,W7,D2,L2,V0,M2} { in( skol4, skol5 ), ! alpha1( skol4,
% 0.71/1.10 skol3, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (966) {G1,W6,D2,L2,V0,M2} { in( skol3, skol5 ), ! in( skol4,
% 0.71/1.10 skol5 ) }.
% 0.71/1.10 parent0[1]: (32) {G1,W7,D2,L2,V0,M2} R(5,18) { in( skol3, skol5 ), ! alpha1
% 0.71/1.10 ( skol3, skol4, skol5 ) }.
% 0.71/1.10 parent1[1]: (7) {G0,W7,D2,L2,V3,M2} I { ! in( Y, Z ), alpha1( X, Y, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := skol4
% 0.71/1.10 Z := skol5
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (44) {G2,W6,D2,L2,V0,M2} R(32,7) { in( skol3, skol5 ), ! in(
% 0.71/1.10 skol4, skol5 ) }.
% 0.71/1.10 parent0: (966) {G1,W6,D2,L2,V0,M2} { in( skol3, skol5 ), ! in( skol4,
% 0.71/1.10 skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (967) {G0,W15,D4,L3,V3,M3} { unordered_pair( X, Y ) ==>
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ), in( X, Z ), in( Y, Z ) }.
% 0.71/1.10 parent0[2]: (13) {G0,W15,D4,L3,V3,M3} I { in( X, Z ), in( Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> unordered_pair( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (968) {G1,W9,D4,L1,V0,M1} { ! unordered_pair( skol4, skol3 ) ==>
% 0.71/1.10 set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (31) {G1,W9,D4,L1,V0,M1} P(1,20) { ! set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) ==> unordered_pair( skol4, skol3
% 0.71/1.10 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (969) {G1,W6,D2,L2,V0,M2} { in( skol4, skol5 ), in( skol3,
% 0.71/1.10 skol5 ) }.
% 0.71/1.10 parent0[0]: (968) {G1,W9,D4,L1,V0,M1} { ! unordered_pair( skol4, skol3 )
% 0.71/1.10 ==> set_difference( unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent1[0]: (967) {G0,W15,D4,L3,V3,M3} { unordered_pair( X, Y ) ==>
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ), in( X, Z ), in( Y, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol4
% 0.71/1.10 Y := skol3
% 0.71/1.10 Z := skol5
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (970) {G2,W6,D2,L2,V0,M2} { in( skol3, skol5 ), in( skol3,
% 0.71/1.10 skol5 ) }.
% 0.71/1.10 parent0[1]: (44) {G2,W6,D2,L2,V0,M2} R(32,7) { in( skol3, skol5 ), ! in(
% 0.71/1.10 skol4, skol5 ) }.
% 0.71/1.10 parent1[0]: (969) {G1,W6,D2,L2,V0,M2} { in( skol4, skol5 ), in( skol3,
% 0.71/1.10 skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 factor: (971) {G2,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.71/1.10 parent0[0, 1]: (970) {G2,W6,D2,L2,V0,M2} { in( skol3, skol5 ), in( skol3,
% 0.71/1.10 skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (399) {G3,W3,D2,L1,V0,M1} R(13,31);r(44) { in( skol3, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 parent0: (971) {G2,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (972) {G1,W4,D2,L1,V1,M1} { alpha1( X, skol3, skol5 ) }.
% 0.71/1.10 parent0[0]: (7) {G0,W7,D2,L2,V3,M2} I { ! in( Y, Z ), alpha1( X, Y, Z ) }.
% 0.71/1.10 parent1[0]: (399) {G3,W3,D2,L1,V0,M1} R(13,31);r(44) { in( skol3, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := skol3
% 0.71/1.10 Z := skol5
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (415) {G4,W4,D2,L1,V1,M1} R(399,7) { alpha1( X, skol3, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 parent0: (972) {G1,W4,D2,L1,V1,M1} { alpha1( X, skol3, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (973) {G0,W13,D4,L3,V3,M3} { empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ), ! in( X, Z ), ! in( Y, Z ) }.
% 0.71/1.10 parent0[2]: (16) {G0,W13,D4,L3,V3,M3} I { ! in( X, Z ), ! in( Y, Z ),
% 0.71/1.10 set_difference( unordered_pair( X, Y ), Z ) ==> empty_set }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 eqswap: (974) {G1,W7,D4,L1,V0,M1} { ! empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent0[0]: (26) {G1,W7,D4,L1,V0,M1} P(1,17) { ! set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) ==> empty_set }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (975) {G1,W6,D2,L2,V0,M2} { ! in( skol4, skol5 ), ! in( skol3
% 0.71/1.10 , skol5 ) }.
% 0.71/1.10 parent0[0]: (974) {G1,W7,D4,L1,V0,M1} { ! empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( skol4, skol3 ), skol5 ) }.
% 0.71/1.10 parent1[0]: (973) {G0,W13,D4,L3,V3,M3} { empty_set ==> set_difference(
% 0.71/1.10 unordered_pair( X, Y ), Z ), ! in( X, Z ), ! in( Y, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol4
% 0.71/1.10 Y := skol3
% 0.71/1.10 Z := skol5
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (976) {G2,W6,D2,L2,V0,M2} { ! in( skol4, skol5 ), ! in( skol4
% 0.71/1.10 , skol5 ) }.
% 0.71/1.10 parent0[1]: (975) {G1,W6,D2,L2,V0,M2} { ! in( skol4, skol5 ), ! in( skol3
% 0.71/1.10 , skol5 ) }.
% 0.71/1.10 parent1[0]: (44) {G2,W6,D2,L2,V0,M2} R(32,7) { in( skol3, skol5 ), ! in(
% 0.71/1.10 skol4, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 factor: (977) {G2,W3,D2,L1,V0,M1} { ! in( skol4, skol5 ) }.
% 0.71/1.10 parent0[0, 1]: (976) {G2,W6,D2,L2,V0,M2} { ! in( skol4, skol5 ), ! in(
% 0.71/1.10 skol4, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (543) {G3,W3,D2,L1,V0,M1} R(16,26);r(44) { ! in( skol4, skol5
% 0.71/1.10 ) }.
% 0.71/1.10 parent0: (977) {G2,W3,D2,L1,V0,M1} { ! in( skol4, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (978) {G3,W4,D2,L1,V0,M1} { ! alpha1( skol4, skol3, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 parent0[0]: (543) {G3,W3,D2,L1,V0,M1} R(16,26);r(44) { ! in( skol4, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 parent1[0]: (33) {G2,W7,D2,L2,V0,M2} R(5,28) { in( skol4, skol5 ), ! alpha1
% 0.71/1.10 ( skol4, skol3, skol5 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (979) {G4,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 parent0[0]: (978) {G3,W4,D2,L1,V0,M1} { ! alpha1( skol4, skol3, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 parent1[0]: (415) {G4,W4,D2,L1,V1,M1} R(399,7) { alpha1( X, skol3, skol5 )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol4
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (807) {G5,W0,D0,L0,V0,M0} S(33);r(543);r(415) { }.
% 0.71/1.10 parent0: (979) {G4,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 Proof check complete!
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 11170
% 0.71/1.10 space for clauses: 38338
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 1505
% 0.71/1.10 clauses kept: 808
% 0.71/1.10 clauses selected: 80
% 0.71/1.10 clauses deleted: 1
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 2041
% 0.71/1.10 literals s-matched: 1419
% 0.71/1.10 literals matched: 1368
% 0.71/1.10 full subsumption: 220
% 0.71/1.10
% 0.71/1.10 checksum: -1580511695
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------