TSTP Solution File: SEU165+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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:06 EDT 2022
% Result : Theorem 0.41s 1.07s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Mon Jun 20 07:34:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.41/1.07 *** allocated 10000 integers for termspace/termends
% 0.41/1.07 *** allocated 10000 integers for clauses
% 0.41/1.07 *** allocated 10000 integers for justifications
% 0.41/1.07 Bliksem 1.12
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Automatic Strategy Selection
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Clauses:
% 0.41/1.07
% 0.41/1.07 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.41/1.07 { ! in( X, Y ), ! in( Y, X ) }.
% 0.41/1.07 { ! empty( ordered_pair( X, Y ) ) }.
% 0.41/1.07 { empty( skol1 ) }.
% 0.41/1.07 { ! empty( skol2 ) }.
% 0.41/1.07 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.41/1.07 ( X ) ) }.
% 0.41/1.07 { alpha1( skol3, skol4, skol5, skol6 ), in( skol3, skol5 ) }.
% 0.41/1.07 { alpha1( skol3, skol4, skol5, skol6 ), in( skol4, skol6 ) }.
% 0.41/1.07 { alpha1( skol3, skol4, skol5, skol6 ), ! in( ordered_pair( skol3, skol4 )
% 0.41/1.07 , cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 { ! alpha1( X, Y, Z, T ), in( ordered_pair( X, Y ), cartesian_product2( Z,
% 0.41/1.07 T ) ) }.
% 0.41/1.07 { ! alpha1( X, Y, Z, T ), ! in( X, Z ), ! in( Y, T ) }.
% 0.41/1.07 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( X, Z ),
% 0.41/1.07 alpha1( X, Y, Z, T ) }.
% 0.41/1.07 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( Y, T ),
% 0.41/1.07 alpha1( X, Y, Z, T ) }.
% 0.41/1.07 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.41/1.07 { ! in( X, Z ), ! in( Y, T ), in( ordered_pair( X, Y ), cartesian_product2
% 0.41/1.07 ( Z, T ) ) }.
% 0.41/1.07
% 0.41/1.07 percentage equality = 0.064516, percentage horn = 0.750000
% 0.41/1.07 This is a problem with some equality
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Options Used:
% 0.41/1.07
% 0.41/1.07 useres = 1
% 0.41/1.07 useparamod = 1
% 0.41/1.07 useeqrefl = 1
% 0.41/1.07 useeqfact = 1
% 0.41/1.07 usefactor = 1
% 0.41/1.07 usesimpsplitting = 0
% 0.41/1.07 usesimpdemod = 5
% 0.41/1.07 usesimpres = 3
% 0.41/1.07
% 0.41/1.07 resimpinuse = 1000
% 0.41/1.07 resimpclauses = 20000
% 0.41/1.07 substype = eqrewr
% 0.41/1.07 backwardsubs = 1
% 0.41/1.07 selectoldest = 5
% 0.41/1.07
% 0.41/1.07 litorderings [0] = split
% 0.41/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.07
% 0.41/1.07 termordering = kbo
% 0.41/1.07
% 0.41/1.07 litapriori = 0
% 0.41/1.07 termapriori = 1
% 0.41/1.07 litaposteriori = 0
% 0.41/1.07 termaposteriori = 0
% 0.41/1.07 demodaposteriori = 0
% 0.41/1.07 ordereqreflfact = 0
% 0.41/1.07
% 0.41/1.07 litselect = negord
% 0.41/1.07
% 0.41/1.07 maxweight = 15
% 0.41/1.07 maxdepth = 30000
% 0.41/1.07 maxlength = 115
% 0.41/1.07 maxnrvars = 195
% 0.41/1.07 excuselevel = 1
% 0.41/1.07 increasemaxweight = 1
% 0.41/1.07
% 0.41/1.07 maxselected = 10000000
% 0.41/1.07 maxnrclauses = 10000000
% 0.41/1.07
% 0.41/1.07 showgenerated = 0
% 0.41/1.07 showkept = 0
% 0.41/1.07 showselected = 0
% 0.41/1.07 showdeleted = 0
% 0.41/1.07 showresimp = 1
% 0.41/1.07 showstatus = 2000
% 0.41/1.07
% 0.41/1.07 prologoutput = 0
% 0.41/1.07 nrgoals = 5000000
% 0.41/1.07 totalproof = 1
% 0.41/1.07
% 0.41/1.07 Symbols occurring in the translation:
% 0.41/1.07
% 0.41/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.07 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.41/1.07 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.41/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.07 unordered_pair [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.41/1.07 in [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.41/1.07 ordered_pair [39, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.41/1.07 empty [40, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.41/1.07 singleton [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.41/1.07 cartesian_product2 [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.41/1.07 alpha1 [45, 4] (w:1, o:51, a:1, s:1, b:1),
% 0.41/1.07 skol1 [46, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.41/1.07 skol2 [47, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.41/1.07 skol3 [48, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.41/1.07 skol4 [49, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.41/1.07 skol5 [50, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.41/1.07 skol6 [51, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Starting Search:
% 0.41/1.07
% 0.41/1.07 *** allocated 15000 integers for clauses
% 0.41/1.07
% 0.41/1.07 Bliksems!, er is een bewijs:
% 0.41/1.07 % SZS status Theorem
% 0.41/1.07 % SZS output start Refutation
% 0.41/1.07
% 0.41/1.07 (6) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6 ), in( skol3
% 0.41/1.07 , skol5 ) }.
% 0.41/1.07 (7) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6 ), in( skol4
% 0.41/1.07 , skol6 ) }.
% 0.41/1.07 (8) {G0,W12,D3,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6 ), ! in(
% 0.41/1.07 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 (9) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in( ordered_pair( X, Y
% 0.41/1.07 ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 (10) {G0,W11,D2,L3,V4,M3} I { ! alpha1( X, Y, Z, T ), ! in( X, Z ), ! in( Y
% 0.41/1.07 , T ) }.
% 0.41/1.07 (13) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.41/1.07 (15) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in( ordered_pair
% 0.41/1.07 ( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 (52) {G1,W8,D2,L2,V4,M2} R(9,13) { ! alpha1( X, Y, Z, T ), in( X, Z ) }.
% 0.41/1.07 (59) {G1,W3,D2,L1,V0,M1} R(9,6);r(13) { in( skol3, skol5 ) }.
% 0.41/1.07 (61) {G1,W3,D2,L1,V0,M1} R(9,7);r(14) { in( skol4, skol6 ) }.
% 0.41/1.07 (125) {G2,W13,D2,L3,V6,M3} R(52,10) { ! alpha1( X, Y, Z, T ), ! alpha1( X,
% 0.41/1.07 U, Z, W ), ! in( U, W ) }.
% 0.41/1.07 (137) {G3,W8,D2,L2,V4,M2} F(125) { ! alpha1( X, Y, Z, T ), ! in( Y, T ) }.
% 0.41/1.07 (171) {G4,W7,D3,L1,V0,M1} R(137,8);r(61) { ! in( ordered_pair( skol3, skol4
% 0.41/1.07 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 (174) {G5,W3,D2,L1,V0,M1} R(171,15);r(59) { ! in( skol4, skol6 ) }.
% 0.41/1.07 (180) {G6,W0,D0,L0,V0,M0} S(174);r(61) { }.
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 % SZS output end Refutation
% 0.41/1.07 found a proof!
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Unprocessed initial clauses:
% 0.41/1.07
% 0.41/1.07 (182) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 0.41/1.07 ) }.
% 0.41/1.07 (183) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.41/1.07 (184) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.41/1.07 (185) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.41/1.07 (186) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.41/1.07 (187) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.41/1.07 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.41/1.07 (188) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 ), in(
% 0.41/1.07 skol3, skol5 ) }.
% 0.41/1.07 (189) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 ), in(
% 0.41/1.07 skol4, skol6 ) }.
% 0.41/1.07 (190) {G0,W12,D3,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 ), ! in(
% 0.41/1.07 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 (191) {G0,W12,D3,L2,V4,M2} { ! alpha1( X, Y, Z, T ), in( ordered_pair( X,
% 0.41/1.07 Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 (192) {G0,W11,D2,L3,V4,M3} { ! alpha1( X, Y, Z, T ), ! in( X, Z ), ! in( Y
% 0.41/1.07 , T ) }.
% 0.41/1.07 (193) {G0,W15,D3,L3,V4,M3} { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ), alpha1( X, Y, Z, T ) }.
% 0.41/1.07 (194) {G0,W15,D3,L3,V4,M3} { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( Y, T ), alpha1( X, Y, Z, T ) }.
% 0.41/1.07 (195) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 (196) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.41/1.07 (197) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in( ordered_pair
% 0.41/1.07 ( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Total Proof:
% 0.41/1.07
% 0.41/1.07 subsumption: (6) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.41/1.07 ), in( skol3, skol5 ) }.
% 0.41/1.07 parent0: (188) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 )
% 0.41/1.07 , in( skol3, skol5 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (7) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.41/1.07 ), in( skol4, skol6 ) }.
% 0.41/1.07 parent0: (189) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 )
% 0.41/1.07 , in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (8) {G0,W12,D3,L2,V0,M2} I { alpha1( skol3, skol4, skol5,
% 0.41/1.07 skol6 ), ! in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5,
% 0.41/1.07 skol6 ) ) }.
% 0.41/1.07 parent0: (190) {G0,W12,D3,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 )
% 0.41/1.07 , ! in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 )
% 0.41/1.07 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (9) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 parent0: (191) {G0,W12,D3,L2,V4,M2} { ! alpha1( X, Y, Z, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (10) {G0,W11,D2,L3,V4,M3} I { ! alpha1( X, Y, Z, T ), ! in( X
% 0.41/1.07 , Z ), ! in( Y, T ) }.
% 0.41/1.07 parent0: (192) {G0,W11,D2,L3,V4,M3} { ! alpha1( X, Y, Z, T ), ! in( X, Z )
% 0.41/1.07 , ! in( Y, T ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 2 ==> 2
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (13) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 parent0: (195) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.41/1.07 parent0: (196) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (15) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 parent0: (197) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 2 ==> 2
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (219) {G1,W8,D2,L2,V4,M2} { in( X, Z ), ! alpha1( X, Y, Z, T )
% 0.41/1.07 }.
% 0.41/1.07 parent0[0]: (13) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 parent1[1]: (9) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (52) {G1,W8,D2,L2,V4,M2} R(9,13) { ! alpha1( X, Y, Z, T ), in
% 0.41/1.07 ( X, Z ) }.
% 0.41/1.07 parent0: (219) {G1,W8,D2,L2,V4,M2} { in( X, Z ), ! alpha1( X, Y, Z, T )
% 0.41/1.07 }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 1
% 0.41/1.07 1 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (220) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.41/1.07 , cartesian_product2( skol5, skol6 ) ), in( skol3, skol5 ) }.
% 0.41/1.07 parent0[0]: (9) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 parent1[0]: (6) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.41/1.07 ), in( skol3, skol5 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := skol3
% 0.41/1.07 Y := skol4
% 0.41/1.07 Z := skol5
% 0.41/1.07 T := skol6
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (221) {G1,W6,D2,L2,V0,M2} { in( skol3, skol5 ), in( skol3,
% 0.41/1.07 skol5 ) }.
% 0.41/1.07 parent0[0]: (13) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.41/1.07 parent1[0]: (220) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.41/1.07 , cartesian_product2( skol5, skol6 ) ), in( skol3, skol5 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := skol3
% 0.41/1.07 Y := skol4
% 0.41/1.07 Z := skol5
% 0.41/1.07 T := skol6
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 factor: (222) {G1,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.41/1.07 parent0[0, 1]: (221) {G1,W6,D2,L2,V0,M2} { in( skol3, skol5 ), in( skol3,
% 0.41/1.07 skol5 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (59) {G1,W3,D2,L1,V0,M1} R(9,6);r(13) { in( skol3, skol5 ) }.
% 0.41/1.07 parent0: (222) {G1,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (223) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.41/1.07 , cartesian_product2( skol5, skol6 ) ), in( skol4, skol6 ) }.
% 0.41/1.07 parent0[0]: (9) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 parent1[0]: (7) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.41/1.07 ), in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := skol3
% 0.41/1.07 Y := skol4
% 0.41/1.07 Z := skol5
% 0.41/1.07 T := skol6
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (224) {G1,W6,D2,L2,V0,M2} { in( skol4, skol6 ), in( skol4,
% 0.41/1.07 skol6 ) }.
% 0.41/1.07 parent0[0]: (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.41/1.07 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.41/1.07 parent1[0]: (223) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.41/1.07 , cartesian_product2( skol5, skol6 ) ), in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := skol3
% 0.41/1.07 Y := skol4
% 0.41/1.07 Z := skol5
% 0.41/1.07 T := skol6
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 factor: (225) {G1,W3,D2,L1,V0,M1} { in( skol4, skol6 ) }.
% 0.41/1.07 parent0[0, 1]: (224) {G1,W6,D2,L2,V0,M2} { in( skol4, skol6 ), in( skol4,
% 0.41/1.07 skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (61) {G1,W3,D2,L1,V0,M1} R(9,7);r(14) { in( skol4, skol6 ) }.
% 0.41/1.07 parent0: (225) {G1,W3,D2,L1,V0,M1} { in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (226) {G1,W13,D2,L3,V6,M3} { ! alpha1( X, Y, Z, T ), ! in( Y,
% 0.41/1.07 T ), ! alpha1( X, U, Z, W ) }.
% 0.41/1.07 parent0[1]: (10) {G0,W11,D2,L3,V4,M3} I { ! alpha1( X, Y, Z, T ), ! in( X,
% 0.41/1.07 Z ), ! in( Y, T ) }.
% 0.41/1.07 parent1[1]: (52) {G1,W8,D2,L2,V4,M2} R(9,13) { ! alpha1( X, Y, Z, T ), in(
% 0.41/1.07 X, Z ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 X := X
% 0.41/1.07 Y := U
% 0.41/1.07 Z := Z
% 0.41/1.07 T := W
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (125) {G2,W13,D2,L3,V6,M3} R(52,10) { ! alpha1( X, Y, Z, T ),
% 0.41/1.07 ! alpha1( X, U, Z, W ), ! in( U, W ) }.
% 0.41/1.07 parent0: (226) {G1,W13,D2,L3,V6,M3} { ! alpha1( X, Y, Z, T ), ! in( Y, T )
% 0.41/1.07 , ! alpha1( X, U, Z, W ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := U
% 0.41/1.07 Z := Z
% 0.41/1.07 T := W
% 0.41/1.07 U := Y
% 0.41/1.07 W := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 1
% 0.41/1.07 1 ==> 2
% 0.41/1.07 2 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 factor: (229) {G2,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), ! in( Y, T )
% 0.41/1.07 }.
% 0.41/1.07 parent0[0, 1]: (125) {G2,W13,D2,L3,V6,M3} R(52,10) { ! alpha1( X, Y, Z, T )
% 0.41/1.07 , ! alpha1( X, U, Z, W ), ! in( U, W ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 U := Y
% 0.41/1.07 W := T
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (137) {G3,W8,D2,L2,V4,M2} F(125) { ! alpha1( X, Y, Z, T ), !
% 0.41/1.07 in( Y, T ) }.
% 0.41/1.07 parent0: (229) {G2,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), ! in( Y, T )
% 0.41/1.07 }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 Z := Z
% 0.41/1.07 T := T
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 1 ==> 1
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (230) {G1,W10,D3,L2,V0,M2} { ! in( skol4, skol6 ), ! in(
% 0.41/1.07 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 parent0[0]: (137) {G3,W8,D2,L2,V4,M2} F(125) { ! alpha1( X, Y, Z, T ), ! in
% 0.41/1.07 ( Y, T ) }.
% 0.41/1.07 parent1[0]: (8) {G0,W12,D3,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.41/1.07 ), ! in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6
% 0.41/1.07 ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := skol3
% 0.41/1.07 Y := skol4
% 0.41/1.07 Z := skol5
% 0.41/1.07 T := skol6
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (231) {G2,W7,D3,L1,V0,M1} { ! in( ordered_pair( skol3, skol4 )
% 0.41/1.07 , cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 parent0[0]: (230) {G1,W10,D3,L2,V0,M2} { ! in( skol4, skol6 ), ! in(
% 0.41/1.07 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 parent1[0]: (61) {G1,W3,D2,L1,V0,M1} R(9,7);r(14) { in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (171) {G4,W7,D3,L1,V0,M1} R(137,8);r(61) { ! in( ordered_pair
% 0.41/1.07 ( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 parent0: (231) {G2,W7,D3,L1,V0,M1} { ! in( ordered_pair( skol3, skol4 ),
% 0.41/1.07 cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (232) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol5 ), ! in( skol4
% 0.41/1.07 , skol6 ) }.
% 0.41/1.07 parent0[0]: (171) {G4,W7,D3,L1,V0,M1} R(137,8);r(61) { ! in( ordered_pair(
% 0.41/1.07 skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.41/1.07 parent1[2]: (15) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 0.41/1.07 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 X := skol3
% 0.41/1.07 Y := skol4
% 0.41/1.07 Z := skol5
% 0.41/1.07 T := skol6
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (233) {G2,W3,D2,L1,V0,M1} { ! in( skol4, skol6 ) }.
% 0.41/1.07 parent0[0]: (232) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol5 ), ! in( skol4
% 0.41/1.07 , skol6 ) }.
% 0.41/1.07 parent1[0]: (59) {G1,W3,D2,L1,V0,M1} R(9,6);r(13) { in( skol3, skol5 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (174) {G5,W3,D2,L1,V0,M1} R(171,15);r(59) { ! in( skol4, skol6
% 0.41/1.07 ) }.
% 0.41/1.07 parent0: (233) {G2,W3,D2,L1,V0,M1} { ! in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (234) {G2,W0,D0,L0,V0,M0} { }.
% 0.41/1.07 parent0[0]: (174) {G5,W3,D2,L1,V0,M1} R(171,15);r(59) { ! in( skol4, skol6
% 0.41/1.07 ) }.
% 0.41/1.07 parent1[0]: (61) {G1,W3,D2,L1,V0,M1} R(9,7);r(14) { in( skol4, skol6 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (180) {G6,W0,D0,L0,V0,M0} S(174);r(61) { }.
% 0.41/1.07 parent0: (234) {G2,W0,D0,L0,V0,M0} { }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 Proof check complete!
% 0.41/1.07
% 0.41/1.07 Memory use:
% 0.41/1.07
% 0.41/1.07 space for terms: 2507
% 0.41/1.07 space for clauses: 12035
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 clauses generated: 355
% 0.41/1.07 clauses kept: 181
% 0.41/1.07 clauses selected: 54
% 0.41/1.07 clauses deleted: 3
% 0.41/1.07 clauses inuse deleted: 0
% 0.41/1.07
% 0.41/1.07 subsentry: 1158
% 0.41/1.07 literals s-matched: 650
% 0.41/1.07 literals matched: 636
% 0.41/1.07 full subsumption: 222
% 0.41/1.07
% 0.41/1.07 checksum: -1175169171
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Bliksem ended
%------------------------------------------------------------------------------