TSTP Solution File: SEU189+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Tue Jul 19 07:11:16 EDT 2022
% Result : Theorem 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Mon Jun 20 11:27:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.72/1.11 *** allocated 10000 integers for termspace/termends
% 0.72/1.11 *** allocated 10000 integers for clauses
% 0.72/1.11 *** allocated 10000 integers for justifications
% 0.72/1.11 Bliksem 1.12
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Automatic Strategy Selection
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Clauses:
% 0.72/1.11
% 0.72/1.11 { element( skol1( X ), X ) }.
% 0.72/1.11 { && }.
% 0.72/1.11 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.72/1.11 { ! in( X, Y ), ! in( Y, X ) }.
% 0.72/1.11 { ! in( X, Y ), element( X, Y ) }.
% 0.72/1.11 { empty( skol2 ) }.
% 0.72/1.11 { relation( skol2 ) }.
% 0.72/1.11 { ! empty( X ), relation( X ) }.
% 0.72/1.11 { ! empty( skol3 ) }.
% 0.72/1.11 { relation( skol3 ) }.
% 0.72/1.11 { empty( X ), ! relation( X ), ! empty( relation_dom( X ) ) }.
% 0.72/1.11 { empty( X ), ! relation( X ), ! empty( relation_rng( X ) ) }.
% 0.72/1.11 { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.72/1.11 { ! empty( X ), relation( relation_dom( X ) ) }.
% 0.72/1.11 { ! empty( X ), empty( relation_rng( X ) ) }.
% 0.72/1.11 { ! empty( X ), relation( relation_rng( X ) ) }.
% 0.72/1.11 { empty( skol4 ) }.
% 0.72/1.11 { ! empty( skol5 ) }.
% 0.72/1.11 { ! in( X, Y ), ! empty( Y ) }.
% 0.72/1.11 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.72/1.11 { && }.
% 0.72/1.11 { && }.
% 0.72/1.11 { && }.
% 0.72/1.11 { empty( empty_set ) }.
% 0.72/1.11 { relation( empty_set ) }.
% 0.72/1.11 { empty( empty_set ) }.
% 0.72/1.11 { ! empty( X ), X = empty_set }.
% 0.72/1.11 { relation( skol6 ) }.
% 0.72/1.11 { alpha1( skol6 ), relation_rng( skol6 ) = empty_set }.
% 0.72/1.11 { alpha1( skol6 ), ! relation_dom( skol6 ) = empty_set }.
% 0.72/1.11 { ! alpha1( X ), relation_dom( X ) = empty_set }.
% 0.72/1.11 { ! alpha1( X ), ! relation_rng( X ) = empty_set }.
% 0.72/1.11 { ! relation_dom( X ) = empty_set, relation_rng( X ) = empty_set, alpha1( X
% 0.72/1.11 ) }.
% 0.72/1.11 { relation_dom( empty_set ) = empty_set }.
% 0.72/1.11 { relation_rng( empty_set ) = empty_set }.
% 0.72/1.11 { ! relation( X ), ! relation_dom( X ) = empty_set, X = empty_set }.
% 0.72/1.11 { ! relation( X ), ! relation_rng( X ) = empty_set, X = empty_set }.
% 0.72/1.11
% 0.72/1.11 percentage equality = 0.233333, percentage horn = 0.909091
% 0.72/1.11 This is a problem with some equality
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Options Used:
% 0.72/1.11
% 0.72/1.11 useres = 1
% 0.72/1.11 useparamod = 1
% 0.72/1.11 useeqrefl = 1
% 0.72/1.11 useeqfact = 1
% 0.72/1.11 usefactor = 1
% 0.72/1.11 usesimpsplitting = 0
% 0.72/1.11 usesimpdemod = 5
% 0.72/1.11 usesimpres = 3
% 0.72/1.11
% 0.72/1.11 resimpinuse = 1000
% 0.72/1.11 resimpclauses = 20000
% 0.72/1.11 substype = eqrewr
% 0.72/1.11 backwardsubs = 1
% 0.72/1.11 selectoldest = 5
% 0.72/1.11
% 0.72/1.11 litorderings [0] = split
% 0.72/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.11
% 0.72/1.11 termordering = kbo
% 0.72/1.11
% 0.72/1.11 litapriori = 0
% 0.72/1.11 termapriori = 1
% 0.72/1.11 litaposteriori = 0
% 0.72/1.11 termaposteriori = 0
% 0.72/1.11 demodaposteriori = 0
% 0.72/1.11 ordereqreflfact = 0
% 0.72/1.11
% 0.72/1.11 litselect = negord
% 0.72/1.11
% 0.72/1.11 maxweight = 15
% 0.72/1.11 maxdepth = 30000
% 0.72/1.11 maxlength = 115
% 0.72/1.11 maxnrvars = 195
% 0.72/1.11 excuselevel = 1
% 0.72/1.11 increasemaxweight = 1
% 0.72/1.11
% 0.72/1.11 maxselected = 10000000
% 0.72/1.11 maxnrclauses = 10000000
% 0.72/1.11
% 0.72/1.11 showgenerated = 0
% 0.72/1.11 showkept = 0
% 0.72/1.11 showselected = 0
% 0.72/1.11 showdeleted = 0
% 0.72/1.11 showresimp = 1
% 0.72/1.11 showstatus = 2000
% 0.72/1.11
% 0.72/1.11 prologoutput = 0
% 0.72/1.11 nrgoals = 5000000
% 0.72/1.11 totalproof = 1
% 0.72/1.11
% 0.72/1.11 Symbols occurring in the translation:
% 0.72/1.11
% 0.72/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.11 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.72/1.11 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.72/1.11 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.72/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 element [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.72/1.11 empty [38, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.72/1.11 in [39, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.72/1.11 relation [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.72/1.11 relation_dom [41, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.72/1.11 relation_rng [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.72/1.11 empty_set [43, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.72/1.11 alpha1 [44, 1] (w:1, o:23, a:1, s:1, b:1),
% 0.72/1.11 skol1 [45, 1] (w:1, o:24, a:1, s:1, b:1),
% 0.72/1.11 skol2 [46, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.72/1.11 skol3 [47, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.72/1.11 skol4 [48, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.72/1.11 skol5 [49, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.72/1.11 skol6 [50, 0] (w:1, o:13, a:1, s:1, b:1).
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Starting Search:
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Bliksems!, er is een bewijs:
% 0.72/1.11 % SZS status Theorem
% 0.72/1.11 % SZS output start Refutation
% 0.72/1.11
% 0.72/1.11 (10) {G0,W7,D3,L3,V1,M3} I { empty( X ), ! relation( X ), ! empty(
% 0.72/1.11 relation_dom( X ) ) }.
% 0.72/1.11 (11) {G0,W7,D3,L3,V1,M3} I { empty( X ), ! relation( X ), ! empty(
% 0.72/1.11 relation_rng( X ) ) }.
% 0.72/1.11 (20) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.72/1.11 (22) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.72/1.11 (23) {G0,W2,D2,L1,V0,M1} I { relation( skol6 ) }.
% 0.72/1.11 (24) {G0,W6,D3,L2,V0,M2} I { alpha1( skol6 ), relation_rng( skol6 ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 (25) {G0,W6,D3,L2,V0,M2} I { alpha1( skol6 ), ! relation_dom( skol6 ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 (26) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), relation_dom( X ) ==> empty_set
% 0.72/1.11 }.
% 0.72/1.11 (27) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), ! relation_rng( X ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 (29) {G0,W4,D3,L1,V0,M1} I { relation_dom( empty_set ) ==> empty_set }.
% 0.72/1.11 (30) {G0,W4,D3,L1,V0,M1} I { relation_rng( empty_set ) ==> empty_set }.
% 0.72/1.11 (55) {G1,W5,D3,L2,V0,M2} R(10,23) { empty( skol6 ), ! empty( relation_dom(
% 0.72/1.11 skol6 ) ) }.
% 0.72/1.11 (77) {G1,W5,D3,L2,V0,M2} R(11,23) { empty( skol6 ), ! empty( relation_rng(
% 0.72/1.11 skol6 ) ) }.
% 0.72/1.11 (109) {G2,W4,D2,L2,V0,M2} P(24,77);r(20) { empty( skol6 ), alpha1( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 (111) {G3,W5,D2,L2,V0,M2} R(109,22) { alpha1( skol6 ), skol6 ==> empty_set
% 0.72/1.11 }.
% 0.72/1.11 (116) {G4,W2,D2,L1,V0,M1} S(25);d(111);d(29);q { alpha1( skol6 ) }.
% 0.72/1.11 (125) {G2,W4,D2,L2,V0,M2} P(26,55);r(20) { empty( skol6 ), ! alpha1( skol6
% 0.72/1.11 ) }.
% 0.72/1.11 (130) {G3,W2,D2,L1,V0,M1} S(125);r(109) { empty( skol6 ) }.
% 0.72/1.11 (132) {G4,W3,D2,L1,V0,M1} R(130,22) { skol6 ==> empty_set }.
% 0.72/1.11 (133) {G5,W0,D0,L0,V0,M0} R(27,116);d(132);d(30);q { }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 % SZS output end Refutation
% 0.72/1.11 found a proof!
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Unprocessed initial clauses:
% 0.72/1.11
% 0.72/1.11 (135) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.72/1.11 (136) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (137) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.72/1.11 (138) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.72/1.11 (139) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.72/1.11 (140) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 0.72/1.11 (141) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.72/1.11 (142) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.72/1.11 (143) {G0,W2,D2,L1,V0,M1} { ! empty( skol3 ) }.
% 0.72/1.11 (144) {G0,W2,D2,L1,V0,M1} { relation( skol3 ) }.
% 0.72/1.11 (145) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.72/1.11 relation_dom( X ) ) }.
% 0.72/1.11 (146) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.72/1.11 relation_rng( X ) ) }.
% 0.72/1.11 (147) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.72/1.11 (148) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_dom( X ) )
% 0.72/1.11 }.
% 0.72/1.11 (149) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_rng( X ) ) }.
% 0.72/1.11 (150) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_rng( X ) )
% 0.72/1.11 }.
% 0.72/1.11 (151) {G0,W2,D2,L1,V0,M1} { empty( skol4 ) }.
% 0.72/1.11 (152) {G0,W2,D2,L1,V0,M1} { ! empty( skol5 ) }.
% 0.72/1.11 (153) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.72/1.11 (154) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.72/1.11 (155) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (156) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (157) {G0,W1,D1,L1,V0,M1} { && }.
% 0.72/1.11 (158) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.72/1.11 (159) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.72/1.11 (160) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.72/1.11 (161) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.72/1.11 (162) {G0,W2,D2,L1,V0,M1} { relation( skol6 ) }.
% 0.72/1.11 (163) {G0,W6,D3,L2,V0,M2} { alpha1( skol6 ), relation_rng( skol6 ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 (164) {G0,W6,D3,L2,V0,M2} { alpha1( skol6 ), ! relation_dom( skol6 ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 (165) {G0,W6,D3,L2,V1,M2} { ! alpha1( X ), relation_dom( X ) = empty_set
% 0.72/1.11 }.
% 0.72/1.11 (166) {G0,W6,D3,L2,V1,M2} { ! alpha1( X ), ! relation_rng( X ) = empty_set
% 0.72/1.11 }.
% 0.72/1.11 (167) {G0,W10,D3,L3,V1,M3} { ! relation_dom( X ) = empty_set, relation_rng
% 0.72/1.11 ( X ) = empty_set, alpha1( X ) }.
% 0.72/1.11 (168) {G0,W4,D3,L1,V0,M1} { relation_dom( empty_set ) = empty_set }.
% 0.72/1.11 (169) {G0,W4,D3,L1,V0,M1} { relation_rng( empty_set ) = empty_set }.
% 0.72/1.11 (170) {G0,W9,D3,L3,V1,M3} { ! relation( X ), ! relation_dom( X ) =
% 0.72/1.11 empty_set, X = empty_set }.
% 0.72/1.11 (171) {G0,W9,D3,L3,V1,M3} { ! relation( X ), ! relation_rng( X ) =
% 0.72/1.11 empty_set, X = empty_set }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Total Proof:
% 0.72/1.11
% 0.72/1.11 subsumption: (10) {G0,W7,D3,L3,V1,M3} I { empty( X ), ! relation( X ), !
% 0.72/1.11 empty( relation_dom( X ) ) }.
% 0.72/1.11 parent0: (145) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty
% 0.72/1.11 ( relation_dom( X ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 2 ==> 2
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (11) {G0,W7,D3,L3,V1,M3} I { empty( X ), ! relation( X ), !
% 0.72/1.11 empty( relation_rng( X ) ) }.
% 0.72/1.11 parent0: (146) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty
% 0.72/1.11 ( relation_rng( X ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 2 ==> 2
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (20) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.72/1.11 parent0: (158) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (22) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.72/1.11 parent0: (161) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (23) {G0,W2,D2,L1,V0,M1} I { relation( skol6 ) }.
% 0.72/1.11 parent0: (162) {G0,W2,D2,L1,V0,M1} { relation( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (24) {G0,W6,D3,L2,V0,M2} I { alpha1( skol6 ), relation_rng(
% 0.72/1.11 skol6 ) ==> empty_set }.
% 0.72/1.11 parent0: (163) {G0,W6,D3,L2,V0,M2} { alpha1( skol6 ), relation_rng( skol6
% 0.72/1.11 ) = empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (25) {G0,W6,D3,L2,V0,M2} I { alpha1( skol6 ), ! relation_dom(
% 0.72/1.11 skol6 ) ==> empty_set }.
% 0.72/1.11 parent0: (164) {G0,W6,D3,L2,V0,M2} { alpha1( skol6 ), ! relation_dom(
% 0.72/1.11 skol6 ) = empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (26) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), relation_dom( X )
% 0.72/1.11 ==> empty_set }.
% 0.72/1.11 parent0: (165) {G0,W6,D3,L2,V1,M2} { ! alpha1( X ), relation_dom( X ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (27) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), ! relation_rng( X
% 0.72/1.11 ) ==> empty_set }.
% 0.72/1.11 parent0: (166) {G0,W6,D3,L2,V1,M2} { ! alpha1( X ), ! relation_rng( X ) =
% 0.72/1.11 empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (29) {G0,W4,D3,L1,V0,M1} I { relation_dom( empty_set ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 parent0: (168) {G0,W4,D3,L1,V0,M1} { relation_dom( empty_set ) = empty_set
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (30) {G0,W4,D3,L1,V0,M1} I { relation_rng( empty_set ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 parent0: (169) {G0,W4,D3,L1,V0,M1} { relation_rng( empty_set ) = empty_set
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (227) {G1,W5,D3,L2,V0,M2} { empty( skol6 ), ! empty(
% 0.72/1.11 relation_dom( skol6 ) ) }.
% 0.72/1.11 parent0[1]: (10) {G0,W7,D3,L3,V1,M3} I { empty( X ), ! relation( X ), !
% 0.72/1.11 empty( relation_dom( X ) ) }.
% 0.72/1.11 parent1[0]: (23) {G0,W2,D2,L1,V0,M1} I { relation( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol6
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (55) {G1,W5,D3,L2,V0,M2} R(10,23) { empty( skol6 ), ! empty(
% 0.72/1.11 relation_dom( skol6 ) ) }.
% 0.72/1.11 parent0: (227) {G1,W5,D3,L2,V0,M2} { empty( skol6 ), ! empty( relation_dom
% 0.72/1.11 ( skol6 ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (228) {G1,W5,D3,L2,V0,M2} { empty( skol6 ), ! empty(
% 0.72/1.11 relation_rng( skol6 ) ) }.
% 0.72/1.11 parent0[1]: (11) {G0,W7,D3,L3,V1,M3} I { empty( X ), ! relation( X ), !
% 0.72/1.11 empty( relation_rng( X ) ) }.
% 0.72/1.11 parent1[0]: (23) {G0,W2,D2,L1,V0,M1} I { relation( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol6
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (77) {G1,W5,D3,L2,V0,M2} R(11,23) { empty( skol6 ), ! empty(
% 0.72/1.11 relation_rng( skol6 ) ) }.
% 0.72/1.11 parent0: (228) {G1,W5,D3,L2,V0,M2} { empty( skol6 ), ! empty( relation_rng
% 0.72/1.11 ( skol6 ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 paramod: (230) {G1,W6,D2,L3,V0,M3} { ! empty( empty_set ), alpha1( skol6 )
% 0.72/1.11 , empty( skol6 ) }.
% 0.72/1.11 parent0[1]: (24) {G0,W6,D3,L2,V0,M2} I { alpha1( skol6 ), relation_rng(
% 0.72/1.11 skol6 ) ==> empty_set }.
% 0.72/1.11 parent1[1; 2]: (77) {G1,W5,D3,L2,V0,M2} R(11,23) { empty( skol6 ), ! empty
% 0.72/1.11 ( relation_rng( skol6 ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (231) {G1,W4,D2,L2,V0,M2} { alpha1( skol6 ), empty( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 parent0[0]: (230) {G1,W6,D2,L3,V0,M3} { ! empty( empty_set ), alpha1(
% 0.72/1.11 skol6 ), empty( skol6 ) }.
% 0.72/1.11 parent1[0]: (20) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (109) {G2,W4,D2,L2,V0,M2} P(24,77);r(20) { empty( skol6 ),
% 0.72/1.11 alpha1( skol6 ) }.
% 0.72/1.11 parent0: (231) {G1,W4,D2,L2,V0,M2} { alpha1( skol6 ), empty( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 1
% 0.72/1.11 1 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqswap: (232) {G0,W5,D2,L2,V1,M2} { empty_set = X, ! empty( X ) }.
% 0.72/1.11 parent0[1]: (22) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (233) {G1,W5,D2,L2,V0,M2} { empty_set = skol6, alpha1( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 parent0[1]: (232) {G0,W5,D2,L2,V1,M2} { empty_set = X, ! empty( X ) }.
% 0.72/1.11 parent1[0]: (109) {G2,W4,D2,L2,V0,M2} P(24,77);r(20) { empty( skol6 ),
% 0.72/1.11 alpha1( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol6
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqswap: (234) {G1,W5,D2,L2,V0,M2} { skol6 = empty_set, alpha1( skol6 ) }.
% 0.72/1.11 parent0[0]: (233) {G1,W5,D2,L2,V0,M2} { empty_set = skol6, alpha1( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (111) {G3,W5,D2,L2,V0,M2} R(109,22) { alpha1( skol6 ), skol6
% 0.72/1.11 ==> empty_set }.
% 0.72/1.11 parent0: (234) {G1,W5,D2,L2,V0,M2} { skol6 = empty_set, alpha1( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 1
% 0.72/1.11 1 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 paramod: (239) {G1,W8,D3,L3,V0,M3} { ! relation_dom( empty_set ) ==>
% 0.72/1.11 empty_set, alpha1( skol6 ), alpha1( skol6 ) }.
% 0.72/1.11 parent0[1]: (111) {G3,W5,D2,L2,V0,M2} R(109,22) { alpha1( skol6 ), skol6
% 0.72/1.11 ==> empty_set }.
% 0.72/1.11 parent1[1; 3]: (25) {G0,W6,D3,L2,V0,M2} I { alpha1( skol6 ), ! relation_dom
% 0.72/1.11 ( skol6 ) ==> empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 factor: (250) {G1,W6,D3,L2,V0,M2} { ! relation_dom( empty_set ) ==>
% 0.72/1.11 empty_set, alpha1( skol6 ) }.
% 0.72/1.11 parent0[1, 2]: (239) {G1,W8,D3,L3,V0,M3} { ! relation_dom( empty_set ) ==>
% 0.72/1.11 empty_set, alpha1( skol6 ), alpha1( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 paramod: (251) {G1,W5,D2,L2,V0,M2} { ! empty_set ==> empty_set, alpha1(
% 0.72/1.11 skol6 ) }.
% 0.72/1.11 parent0[0]: (29) {G0,W4,D3,L1,V0,M1} I { relation_dom( empty_set ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 parent1[0; 2]: (250) {G1,W6,D3,L2,V0,M2} { ! relation_dom( empty_set ) ==>
% 0.72/1.11 empty_set, alpha1( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqrefl: (252) {G0,W2,D2,L1,V0,M1} { alpha1( skol6 ) }.
% 0.72/1.11 parent0[0]: (251) {G1,W5,D2,L2,V0,M2} { ! empty_set ==> empty_set, alpha1
% 0.72/1.11 ( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (116) {G4,W2,D2,L1,V0,M1} S(25);d(111);d(29);q { alpha1( skol6
% 0.72/1.11 ) }.
% 0.72/1.11 parent0: (252) {G0,W2,D2,L1,V0,M1} { alpha1( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 paramod: (254) {G1,W6,D2,L3,V0,M3} { ! empty( empty_set ), ! alpha1( skol6
% 0.72/1.11 ), empty( skol6 ) }.
% 0.72/1.11 parent0[1]: (26) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), relation_dom( X )
% 0.72/1.11 ==> empty_set }.
% 0.72/1.11 parent1[1; 2]: (55) {G1,W5,D3,L2,V0,M2} R(10,23) { empty( skol6 ), ! empty
% 0.72/1.11 ( relation_dom( skol6 ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol6
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (255) {G1,W4,D2,L2,V0,M2} { ! alpha1( skol6 ), empty( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 parent0[0]: (254) {G1,W6,D2,L3,V0,M3} { ! empty( empty_set ), ! alpha1(
% 0.72/1.11 skol6 ), empty( skol6 ) }.
% 0.72/1.11 parent1[0]: (20) {G0,W2,D2,L1,V0,M1} I { empty( empty_set ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (125) {G2,W4,D2,L2,V0,M2} P(26,55);r(20) { empty( skol6 ), !
% 0.72/1.11 alpha1( skol6 ) }.
% 0.72/1.11 parent0: (255) {G1,W4,D2,L2,V0,M2} { ! alpha1( skol6 ), empty( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 1
% 0.72/1.11 1 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (256) {G3,W4,D2,L2,V0,M2} { empty( skol6 ), empty( skol6 ) }.
% 0.72/1.11 parent0[1]: (125) {G2,W4,D2,L2,V0,M2} P(26,55);r(20) { empty( skol6 ), !
% 0.72/1.11 alpha1( skol6 ) }.
% 0.72/1.11 parent1[1]: (109) {G2,W4,D2,L2,V0,M2} P(24,77);r(20) { empty( skol6 ),
% 0.72/1.11 alpha1( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 factor: (257) {G3,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.72/1.11 parent0[0, 1]: (256) {G3,W4,D2,L2,V0,M2} { empty( skol6 ), empty( skol6 )
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (130) {G3,W2,D2,L1,V0,M1} S(125);r(109) { empty( skol6 ) }.
% 0.72/1.11 parent0: (257) {G3,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqswap: (258) {G0,W5,D2,L2,V1,M2} { empty_set = X, ! empty( X ) }.
% 0.72/1.11 parent0[1]: (22) {G0,W5,D2,L2,V1,M2} I { ! empty( X ), X = empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (259) {G1,W3,D2,L1,V0,M1} { empty_set = skol6 }.
% 0.72/1.11 parent0[1]: (258) {G0,W5,D2,L2,V1,M2} { empty_set = X, ! empty( X ) }.
% 0.72/1.11 parent1[0]: (130) {G3,W2,D2,L1,V0,M1} S(125);r(109) { empty( skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol6
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqswap: (260) {G1,W3,D2,L1,V0,M1} { skol6 = empty_set }.
% 0.72/1.11 parent0[0]: (259) {G1,W3,D2,L1,V0,M1} { empty_set = skol6 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (132) {G4,W3,D2,L1,V0,M1} R(130,22) { skol6 ==> empty_set }.
% 0.72/1.11 parent0: (260) {G1,W3,D2,L1,V0,M1} { skol6 = empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqswap: (261) {G0,W6,D3,L2,V1,M2} { ! empty_set ==> relation_rng( X ), !
% 0.72/1.11 alpha1( X ) }.
% 0.72/1.11 parent0[1]: (27) {G0,W6,D3,L2,V1,M2} I { ! alpha1( X ), ! relation_rng( X )
% 0.72/1.11 ==> empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (264) {G1,W4,D3,L1,V0,M1} { ! empty_set ==> relation_rng(
% 0.72/1.11 skol6 ) }.
% 0.72/1.11 parent0[1]: (261) {G0,W6,D3,L2,V1,M2} { ! empty_set ==> relation_rng( X )
% 0.72/1.11 , ! alpha1( X ) }.
% 0.72/1.11 parent1[0]: (116) {G4,W2,D2,L1,V0,M1} S(25);d(111);d(29);q { alpha1( skol6
% 0.72/1.11 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol6
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 paramod: (265) {G2,W4,D3,L1,V0,M1} { ! empty_set ==> relation_rng(
% 0.72/1.11 empty_set ) }.
% 0.72/1.11 parent0[0]: (132) {G4,W3,D2,L1,V0,M1} R(130,22) { skol6 ==> empty_set }.
% 0.72/1.11 parent1[0; 4]: (264) {G1,W4,D3,L1,V0,M1} { ! empty_set ==> relation_rng(
% 0.72/1.11 skol6 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 paramod: (266) {G1,W3,D2,L1,V0,M1} { ! empty_set ==> empty_set }.
% 0.72/1.11 parent0[0]: (30) {G0,W4,D3,L1,V0,M1} I { relation_rng( empty_set ) ==>
% 0.72/1.11 empty_set }.
% 0.72/1.11 parent1[0; 3]: (265) {G2,W4,D3,L1,V0,M1} { ! empty_set ==> relation_rng(
% 0.72/1.11 empty_set ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 eqrefl: (267) {G0,W0,D0,L0,V0,M0} { }.
% 0.72/1.11 parent0[0]: (266) {G1,W3,D2,L1,V0,M1} { ! empty_set ==> empty_set }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (133) {G5,W0,D0,L0,V0,M0} R(27,116);d(132);d(30);q { }.
% 0.72/1.11 parent0: (267) {G0,W0,D0,L0,V0,M0} { }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 Proof check complete!
% 0.72/1.11
% 0.72/1.11 Memory use:
% 0.72/1.11
% 0.72/1.11 space for terms: 1518
% 0.72/1.11 space for clauses: 6859
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 clauses generated: 535
% 0.72/1.11 clauses kept: 134
% 0.72/1.11 clauses selected: 55
% 0.72/1.11 clauses deleted: 6
% 0.72/1.11 clauses inuse deleted: 0
% 0.72/1.11
% 0.72/1.11 subsentry: 948
% 0.72/1.11 literals s-matched: 716
% 0.72/1.11 literals matched: 716
% 0.72/1.11 full subsumption: 79
% 0.72/1.11
% 0.72/1.11 checksum: -1159626561
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Bliksem ended
%------------------------------------------------------------------------------