TSTP Solution File: SET961+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET961+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Mon Jul 18 22:53:38 EDT 2022
% Result : Theorem 1.94s 2.31s
% Output : Refutation 1.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET961+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.32 % Computer : n024.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % DateTime : Sun Jul 10 22:55:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.94/2.31 *** allocated 10000 integers for termspace/termends
% 1.94/2.31 *** allocated 10000 integers for clauses
% 1.94/2.31 *** allocated 10000 integers for justifications
% 1.94/2.31 Bliksem 1.12
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Automatic Strategy Selection
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Clauses:
% 1.94/2.31
% 1.94/2.31 { ! in( X, Y ), ! in( Y, X ) }.
% 1.94/2.31 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 1.94/2.31 { ! X = empty_set, ! in( Y, X ) }.
% 1.94/2.31 { in( skol1( X ), X ), X = empty_set }.
% 1.94/2.31 { ordered_pair( X, Y ) = unordered_pair( unordered_pair( X, Y ), singleton
% 1.94/2.31 ( X ) ) }.
% 1.94/2.31 { empty( empty_set ) }.
% 1.94/2.31 { ! empty( ordered_pair( X, Y ) ) }.
% 1.94/2.31 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( X, Z ) }.
% 1.94/2.31 { ! in( ordered_pair( X, Y ), cartesian_product2( Z, T ) ), in( Y, T ) }.
% 1.94/2.31 { ! in( X, Z ), ! in( Y, T ), in( ordered_pair( X, Y ), cartesian_product2
% 1.94/2.31 ( Z, T ) ) }.
% 1.94/2.31 { empty( skol2 ) }.
% 1.94/2.31 { ! empty( skol3 ) }.
% 1.94/2.31 { cartesian_product2( skol4, skol6 ) = cartesian_product2( skol6, skol4 ) }
% 1.94/2.31 .
% 1.94/2.31 { ! skol4 = empty_set }.
% 1.94/2.31 { ! skol6 = empty_set }.
% 1.94/2.31 { ! skol4 = skol6 }.
% 1.94/2.31 { alpha1( X, Y, skol5( X, Y ) ), in( skol5( X, Y ), Y ), X = Y }.
% 1.94/2.31 { alpha1( X, Y, skol5( X, Y ) ), ! in( skol5( X, Y ), X ), X = Y }.
% 1.94/2.31 { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 1.94/2.31 { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 1.94/2.31 { ! in( Z, X ), in( Z, Y ), alpha1( X, Y, Z ) }.
% 1.94/2.31
% 1.94/2.31 percentage equality = 0.277778, percentage horn = 0.809524
% 1.94/2.31 This is a problem with some equality
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Options Used:
% 1.94/2.31
% 1.94/2.31 useres = 1
% 1.94/2.31 useparamod = 1
% 1.94/2.31 useeqrefl = 1
% 1.94/2.31 useeqfact = 1
% 1.94/2.31 usefactor = 1
% 1.94/2.31 usesimpsplitting = 0
% 1.94/2.31 usesimpdemod = 5
% 1.94/2.31 usesimpres = 3
% 1.94/2.31
% 1.94/2.31 resimpinuse = 1000
% 1.94/2.31 resimpclauses = 20000
% 1.94/2.31 substype = eqrewr
% 1.94/2.31 backwardsubs = 1
% 1.94/2.31 selectoldest = 5
% 1.94/2.31
% 1.94/2.31 litorderings [0] = split
% 1.94/2.31 litorderings [1] = extend the termordering, first sorting on arguments
% 1.94/2.31
% 1.94/2.31 termordering = kbo
% 1.94/2.31
% 1.94/2.31 litapriori = 0
% 1.94/2.31 termapriori = 1
% 1.94/2.31 litaposteriori = 0
% 1.94/2.31 termaposteriori = 0
% 1.94/2.31 demodaposteriori = 0
% 1.94/2.31 ordereqreflfact = 0
% 1.94/2.31
% 1.94/2.31 litselect = negord
% 1.94/2.31
% 1.94/2.31 maxweight = 15
% 1.94/2.31 maxdepth = 30000
% 1.94/2.31 maxlength = 115
% 1.94/2.31 maxnrvars = 195
% 1.94/2.31 excuselevel = 1
% 1.94/2.31 increasemaxweight = 1
% 1.94/2.31
% 1.94/2.31 maxselected = 10000000
% 1.94/2.31 maxnrclauses = 10000000
% 1.94/2.31
% 1.94/2.31 showgenerated = 0
% 1.94/2.31 showkept = 0
% 1.94/2.31 showselected = 0
% 1.94/2.31 showdeleted = 0
% 1.94/2.31 showresimp = 1
% 1.94/2.31 showstatus = 2000
% 1.94/2.31
% 1.94/2.31 prologoutput = 0
% 1.94/2.31 nrgoals = 5000000
% 1.94/2.31 totalproof = 1
% 1.94/2.31
% 1.94/2.31 Symbols occurring in the translation:
% 1.94/2.31
% 1.94/2.31 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.94/2.31 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 1.94/2.31 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 1.94/2.31 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.94/2.31 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.94/2.31 in [37, 2] (w:1, o:47, a:1, s:1, b:0),
% 1.94/2.31 unordered_pair [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 1.94/2.31 empty_set [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 1.94/2.31 ordered_pair [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 1.94/2.31 singleton [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 1.94/2.31 empty [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 1.94/2.31 cartesian_product2 [45, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.94/2.31 alpha1 [46, 3] (w:1, o:52, a:1, s:1, b:1),
% 1.94/2.31 skol1 [47, 1] (w:1, o:22, a:1, s:1, b:1),
% 1.94/2.31 skol2 [48, 0] (w:1, o:11, a:1, s:1, b:1),
% 1.94/2.31 skol3 [49, 0] (w:1, o:12, a:1, s:1, b:1),
% 1.94/2.31 skol4 [50, 0] (w:1, o:13, a:1, s:1, b:1),
% 1.94/2.31 skol5 [51, 2] (w:1, o:51, a:1, s:1, b:1),
% 1.94/2.31 skol6 [52, 0] (w:1, o:14, a:1, s:1, b:1).
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Starting Search:
% 1.94/2.31
% 1.94/2.31 *** allocated 15000 integers for clauses
% 1.94/2.31 *** allocated 22500 integers for clauses
% 1.94/2.31 *** allocated 33750 integers for clauses
% 1.94/2.31 *** allocated 50625 integers for clauses
% 1.94/2.31 *** allocated 15000 integers for termspace/termends
% 1.94/2.31 *** allocated 75937 integers for clauses
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 *** allocated 22500 integers for termspace/termends
% 1.94/2.31 *** allocated 113905 integers for clauses
% 1.94/2.31 *** allocated 33750 integers for termspace/termends
% 1.94/2.31
% 1.94/2.31 Intermediate Status:
% 1.94/2.31 Generated: 10608
% 1.94/2.31 Kept: 2011
% 1.94/2.31 Inuse: 238
% 1.94/2.31 Deleted: 10
% 1.94/2.31 Deletedinuse: 4
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 *** allocated 170857 integers for clauses
% 1.94/2.31 *** allocated 50625 integers for termspace/termends
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 *** allocated 256285 integers for clauses
% 1.94/2.31 *** allocated 75937 integers for termspace/termends
% 1.94/2.31
% 1.94/2.31 Intermediate Status:
% 1.94/2.31 Generated: 25663
% 1.94/2.31 Kept: 4110
% 1.94/2.31 Inuse: 330
% 1.94/2.31 Deleted: 12
% 1.94/2.31 Deletedinuse: 4
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 *** allocated 384427 integers for clauses
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 *** allocated 113905 integers for termspace/termends
% 1.94/2.31
% 1.94/2.31 Intermediate Status:
% 1.94/2.31 Generated: 37251
% 1.94/2.31 Kept: 6118
% 1.94/2.31 Inuse: 387
% 1.94/2.31 Deleted: 15
% 1.94/2.31 Deletedinuse: 4
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31 Done
% 1.94/2.31
% 1.94/2.31 *** allocated 576640 integers for clauses
% 1.94/2.31 *** allocated 170857 integers for termspace/termends
% 1.94/2.31
% 1.94/2.31 Intermediate Status:
% 1.94/2.31 Generated: 57106
% 1.94/2.31 Kept: 8451
% 1.94/2.31 Inuse: 474
% 1.94/2.31 Deleted: 23
% 1.94/2.31 Deletedinuse: 6
% 1.94/2.31
% 1.94/2.31 Resimplifying inuse:
% 1.94/2.31
% 1.94/2.31 Bliksems!, er is een bewijs:
% 1.94/2.31 % SZS status Theorem
% 1.94/2.31 % SZS output start Refutation
% 1.94/2.31
% 1.94/2.31 (3) {G0,W7,D3,L2,V1,M2} I { in( skol1( X ), X ), X = empty_set }.
% 1.94/2.31 (7) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ), cartesian_product2
% 1.94/2.31 ( Z, T ) ), in( X, Z ) }.
% 1.94/2.31 (8) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ), cartesian_product2
% 1.94/2.31 ( Z, T ) ), in( Y, T ) }.
% 1.94/2.31 (9) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in( ordered_pair(
% 1.94/2.31 X, Y ), cartesian_product2( Z, T ) ) }.
% 1.94/2.31 (12) {G0,W7,D3,L1,V0,M1} I { cartesian_product2( skol4, skol6 ) ==>
% 1.94/2.31 cartesian_product2( skol6, skol4 ) }.
% 1.94/2.31 (13) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> empty_set }.
% 1.94/2.31 (14) {G0,W3,D2,L1,V0,M1} I { ! skol6 ==> empty_set }.
% 1.94/2.31 (15) {G0,W3,D2,L1,V0,M1} I { ! skol6 ==> skol4 }.
% 1.94/2.31 (16) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), in( skol5( X,
% 1.94/2.31 Y ), Y ), X = Y }.
% 1.94/2.31 (17) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), ! in( skol5( X
% 1.94/2.31 , Y ), X ), X = Y }.
% 1.94/2.31 (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 1.94/2.31 (19) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 1.94/2.31 (38) {G1,W4,D3,L1,V0,M1} P(3,13);q { in( skol1( skol4 ), skol4 ) }.
% 1.94/2.31 (39) {G1,W4,D3,L1,V0,M1} P(3,14);q { in( skol1( skol6 ), skol6 ) }.
% 1.94/2.31 (96) {G2,W11,D4,L2,V2,M2} R(9,39) { ! in( X, Y ), in( ordered_pair( skol1(
% 1.94/2.31 skol6 ), X ), cartesian_product2( skol6, Y ) ) }.
% 1.94/2.31 (99) {G2,W11,D4,L2,V2,M2} R(9,38) { ! in( X, Y ), in( ordered_pair( X,
% 1.94/2.31 skol1( skol4 ) ), cartesian_product2( Y, skol4 ) ) }.
% 1.94/2.31 (121) {G1,W10,D3,L2,V2,M2} P(12,8) { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( skol6, skol4 ) ), in( Y, skol6 ) }.
% 1.94/2.31 (122) {G1,W10,D3,L2,V2,M2} P(12,7) { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( skol6, skol4 ) ), in( X, skol4 ) }.
% 1.94/2.31 (149) {G1,W13,D3,L3,V2,M3} R(16,18) { in( skol5( X, Y ), Y ), X = Y, in(
% 1.94/2.31 skol5( X, Y ), X ) }.
% 1.94/2.31 (5987) {G3,W6,D2,L2,V1,M2} R(121,96) { in( X, skol6 ), ! in( X, skol4 ) }.
% 1.94/2.31 (6135) {G3,W6,D2,L2,V1,M2} R(122,99) { in( X, skol4 ), ! in( X, skol6 ) }.
% 1.94/2.31 (6362) {G4,W7,D2,L2,V2,M2} R(6135,18) { in( X, skol4 ), ! alpha1( skol6, Y
% 1.94/2.31 , X ) }.
% 1.94/2.31 (6699) {G5,W8,D2,L2,V3,M2} R(6362,19) { ! alpha1( skol6, X, Y ), ! alpha1(
% 1.94/2.31 Z, skol4, Y ) }.
% 1.94/2.31 (6700) {G6,W4,D2,L1,V1,M1} F(6699) { ! alpha1( skol6, skol4, X ) }.
% 1.94/2.31 (6708) {G7,W8,D3,L2,V0,M2} R(6700,17) { ! in( skol5( skol6, skol4 ), skol6
% 1.94/2.31 ), skol6 ==> skol4 }.
% 1.94/2.31 (7889) {G4,W13,D3,L3,V1,M3} R(149,5987) { X = skol4, in( skol5( X, skol4 )
% 1.94/2.31 , X ), in( skol5( X, skol4 ), skol6 ) }.
% 1.94/2.31 (8450) {G8,W3,D2,L1,V0,M1} F(7889);r(6708) { skol6 ==> skol4 }.
% 1.94/2.31 (8453) {G9,W0,D0,L0,V0,M0} S(15);d(8450);q { }.
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 % SZS output end Refutation
% 1.94/2.31 found a proof!
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Unprocessed initial clauses:
% 1.94/2.31
% 1.94/2.31 (8455) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 1.94/2.31 (8456) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 1.94/2.31 ) }.
% 1.94/2.31 (8457) {G0,W6,D2,L2,V2,M2} { ! X = empty_set, ! in( Y, X ) }.
% 1.94/2.31 (8458) {G0,W7,D3,L2,V1,M2} { in( skol1( X ), X ), X = empty_set }.
% 1.94/2.31 (8459) {G0,W10,D4,L1,V2,M1} { ordered_pair( X, Y ) = unordered_pair(
% 1.94/2.31 unordered_pair( X, Y ), singleton( X ) ) }.
% 1.94/2.31 (8460) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 1.94/2.31 (8461) {G0,W4,D3,L1,V2,M1} { ! empty( ordered_pair( X, Y ) ) }.
% 1.94/2.31 (8462) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 1.94/2.31 (8463) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 1.94/2.31 (8464) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in( ordered_pair
% 1.94/2.31 ( X, Y ), cartesian_product2( Z, T ) ) }.
% 1.94/2.31 (8465) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 1.94/2.31 (8466) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 1.94/2.31 (8467) {G0,W7,D3,L1,V0,M1} { cartesian_product2( skol4, skol6 ) =
% 1.94/2.31 cartesian_product2( skol6, skol4 ) }.
% 1.94/2.31 (8468) {G0,W3,D2,L1,V0,M1} { ! skol4 = empty_set }.
% 1.94/2.31 (8469) {G0,W3,D2,L1,V0,M1} { ! skol6 = empty_set }.
% 1.94/2.31 (8470) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol6 }.
% 1.94/2.31 (8471) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), in( skol5( X
% 1.94/2.31 , Y ), Y ), X = Y }.
% 1.94/2.31 (8472) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), ! in( skol5(
% 1.94/2.31 X, Y ), X ), X = Y }.
% 1.94/2.31 (8473) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 1.94/2.31 (8474) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! in( Z, Y ) }.
% 1.94/2.31 (8475) {G0,W10,D2,L3,V3,M3} { ! in( Z, X ), in( Z, Y ), alpha1( X, Y, Z )
% 1.94/2.31 }.
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Total Proof:
% 1.94/2.31
% 1.94/2.31 subsumption: (3) {G0,W7,D3,L2,V1,M2} I { in( skol1( X ), X ), X = empty_set
% 1.94/2.31 }.
% 1.94/2.31 parent0: (8458) {G0,W7,D3,L2,V1,M2} { in( skol1( X ), X ), X = empty_set
% 1.94/2.31 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (7) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 1.94/2.31 parent0: (8462) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := Z
% 1.94/2.31 T := T
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (8) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 1.94/2.31 parent0: (8463) {G0,W10,D3,L2,V4,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := Z
% 1.94/2.31 T := T
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (9) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 1.94/2.31 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 1.94/2.31 parent0: (8464) {G0,W13,D3,L3,V4,M3} { ! in( X, Z ), ! in( Y, T ), in(
% 1.94/2.31 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := Z
% 1.94/2.31 T := T
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 2 ==> 2
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (12) {G0,W7,D3,L1,V0,M1} I { cartesian_product2( skol4, skol6
% 1.94/2.31 ) ==> cartesian_product2( skol6, skol4 ) }.
% 1.94/2.31 parent0: (8467) {G0,W7,D3,L1,V0,M1} { cartesian_product2( skol4, skol6 ) =
% 1.94/2.31 cartesian_product2( skol6, skol4 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (13) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> empty_set }.
% 1.94/2.31 parent0: (8468) {G0,W3,D2,L1,V0,M1} { ! skol4 = empty_set }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (14) {G0,W3,D2,L1,V0,M1} I { ! skol6 ==> empty_set }.
% 1.94/2.31 parent0: (8469) {G0,W3,D2,L1,V0,M1} { ! skol6 = empty_set }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8521) {G0,W3,D2,L1,V0,M1} { ! skol6 = skol4 }.
% 1.94/2.31 parent0[0]: (8470) {G0,W3,D2,L1,V0,M1} { ! skol4 = skol6 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { ! skol6 ==> skol4 }.
% 1.94/2.31 parent0: (8521) {G0,W3,D2,L1,V0,M1} { ! skol6 = skol4 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (16) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ),
% 1.94/2.31 in( skol5( X, Y ), Y ), X = Y }.
% 1.94/2.31 parent0: (8471) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), in(
% 1.94/2.31 skol5( X, Y ), Y ), X = Y }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 2 ==> 2
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (17) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), !
% 1.94/2.31 in( skol5( X, Y ), X ), X = Y }.
% 1.94/2.31 parent0: (8472) {G0,W14,D3,L3,V2,M3} { alpha1( X, Y, skol5( X, Y ) ), ! in
% 1.94/2.31 ( skol5( X, Y ), X ), X = Y }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 2 ==> 2
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 1.94/2.31 }.
% 1.94/2.31 parent0: (8473) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), in( Z, X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := Z
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (19) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 1.94/2.31 }.
% 1.94/2.31 parent0: (8474) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 1.94/2.31 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := Z
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8566) {G0,W3,D2,L1,V0,M1} { ! empty_set ==> skol4 }.
% 1.94/2.31 parent0[0]: (13) {G0,W3,D2,L1,V0,M1} I { ! skol4 ==> empty_set }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 paramod: (8570) {G1,W7,D3,L2,V0,M2} { ! empty_set ==> empty_set, in( skol1
% 1.94/2.31 ( skol4 ), skol4 ) }.
% 1.94/2.31 parent0[1]: (3) {G0,W7,D3,L2,V1,M2} I { in( skol1( X ), X ), X = empty_set
% 1.94/2.31 }.
% 1.94/2.31 parent1[0; 3]: (8566) {G0,W3,D2,L1,V0,M1} { ! empty_set ==> skol4 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol4
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqrefl: (8620) {G0,W4,D3,L1,V0,M1} { in( skol1( skol4 ), skol4 ) }.
% 1.94/2.31 parent0[0]: (8570) {G1,W7,D3,L2,V0,M2} { ! empty_set ==> empty_set, in(
% 1.94/2.31 skol1( skol4 ), skol4 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (38) {G1,W4,D3,L1,V0,M1} P(3,13);q { in( skol1( skol4 ), skol4
% 1.94/2.31 ) }.
% 1.94/2.31 parent0: (8620) {G0,W4,D3,L1,V0,M1} { in( skol1( skol4 ), skol4 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8622) {G0,W3,D2,L1,V0,M1} { ! empty_set ==> skol6 }.
% 1.94/2.31 parent0[0]: (14) {G0,W3,D2,L1,V0,M1} I { ! skol6 ==> empty_set }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 paramod: (8626) {G1,W7,D3,L2,V0,M2} { ! empty_set ==> empty_set, in( skol1
% 1.94/2.31 ( skol6 ), skol6 ) }.
% 1.94/2.31 parent0[1]: (3) {G0,W7,D3,L2,V1,M2} I { in( skol1( X ), X ), X = empty_set
% 1.94/2.31 }.
% 1.94/2.31 parent1[0; 3]: (8622) {G0,W3,D2,L1,V0,M1} { ! empty_set ==> skol6 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol6
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqrefl: (8676) {G0,W4,D3,L1,V0,M1} { in( skol1( skol6 ), skol6 ) }.
% 1.94/2.31 parent0[0]: (8626) {G1,W7,D3,L2,V0,M2} { ! empty_set ==> empty_set, in(
% 1.94/2.31 skol1( skol6 ), skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (39) {G1,W4,D3,L1,V0,M1} P(3,14);q { in( skol1( skol6 ), skol6
% 1.94/2.31 ) }.
% 1.94/2.31 parent0: (8676) {G0,W4,D3,L1,V0,M1} { in( skol1( skol6 ), skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8677) {G1,W11,D4,L2,V2,M2} { ! in( X, Y ), in( ordered_pair(
% 1.94/2.31 skol1( skol6 ), X ), cartesian_product2( skol6, Y ) ) }.
% 1.94/2.31 parent0[0]: (9) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 1.94/2.31 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 1.94/2.31 parent1[0]: (39) {G1,W4,D3,L1,V0,M1} P(3,14);q { in( skol1( skol6 ), skol6
% 1.94/2.31 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol1( skol6 )
% 1.94/2.31 Y := X
% 1.94/2.31 Z := skol6
% 1.94/2.31 T := Y
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (96) {G2,W11,D4,L2,V2,M2} R(9,39) { ! in( X, Y ), in(
% 1.94/2.31 ordered_pair( skol1( skol6 ), X ), cartesian_product2( skol6, Y ) ) }.
% 1.94/2.31 parent0: (8677) {G1,W11,D4,L2,V2,M2} { ! in( X, Y ), in( ordered_pair(
% 1.94/2.31 skol1( skol6 ), X ), cartesian_product2( skol6, Y ) ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8680) {G1,W11,D4,L2,V2,M2} { ! in( X, Y ), in( ordered_pair(
% 1.94/2.31 X, skol1( skol4 ) ), cartesian_product2( Y, skol4 ) ) }.
% 1.94/2.31 parent0[1]: (9) {G0,W13,D3,L3,V4,M3} I { ! in( X, Z ), ! in( Y, T ), in(
% 1.94/2.31 ordered_pair( X, Y ), cartesian_product2( Z, T ) ) }.
% 1.94/2.31 parent1[0]: (38) {G1,W4,D3,L1,V0,M1} P(3,13);q { in( skol1( skol4 ), skol4
% 1.94/2.31 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := skol1( skol4 )
% 1.94/2.31 Z := Y
% 1.94/2.31 T := skol4
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (99) {G2,W11,D4,L2,V2,M2} R(9,38) { ! in( X, Y ), in(
% 1.94/2.31 ordered_pair( X, skol1( skol4 ) ), cartesian_product2( Y, skol4 ) ) }.
% 1.94/2.31 parent0: (8680) {G1,W11,D4,L2,V2,M2} { ! in( X, Y ), in( ordered_pair( X,
% 1.94/2.31 skol1( skol4 ) ), cartesian_product2( Y, skol4 ) ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 paramod: (8682) {G1,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( skol6, skol4 ) ), in( Y, skol6 ) }.
% 1.94/2.31 parent0[0]: (12) {G0,W7,D3,L1,V0,M1} I { cartesian_product2( skol4, skol6 )
% 1.94/2.31 ==> cartesian_product2( skol6, skol4 ) }.
% 1.94/2.31 parent1[0; 5]: (8) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( Y, T ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := skol4
% 1.94/2.31 T := skol6
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (121) {G1,W10,D3,L2,V2,M2} P(12,8) { ! in( ordered_pair( X, Y
% 1.94/2.31 ), cartesian_product2( skol6, skol4 ) ), in( Y, skol6 ) }.
% 1.94/2.31 parent0: (8682) {G1,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( skol6, skol4 ) ), in( Y, skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 paramod: (8684) {G1,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( skol6, skol4 ) ), in( X, skol4 ) }.
% 1.94/2.31 parent0[0]: (12) {G0,W7,D3,L1,V0,M1} I { cartesian_product2( skol4, skol6 )
% 1.94/2.31 ==> cartesian_product2( skol6, skol4 ) }.
% 1.94/2.31 parent1[0; 5]: (7) {G0,W10,D3,L2,V4,M2} I { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( Z, T ) ), in( X, Z ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := skol4
% 1.94/2.31 T := skol6
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (122) {G1,W10,D3,L2,V2,M2} P(12,7) { ! in( ordered_pair( X, Y
% 1.94/2.31 ), cartesian_product2( skol6, skol4 ) ), in( X, skol4 ) }.
% 1.94/2.31 parent0: (8684) {G1,W10,D3,L2,V2,M2} { ! in( ordered_pair( X, Y ),
% 1.94/2.31 cartesian_product2( skol6, skol4 ) ), in( X, skol4 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8685) {G0,W14,D3,L3,V2,M3} { Y = X, alpha1( X, Y, skol5( X, Y ) )
% 1.94/2.31 , in( skol5( X, Y ), Y ) }.
% 1.94/2.31 parent0[2]: (16) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), in
% 1.94/2.31 ( skol5( X, Y ), Y ), X = Y }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8686) {G1,W13,D3,L3,V2,M3} { in( skol5( X, Y ), X ), Y = X,
% 1.94/2.31 in( skol5( X, Y ), Y ) }.
% 1.94/2.31 parent0[0]: (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 1.94/2.31 }.
% 1.94/2.31 parent1[1]: (8685) {G0,W14,D3,L3,V2,M3} { Y = X, alpha1( X, Y, skol5( X, Y
% 1.94/2.31 ) ), in( skol5( X, Y ), Y ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := skol5( X, Y )
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8687) {G1,W13,D3,L3,V2,M3} { Y = X, in( skol5( Y, X ), Y ), in(
% 1.94/2.31 skol5( Y, X ), X ) }.
% 1.94/2.31 parent0[1]: (8686) {G1,W13,D3,L3,V2,M3} { in( skol5( X, Y ), X ), Y = X,
% 1.94/2.31 in( skol5( X, Y ), Y ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := Y
% 1.94/2.31 Y := X
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (149) {G1,W13,D3,L3,V2,M3} R(16,18) { in( skol5( X, Y ), Y ),
% 1.94/2.31 X = Y, in( skol5( X, Y ), X ) }.
% 1.94/2.31 parent0: (8687) {G1,W13,D3,L3,V2,M3} { Y = X, in( skol5( Y, X ), Y ), in(
% 1.94/2.31 skol5( Y, X ), X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := Y
% 1.94/2.31 Y := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 1
% 1.94/2.31 1 ==> 2
% 1.94/2.31 2 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8689) {G2,W6,D2,L2,V1,M2} { in( X, skol6 ), ! in( X, skol4 )
% 1.94/2.31 }.
% 1.94/2.31 parent0[0]: (121) {G1,W10,D3,L2,V2,M2} P(12,8) { ! in( ordered_pair( X, Y )
% 1.94/2.31 , cartesian_product2( skol6, skol4 ) ), in( Y, skol6 ) }.
% 1.94/2.31 parent1[1]: (96) {G2,W11,D4,L2,V2,M2} R(9,39) { ! in( X, Y ), in(
% 1.94/2.31 ordered_pair( skol1( skol6 ), X ), cartesian_product2( skol6, Y ) ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol1( skol6 )
% 1.94/2.31 Y := X
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := X
% 1.94/2.31 Y := skol4
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (5987) {G3,W6,D2,L2,V1,M2} R(121,96) { in( X, skol6 ), ! in( X
% 1.94/2.31 , skol4 ) }.
% 1.94/2.31 parent0: (8689) {G2,W6,D2,L2,V1,M2} { in( X, skol6 ), ! in( X, skol4 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8690) {G2,W6,D2,L2,V1,M2} { in( X, skol4 ), ! in( X, skol6 )
% 1.94/2.31 }.
% 1.94/2.31 parent0[0]: (122) {G1,W10,D3,L2,V2,M2} P(12,7) { ! in( ordered_pair( X, Y )
% 1.94/2.31 , cartesian_product2( skol6, skol4 ) ), in( X, skol4 ) }.
% 1.94/2.31 parent1[1]: (99) {G2,W11,D4,L2,V2,M2} R(9,38) { ! in( X, Y ), in(
% 1.94/2.31 ordered_pair( X, skol1( skol4 ) ), cartesian_product2( Y, skol4 ) ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := skol1( skol4 )
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := X
% 1.94/2.31 Y := skol6
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (6135) {G3,W6,D2,L2,V1,M2} R(122,99) { in( X, skol4 ), ! in( X
% 1.94/2.31 , skol6 ) }.
% 1.94/2.31 parent0: (8690) {G2,W6,D2,L2,V1,M2} { in( X, skol4 ), ! in( X, skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8691) {G1,W7,D2,L2,V2,M2} { in( X, skol4 ), ! alpha1( skol6,
% 1.94/2.31 Y, X ) }.
% 1.94/2.31 parent0[1]: (6135) {G3,W6,D2,L2,V1,M2} R(122,99) { in( X, skol4 ), ! in( X
% 1.94/2.31 , skol6 ) }.
% 1.94/2.31 parent1[1]: (18) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), in( Z, X )
% 1.94/2.31 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := skol6
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := X
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (6362) {G4,W7,D2,L2,V2,M2} R(6135,18) { in( X, skol4 ), !
% 1.94/2.31 alpha1( skol6, Y, X ) }.
% 1.94/2.31 parent0: (8691) {G1,W7,D2,L2,V2,M2} { in( X, skol4 ), ! alpha1( skol6, Y,
% 1.94/2.31 X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8692) {G1,W8,D2,L2,V3,M2} { ! alpha1( X, skol4, Y ), ! alpha1
% 1.94/2.31 ( skol6, Z, Y ) }.
% 1.94/2.31 parent0[1]: (19) {G0,W7,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! in( Z, Y )
% 1.94/2.31 }.
% 1.94/2.31 parent1[0]: (6362) {G4,W7,D2,L2,V2,M2} R(6135,18) { in( X, skol4 ), !
% 1.94/2.31 alpha1( skol6, Y, X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := skol4
% 1.94/2.31 Z := Y
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := Y
% 1.94/2.31 Y := Z
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (6699) {G5,W8,D2,L2,V3,M2} R(6362,19) { ! alpha1( skol6, X, Y
% 1.94/2.31 ), ! alpha1( Z, skol4, Y ) }.
% 1.94/2.31 parent0: (8692) {G1,W8,D2,L2,V3,M2} { ! alpha1( X, skol4, Y ), ! alpha1(
% 1.94/2.31 skol6, Z, Y ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := Z
% 1.94/2.31 Y := Y
% 1.94/2.31 Z := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 1
% 1.94/2.31 1 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 factor: (8694) {G5,W4,D2,L1,V1,M1} { ! alpha1( skol6, skol4, X ) }.
% 1.94/2.31 parent0[0, 1]: (6699) {G5,W8,D2,L2,V3,M2} R(6362,19) { ! alpha1( skol6, X,
% 1.94/2.31 Y ), ! alpha1( Z, skol4, Y ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol4
% 1.94/2.31 Y := X
% 1.94/2.31 Z := skol6
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (6700) {G6,W4,D2,L1,V1,M1} F(6699) { ! alpha1( skol6, skol4, X
% 1.94/2.31 ) }.
% 1.94/2.31 parent0: (8694) {G5,W4,D2,L1,V1,M1} { ! alpha1( skol6, skol4, X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8695) {G0,W14,D3,L3,V2,M3} { Y = X, alpha1( X, Y, skol5( X, Y ) )
% 1.94/2.31 , ! in( skol5( X, Y ), X ) }.
% 1.94/2.31 parent0[2]: (17) {G0,W14,D3,L3,V2,M3} I { alpha1( X, Y, skol5( X, Y ) ), !
% 1.94/2.31 in( skol5( X, Y ), X ), X = Y }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8696) {G1,W8,D3,L2,V0,M2} { skol4 = skol6, ! in( skol5( skol6
% 1.94/2.31 , skol4 ), skol6 ) }.
% 1.94/2.31 parent0[0]: (6700) {G6,W4,D2,L1,V1,M1} F(6699) { ! alpha1( skol6, skol4, X
% 1.94/2.31 ) }.
% 1.94/2.31 parent1[1]: (8695) {G0,W14,D3,L3,V2,M3} { Y = X, alpha1( X, Y, skol5( X, Y
% 1.94/2.31 ) ), ! in( skol5( X, Y ), X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol5( skol6, skol4 )
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := skol6
% 1.94/2.31 Y := skol4
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8697) {G1,W8,D3,L2,V0,M2} { skol6 = skol4, ! in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ) }.
% 1.94/2.31 parent0[0]: (8696) {G1,W8,D3,L2,V0,M2} { skol4 = skol6, ! in( skol5( skol6
% 1.94/2.31 , skol4 ), skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (6708) {G7,W8,D3,L2,V0,M2} R(6700,17) { ! in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ), skol6 ==> skol4 }.
% 1.94/2.31 parent0: (8697) {G1,W8,D3,L2,V0,M2} { skol6 = skol4, ! in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 1
% 1.94/2.31 1 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8698) {G1,W13,D3,L3,V2,M3} { Y = X, in( skol5( X, Y ), Y ), in(
% 1.94/2.31 skol5( X, Y ), X ) }.
% 1.94/2.31 parent0[1]: (149) {G1,W13,D3,L3,V2,M3} R(16,18) { in( skol5( X, Y ), Y ), X
% 1.94/2.31 = Y, in( skol5( X, Y ), X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 Y := Y
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8699) {G2,W13,D3,L3,V1,M3} { in( skol5( X, skol4 ), skol6 ),
% 1.94/2.31 skol4 = X, in( skol5( X, skol4 ), X ) }.
% 1.94/2.31 parent0[1]: (5987) {G3,W6,D2,L2,V1,M2} R(121,96) { in( X, skol6 ), ! in( X
% 1.94/2.31 , skol4 ) }.
% 1.94/2.31 parent1[1]: (8698) {G1,W13,D3,L3,V2,M3} { Y = X, in( skol5( X, Y ), Y ),
% 1.94/2.31 in( skol5( X, Y ), X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol5( X, skol4 )
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 X := X
% 1.94/2.31 Y := skol4
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8702) {G2,W13,D3,L3,V1,M3} { X = skol4, in( skol5( X, skol4 ),
% 1.94/2.31 skol6 ), in( skol5( X, skol4 ), X ) }.
% 1.94/2.31 parent0[1]: (8699) {G2,W13,D3,L3,V1,M3} { in( skol5( X, skol4 ), skol6 ),
% 1.94/2.31 skol4 = X, in( skol5( X, skol4 ), X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (7889) {G4,W13,D3,L3,V1,M3} R(149,5987) { X = skol4, in( skol5
% 1.94/2.31 ( X, skol4 ), X ), in( skol5( X, skol4 ), skol6 ) }.
% 1.94/2.31 parent0: (8702) {G2,W13,D3,L3,V1,M3} { X = skol4, in( skol5( X, skol4 ),
% 1.94/2.31 skol6 ), in( skol5( X, skol4 ), X ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := X
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 1 ==> 2
% 1.94/2.31 2 ==> 1
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8708) {G7,W8,D3,L2,V0,M2} { skol4 ==> skol6, ! in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ) }.
% 1.94/2.31 parent0[1]: (6708) {G7,W8,D3,L2,V0,M2} R(6700,17) { ! in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ), skol6 ==> skol4 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 factor: (8710) {G4,W8,D3,L2,V0,M2} { skol6 = skol4, in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ) }.
% 1.94/2.31 parent0[1, 2]: (7889) {G4,W13,D3,L3,V1,M3} R(149,5987) { X = skol4, in(
% 1.94/2.31 skol5( X, skol4 ), X ), in( skol5( X, skol4 ), skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 X := skol6
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 resolution: (8711) {G5,W6,D2,L2,V0,M2} { skol4 ==> skol6, skol6 = skol4
% 1.94/2.31 }.
% 1.94/2.31 parent0[1]: (8708) {G7,W8,D3,L2,V0,M2} { skol4 ==> skol6, ! in( skol5(
% 1.94/2.31 skol6, skol4 ), skol6 ) }.
% 1.94/2.31 parent1[1]: (8710) {G4,W8,D3,L2,V0,M2} { skol6 = skol4, in( skol5( skol6,
% 1.94/2.31 skol4 ), skol6 ) }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqswap: (8712) {G5,W6,D2,L2,V0,M2} { skol6 ==> skol4, skol6 = skol4 }.
% 1.94/2.31 parent0[0]: (8711) {G5,W6,D2,L2,V0,M2} { skol4 ==> skol6, skol6 = skol4
% 1.94/2.31 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 factor: (8715) {G5,W3,D2,L1,V0,M1} { skol6 ==> skol4 }.
% 1.94/2.31 parent0[0, 1]: (8712) {G5,W6,D2,L2,V0,M2} { skol6 ==> skol4, skol6 = skol4
% 1.94/2.31 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (8450) {G8,W3,D2,L1,V0,M1} F(7889);r(6708) { skol6 ==> skol4
% 1.94/2.31 }.
% 1.94/2.31 parent0: (8715) {G5,W3,D2,L1,V0,M1} { skol6 ==> skol4 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 0 ==> 0
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 paramod: (8719) {G1,W3,D2,L1,V0,M1} { ! skol4 ==> skol4 }.
% 1.94/2.31 parent0[0]: (8450) {G8,W3,D2,L1,V0,M1} F(7889);r(6708) { skol6 ==> skol4
% 1.94/2.31 }.
% 1.94/2.31 parent1[0; 2]: (15) {G0,W3,D2,L1,V0,M1} I { ! skol6 ==> skol4 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 substitution1:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 eqrefl: (8720) {G0,W0,D0,L0,V0,M0} { }.
% 1.94/2.31 parent0[0]: (8719) {G1,W3,D2,L1,V0,M1} { ! skol4 ==> skol4 }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 subsumption: (8453) {G9,W0,D0,L0,V0,M0} S(15);d(8450);q { }.
% 1.94/2.31 parent0: (8720) {G0,W0,D0,L0,V0,M0} { }.
% 1.94/2.31 substitution0:
% 1.94/2.31 end
% 1.94/2.31 permutation0:
% 1.94/2.31 end
% 1.94/2.31
% 1.94/2.31 Proof check complete!
% 1.94/2.31
% 1.94/2.31 Memory use:
% 1.94/2.31
% 1.94/2.31 space for terms: 115390
% 1.94/2.31 space for clauses: 434835
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 clauses generated: 57287
% 1.94/2.31 clauses kept: 8454
% 1.94/2.31 clauses selected: 474
% 1.94/2.31 clauses deleted: 204
% 1.94/2.31 clauses inuse deleted: 187
% 1.94/2.31
% 1.94/2.31 subsentry: 191644
% 1.94/2.31 literals s-matched: 114160
% 1.94/2.31 literals matched: 110952
% 1.94/2.31 full subsumption: 27368
% 1.94/2.31
% 1.94/2.31 checksum: -1540821194
% 1.94/2.31
% 1.94/2.31
% 1.94/2.31 Bliksem ended
%------------------------------------------------------------------------------