TSTP Solution File: SEU165+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU165+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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.74s 1.10s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU165+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n008.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 : Mon Jun 20 08:28:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.10 *** allocated 10000 integers for termspace/termends
% 0.74/1.10 *** allocated 10000 integers for clauses
% 0.74/1.10 *** allocated 10000 integers for justifications
% 0.74/1.10 Bliksem 1.12
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Automatic Strategy Selection
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Clauses:
% 0.74/1.10
% 0.74/1.10 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.74/1.10 { && }.
% 0.74/1.10 { && }.
% 0.74/1.10 { empty( skol1 ) }.
% 0.74/1.10 { ! empty( skol2 ) }.
% 0.74/1.10 { ! in( X, Y ), ! in( Y, X ) }.
% 0.74/1.10 { && }.
% 0.74/1.10 { && }.
% 0.74/1.10 { ! empty( ordered_pair( X, Y ) ) }.
% 0.74/1.10 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 0.74/1.10 ( X ) ) }.
% 0.74/1.10 { alpha1( skol3, skol4, skol5, skol6 ), in( skol3, skol5 ) }.
% 0.74/1.10 { alpha1( skol3, skol4, skol5, skol6 ), in( skol4, skol6 ) }.
% 0.74/1.10 { alpha1( skol3, skol4, skol5, skol6 ), ! in( ordered_pair( skol3, skol4 )
% 0.74/1.10 , cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 { ! alpha1( X, Y, Z, T ), in( ordered_pair( X, Y ), cartesian_product2( Z,
% 0.74/1.10 T ) ) }.
% 0.74/1.10 { ! alpha1( X, Y, Z, T ), ! in( X, Z ), ! in( Y, T ) }.
% 0.74/1.10 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( X, Z ),
% 0.74/1.10 alpha1( X, Y, Z, T ) }.
% 0.74/1.10 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( Y, T ),
% 0.74/1.10 alpha1( X, Y, Z, T ) }.
% 0.74/1.10 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.74/1.10 { ! in( X, Z ), ! in( Y, T ), in( ordered_pair( X, Y ), cartesian_product2
% 0.74/1.10 ( Z, T ) ) }.
% 0.74/1.10
% 0.74/1.10 percentage equality = 0.062500, percentage horn = 0.764706
% 0.74/1.10 This is a problem with some equality
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Options Used:
% 0.74/1.10
% 0.74/1.10 useres = 1
% 0.74/1.10 useparamod = 1
% 0.74/1.10 useeqrefl = 1
% 0.74/1.10 useeqfact = 1
% 0.74/1.10 usefactor = 1
% 0.74/1.10 usesimpsplitting = 0
% 0.74/1.10 usesimpdemod = 5
% 0.74/1.10 usesimpres = 3
% 0.74/1.10
% 0.74/1.10 resimpinuse = 1000
% 0.74/1.10 resimpclauses = 20000
% 0.74/1.10 substype = eqrewr
% 0.74/1.10 backwardsubs = 1
% 0.74/1.10 selectoldest = 5
% 0.74/1.10
% 0.74/1.10 litorderings [0] = split
% 0.74/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.10
% 0.74/1.10 termordering = kbo
% 0.74/1.10
% 0.74/1.10 litapriori = 0
% 0.74/1.10 termapriori = 1
% 0.74/1.10 litaposteriori = 0
% 0.74/1.10 termaposteriori = 0
% 0.74/1.10 demodaposteriori = 0
% 0.74/1.10 ordereqreflfact = 0
% 0.74/1.10
% 0.74/1.10 litselect = negord
% 0.74/1.10
% 0.74/1.10 maxweight = 15
% 0.74/1.10 maxdepth = 30000
% 0.74/1.10 maxlength = 115
% 0.74/1.10 maxnrvars = 195
% 0.74/1.10 excuselevel = 1
% 0.74/1.10 increasemaxweight = 1
% 0.74/1.10
% 0.74/1.10 maxselected = 10000000
% 0.74/1.10 maxnrclauses = 10000000
% 0.74/1.10
% 0.74/1.10 showgenerated = 0
% 0.74/1.10 showkept = 0
% 0.74/1.10 showselected = 0
% 0.74/1.10 showdeleted = 0
% 0.74/1.10 showresimp = 1
% 0.74/1.10 showstatus = 2000
% 0.74/1.10
% 0.74/1.10 prologoutput = 0
% 0.74/1.10 nrgoals = 5000000
% 0.74/1.10 totalproof = 1
% 0.74/1.10
% 0.74/1.10 Symbols occurring in the translation:
% 0.74/1.10
% 0.74/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.10 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.10 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.74/1.10 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.74/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.10 unordered_pair [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.74/1.10 empty [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.10 in [39, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.74/1.10 ordered_pair [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.74/1.10 singleton [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.10 cartesian_product2 [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.10 alpha1 [45, 4] (w:1, o:51, a:1, s:1, b:1),
% 0.74/1.10 skol1 [46, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.74/1.10 skol2 [47, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.74/1.10 skol3 [48, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.74/1.10 skol4 [49, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.74/1.10 skol5 [50, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.74/1.10 skol6 [51, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Starting Search:
% 0.74/1.10
% 0.74/1.10 *** allocated 15000 integers for clauses
% 0.74/1.10
% 0.74/1.10 Bliksems!, er is een bewijs:
% 0.74/1.10 % SZS status Theorem
% 0.74/1.10 % SZS output start Refutation
% 0.74/1.10
% 0.74/1.10 (7) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6 ), in( skol3
% 0.74/1.10 , skol5 ) }.
% 0.74/1.10 (8) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6 ), in( skol4
% 0.74/1.10 , skol6 ) }.
% 0.74/1.10 (9) {G0,W12,D3,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6 ), ! in(
% 0.74/1.10 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 (10) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in( ordered_pair( X,
% 0.74/1.10 Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 (11) {G0,W11,D2,L3,V4,M3} I { ! alpha1( X, Y, Z, T ), ! in( X, Z ), ! in( Y
% 0.74/1.10 , T ) }.
% 0.74/1.10 (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 (15) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.74/1.10 (16) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in( ordered_pair
% 0.74/1.10 ( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 (50) {G1,W8,D2,L2,V4,M2} R(10,14) { ! alpha1( X, Y, Z, T ), in( X, Z ) }.
% 0.74/1.10 (57) {G1,W3,D2,L1,V0,M1} R(10,7);r(14) { in( skol3, skol5 ) }.
% 0.74/1.10 (59) {G1,W3,D2,L1,V0,M1} R(10,8);r(15) { in( skol4, skol6 ) }.
% 0.74/1.10 (127) {G2,W13,D2,L3,V6,M3} R(50,11) { ! alpha1( X, Y, Z, T ), ! alpha1( X,
% 0.74/1.10 U, Z, W ), ! in( U, W ) }.
% 0.74/1.10 (138) {G3,W8,D2,L2,V4,M2} F(127) { ! alpha1( X, Y, Z, T ), ! in( Y, T ) }.
% 0.74/1.10 (173) {G4,W7,D3,L1,V0,M1} R(138,9);r(59) { ! in( ordered_pair( skol3, skol4
% 0.74/1.10 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 (178) {G5,W3,D2,L1,V0,M1} R(173,16);r(57) { ! in( skol4, skol6 ) }.
% 0.74/1.10 (181) {G6,W0,D0,L0,V0,M0} S(178);r(59) { }.
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 % SZS output end Refutation
% 0.74/1.10 found a proof!
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Unprocessed initial clauses:
% 0.74/1.10
% 0.74/1.10 (183) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 0.74/1.10 ) }.
% 0.74/1.10 (184) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.10 (185) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.10 (186) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.74/1.10 (187) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.74/1.10 (188) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.74/1.10 (189) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.10 (190) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.10 (191) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 0.74/1.10 (192) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 0.74/1.10 unordered_pair( X, Y ), singleton( X ) ) }.
% 0.74/1.10 (193) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 ), in(
% 0.74/1.10 skol3, skol5 ) }.
% 0.74/1.10 (194) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 ), in(
% 0.74/1.10 skol4, skol6 ) }.
% 0.74/1.10 (195) {G0,W12,D3,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 ), ! in(
% 0.74/1.10 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 (196) {G0,W12,D3,L2,V4,M2} { ! alpha1( X, Y, Z, T ), in( ordered_pair( X,
% 0.74/1.10 Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 (197) {G0,W11,D2,L3,V4,M3} { ! alpha1( X, Y, Z, T ), ! in( X, Z ), ! in( Y
% 0.74/1.10 , T ) }.
% 0.74/1.10 (198) {G0,W15,D3,L3,V4,M3} { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ), alpha1( X, Y, Z, T ) }.
% 0.74/1.10 (199) {G0,W15,D3,L3,V4,M3} { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( Y, T ), alpha1( X, Y, Z, T ) }.
% 0.74/1.10 (200) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 (201) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.74/1.10 (202) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in( ordered_pair
% 0.74/1.10 ( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Total Proof:
% 0.74/1.10
% 0.74/1.10 subsumption: (7) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.74/1.10 ), in( skol3, skol5 ) }.
% 0.74/1.10 parent0: (193) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 )
% 0.74/1.10 , in( skol3, skol5 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (8) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.74/1.10 ), in( skol4, skol6 ) }.
% 0.74/1.10 parent0: (194) {G0,W8,D2,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 )
% 0.74/1.10 , in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (9) {G0,W12,D3,L2,V0,M2} I { alpha1( skol3, skol4, skol5,
% 0.74/1.10 skol6 ), ! in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5,
% 0.74/1.10 skol6 ) ) }.
% 0.74/1.10 parent0: (195) {G0,W12,D3,L2,V0,M2} { alpha1( skol3, skol4, skol5, skol6 )
% 0.74/1.10 , ! in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 )
% 0.74/1.10 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (10) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 parent0: (196) {G0,W12,D3,L2,V4,M2} { ! alpha1( X, Y, Z, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (11) {G0,W11,D2,L3,V4,M3} I { ! alpha1( X, Y, Z, T ), ! in( X
% 0.74/1.10 , Z ), ! in( Y, T ) }.
% 0.74/1.10 parent0: (197) {G0,W11,D2,L3,V4,M3} { ! alpha1( X, Y, Z, T ), ! in( X, Z )
% 0.74/1.10 , ! in( Y, T ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 2 ==> 2
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 parent0: (200) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (15) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.74/1.10 parent0: (201) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (16) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 parent0: (202) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 2 ==> 2
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (224) {G1,W8,D2,L2,V4,M2} { in( X, Z ), ! alpha1( X, Y, Z, T )
% 0.74/1.10 }.
% 0.74/1.10 parent0[0]: (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 parent1[1]: (10) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (50) {G1,W8,D2,L2,V4,M2} R(10,14) { ! alpha1( X, Y, Z, T ), in
% 0.74/1.10 ( X, Z ) }.
% 0.74/1.10 parent0: (224) {G1,W8,D2,L2,V4,M2} { in( X, Z ), ! alpha1( X, Y, Z, T )
% 0.74/1.10 }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 1
% 0.74/1.10 1 ==> 0
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (225) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.74/1.10 , cartesian_product2( skol5, skol6 ) ), in( skol3, skol5 ) }.
% 0.74/1.10 parent0[0]: (10) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 parent1[0]: (7) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.74/1.10 ), in( skol3, skol5 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := skol3
% 0.74/1.10 Y := skol4
% 0.74/1.10 Z := skol5
% 0.74/1.10 T := skol6
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (226) {G1,W6,D2,L2,V0,M2} { in( skol3, skol5 ), in( skol3,
% 0.74/1.10 skol5 ) }.
% 0.74/1.10 parent0[0]: (14) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 0.74/1.10 parent1[0]: (225) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.74/1.10 , cartesian_product2( skol5, skol6 ) ), in( skol3, skol5 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := skol3
% 0.74/1.10 Y := skol4
% 0.74/1.10 Z := skol5
% 0.74/1.10 T := skol6
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 factor: (227) {G1,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.74/1.10 parent0[0, 1]: (226) {G1,W6,D2,L2,V0,M2} { in( skol3, skol5 ), in( skol3,
% 0.74/1.10 skol5 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (57) {G1,W3,D2,L1,V0,M1} R(10,7);r(14) { in( skol3, skol5 )
% 0.74/1.10 }.
% 0.74/1.10 parent0: (227) {G1,W3,D2,L1,V0,M1} { in( skol3, skol5 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (228) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.74/1.10 , cartesian_product2( skol5, skol6 ) ), in( skol4, skol6 ) }.
% 0.74/1.10 parent0[0]: (10) {G0,W12,D3,L2,V4,M2} I { ! alpha1( X, Y, Z, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 parent1[0]: (8) {G0,W8,D2,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.74/1.10 ), in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := skol3
% 0.74/1.10 Y := skol4
% 0.74/1.10 Z := skol5
% 0.74/1.10 T := skol6
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (229) {G1,W6,D2,L2,V0,M2} { in( skol4, skol6 ), in( skol4,
% 0.74/1.10 skol6 ) }.
% 0.74/1.10 parent0[0]: (15) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 0.74/1.10 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 0.74/1.10 parent1[0]: (228) {G1,W10,D3,L2,V0,M2} { in( ordered_pair( skol3, skol4 )
% 0.74/1.10 , cartesian_product2( skol5, skol6 ) ), in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := skol3
% 0.74/1.10 Y := skol4
% 0.74/1.10 Z := skol5
% 0.74/1.10 T := skol6
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 factor: (230) {G1,W3,D2,L1,V0,M1} { in( skol4, skol6 ) }.
% 0.74/1.10 parent0[0, 1]: (229) {G1,W6,D2,L2,V0,M2} { in( skol4, skol6 ), in( skol4,
% 0.74/1.10 skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (59) {G1,W3,D2,L1,V0,M1} R(10,8);r(15) { in( skol4, skol6 )
% 0.74/1.10 }.
% 0.74/1.10 parent0: (230) {G1,W3,D2,L1,V0,M1} { in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (231) {G1,W13,D2,L3,V6,M3} { ! alpha1( X, Y, Z, T ), ! in( Y,
% 0.74/1.10 T ), ! alpha1( X, U, Z, W ) }.
% 0.74/1.10 parent0[1]: (11) {G0,W11,D2,L3,V4,M3} I { ! alpha1( X, Y, Z, T ), ! in( X,
% 0.74/1.10 Z ), ! in( Y, T ) }.
% 0.74/1.10 parent1[1]: (50) {G1,W8,D2,L2,V4,M2} R(10,14) { ! alpha1( X, Y, Z, T ), in
% 0.74/1.10 ( X, Z ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 X := X
% 0.74/1.10 Y := U
% 0.74/1.10 Z := Z
% 0.74/1.10 T := W
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (127) {G2,W13,D2,L3,V6,M3} R(50,11) { ! alpha1( X, Y, Z, T ),
% 0.74/1.10 ! alpha1( X, U, Z, W ), ! in( U, W ) }.
% 0.74/1.10 parent0: (231) {G1,W13,D2,L3,V6,M3} { ! alpha1( X, Y, Z, T ), ! in( Y, T )
% 0.74/1.10 , ! alpha1( X, U, Z, W ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := U
% 0.74/1.10 Z := Z
% 0.74/1.10 T := W
% 0.74/1.10 U := Y
% 0.74/1.10 W := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 1
% 0.74/1.10 1 ==> 2
% 0.74/1.10 2 ==> 0
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 factor: (234) {G2,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), ! in( Y, T )
% 0.74/1.10 }.
% 0.74/1.10 parent0[0, 1]: (127) {G2,W13,D2,L3,V6,M3} R(50,11) { ! alpha1( X, Y, Z, T )
% 0.74/1.10 , ! alpha1( X, U, Z, W ), ! in( U, W ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 U := Y
% 0.74/1.10 W := T
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (138) {G3,W8,D2,L2,V4,M2} F(127) { ! alpha1( X, Y, Z, T ), !
% 0.74/1.10 in( Y, T ) }.
% 0.74/1.10 parent0: (234) {G2,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), ! in( Y, T )
% 0.74/1.10 }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := X
% 0.74/1.10 Y := Y
% 0.74/1.10 Z := Z
% 0.74/1.10 T := T
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 1 ==> 1
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (235) {G1,W10,D3,L2,V0,M2} { ! in( skol4, skol6 ), ! in(
% 0.74/1.10 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 parent0[0]: (138) {G3,W8,D2,L2,V4,M2} F(127) { ! alpha1( X, Y, Z, T ), ! in
% 0.74/1.10 ( Y, T ) }.
% 0.74/1.10 parent1[0]: (9) {G0,W12,D3,L2,V0,M2} I { alpha1( skol3, skol4, skol5, skol6
% 0.74/1.10 ), ! in( ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6
% 0.74/1.10 ) ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 X := skol3
% 0.74/1.10 Y := skol4
% 0.74/1.10 Z := skol5
% 0.74/1.10 T := skol6
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (236) {G2,W7,D3,L1,V0,M1} { ! in( ordered_pair( skol3, skol4 )
% 0.74/1.10 , cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 parent0[0]: (235) {G1,W10,D3,L2,V0,M2} { ! in( skol4, skol6 ), ! in(
% 0.74/1.10 ordered_pair( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 parent1[0]: (59) {G1,W3,D2,L1,V0,M1} R(10,8);r(15) { in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (173) {G4,W7,D3,L1,V0,M1} R(138,9);r(59) { ! in( ordered_pair
% 0.74/1.10 ( skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 parent0: (236) {G2,W7,D3,L1,V0,M1} { ! in( ordered_pair( skol3, skol4 ),
% 0.74/1.10 cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (237) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol5 ), ! in( skol4
% 0.74/1.10 , skol6 ) }.
% 0.74/1.10 parent0[0]: (173) {G4,W7,D3,L1,V0,M1} R(138,9);r(59) { ! in( ordered_pair(
% 0.74/1.10 skol3, skol4 ), cartesian_product2( skol5, skol6 ) ) }.
% 0.74/1.10 parent1[2]: (16) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 0.74/1.10 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 X := skol3
% 0.74/1.10 Y := skol4
% 0.74/1.10 Z := skol5
% 0.74/1.10 T := skol6
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (238) {G2,W3,D2,L1,V0,M1} { ! in( skol4, skol6 ) }.
% 0.74/1.10 parent0[0]: (237) {G1,W6,D2,L2,V0,M2} { ! in( skol3, skol5 ), ! in( skol4
% 0.74/1.10 , skol6 ) }.
% 0.74/1.10 parent1[0]: (57) {G1,W3,D2,L1,V0,M1} R(10,7);r(14) { in( skol3, skol5 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (178) {G5,W3,D2,L1,V0,M1} R(173,16);r(57) { ! in( skol4, skol6
% 0.74/1.10 ) }.
% 0.74/1.10 parent0: (238) {G2,W3,D2,L1,V0,M1} { ! in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 0 ==> 0
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 resolution: (239) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.10 parent0[0]: (178) {G5,W3,D2,L1,V0,M1} R(173,16);r(57) { ! in( skol4, skol6
% 0.74/1.10 ) }.
% 0.74/1.10 parent1[0]: (59) {G1,W3,D2,L1,V0,M1} R(10,8);r(15) { in( skol4, skol6 ) }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 substitution1:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 subsumption: (181) {G6,W0,D0,L0,V0,M0} S(178);r(59) { }.
% 0.74/1.10 parent0: (239) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.10 substitution0:
% 0.74/1.10 end
% 0.74/1.10 permutation0:
% 0.74/1.10 end
% 0.74/1.10
% 0.74/1.10 Proof check complete!
% 0.74/1.10
% 0.74/1.10 Memory use:
% 0.74/1.10
% 0.74/1.10 space for terms: 2524
% 0.74/1.10 space for clauses: 12074
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 clauses generated: 359
% 0.74/1.10 clauses kept: 182
% 0.74/1.10 clauses selected: 55
% 0.74/1.10 clauses deleted: 3
% 0.74/1.10 clauses inuse deleted: 0
% 0.74/1.10
% 0.74/1.10 subsentry: 1148
% 0.74/1.10 literals s-matched: 651
% 0.74/1.10 literals matched: 637
% 0.74/1.10 full subsumption: 222
% 0.74/1.10
% 0.74/1.10 checksum: -1630078627
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 Bliksem ended
%------------------------------------------------------------------------------