TSTP Solution File: SET985+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:46 EDT 2022
% Result : Theorem 3.93s 4.30s
% Output : Refutation 3.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n027.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 : Mon Jul 11 06:36:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.93/4.30 *** allocated 10000 integers for termspace/termends
% 3.93/4.30 *** allocated 10000 integers for clauses
% 3.93/4.30 *** allocated 10000 integers for justifications
% 3.93/4.30 Bliksem 1.12
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Automatic Strategy Selection
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Clauses:
% 3.93/4.30
% 3.93/4.30 { empty( empty_set ) }.
% 3.93/4.30 { empty( skol1 ) }.
% 3.93/4.30 { ! empty( skol2 ) }.
% 3.93/4.30 { subset( X, X ) }.
% 3.93/4.30 { ! cartesian_product2( X, Y ) = empty_set, X = empty_set, Y = empty_set }
% 3.93/4.30 .
% 3.93/4.30 { ! X = empty_set, cartesian_product2( X, Y ) = empty_set }.
% 3.93/4.30 { ! Y = empty_set, cartesian_product2( X, Y ) = empty_set }.
% 3.93/4.30 { ! subset( cartesian_product2( X, Y ), cartesian_product2( Z, T ) ),
% 3.93/4.30 cartesian_product2( X, Y ) = empty_set, subset( X, Z ) }.
% 3.93/4.30 { ! subset( cartesian_product2( X, Y ), cartesian_product2( Z, T ) ),
% 3.93/4.30 cartesian_product2( X, Y ) = empty_set, subset( Y, T ) }.
% 3.93/4.30 { ! empty( skol3 ) }.
% 3.93/4.30 { subset( cartesian_product2( skol3, skol4 ), cartesian_product2( skol6,
% 3.93/4.30 skol5 ) ), subset( cartesian_product2( skol4, skol3 ), cartesian_product2
% 3.93/4.30 ( skol5, skol6 ) ) }.
% 3.93/4.30 { ! subset( skol4, skol5 ) }.
% 3.93/4.30 { subset( empty_set, X ) }.
% 3.93/4.30
% 3.93/4.30 percentage equality = 0.409091, percentage horn = 0.692308
% 3.93/4.30 This is a problem with some equality
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Options Used:
% 3.93/4.30
% 3.93/4.30 useres = 1
% 3.93/4.30 useparamod = 1
% 3.93/4.30 useeqrefl = 1
% 3.93/4.30 useeqfact = 1
% 3.93/4.30 usefactor = 1
% 3.93/4.30 usesimpsplitting = 0
% 3.93/4.30 usesimpdemod = 5
% 3.93/4.30 usesimpres = 3
% 3.93/4.30
% 3.93/4.30 resimpinuse = 1000
% 3.93/4.30 resimpclauses = 20000
% 3.93/4.30 substype = eqrewr
% 3.93/4.30 backwardsubs = 1
% 3.93/4.30 selectoldest = 5
% 3.93/4.30
% 3.93/4.30 litorderings [0] = split
% 3.93/4.30 litorderings [1] = extend the termordering, first sorting on arguments
% 3.93/4.30
% 3.93/4.30 termordering = kbo
% 3.93/4.30
% 3.93/4.30 litapriori = 0
% 3.93/4.30 termapriori = 1
% 3.93/4.30 litaposteriori = 0
% 3.93/4.30 termaposteriori = 0
% 3.93/4.30 demodaposteriori = 0
% 3.93/4.30 ordereqreflfact = 0
% 3.93/4.30
% 3.93/4.30 litselect = negord
% 3.93/4.30
% 3.93/4.30 maxweight = 15
% 3.93/4.30 maxdepth = 30000
% 3.93/4.30 maxlength = 115
% 3.93/4.30 maxnrvars = 195
% 3.93/4.30 excuselevel = 1
% 3.93/4.30 increasemaxweight = 1
% 3.93/4.30
% 3.93/4.30 maxselected = 10000000
% 3.93/4.30 maxnrclauses = 10000000
% 3.93/4.30
% 3.93/4.30 showgenerated = 0
% 3.93/4.30 showkept = 0
% 3.93/4.30 showselected = 0
% 3.93/4.30 showdeleted = 0
% 3.93/4.30 showresimp = 1
% 3.93/4.30 showstatus = 2000
% 3.93/4.30
% 3.93/4.30 prologoutput = 0
% 3.93/4.30 nrgoals = 5000000
% 3.93/4.30 totalproof = 1
% 3.93/4.30
% 3.93/4.30 Symbols occurring in the translation:
% 3.93/4.30
% 3.93/4.30 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 3.93/4.30 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 3.93/4.30 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 3.93/4.30 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 3.93/4.30 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 3.93/4.30 empty_set [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 3.93/4.30 empty [36, 1] (w:1, o:22, a:1, s:1, b:0),
% 3.93/4.30 subset [39, 2] (w:1, o:47, a:1, s:1, b:0),
% 3.93/4.30 cartesian_product2 [40, 2] (w:1, o:48, a:1, s:1, b:0),
% 3.93/4.30 skol1 [43, 0] (w:1, o:11, a:1, s:1, b:1),
% 3.93/4.30 skol2 [44, 0] (w:1, o:12, a:1, s:1, b:1),
% 3.93/4.30 skol3 [45, 0] (w:1, o:13, a:1, s:1, b:1),
% 3.93/4.30 skol4 [46, 0] (w:1, o:14, a:1, s:1, b:1),
% 3.93/4.30 skol5 [47, 0] (w:1, o:15, a:1, s:1, b:1),
% 3.93/4.30 skol6 [48, 0] (w:1, o:16, a:1, s:1, b:1).
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Starting Search:
% 3.93/4.30
% 3.93/4.30 *** allocated 15000 integers for clauses
% 3.93/4.30 *** allocated 22500 integers for clauses
% 3.93/4.30 *** allocated 33750 integers for clauses
% 3.93/4.30 *** allocated 50625 integers for clauses
% 3.93/4.30 *** allocated 15000 integers for termspace/termends
% 3.93/4.30 Resimplifying inuse:
% 3.93/4.30 Done
% 3.93/4.30
% 3.93/4.30 *** allocated 75937 integers for clauses
% 3.93/4.30 *** allocated 22500 integers for termspace/termends
% 3.93/4.30 *** allocated 113905 integers for clauses
% 3.93/4.30 *** allocated 33750 integers for termspace/termends
% 3.93/4.30
% 3.93/4.30 Intermediate Status:
% 3.93/4.30 Generated: 21850
% 3.93/4.30 Kept: 2055
% 3.93/4.30 Inuse: 109
% 3.93/4.30 Deleted: 8
% 3.93/4.30 Deletedinuse: 0
% 3.93/4.30
% 3.93/4.30 Resimplifying inuse:
% 3.93/4.30 Done
% 3.93/4.30
% 3.93/4.30 *** allocated 170857 integers for clauses
% 3.93/4.30 *** allocated 50625 integers for termspace/termends
% 3.93/4.30 Resimplifying inuse:
% 3.93/4.30 Done
% 3.93/4.30
% 3.93/4.30 *** allocated 75937 integers for termspace/termends
% 3.93/4.30 *** allocated 256285 integers for clauses
% 3.93/4.30
% 3.93/4.30 Intermediate Status:
% 3.93/4.30 Generated: 39305
% 3.93/4.30 Kept: 4077
% 3.93/4.30 Inuse: 157
% 3.93/4.30 Deleted: 10
% 3.93/4.30 Deletedinuse: 0
% 3.93/4.30
% 3.93/4.30 Resimplifying inuse:
% 3.93/4.30 Done
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Bliksems!, er is een bewijs:
% 3.93/4.30 % SZS status Theorem
% 3.93/4.30 % SZS output start Refutation
% 3.93/4.30
% 3.93/4.30 (0) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 3.93/4.30 (4) {G0,W11,D3,L3,V2,M3} I { ! cartesian_product2( X, Y ) ==> empty_set, X
% 3.93/4.30 = empty_set, Y = empty_set }.
% 3.93/4.30 (6) {G0,W8,D3,L2,V2,M2} I { ! Y = empty_set, cartesian_product2( X, Y ) ==>
% 3.93/4.30 empty_set }.
% 3.93/4.30 (7) {G0,W15,D3,L3,V4,M3} I { ! subset( cartesian_product2( X, Y ),
% 3.93/4.30 cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) ==> empty_set,
% 3.93/4.30 subset( X, Z ) }.
% 3.93/4.30 (8) {G0,W15,D3,L3,V4,M3} I { ! subset( cartesian_product2( X, Y ),
% 3.93/4.30 cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) ==> empty_set,
% 3.93/4.30 subset( Y, T ) }.
% 3.93/4.30 (9) {G0,W2,D2,L1,V0,M1} I { ! empty( skol3 ) }.
% 3.93/4.30 (10) {G0,W14,D3,L2,V0,M2} I { subset( cartesian_product2( skol3, skol4 ),
% 3.93/4.30 cartesian_product2( skol6, skol5 ) ), subset( cartesian_product2( skol4,
% 3.93/4.30 skol3 ), cartesian_product2( skol5, skol6 ) ) }.
% 3.93/4.30 (11) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 3.93/4.30 (12) {G0,W3,D2,L1,V1,M1} I { subset( empty_set, X ) }.
% 3.93/4.30 (14) {G1,W6,D2,L2,V1,M2} E(4);d(6);q { ! empty_set = X, X = empty_set }.
% 3.93/4.30 (18) {G1,W5,D3,L1,V1,M1} Q(6) { cartesian_product2( X, empty_set ) ==>
% 3.93/4.30 empty_set }.
% 3.93/4.30 (25) {G2,W3,D2,L1,V0,M1} P(14,9);r(0) { ! skol3 ==> empty_set }.
% 3.93/4.30 (37) {G1,W8,D3,L2,V1,M2} P(4,11);r(12) { ! cartesian_product2( skol4, X )
% 3.93/4.30 ==> empty_set, X = empty_set }.
% 3.93/4.30 (39) {G1,W8,D3,L2,V1,M2} P(4,11);r(12) { ! cartesian_product2( X, skol4 )
% 3.93/4.30 ==> empty_set, X = empty_set }.
% 3.93/4.30 (144) {G3,W5,D3,L1,V0,M1} P(37,25);q { ! cartesian_product2( skol4, skol3 )
% 3.93/4.30 ==> empty_set }.
% 3.93/4.30 (165) {G4,W7,D4,L1,V0,M1} P(37,144);q { ! cartesian_product2( skol4,
% 3.93/4.30 cartesian_product2( skol4, skol3 ) ) ==> empty_set }.
% 3.93/4.30 (173) {G4,W10,D3,L2,V2,M2} R(7,144) { ! subset( cartesian_product2( skol4,
% 3.93/4.30 skol3 ), cartesian_product2( X, Y ) ), subset( skol4, X ) }.
% 3.93/4.30 (229) {G5,W8,D3,L2,V0,M2} R(10,8);r(173) { cartesian_product2( skol3, skol4
% 3.93/4.30 ) ==> empty_set, subset( skol4, skol5 ) }.
% 3.93/4.30 (267) {G5,W5,D3,L1,V0,M1} P(39,165);d(18);d(18);q { ! cartesian_product2(
% 3.93/4.30 skol3, skol4 ) ==> empty_set }.
% 3.93/4.30 (4475) {G6,W0,D0,L0,V0,M0} S(229);r(267);r(11) { }.
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 % SZS output end Refutation
% 3.93/4.30 found a proof!
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Unprocessed initial clauses:
% 3.93/4.30
% 3.93/4.30 (4477) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 3.93/4.30 (4478) {G0,W2,D2,L1,V0,M1} { empty( skol1 ) }.
% 3.93/4.30 (4479) {G0,W2,D2,L1,V0,M1} { ! empty( skol2 ) }.
% 3.93/4.30 (4480) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 3.93/4.30 (4481) {G0,W11,D3,L3,V2,M3} { ! cartesian_product2( X, Y ) = empty_set, X
% 3.93/4.30 = empty_set, Y = empty_set }.
% 3.93/4.30 (4482) {G0,W8,D3,L2,V2,M2} { ! X = empty_set, cartesian_product2( X, Y ) =
% 3.93/4.30 empty_set }.
% 3.93/4.30 (4483) {G0,W8,D3,L2,V2,M2} { ! Y = empty_set, cartesian_product2( X, Y ) =
% 3.93/4.30 empty_set }.
% 3.93/4.30 (4484) {G0,W15,D3,L3,V4,M3} { ! subset( cartesian_product2( X, Y ),
% 3.93/4.30 cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) = empty_set,
% 3.93/4.30 subset( X, Z ) }.
% 3.93/4.30 (4485) {G0,W15,D3,L3,V4,M3} { ! subset( cartesian_product2( X, Y ),
% 3.93/4.30 cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) = empty_set,
% 3.93/4.30 subset( Y, T ) }.
% 3.93/4.30 (4486) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 3.93/4.30 (4487) {G0,W14,D3,L2,V0,M2} { subset( cartesian_product2( skol3, skol4 ),
% 3.93/4.30 cartesian_product2( skol6, skol5 ) ), subset( cartesian_product2( skol4,
% 3.93/4.30 skol3 ), cartesian_product2( skol5, skol6 ) ) }.
% 3.93/4.30 (4488) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 3.93/4.30 (4489) {G0,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 3.93/4.30
% 3.93/4.30
% 3.93/4.30 Total Proof:
% 3.93/4.30
% 3.93/4.30 subsumption: (0) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 3.93/4.30 parent0: (4477) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (4) {G0,W11,D3,L3,V2,M3} I { ! cartesian_product2( X, Y ) ==>
% 3.93/4.30 empty_set, X = empty_set, Y = empty_set }.
% 3.93/4.30 parent0: (4481) {G0,W11,D3,L3,V2,M3} { ! cartesian_product2( X, Y ) =
% 3.93/4.30 empty_set, X = empty_set, Y = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := Y
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 1 ==> 1
% 3.93/4.30 2 ==> 2
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (6) {G0,W8,D3,L2,V2,M2} I { ! Y = empty_set,
% 3.93/4.30 cartesian_product2( X, Y ) ==> empty_set }.
% 3.93/4.30 parent0: (4483) {G0,W8,D3,L2,V2,M2} { ! Y = empty_set, cartesian_product2
% 3.93/4.30 ( X, Y ) = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := Y
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 1 ==> 1
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (7) {G0,W15,D3,L3,V4,M3} I { ! subset( cartesian_product2( X,
% 3.93/4.30 Y ), cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) ==>
% 3.93/4.30 empty_set, subset( X, Z ) }.
% 3.93/4.30 parent0: (4484) {G0,W15,D3,L3,V4,M3} { ! subset( cartesian_product2( X, Y
% 3.93/4.30 ), cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) = empty_set
% 3.93/4.30 , subset( X, Z ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := Y
% 3.93/4.30 Z := Z
% 3.93/4.30 T := T
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 1 ==> 1
% 3.93/4.30 2 ==> 2
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (8) {G0,W15,D3,L3,V4,M3} I { ! subset( cartesian_product2( X,
% 3.93/4.30 Y ), cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) ==>
% 3.93/4.30 empty_set, subset( Y, T ) }.
% 3.93/4.30 parent0: (4485) {G0,W15,D3,L3,V4,M3} { ! subset( cartesian_product2( X, Y
% 3.93/4.30 ), cartesian_product2( Z, T ) ), cartesian_product2( X, Y ) = empty_set
% 3.93/4.30 , subset( Y, T ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := Y
% 3.93/4.30 Z := Z
% 3.93/4.30 T := T
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 1 ==> 1
% 3.93/4.30 2 ==> 2
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (9) {G0,W2,D2,L1,V0,M1} I { ! empty( skol3 ) }.
% 3.93/4.30 parent0: (4486) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (10) {G0,W14,D3,L2,V0,M2} I { subset( cartesian_product2(
% 3.93/4.30 skol3, skol4 ), cartesian_product2( skol6, skol5 ) ), subset(
% 3.93/4.30 cartesian_product2( skol4, skol3 ), cartesian_product2( skol5, skol6 ) )
% 3.93/4.30 }.
% 3.93/4.30 parent0: (4487) {G0,W14,D3,L2,V0,M2} { subset( cartesian_product2( skol3,
% 3.93/4.30 skol4 ), cartesian_product2( skol6, skol5 ) ), subset( cartesian_product2
% 3.93/4.30 ( skol4, skol3 ), cartesian_product2( skol5, skol6 ) ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 1 ==> 1
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (11) {G0,W3,D2,L1,V0,M1} I { ! subset( skol4, skol5 ) }.
% 3.93/4.30 parent0: (4488) {G0,W3,D2,L1,V0,M1} { ! subset( skol4, skol5 ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (12) {G0,W3,D2,L1,V1,M1} I { subset( empty_set, X ) }.
% 3.93/4.30 parent0: (4489) {G0,W3,D2,L1,V1,M1} { subset( empty_set, X ) }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 eqswap: (4631) {G0,W11,D3,L3,V2,M3} { ! empty_set ==> cartesian_product2(
% 3.93/4.30 X, Y ), X = empty_set, Y = empty_set }.
% 3.93/4.30 parent0[0]: (4) {G0,W11,D3,L3,V2,M3} I { ! cartesian_product2( X, Y ) ==>
% 3.93/4.30 empty_set, X = empty_set, Y = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := Y
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 eqswap: (4638) {G0,W8,D3,L2,V2,M2} { ! empty_set = X, cartesian_product2(
% 3.93/4.30 Y, X ) ==> empty_set }.
% 3.93/4.30 parent0[0]: (6) {G0,W8,D3,L2,V2,M2} I { ! Y = empty_set, cartesian_product2
% 3.93/4.30 ( X, Y ) ==> empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := Y
% 3.93/4.30 Y := X
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 eqfact: (4641) {G0,W11,D3,L3,V1,M3} { ! empty_set = empty_set, ! empty_set
% 3.93/4.30 ==> cartesian_product2( X, X ), X = empty_set }.
% 3.93/4.30 parent0[1, 2]: (4631) {G0,W11,D3,L3,V2,M3} { ! empty_set ==>
% 3.93/4.30 cartesian_product2( X, Y ), X = empty_set, Y = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := X
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 paramod: (4642) {G1,W12,D2,L4,V1,M4} { ! empty_set ==> empty_set, !
% 3.93/4.30 empty_set = X, ! empty_set = empty_set, X = empty_set }.
% 3.93/4.30 parent0[1]: (4638) {G0,W8,D3,L2,V2,M2} { ! empty_set = X,
% 3.93/4.30 cartesian_product2( Y, X ) ==> empty_set }.
% 3.93/4.30 parent1[1; 3]: (4641) {G0,W11,D3,L3,V1,M3} { ! empty_set = empty_set, !
% 3.93/4.30 empty_set ==> cartesian_product2( X, X ), X = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 Y := X
% 3.93/4.30 end
% 3.93/4.30 substitution1:
% 3.93/4.30 X := X
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 factor: (4644) {G1,W9,D2,L3,V1,M3} { ! empty_set ==> empty_set, !
% 3.93/4.30 empty_set = X, X = empty_set }.
% 3.93/4.30 parent0[0, 2]: (4642) {G1,W12,D2,L4,V1,M4} { ! empty_set ==> empty_set, !
% 3.93/4.30 empty_set = X, ! empty_set = empty_set, X = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 eqrefl: (4649) {G0,W6,D2,L2,V1,M2} { ! empty_set = X, X = empty_set }.
% 3.93/4.30 parent0[0]: (4644) {G1,W9,D2,L3,V1,M3} { ! empty_set ==> empty_set, !
% 3.93/4.30 empty_set = X, X = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 subsumption: (14) {G1,W6,D2,L2,V1,M2} E(4);d(6);q { ! empty_set = X, X =
% 3.93/4.30 empty_set }.
% 3.93/4.30 parent0: (4649) {G0,W6,D2,L2,V1,M2} { ! empty_set = X, X = empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := X
% 3.93/4.30 end
% 3.93/4.30 permutation0:
% 3.93/4.30 0 ==> 0
% 3.93/4.30 1 ==> 1
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 eqswap: (4653) {G0,W8,D3,L2,V2,M2} { ! empty_set = X, cartesian_product2(
% 3.93/4.30 Y, X ) ==> empty_set }.
% 3.93/4.30 parent0[0]: (6) {G0,W8,D3,L2,V2,M2} I { ! Y = empty_set, cartesian_product2
% 3.93/4.30 ( X, Y ) ==> empty_set }.
% 3.93/4.30 substitution0:
% 3.93/4.30 X := Y
% 3.93/4.30 Y := X
% 3.93/4.30 end
% 3.93/4.30
% 3.93/4.30 eqrefl: (4656) {G0,W5,D3,L1,V1,M1} { cartesian_product2( X, empty_set )
% 3.93/4.30 ==> empty_set }.
% 3.93/4.30 parent0[0]: (4653) {G0,W8,D3,L2,V2,M2} { ! empCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------