%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET901+1 : 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 : Mon Jul 18 22:53:13 EDT 2022
% Result : Theorem 0.44s 1.13s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET901+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n005.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 : Sun Jul 10 13:51:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.13 *** allocated 10000 integers for termspace/termends
% 0.44/1.13 *** allocated 10000 integers for clauses
% 0.44/1.13 *** allocated 10000 integers for justifications
% 0.44/1.13 Bliksem 1.12
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 Automatic Strategy Selection
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 Clauses:
% 0.44/1.13
% 0.44/1.13 { unordered_pair( X, Y ) = unordered_pair( Y, X ) }.
% 0.44/1.13 { subset( X, X ) }.
% 0.44/1.13 { empty( empty_set ) }.
% 0.44/1.13 { empty( skol1 ) }.
% 0.44/1.13 { ! empty( skol2 ) }.
% 0.44/1.13 { alpha5( skol3, skol4, skol5 ), skol3 = empty_set, ! alpha1( skol3, skol4
% 0.44/1.13 , skol5 ) }.
% 0.44/1.13 { alpha5( skol3, skol4, skol5 ), ! subset( skol3, unordered_pair( skol4,
% 0.44/1.13 skol5 ) ) }.
% 0.44/1.13 { ! alpha5( X, Y, Z ), subset( X, unordered_pair( Y, Z ) ) }.
% 0.44/1.13 { ! alpha5( X, Y, Z ), ! X = empty_set }.
% 0.44/1.13 { ! alpha5( X, Y, Z ), alpha1( X, Y, Z ) }.
% 0.44/1.13 { ! subset( X, unordered_pair( Y, Z ) ), X = empty_set, ! alpha1( X, Y, Z )
% 0.44/1.13 , alpha5( X, Y, Z ) }.
% 0.44/1.13 { ! alpha1( X, Y, Z ), ! X = singleton( Y ) }.
% 0.44/1.13 { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.13 { X = singleton( Y ), ! alpha3( X, Y, Z ), alpha1( X, Y, Z ) }.
% 0.44/1.13 { ! alpha3( X, Y, Z ), ! X = singleton( Z ) }.
% 0.44/1.13 { ! alpha3( X, Y, Z ), ! X = unordered_pair( Y, Z ) }.
% 0.44/1.13 { X = singleton( Z ), X = unordered_pair( Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.13 { ! subset( X, unordered_pair( Y, Z ) ), X = empty_set, ! alpha2( X, Y, Z )
% 0.44/1.13 }.
% 0.44/1.13 { ! X = empty_set, subset( X, unordered_pair( Y, Z ) ) }.
% 0.44/1.13 { alpha2( X, Y, Z ), subset( X, unordered_pair( Y, Z ) ) }.
% 0.44/1.13 { ! alpha2( X, Y, Z ), ! X = singleton( Y ) }.
% 0.44/1.13 { ! alpha2( X, Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.13 { X = singleton( Y ), ! alpha4( X, Y, Z ), alpha2( X, Y, Z ) }.
% 0.44/1.13 { ! alpha4( X, Y, Z ), ! X = singleton( Z ) }.
% 0.44/1.13 { ! alpha4( X, Y, Z ), ! X = unordered_pair( Y, Z ) }.
% 0.44/1.13 { X = singleton( Z ), X = unordered_pair( Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.13
% 0.44/1.13 percentage equality = 0.327273, percentage horn = 0.730769
% 0.44/1.13 This is a problem with some equality
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 Options Used:
% 0.44/1.13
% 0.44/1.13 useres = 1
% 0.44/1.13 useparamod = 1
% 0.44/1.13 useeqrefl = 1
% 0.44/1.13 useeqfact = 1
% 0.44/1.13 usefactor = 1
% 0.44/1.13 usesimpsplitting = 0
% 0.44/1.13 usesimpdemod = 5
% 0.44/1.13 usesimpres = 3
% 0.44/1.13
% 0.44/1.13 resimpinuse = 1000
% 0.44/1.13 resimpclauses = 20000
% 0.44/1.13 substype = eqrewr
% 0.44/1.13 backwardsubs = 1
% 0.44/1.13 selectoldest = 5
% 0.44/1.13
% 0.44/1.13 litorderings [0] = split
% 0.44/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.44/1.13
% 0.44/1.13 termordering = kbo
% 0.44/1.13
% 0.44/1.13 litapriori = 0
% 0.44/1.13 termapriori = 1
% 0.44/1.13 litaposteriori = 0
% 0.44/1.13 termaposteriori = 0
% 0.44/1.13 demodaposteriori = 0
% 0.44/1.13 ordereqreflfact = 0
% 0.44/1.13
% 0.44/1.13 litselect = negord
% 0.44/1.13
% 0.44/1.13 maxweight = 15
% 0.44/1.13 maxdepth = 30000
% 0.44/1.13 maxlength = 115
% 0.44/1.13 maxnrvars = 195
% 0.44/1.13 excuselevel = 1
% 0.44/1.13 increasemaxweight = 1
% 0.44/1.13
% 0.44/1.13 maxselected = 10000000
% 0.44/1.13 maxnrclauses = 10000000
% 0.44/1.13
% 0.44/1.13 showgenerated = 0
% 0.44/1.13 showkept = 0
% 0.44/1.13 showselected = 0
% 0.44/1.13 showdeleted = 0
% 0.44/1.13 showresimp = 1
% 0.44/1.13 showstatus = 2000
% 0.44/1.13
% 0.44/1.13 prologoutput = 0
% 0.44/1.13 nrgoals = 5000000
% 0.44/1.13 totalproof = 1
% 0.44/1.13
% 0.44/1.13 Symbols occurring in the translation:
% 0.44/1.13
% 0.44/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.13 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.13 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.44/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.13 unordered_pair [37, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.44/1.13 subset [38, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.13 empty_set [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.44/1.13 empty [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.13 singleton [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.13 alpha1 [43, 3] (w:1, o:48, a:1, s:1, b:1),
% 0.44/1.13 alpha2 [44, 3] (w:1, o:49, a:1, s:1, b:1),
% 0.44/1.13 alpha3 [45, 3] (w:1, o:50, a:1, s:1, b:1),
% 0.44/1.13 alpha4 [46, 3] (w:1, o:51, a:1, s:1, b:1),
% 0.44/1.13 alpha5 [47, 3] (w:1, o:52, a:1, s:1, b:1),
% 0.44/1.13 skol1 [48, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.44/1.13 skol2 [49, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.44/1.13 skol3 [50, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.44/1.13 skol4 [51, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.44/1.13 skol5 [52, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 Starting Search:
% 0.44/1.13
% 0.44/1.13 *** allocated 15000 integers for clauses
% 0.44/1.13 *** allocated 22500 integers for clauses
% 0.44/1.13 *** allocated 33750 integers for clauses
% 0.44/1.13 *** allocated 15000 integers for termspace/termends
% 0.44/1.13 *** allocated 50625 integers for clauses
% 0.44/1.13
% 0.44/1.13 Bliksems!, er is een bewijs:
% 0.44/1.13 % SZS status Theorem
% 0.44/1.13 % SZS output start Refutation
% 0.44/1.13
% 0.44/1.13 (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) = unordered_pair( Y, X )
% 0.44/1.13 }.
% 0.44/1.13 (1) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.44/1.13 (5) {G0,W11,D2,L3,V0,M3} I { alpha5( skol3, skol4, skol5 ), skol3 ==>
% 0.44/1.13 empty_set, ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.13 (6) {G0,W9,D3,L2,V0,M2} I { alpha5( skol3, skol4, skol5 ), ! subset( skol3
% 0.44/1.13 , unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.13 (7) {G0,W9,D3,L2,V3,M2} I { ! alpha5( X, Y, Z ), subset( X, unordered_pair
% 0.44/1.13 ( Y, Z ) ) }.
% 0.44/1.13 (8) {G0,W7,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), ! X = empty_set }.
% 0.44/1.13 (9) {G0,W8,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), alpha1( X, Y, Z ) }.
% 0.44/1.13 (11) {G0,W8,D3,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! X = singleton( Y ) }.
% 0.44/1.13 (12) {G0,W8,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.13 (13) {G0,W12,D3,L3,V3,M3} I { X = singleton( Y ), ! alpha3( X, Y, Z ),
% 0.44/1.13 alpha1( X, Y, Z ) }.
% 0.44/1.13 (14) {G0,W8,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), ! X = singleton( Z ) }.
% 0.44/1.13 (15) {G0,W9,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), ! X = unordered_pair( Y,
% 0.44/1.13 Z ) }.
% 0.44/1.13 (16) {G0,W13,D3,L3,V3,M3} I { X = singleton( Z ), X = unordered_pair( Y, Z
% 0.44/1.13 ), alpha3( X, Y, Z ) }.
% 0.44/1.13 (17) {G0,W12,D3,L3,V3,M3} I { ! subset( X, unordered_pair( Y, Z ) ), X =
% 0.44/1.13 empty_set, ! alpha2( X, Y, Z ) }.
% 0.44/1.13 (18) {G0,W8,D3,L2,V3,M2} I { ! X = empty_set, subset( X, unordered_pair( Y
% 0.44/1.13 , Z ) ) }.
% 0.44/1.13 (19) {G0,W9,D3,L2,V3,M2} I { alpha2( X, Y, Z ), subset( X, unordered_pair(
% 0.44/1.13 Y, Z ) ) }.
% 0.44/1.13 (20) {G0,W8,D3,L2,V3,M2} I { ! alpha2( X, Y, Z ), ! X = singleton( Y ) }.
% 0.44/1.13 (21) {G0,W8,D2,L2,V3,M2} I { ! alpha2( X, Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.13 (22) {G0,W12,D3,L3,V3,M3} I { X = singleton( Y ), ! alpha4( X, Y, Z ),
% 0.44/1.13 alpha2( X, Y, Z ) }.
% 0.44/1.13 (23) {G0,W8,D3,L2,V3,M2} I { ! alpha4( X, Y, Z ), ! X = singleton( Z ) }.
% 0.44/1.13 (24) {G0,W9,D3,L2,V3,M2} I { ! alpha4( X, Y, Z ), ! X = unordered_pair( Y,
% 0.44/1.13 Z ) }.
% 0.44/1.13 (25) {G0,W13,D3,L3,V3,M3} I { X = singleton( Z ), X = unordered_pair( Y, Z
% 0.44/1.13 ), alpha4( X, Y, Z ) }.
% 0.44/1.13 (30) {G1,W15,D3,L3,V3,M3} E(16) { ! unordered_pair( Y, X ) ==> singleton( X
% 0.44/1.13 ), Z = unordered_pair( Y, X ), alpha3( Z, Y, X ) }.
% 0.44/1.13 (36) {G1,W15,D3,L3,V3,M3} E(25) { ! unordered_pair( Y, X ) ==> singleton( X
% 0.44/1.13 ), Z = unordered_pair( Y, X ), alpha4( Z, Y, X ) }.
% 0.44/1.13 (39) {G1,W3,D2,L1,V0,M1} R(6,8);r(18) { ! skol3 ==> empty_set }.
% 0.44/1.13 (42) {G2,W8,D2,L2,V0,M2} R(39,5) { alpha5( skol3, skol4, skol5 ), ! alpha1
% 0.44/1.13 ( skol3, skol4, skol5 ) }.
% 0.44/1.13 (51) {G1,W8,D2,L2,V3,M2} R(9,12) { ! alpha5( X, Y, Z ), alpha3( X, Y, Z )
% 0.44/1.13 }.
% 0.44/1.13 (68) {G1,W8,D3,L2,V3,M2} R(11,9) { ! X = singleton( Y ), ! alpha5( X, Y, Z
% 0.44/1.13 ) }.
% 0.44/1.13 (71) {G1,W8,D3,L2,V3,M2} R(23,21) { ! X = singleton( Y ), ! alpha2( X, Z, Y
% 0.44/1.13 ) }.
% 0.44/1.13 (117) {G2,W8,D3,L2,V3,M2} R(14,51) { ! X = singleton( Y ), ! alpha5( X, Z,
% 0.44/1.13 Y ) }.
% 0.44/1.13 (334) {G1,W8,D2,L2,V0,M2} R(19,6) { alpha2( skol3, skol4, skol5 ), alpha5(
% 0.44/1.13 skol3, skol4, skol5 ) }.
% 0.44/1.13 (352) {G3,W4,D3,L1,V0,M1} R(334,117);r(71) { ! singleton( skol5 ) ==> skol3
% 0.44/1.13 }.
% 0.44/1.13 (353) {G2,W4,D3,L1,V0,M1} R(334,20);r(68) { ! singleton( skol4 ) ==> skol3
% 0.44/1.13 }.
% 0.44/1.13 (354) {G2,W8,D2,L2,V0,M2} R(334,51) { alpha2( skol3, skol4, skol5 ), alpha3
% 0.44/1.13 ( skol3, skol4, skol5 ) }.
% 0.44/1.13 (362) {G4,W12,D3,L3,V2,M3} P(16,352) { ! X = skol3, X = unordered_pair( Y,
% 0.44/1.13 skol5 ), alpha3( X, Y, skol5 ) }.
% 0.44/1.13 (370) {G5,W9,D3,L2,V1,M2} Q(362) { unordered_pair( X, skol5 ) ==> skol3,
% 0.44/1.13 alpha3( skol3, X, skol5 ) }.
% 0.44/1.13 (383) {G4,W11,D2,L3,V2,M3} P(22,352) { ! X = skol3, ! alpha4( X, skol5, Y )
% 0.44/1.13 , alpha2( X, skol5, Y ) }.
% 0.44/1.13 (446) {G5,W8,D2,L2,V1,M2} Q(383) { ! alpha4( skol3, skol5, X ), alpha2(
% 0.44/1.13 skol3, skol5, X ) }.
% 0.44/1.13 (460) {G3,W11,D2,L3,V2,M3} P(13,353) { ! X = skol3, ! alpha3( X, skol4, Y )
% 0.44/1.13 , alpha1( X, skol4, Y ) }.
% 0.44/1.13 (462) {G4,W8,D2,L2,V1,M2} Q(460) { ! alpha3( skol3, skol4, X ), alpha1(
% 0.44/1.13 skol3, skol4, X ) }.
% 0.44/1.13 (481) {G1,W9,D3,L2,V3,M2} R(24,21) { ! X = unordered_pair( Y, Z ), ! alpha2
% 0.44/1.13 ( X, Y, Z ) }.
% 0.44/1.13 (528) {G3,W12,D3,L3,V2,M3} P(25,353) { ! X = skol3, X = unordered_pair( Y,
% 0.44/1.13 skol4 ), alpha4( X, Y, skol4 ) }.
% 0.44/1.13 (637) {G4,W9,D3,L2,V1,M2} Q(528) { unordered_pair( X, skol4 ) ==> skol3,
% 0.44/1.13 alpha4( skol3, X, skol4 ) }.
% 0.44/1.13 (640) {G5,W8,D2,L2,V0,M2} R(462,42) { ! alpha3( skol3, skol4, skol5 ),
% 0.44/1.13 alpha5( skol3, skol4, skol5 ) }.
% 0.44/1.13 (657) {G6,W7,D2,L2,V0,M2} R(354,17);d(370);r(1) { alpha3( skol3, skol4,
% 0.44/1.13 skol5 ), skol3 ==> empty_set }.
% 0.44/1.13 (658) {G3,W5,D3,L1,V0,M1} R(354,15);r(481) { ! unordered_pair( skol4, skol5
% 0.44/1.13 ) ==> skol3 }.
% 0.44/1.13 (662) {G4,W13,D3,L3,V1,M3} P(30,658) { ! X = skol3, ! unordered_pair( skol4
% 0.44/1.13 , skol5 ) ==> singleton( skol5 ), alpha3( X, skol4, skol5 ) }.
% 0.44/1.13 (677) {G4,W11,D3,L3,V1,M3} P(16,658) { ! X = skol3, X = singleton( skol5 )
% 0.44/1.13 , alpha3( X, skol4, skol5 ) }.
% 0.44/1.13 (682) {G4,W5,D3,L1,V0,M1} P(0,658) { ! unordered_pair( skol5, skol4 ) ==>
% 0.44/1.13 skol3 }.
% 0.44/1.13 (683) {G7,W8,D3,L2,V0,M2} Q(677);d(657) { alpha3( skol3, skol4, skol5 ),
% 0.44/1.13 singleton( skol5 ) ==> empty_set }.
% 0.44/1.13 (685) {G8,W4,D2,L1,V0,M1} Q(662);d(370);d(657);d(683);q { alpha3( skol3,
% 0.44/1.13 skol4, skol5 ) }.
% 0.44/1.13 (686) {G9,W4,D2,L1,V0,M1} R(685,640) { alpha5( skol3, skol4, skol5 ) }.
% 0.44/1.13 (688) {G10,W5,D3,L1,V0,M1} R(686,7) { subset( skol3, unordered_pair( skol4
% 0.44/1.13 , skol5 ) ) }.
% 0.44/1.13 (733) {G11,W5,D3,L1,V0,M1} P(0,688) { subset( skol3, unordered_pair( skol5
% 0.44/1.13 , skol4 ) ) }.
% 0.44/1.13 (765) {G5,W11,D3,L3,V1,M3} P(25,682) { ! X = skol3, X = singleton( skol4 )
% 0.44/1.13 , alpha4( X, skol5, skol4 ) }.
% 0.44/1.13 (783) {G6,W8,D3,L2,V0,M2} Q(765) { singleton( skol4 ) ==> skol3, alpha4(
% 0.44/1.13 skol3, skol5, skol4 ) }.
% 0.44/1.13 (785) {G5,W13,D3,L3,V1,M3} P(36,682) { ! X = skol3, ! unordered_pair( skol5
% 0.44/1.13 , skol4 ) ==> singleton( skol4 ), alpha4( X, skol5, skol4 ) }.
% 0.44/1.13 (800) {G7,W4,D2,L1,V0,M1} Q(785);d(637);d(783);q { alpha4( skol3, skol5,
% 0.44/1.13 skol4 ) }.
% 0.44/1.13 (801) {G8,W4,D2,L1,V0,M1} R(800,446) { alpha2( skol3, skol5, skol4 ) }.
% 0.44/1.13 (802) {G12,W3,D2,L1,V0,M1} R(801,17);r(733) { skol3 ==> empty_set }.
% 0.44/1.13 (806) {G13,W0,D0,L0,V0,M0} S(802);r(39) { }.
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 % SZS output end Refutation
% 0.44/1.13 found a proof!
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 Unprocessed initial clauses:
% 0.44/1.13
% 0.44/1.13 (808) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) = unordered_pair( Y, X
% 0.44/1.13 ) }.
% 0.44/1.13 (809) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.44/1.13 (810) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.44/1.13 (811) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 0.44/1.13 (812) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 0.44/1.13 (813) {G0,W11,D2,L3,V0,M3} { alpha5( skol3, skol4, skol5 ), skol3 =
% 0.44/1.13 empty_set, ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.13 (814) {G0,W9,D3,L2,V0,M2} { alpha5( skol3, skol4, skol5 ), ! subset( skol3
% 0.44/1.13 , unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.13 (815) {G0,W9,D3,L2,V3,M2} { ! alpha5( X, Y, Z ), subset( X, unordered_pair
% 0.44/1.13 ( Y, Z ) ) }.
% 0.44/1.13 (816) {G0,W7,D2,L2,V3,M2} { ! alpha5( X, Y, Z ), ! X = empty_set }.
% 0.44/1.13 (817) {G0,W8,D2,L2,V3,M2} { ! alpha5( X, Y, Z ), alpha1( X, Y, Z ) }.
% 0.44/1.13 (818) {G0,W16,D3,L4,V3,M4} { ! subset( X, unordered_pair( Y, Z ) ), X =
% 0.44/1.13 empty_set, ! alpha1( X, Y, Z ), alpha5( X, Y, Z ) }.
% 0.44/1.13 (819) {G0,W8,D3,L2,V3,M2} { ! alpha1( X, Y, Z ), ! X = singleton( Y ) }.
% 0.44/1.13 (820) {G0,W8,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.13 (821) {G0,W12,D3,L3,V3,M3} { X = singleton( Y ), ! alpha3( X, Y, Z ),
% 0.44/1.13 alpha1( X, Y, Z ) }.
% 0.44/1.13 (822) {G0,W8,D3,L2,V3,M2} { ! alpha3( X, Y, Z ), ! X = singleton( Z ) }.
% 0.44/1.13 (823) {G0,W9,D3,L2,V3,M2} { ! alpha3( X, Y, Z ), ! X = unordered_pair( Y,
% 0.44/1.13 Z ) }.
% 0.44/1.13 (824) {G0,W13,D3,L3,V3,M3} { X = singleton( Z ), X = unordered_pair( Y, Z
% 0.44/1.13 ), alpha3( X, Y, Z ) }.
% 0.44/1.13 (825) {G0,W12,D3,L3,V3,M3} { ! subset( X, unordered_pair( Y, Z ) ), X =
% 0.44/1.13 empty_set, ! alpha2( X, Y, Z ) }.
% 0.44/1.13 (826) {G0,W8,D3,L2,V3,M2} { ! X = empty_set, subset( X, unordered_pair( Y
% 0.44/1.13 , Z ) ) }.
% 0.44/1.13 (827) {G0,W9,D3,L2,V3,M2} { alpha2( X, Y, Z ), subset( X, unordered_pair(
% 0.44/1.13 Y, Z ) ) }.
% 0.44/1.13 (828) {G0,W8,D3,L2,V3,M2} { ! alpha2( X, Y, Z ), ! X = singleton( Y ) }.
% 0.44/1.13 (829) {G0,W8,D2,L2,V3,M2} { ! alpha2( X, Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.13 (830) {G0,W12,D3,L3,V3,M3} { X = singleton( Y ), ! alpha4( X, Y, Z ),
% 0.44/1.13 alpha2( X, Y, Z ) }.
% 0.44/1.13 (831) {G0,W8,D3,L2,V3,M2} { ! alpha4( X, Y, Z ), ! X = singleton( Z ) }.
% 0.44/1.13 (832) {G0,W9,D3,L2,V3,M2} { ! alpha4( X, Y, Z ), ! X = unordered_pair( Y,
% 0.44/1.13 Z ) }.
% 0.44/1.13 (833) {G0,W13,D3,L3,V3,M3} { X = singleton( Z ), X = unordered_pair( Y, Z
% 0.44/1.13 ), alpha4( X, Y, Z ) }.
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 Total Proof:
% 0.44/1.13
% 0.44/1.13 subsumption: (0) {G0,W7,D3,L1,V2,M1} I { unordered_pair( X, Y ) =
% 0.44/1.13 unordered_pair( Y, X ) }.
% 0.44/1.13 parent0: (808) {G0,W7,D3,L1,V2,M1} { unordered_pair( X, Y ) =
% 0.44/1.13 unordered_pair( Y, X ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 Y := Y
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (1) {G0,W3,D2,L1,V1,M1} I { subset( X, X ) }.
% 0.44/1.13 parent0: (809) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (5) {G0,W11,D2,L3,V0,M3} I { alpha5( skol3, skol4, skol5 ),
% 0.44/1.13 skol3 ==> empty_set, ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.13 parent0: (813) {G0,W11,D2,L3,V0,M3} { alpha5( skol3, skol4, skol5 ), skol3
% 0.44/1.13 = empty_set, ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 1 ==> 1
% 0.44/1.13 2 ==> 2
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (6) {G0,W9,D3,L2,V0,M2} I { alpha5( skol3, skol4, skol5 ), !
% 0.44/1.13 subset( skol3, unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.13 parent0: (814) {G0,W9,D3,L2,V0,M2} { alpha5( skol3, skol4, skol5 ), !
% 0.44/1.13 subset( skol3, unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 1 ==> 1
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (7) {G0,W9,D3,L2,V3,M2} I { ! alpha5( X, Y, Z ), subset( X,
% 0.44/1.13 unordered_pair( Y, Z ) ) }.
% 0.44/1.13 parent0: (815) {G0,W9,D3,L2,V3,M2} { ! alpha5( X, Y, Z ), subset( X,
% 0.44/1.13 unordered_pair( Y, Z ) ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 Y := Y
% 0.44/1.13 Z := Z
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 1 ==> 1
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (8) {G0,W7,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), ! X =
% 0.44/1.13 empty_set }.
% 0.44/1.13 parent0: (816) {G0,W7,D2,L2,V3,M2} { ! alpha5( X, Y, Z ), ! X = empty_set
% 0.44/1.13 }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 Y := Y
% 0.44/1.13 Z := Z
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 1 ==> 1
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (9) {G0,W8,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), alpha1( X, Y
% 0.44/1.13 , Z ) }.
% 0.44/1.13 parent0: (817) {G0,W8,D2,L2,V3,M2} { ! alpha5( X, Y, Z ), alpha1( X, Y, Z
% 0.44/1.13 ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 Y := Y
% 0.44/1.13 Z := Z
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 1 ==> 1
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (11) {G0,W8,D3,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! X =
% 0.44/1.13 singleton( Y ) }.
% 0.44/1.13 parent0: (819) {G0,W8,D3,L2,V3,M2} { ! alpha1( X, Y, Z ), ! X = singleton
% 0.44/1.13 ( Y ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 Y := Y
% 0.44/1.13 Z := Z
% 0.44/1.13 end
% 0.44/1.13 permutation0:
% 0.44/1.13 0 ==> 0
% 0.44/1.13 1 ==> 1
% 0.44/1.13 end
% 0.44/1.13
% 0.44/1.13 subsumption: (12) {G0,W8,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), alpha3( X, Y
% 0.44/1.13 , Z ) }.
% 0.44/1.13 parent0: (820) {G0,W8,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), alpha3( X, Y, Z
% 0.44/1.13 ) }.
% 0.44/1.13 substitution0:
% 0.44/1.13 X := X
% 0.44/1.13 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (13) {G0,W12,D3,L3,V3,M3} I { X = singleton( Y ), ! alpha3( X
% 0.44/1.14 , Y, Z ), alpha1( X, Y, Z ) }.
% 0.44/1.14 parent0: (821) {G0,W12,D3,L3,V3,M3} { X = singleton( Y ), ! alpha3( X, Y,
% 0.44/1.14 Z ), alpha1( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (14) {G0,W8,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), ! X =
% 0.44/1.14 singleton( Z ) }.
% 0.44/1.14 parent0: (822) {G0,W8,D3,L2,V3,M2} { ! alpha3( X, Y, Z ), ! X = singleton
% 0.44/1.14 ( Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (15) {G0,W9,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), ! X =
% 0.44/1.14 unordered_pair( Y, Z ) }.
% 0.44/1.14 parent0: (823) {G0,W9,D3,L2,V3,M2} { ! alpha3( X, Y, Z ), ! X =
% 0.44/1.14 unordered_pair( Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (16) {G0,W13,D3,L3,V3,M3} I { X = singleton( Z ), X =
% 0.44/1.14 unordered_pair( Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.14 parent0: (824) {G0,W13,D3,L3,V3,M3} { X = singleton( Z ), X =
% 0.44/1.14 unordered_pair( Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (17) {G0,W12,D3,L3,V3,M3} I { ! subset( X, unordered_pair( Y,
% 0.44/1.14 Z ) ), X = empty_set, ! alpha2( X, Y, Z ) }.
% 0.44/1.14 parent0: (825) {G0,W12,D3,L3,V3,M3} { ! subset( X, unordered_pair( Y, Z )
% 0.44/1.14 ), X = empty_set, ! alpha2( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (18) {G0,W8,D3,L2,V3,M2} I { ! X = empty_set, subset( X,
% 0.44/1.14 unordered_pair( Y, Z ) ) }.
% 0.44/1.14 parent0: (826) {G0,W8,D3,L2,V3,M2} { ! X = empty_set, subset( X,
% 0.44/1.14 unordered_pair( Y, Z ) ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (19) {G0,W9,D3,L2,V3,M2} I { alpha2( X, Y, Z ), subset( X,
% 0.44/1.14 unordered_pair( Y, Z ) ) }.
% 0.44/1.14 parent0: (827) {G0,W9,D3,L2,V3,M2} { alpha2( X, Y, Z ), subset( X,
% 0.44/1.14 unordered_pair( Y, Z ) ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (20) {G0,W8,D3,L2,V3,M2} I { ! alpha2( X, Y, Z ), ! X =
% 0.44/1.14 singleton( Y ) }.
% 0.44/1.14 parent0: (828) {G0,W8,D3,L2,V3,M2} { ! alpha2( X, Y, Z ), ! X = singleton
% 0.44/1.14 ( Y ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 *** allocated 22500 integers for termspace/termends
% 0.44/1.14 subsumption: (21) {G0,W8,D2,L2,V3,M2} I { ! alpha2( X, Y, Z ), alpha4( X, Y
% 0.44/1.14 , Z ) }.
% 0.44/1.14 parent0: (829) {G0,W8,D2,L2,V3,M2} { ! alpha2( X, Y, Z ), alpha4( X, Y, Z
% 0.44/1.14 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (22) {G0,W12,D3,L3,V3,M3} I { X = singleton( Y ), ! alpha4( X
% 0.44/1.14 , Y, Z ), alpha2( X, Y, Z ) }.
% 0.44/1.14 parent0: (830) {G0,W12,D3,L3,V3,M3} { X = singleton( Y ), ! alpha4( X, Y,
% 0.44/1.14 Z ), alpha2( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (23) {G0,W8,D3,L2,V3,M2} I { ! alpha4( X, Y, Z ), ! X =
% 0.44/1.14 singleton( Z ) }.
% 0.44/1.14 parent0: (831) {G0,W8,D3,L2,V3,M2} { ! alpha4( X, Y, Z ), ! X = singleton
% 0.44/1.14 ( Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (24) {G0,W9,D3,L2,V3,M2} I { ! alpha4( X, Y, Z ), ! X =
% 0.44/1.14 unordered_pair( Y, Z ) }.
% 0.44/1.14 parent0: (832) {G0,W9,D3,L2,V3,M2} { ! alpha4( X, Y, Z ), ! X =
% 0.44/1.14 unordered_pair( Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (25) {G0,W13,D3,L3,V3,M3} I { X = singleton( Z ), X =
% 0.44/1.14 unordered_pair( Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.14 parent0: (833) {G0,W13,D3,L3,V3,M3} { X = singleton( Z ), X =
% 0.44/1.14 unordered_pair( Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqfact: (1017) {G0,W15,D3,L3,V3,M3} { ! singleton( X ) = unordered_pair( Y
% 0.44/1.14 , X ), Z = unordered_pair( Y, X ), alpha3( Z, Y, X ) }.
% 0.44/1.14 parent0[0, 1]: (16) {G0,W13,D3,L3,V3,M3} I { X = singleton( Z ), X =
% 0.44/1.14 unordered_pair( Y, Z ), alpha3( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Z
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := X
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1022) {G0,W15,D3,L3,V3,M3} { ! unordered_pair( Y, X ) = singleton
% 0.44/1.14 ( X ), Z = unordered_pair( Y, X ), alpha3( Z, Y, X ) }.
% 0.44/1.14 parent0[0]: (1017) {G0,W15,D3,L3,V3,M3} { ! singleton( X ) =
% 0.44/1.14 unordered_pair( Y, X ), Z = unordered_pair( Y, X ), alpha3( Z, Y, X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (30) {G1,W15,D3,L3,V3,M3} E(16) { ! unordered_pair( Y, X ) ==>
% 0.44/1.14 singleton( X ), Z = unordered_pair( Y, X ), alpha3( Z, Y, X ) }.
% 0.44/1.14 parent0: (1022) {G0,W15,D3,L3,V3,M3} { ! unordered_pair( Y, X ) =
% 0.44/1.14 singleton( X ), Z = unordered_pair( Y, X ), alpha3( Z, Y, X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqfact: (1040) {G0,W15,D3,L3,V3,M3} { ! singleton( X ) = unordered_pair( Y
% 0.44/1.14 , X ), Z = unordered_pair( Y, X ), alpha4( Z, Y, X ) }.
% 0.44/1.14 parent0[0, 1]: (25) {G0,W13,D3,L3,V3,M3} I { X = singleton( Z ), X =
% 0.44/1.14 unordered_pair( Y, Z ), alpha4( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Z
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := X
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1045) {G0,W15,D3,L3,V3,M3} { ! unordered_pair( Y, X ) = singleton
% 0.44/1.14 ( X ), Z = unordered_pair( Y, X ), alpha4( Z, Y, X ) }.
% 0.44/1.14 parent0[0]: (1040) {G0,W15,D3,L3,V3,M3} { ! singleton( X ) =
% 0.44/1.14 unordered_pair( Y, X ), Z = unordered_pair( Y, X ), alpha4( Z, Y, X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (36) {G1,W15,D3,L3,V3,M3} E(25) { ! unordered_pair( Y, X ) ==>
% 0.44/1.14 singleton( X ), Z = unordered_pair( Y, X ), alpha4( Z, Y, X ) }.
% 0.44/1.14 parent0: (1045) {G0,W15,D3,L3,V3,M3} { ! unordered_pair( Y, X ) =
% 0.44/1.14 singleton( X ), Z = unordered_pair( Y, X ), alpha4( Z, Y, X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 2 ==> 2
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1048) {G0,W7,D2,L2,V3,M2} { ! empty_set = X, ! alpha5( X, Y, Z )
% 0.44/1.14 }.
% 0.44/1.14 parent0[1]: (8) {G0,W7,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), ! X =
% 0.44/1.14 empty_set }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1050) {G1,W8,D3,L2,V0,M2} { ! empty_set = skol3, ! subset(
% 0.44/1.14 skol3, unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.14 parent0[1]: (1048) {G0,W7,D2,L2,V3,M2} { ! empty_set = X, ! alpha5( X, Y,
% 0.44/1.14 Z ) }.
% 0.44/1.14 parent1[0]: (6) {G0,W9,D3,L2,V0,M2} I { alpha5( skol3, skol4, skol5 ), !
% 0.44/1.14 subset( skol3, unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := skol3
% 0.44/1.14 Y := skol4
% 0.44/1.14 Z := skol5
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1053) {G1,W6,D2,L2,V0,M2} { ! empty_set = skol3, ! skol3 =
% 0.44/1.14 empty_set }.
% 0.44/1.14 parent0[1]: (1050) {G1,W8,D3,L2,V0,M2} { ! empty_set = skol3, ! subset(
% 0.44/1.14 skol3, unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.14 parent1[1]: (18) {G0,W8,D3,L2,V3,M2} I { ! X = empty_set, subset( X,
% 0.44/1.14 unordered_pair( Y, Z ) ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 X := skol3
% 0.44/1.14 Y := skol4
% 0.44/1.14 Z := skol5
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1054) {G1,W6,D2,L2,V0,M2} { ! skol3 = empty_set, ! skol3 =
% 0.44/1.14 empty_set }.
% 0.44/1.14 parent0[0]: (1053) {G1,W6,D2,L2,V0,M2} { ! empty_set = skol3, ! skol3 =
% 0.44/1.14 empty_set }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 factor: (1056) {G1,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.44/1.14 parent0[0, 1]: (1054) {G1,W6,D2,L2,V0,M2} { ! skol3 = empty_set, ! skol3 =
% 0.44/1.14 empty_set }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (39) {G1,W3,D2,L1,V0,M1} R(6,8);r(18) { ! skol3 ==> empty_set
% 0.44/1.14 }.
% 0.44/1.14 parent0: (1056) {G1,W3,D2,L1,V0,M1} { ! skol3 = empty_set }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1058) {G1,W3,D2,L1,V0,M1} { ! empty_set ==> skol3 }.
% 0.44/1.14 parent0[0]: (39) {G1,W3,D2,L1,V0,M1} R(6,8);r(18) { ! skol3 ==> empty_set
% 0.44/1.14 }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1059) {G0,W11,D2,L3,V0,M3} { empty_set ==> skol3, alpha5( skol3,
% 0.44/1.14 skol4, skol5 ), ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.14 parent0[1]: (5) {G0,W11,D2,L3,V0,M3} I { alpha5( skol3, skol4, skol5 ),
% 0.44/1.14 skol3 ==> empty_set, ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1060) {G1,W8,D2,L2,V0,M2} { alpha5( skol3, skol4, skol5 ), !
% 0.44/1.14 alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.14 parent0[0]: (1058) {G1,W3,D2,L1,V0,M1} { ! empty_set ==> skol3 }.
% 0.44/1.14 parent1[0]: (1059) {G0,W11,D2,L3,V0,M3} { empty_set ==> skol3, alpha5(
% 0.44/1.14 skol3, skol4, skol5 ), ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (42) {G2,W8,D2,L2,V0,M2} R(39,5) { alpha5( skol3, skol4, skol5
% 0.44/1.14 ), ! alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.14 parent0: (1060) {G1,W8,D2,L2,V0,M2} { alpha5( skol3, skol4, skol5 ), !
% 0.44/1.14 alpha1( skol3, skol4, skol5 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1061) {G1,W8,D2,L2,V3,M2} { alpha3( X, Y, Z ), ! alpha5( X, Y
% 0.44/1.14 , Z ) }.
% 0.44/1.14 parent0[0]: (12) {G0,W8,D2,L2,V3,M2} I { ! alpha1( X, Y, Z ), alpha3( X, Y
% 0.44/1.14 , Z ) }.
% 0.44/1.14 parent1[1]: (9) {G0,W8,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), alpha1( X, Y,
% 0.44/1.14 Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (51) {G1,W8,D2,L2,V3,M2} R(9,12) { ! alpha5( X, Y, Z ), alpha3
% 0.44/1.14 ( X, Y, Z ) }.
% 0.44/1.14 parent0: (1061) {G1,W8,D2,L2,V3,M2} { alpha3( X, Y, Z ), ! alpha5( X, Y, Z
% 0.44/1.14 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 1
% 0.44/1.14 1 ==> 0
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1062) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha1( X, Y
% 0.44/1.14 , Z ) }.
% 0.44/1.14 parent0[1]: (11) {G0,W8,D3,L2,V3,M2} I { ! alpha1( X, Y, Z ), ! X =
% 0.44/1.14 singleton( Y ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1063) {G1,W8,D3,L2,V3,M2} { ! singleton( X ) = Y, ! alpha5( Y
% 0.44/1.14 , X, Z ) }.
% 0.44/1.14 parent0[1]: (1062) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha1( X
% 0.44/1.14 , Y, Z ) }.
% 0.44/1.14 parent1[1]: (9) {G0,W8,D2,L2,V3,M2} I { ! alpha5( X, Y, Z ), alpha1( X, Y,
% 0.44/1.14 Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1064) {G1,W8,D3,L2,V3,M2} { ! Y = singleton( X ), ! alpha5( Y, X
% 0.44/1.14 , Z ) }.
% 0.44/1.14 parent0[0]: (1063) {G1,W8,D3,L2,V3,M2} { ! singleton( X ) = Y, ! alpha5( Y
% 0.44/1.14 , X, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (68) {G1,W8,D3,L2,V3,M2} R(11,9) { ! X = singleton( Y ), !
% 0.44/1.14 alpha5( X, Y, Z ) }.
% 0.44/1.14 parent0: (1064) {G1,W8,D3,L2,V3,M2} { ! Y = singleton( X ), ! alpha5( Y, X
% 0.44/1.14 , Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1065) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha4( X, Z
% 0.44/1.14 , Y ) }.
% 0.44/1.14 parent0[1]: (23) {G0,W8,D3,L2,V3,M2} I { ! alpha4( X, Y, Z ), ! X =
% 0.44/1.14 singleton( Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Z
% 0.44/1.14 Z := Y
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1066) {G1,W8,D3,L2,V3,M2} { ! singleton( X ) = Y, ! alpha2( Y
% 0.44/1.14 , Z, X ) }.
% 0.44/1.14 parent0[1]: (1065) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha4( X
% 0.44/1.14 , Z, Y ) }.
% 0.44/1.14 parent1[1]: (21) {G0,W8,D2,L2,V3,M2} I { ! alpha2( X, Y, Z ), alpha4( X, Y
% 0.44/1.14 , Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := Z
% 0.44/1.14 Z := X
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1067) {G1,W8,D3,L2,V3,M2} { ! Y = singleton( X ), ! alpha2( Y, Z
% 0.44/1.14 , X ) }.
% 0.44/1.14 parent0[0]: (1066) {G1,W8,D3,L2,V3,M2} { ! singleton( X ) = Y, ! alpha2( Y
% 0.44/1.14 , Z, X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (71) {G1,W8,D3,L2,V3,M2} R(23,21) { ! X = singleton( Y ), !
% 0.44/1.14 alpha2( X, Z, Y ) }.
% 0.44/1.14 parent0: (1067) {G1,W8,D3,L2,V3,M2} { ! Y = singleton( X ), ! alpha2( Y, Z
% 0.44/1.14 , X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1068) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha3( X, Z
% 0.44/1.14 , Y ) }.
% 0.44/1.14 parent0[1]: (14) {G0,W8,D3,L2,V3,M2} I { ! alpha3( X, Y, Z ), ! X =
% 0.44/1.14 singleton( Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Z
% 0.44/1.14 Z := Y
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1069) {G1,W8,D3,L2,V3,M2} { ! singleton( X ) = Y, ! alpha5( Y
% 0.44/1.14 , Z, X ) }.
% 0.44/1.14 parent0[1]: (1068) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha3( X
% 0.44/1.14 , Z, Y ) }.
% 0.44/1.14 parent1[1]: (51) {G1,W8,D2,L2,V3,M2} R(9,12) { ! alpha5( X, Y, Z ), alpha3
% 0.44/1.14 ( X, Y, Z ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := Z
% 0.44/1.14 Z := X
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1070) {G1,W8,D3,L2,V3,M2} { ! Y = singleton( X ), ! alpha5( Y, Z
% 0.44/1.14 , X ) }.
% 0.44/1.14 parent0[0]: (1069) {G1,W8,D3,L2,V3,M2} { ! singleton( X ) = Y, ! alpha5( Y
% 0.44/1.14 , Z, X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (117) {G2,W8,D3,L2,V3,M2} R(14,51) { ! X = singleton( Y ), !
% 0.44/1.14 alpha5( X, Z, Y ) }.
% 0.44/1.14 parent0: (1070) {G1,W8,D3,L2,V3,M2} { ! Y = singleton( X ), ! alpha5( Y, Z
% 0.44/1.14 , X ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := Y
% 0.44/1.14 Y := X
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 0
% 0.44/1.14 1 ==> 1
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1071) {G1,W8,D2,L2,V0,M2} { alpha5( skol3, skol4, skol5 ),
% 0.44/1.14 alpha2( skol3, skol4, skol5 ) }.
% 0.44/1.14 parent0[1]: (6) {G0,W9,D3,L2,V0,M2} I { alpha5( skol3, skol4, skol5 ), !
% 0.44/1.14 subset( skol3, unordered_pair( skol4, skol5 ) ) }.
% 0.44/1.14 parent1[1]: (19) {G0,W9,D3,L2,V3,M2} I { alpha2( X, Y, Z ), subset( X,
% 0.44/1.14 unordered_pair( Y, Z ) ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 X := skol3
% 0.44/1.14 Y := skol4
% 0.44/1.14 Z := skol5
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 subsumption: (334) {G1,W8,D2,L2,V0,M2} R(19,6) { alpha2( skol3, skol4,
% 0.44/1.14 skol5 ), alpha5( skol3, skol4, skol5 ) }.
% 0.44/1.14 parent0: (1071) {G1,W8,D2,L2,V0,M2} { alpha5( skol3, skol4, skol5 ),
% 0.44/1.14 alpha2( skol3, skol4, skol5 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 end
% 0.44/1.14 permutation0:
% 0.44/1.14 0 ==> 1
% 0.44/1.14 1 ==> 0
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1072) {G2,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha5( X, Z
% 0.44/1.14 , Y ) }.
% 0.44/1.14 parent0[0]: (117) {G2,W8,D3,L2,V3,M2} R(14,51) { ! X = singleton( Y ), !
% 0.44/1.14 alpha5( X, Z, Y ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 eqswap: (1073) {G1,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha2( X, Z
% 0.44/1.14 , Y ) }.
% 0.44/1.14 parent0[0]: (71) {G1,W8,D3,L2,V3,M2} R(23,21) { ! X = singleton( Y ), !
% 0.44/1.14 alpha2( X, Z, Y ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := X
% 0.44/1.14 Y := Y
% 0.44/1.14 Z := Z
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1074) {G2,W8,D3,L2,V0,M2} { ! singleton( skol5 ) = skol3,
% 0.44/1.14 alpha2( skol3, skol4, skol5 ) }.
% 0.44/1.14 parent0[1]: (1072) {G2,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha5( X
% 0.44/1.14 , Z, Y ) }.
% 0.44/1.14 parent1[1]: (334) {G1,W8,D2,L2,V0,M2} R(19,6) { alpha2( skol3, skol4, skol5
% 0.44/1.14 ), alpha5( skol3, skol4, skol5 ) }.
% 0.44/1.14 substitution0:
% 0.44/1.14 X := skol3
% 0.44/1.14 Y := skol5
% 0.44/1.14 Z := skol4
% 0.44/1.14 end
% 0.44/1.14 substitution1:
% 0.44/1.14 end
% 0.44/1.14
% 0.44/1.14 resolution: (1075) {G2,W8,D3,L2,V0,M2} { ! singleton( skol5 ) = skol3, !
% 0.44/1.14 singleton( skol5 ) = skol3 }.
% 0.44/1.14 parent0[1]: (1073) {G1,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha2( X
% 0.44/1.14 , Z, Y ) }.
% 0.44/1.14 parent1[1]: (1074) {G2,W8,D3,L2,V0,M2} { ! singleton( skol5 ) = skol3,
% 0.44/1.14 alpha2( skol3, skol4, skol5 ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 X := skol3
% 35.35/35.73 Y := skol5
% 35.35/35.73 Z := skol4
% 35.35/35.73 end
% 35.35/35.73 substitution1:
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 factor: (1076) {G2,W4,D3,L1,V0,M1} { ! singleton( skol5 ) = skol3 }.
% 35.35/35.73 parent0[0, 1]: (1075) {G2,W8,D3,L2,V0,M2} { ! singleton( skol5 ) = skol3,
% 35.35/35.73 ! singleton( skol5 ) = skol3 }.
% 35.35/35.73 substitution0:
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 subsumption: (352) {G3,W4,D3,L1,V0,M1} R(334,117);r(71) { ! singleton(
% 35.35/35.73 skol5 ) ==> skol3 }.
% 35.35/35.73 parent0: (1076) {G2,W4,D3,L1,V0,M1} { ! singleton( skol5 ) = skol3 }.
% 35.35/35.73 substitution0:
% 35.35/35.73 end
% 35.35/35.73 permutation0:
% 35.35/35.73 0 ==> 0
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 eqswap: (1077) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha2( X, Y
% 35.35/35.73 , Z ) }.
% 35.35/35.73 parent0[1]: (20) {G0,W8,D3,L2,V3,M2} I { ! alpha2( X, Y, Z ), ! X =
% 35.35/35.73 singleton( Y ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 X := X
% 35.35/35.73 Y := Y
% 35.35/35.73 Z := Z
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 eqswap: (1078) {G1,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha5( X, Y
% 35.35/35.73 , Z ) }.
% 35.35/35.73 parent0[0]: (68) {G1,W8,D3,L2,V3,M2} R(11,9) { ! X = singleton( Y ), !
% 35.35/35.73 alpha5( X, Y, Z ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 X := X
% 35.35/35.73 Y := Y
% 35.35/35.73 Z := Z
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 resolution: (1079) {G1,W8,D3,L2,V0,M2} { ! singleton( skol4 ) = skol3,
% 35.35/35.73 alpha5( skol3, skol4, skol5 ) }.
% 35.35/35.73 parent0[1]: (1077) {G0,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha2( X
% 35.35/35.73 , Y, Z ) }.
% 35.35/35.73 parent1[0]: (334) {G1,W8,D2,L2,V0,M2} R(19,6) { alpha2( skol3, skol4, skol5
% 35.35/35.73 ), alpha5( skol3, skol4, skol5 ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 X := skol3
% 35.35/35.73 Y := skol4
% 35.35/35.73 Z := skol5
% 35.35/35.73 end
% 35.35/35.73 substitution1:
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 resolution: (1080) {G2,W8,D3,L2,V0,M2} { ! singleton( skol4 ) = skol3, !
% 35.35/35.73 singleton( skol4 ) = skol3 }.
% 35.35/35.73 parent0[1]: (1078) {G1,W8,D3,L2,V3,M2} { ! singleton( Y ) = X, ! alpha5( X
% 35.35/35.73 , Y, Z ) }.
% 35.35/35.73 parent1[1]: (1079) {G1,W8,D3,L2,V0,M2} { ! singleton( skol4 ) = skol3,
% 35.35/35.73 alpha5( skol3, skol4, skol5 ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 X := skol3
% 35.35/35.73 Y := skol4
% 35.35/35.73 Z := skol5
% 35.35/35.73 end
% 35.35/35.73 substitution1:
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 factor: (1081) {G2,W4,D3,L1,V0,M1} { ! singleton( skol4 ) = skol3 }.
% 35.35/35.73 parent0[0, 1]: (1080) {G2,W8,D3,L2,V0,M2} { ! singleton( skol4 ) = skol3,
% 35.35/35.73 ! singleton( skol4 ) = skol3 }.
% 35.35/35.73 substitution0:
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 subsumption: (353) {G2,W4,D3,L1,V0,M1} R(334,20);r(68) { ! singleton( skol4
% 35.35/35.73 ) ==> skol3 }.
% 35.35/35.73 parent0: (1081) {G2,W4,D3,L1,V0,M1} { ! singleton( skol4 ) = skol3 }.
% 35.35/35.73 substitution0:
% 35.35/35.73 end
% 35.35/35.73 permutation0:
% 35.35/35.73 0 ==> 0
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 resolution: (1082) {G2,W8,D2,L2,V0,M2} { alpha3( skol3, skol4, skol5 ),
% 35.35/35.73 alpha2( skol3, skol4, skol5 ) }.
% 35.35/35.73 parent0[0]: (51) {G1,W8,D2,L2,V3,M2} R(9,12) { ! alpha5( X, Y, Z ), alpha3
% 35.35/35.73 ( X, Y, Z ) }.
% 35.35/35.73 parent1[1]: (334) {G1,W8,D2,L2,V0,M2} R(19,6) { alpha2( skol3, skol4, skol5
% 35.35/35.73 ), alpha5( skol3, skol4, skol5 ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 X := skol3
% 35.35/35.73 Y := skol4
% 35.35/35.73 Z := skol5
% 35.35/35.73 end
% 35.35/35.73 substitution1:
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 subsumption: (354) {G2,W8,D2,L2,V0,M2} R(334,51) { alpha2( skol3, skol4,
% 35.35/35.73 skol5 ), alpha3( skol3, skol4, skol5 ) }.
% 35.35/35.73 parent0: (1082) {G2,W8,D2,L2,V0,M2} { alpha3( skol3, skol4, skol5 ),
% 35.35/35.73 alpha2( skol3, skol4, skol5 ) }.
% 35.35/35.73 substitution0:
% 35.35/35.73 end
% 35.35/35.73 permutation0:
% 35.35/35.73 0 ==> 1
% 35.35/35.73 1 ==> 0
% 35.35/35.73 end
% 35.35/35.73
% 35.35/35.73 *** allocated 33750 integers for termspace/termends
% 35.35/35.73 *** allocated 15000 integers for justifications
% 35.35/35.73 *** allocated 75937 integers for clauses
% 35.35/35.73 *** allocated 22500 integers for justifications
% 35.35/35.73 *** allocated 50625 integers for termspace/termends
% 35.35/35.73 *** allocated 33750 integers for justifications
% 35.35/35.73 *** allocated 75937 integers for termspace/termends
% 35.35/35.73 *** allocated 50625 integers for justifications
% 35.35/35.73 *** allocated 75937 integers for justifications
% 35.35/35.73 *** allocated 113905 integers for clauses
% 35.35/35.73 *** allocated 113905 integers for termspace/termends
% 35.35/35.73 *** allocated 113905 integers for justifications
% 35.35/35.73 *** allocated 170857 integers for termspace/termends
% 35.35/35.73 *** allocated 170857 integers for clauses
% 35.35/35.73 *** allocated 170857 integers for justifications
% 35.35/35.73 *** allocated 256285 integers for termspace/termends
% 35.35/35.73 *** allocated 256285 integers for justifications
% 35.35/35.73 *** allocated 384427 integers for termspace/termends
% 35.35/35.73 *** allocated 256285 integers for clauses
% 35.35/35.73 *** allocated 384427 integers for justifications
% 35.35/35.73 *** allocated 576640 integers for termspace/termends
% 35.35/35.73 *** allocated 384427 integers for clauses
% 35.35/35.73 *** allocated 576640 integers for justifications
% 35.35/35.73 *** allocated 864960 integers for termspace/termends
% 35.35/35.73 *** allocated 864960 integers for justifications
% 35.35/35.73 *** allocated 576640 integers forCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------