TSTP Solution File: SEU200+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU200+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Tue Jul 19 07:11:21 EDT 2022
% Result : Theorem 0.74s 1.59s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU200+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.32 % Computer : n008.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 : Mon Jun 20 13:38:37 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.74/1.59 *** allocated 10000 integers for termspace/termends
% 0.74/1.59 *** allocated 10000 integers for clauses
% 0.74/1.59 *** allocated 10000 integers for justifications
% 0.74/1.59 Bliksem 1.12
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Automatic Strategy Selection
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Clauses:
% 0.74/1.59
% 0.74/1.59 { ! in( X, Y ), ! in( Y, X ) }.
% 0.74/1.59 { ! empty( X ), relation( X ) }.
% 0.74/1.59 { && }.
% 0.74/1.59 { && }.
% 0.74/1.59 { && }.
% 0.74/1.59 { && }.
% 0.74/1.59 { ! relation( X ), relation( relation_rng_restriction( Y, X ) ) }.
% 0.74/1.59 { && }.
% 0.74/1.59 { element( skol1( X ), X ) }.
% 0.74/1.59 { ! empty( powerset( X ) ) }.
% 0.74/1.59 { empty( empty_set ) }.
% 0.74/1.59 { empty( empty_set ) }.
% 0.74/1.59 { relation( empty_set ) }.
% 0.74/1.59 { empty( X ), ! relation( X ), ! empty( relation_dom( X ) ) }.
% 0.74/1.59 { empty( X ), ! relation( X ), ! empty( relation_rng( X ) ) }.
% 0.74/1.59 { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.74/1.59 { ! empty( X ), relation( relation_dom( X ) ) }.
% 0.74/1.59 { ! empty( X ), empty( relation_rng( X ) ) }.
% 0.74/1.59 { ! empty( X ), relation( relation_rng( X ) ) }.
% 0.74/1.59 { empty( skol2 ) }.
% 0.74/1.59 { relation( skol2 ) }.
% 0.74/1.59 { empty( X ), ! empty( skol3( Y ) ) }.
% 0.74/1.59 { empty( X ), element( skol3( X ), powerset( X ) ) }.
% 0.74/1.59 { empty( skol4 ) }.
% 0.74/1.59 { ! empty( skol5 ) }.
% 0.74/1.59 { relation( skol5 ) }.
% 0.74/1.59 { empty( skol6( Y ) ) }.
% 0.74/1.59 { element( skol6( X ), powerset( X ) ) }.
% 0.74/1.59 { ! empty( skol7 ) }.
% 0.74/1.59 { subset( X, X ) }.
% 0.74/1.59 { ! relation( X ), subset( relation_rng_restriction( Y, X ), X ) }.
% 0.74/1.59 { relation( skol8 ) }.
% 0.74/1.59 { ! subset( relation_rng( relation_rng_restriction( skol9, skol8 ) ),
% 0.74/1.59 relation_rng( skol8 ) ) }.
% 0.74/1.59 { ! in( X, Y ), element( X, Y ) }.
% 0.74/1.59 { ! relation( X ), ! relation( Y ), ! subset( X, Y ), subset( relation_dom
% 0.74/1.59 ( X ), relation_dom( Y ) ) }.
% 0.74/1.59 { ! relation( X ), ! relation( Y ), ! subset( X, Y ), subset( relation_rng
% 0.74/1.59 ( X ), relation_rng( Y ) ) }.
% 0.74/1.59 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.74/1.59 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.74/1.59 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.74/1.59 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.74/1.59 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.74/1.59 { ! empty( X ), X = empty_set }.
% 0.74/1.59 { ! in( X, Y ), ! empty( Y ) }.
% 0.74/1.59 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.74/1.59
% 0.74/1.59 percentage equality = 0.027778, percentage horn = 0.948718
% 0.74/1.59 This is a problem with some equality
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Options Used:
% 0.74/1.59
% 0.74/1.59 useres = 1
% 0.74/1.59 useparamod = 1
% 0.74/1.59 useeqrefl = 1
% 0.74/1.59 useeqfact = 1
% 0.74/1.59 usefactor = 1
% 0.74/1.59 usesimpsplitting = 0
% 0.74/1.59 usesimpdemod = 5
% 0.74/1.59 usesimpres = 3
% 0.74/1.59
% 0.74/1.59 resimpinuse = 1000
% 0.74/1.59 resimpclauses = 20000
% 0.74/1.59 substype = eqrewr
% 0.74/1.59 backwardsubs = 1
% 0.74/1.59 selectoldest = 5
% 0.74/1.59
% 0.74/1.59 litorderings [0] = split
% 0.74/1.59 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.59
% 0.74/1.59 termordering = kbo
% 0.74/1.59
% 0.74/1.59 litapriori = 0
% 0.74/1.59 termapriori = 1
% 0.74/1.59 litaposteriori = 0
% 0.74/1.59 termaposteriori = 0
% 0.74/1.59 demodaposteriori = 0
% 0.74/1.59 ordereqreflfact = 0
% 0.74/1.59
% 0.74/1.59 litselect = negord
% 0.74/1.59
% 0.74/1.59 maxweight = 15
% 0.74/1.59 maxdepth = 30000
% 0.74/1.59 maxlength = 115
% 0.74/1.59 maxnrvars = 195
% 0.74/1.59 excuselevel = 1
% 0.74/1.59 increasemaxweight = 1
% 0.74/1.59
% 0.74/1.59 maxselected = 10000000
% 0.74/1.59 maxnrclauses = 10000000
% 0.74/1.59
% 0.74/1.59 showgenerated = 0
% 0.74/1.59 showkept = 0
% 0.74/1.59 showselected = 0
% 0.74/1.59 showdeleted = 0
% 0.74/1.59 showresimp = 1
% 0.74/1.59 showstatus = 2000
% 0.74/1.59
% 0.74/1.59 prologoutput = 0
% 0.74/1.59 nrgoals = 5000000
% 0.74/1.59 totalproof = 1
% 0.74/1.59
% 0.74/1.59 Symbols occurring in the translation:
% 0.74/1.59
% 0.74/1.59 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.59 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.74/1.59 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.74/1.59 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.74/1.59 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.59 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.59 in [37, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.74/1.59 empty [38, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.59 relation [39, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.59 relation_rng_restriction [40, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.74/1.59 element [41, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.74/1.59 powerset [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.59 empty_set [43, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.74/1.59 relation_dom [44, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.59 relation_rng [45, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.59 subset [46, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.74/1.59 skol1 [48, 1] (w:1, o:26, a:1, s:1, b:1),
% 0.74/1.59 skol2 [49, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.74/1.59 skol3 [50, 1] (w:1, o:27, a:1, s:1, b:1),
% 0.74/1.59 skol4 [51, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.74/1.59 skol5 [52, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.74/1.59 skol6 [53, 1] (w:1, o:28, a:1, s:1, b:1),
% 0.74/1.59 skol7 [54, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.74/1.59 skol8 [55, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.74/1.59 skol9 [56, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Starting Search:
% 0.74/1.59
% 0.74/1.59 *** allocated 15000 integers for clauses
% 0.74/1.59 *** allocated 22500 integers for clauses
% 0.74/1.59 *** allocated 33750 integers for clauses
% 0.74/1.59 *** allocated 50625 integers for clauses
% 0.74/1.59 *** allocated 15000 integers for termspace/termends
% 0.74/1.59 *** allocated 75937 integers for clauses
% 0.74/1.59 Resimplifying inuse:
% 0.74/1.59 Done
% 0.74/1.59
% 0.74/1.59 *** allocated 22500 integers for termspace/termends
% 0.74/1.59 *** allocated 113905 integers for clauses
% 0.74/1.59 *** allocated 33750 integers for termspace/termends
% 0.74/1.59
% 0.74/1.59 Intermediate Status:
% 0.74/1.59 Generated: 8964
% 0.74/1.59 Kept: 2002
% 0.74/1.59 Inuse: 305
% 0.74/1.59 Deleted: 80
% 0.74/1.59 Deletedinuse: 30
% 0.74/1.59
% 0.74/1.59 Resimplifying inuse:
% 0.74/1.59 Done
% 0.74/1.59
% 0.74/1.59 *** allocated 170857 integers for clauses
% 0.74/1.59 *** allocated 50625 integers for termspace/termends
% 0.74/1.59 Resimplifying inuse:
% 0.74/1.59 Done
% 0.74/1.59
% 0.74/1.59 *** allocated 256285 integers for clauses
% 0.74/1.59
% 0.74/1.59 Intermediate Status:
% 0.74/1.59 Generated: 25594
% 0.74/1.59 Kept: 4071
% 0.74/1.59 Inuse: 464
% 0.74/1.59 Deleted: 162
% 0.74/1.59 Deletedinuse: 73
% 0.74/1.59
% 0.74/1.59 Resimplifying inuse:
% 0.74/1.59 Done
% 0.74/1.59
% 0.74/1.59 *** allocated 75937 integers for termspace/termends
% 0.74/1.59
% 0.74/1.59 Bliksems!, er is een bewijs:
% 0.74/1.59 % SZS status Theorem
% 0.74/1.59 % SZS output start Refutation
% 0.74/1.59
% 0.74/1.59 (3) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.74/1.59 relation_rng_restriction( Y, X ) ) }.
% 0.74/1.59 (25) {G0,W7,D3,L2,V2,M2} I { ! relation( X ), subset(
% 0.74/1.59 relation_rng_restriction( Y, X ), X ) }.
% 0.74/1.59 (26) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.74/1.59 (27) {G0,W7,D4,L1,V0,M1} I { ! subset( relation_rng(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), relation_rng( skol8 ) ) }.
% 0.74/1.59 (30) {G0,W12,D3,L4,V2,M4} I { ! relation( X ), ! relation( Y ), ! subset( X
% 0.74/1.59 , Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.74/1.59 (153) {G1,W5,D3,L1,V1,M1} R(25,26) { subset( relation_rng_restriction( X,
% 0.74/1.59 skol8 ), skol8 ) }.
% 0.74/1.59 (208) {G1,W7,D3,L2,V0,M2} R(30,27);r(3) { ! relation( skol8 ), ! subset(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 (4847) {G2,W0,D0,L0,V0,M0} S(208);r(26);r(153) { }.
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 % SZS output end Refutation
% 0.74/1.59 found a proof!
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Unprocessed initial clauses:
% 0.74/1.59
% 0.74/1.59 (4849) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.74/1.59 (4850) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.74/1.59 (4851) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.59 (4852) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.59 (4853) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.59 (4854) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.59 (4855) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.74/1.59 relation_rng_restriction( Y, X ) ) }.
% 0.74/1.59 (4856) {G0,W1,D1,L1,V0,M1} { && }.
% 0.74/1.59 (4857) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.74/1.59 (4858) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.74/1.59 (4859) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.74/1.59 (4860) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.74/1.59 (4861) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.74/1.59 (4862) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.74/1.59 relation_dom( X ) ) }.
% 0.74/1.59 (4863) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.74/1.59 relation_rng( X ) ) }.
% 0.74/1.59 (4864) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.74/1.59 (4865) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_dom( X ) )
% 0.74/1.59 }.
% 0.74/1.59 (4866) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_rng( X ) ) }.
% 0.74/1.59 (4867) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_rng( X ) )
% 0.74/1.59 }.
% 0.74/1.59 (4868) {G0,W2,D2,L1,V0,M1} { empty( skol2 ) }.
% 0.74/1.59 (4869) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.74/1.59 (4870) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol3( Y ) ) }.
% 0.74/1.59 (4871) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol3( X ), powerset( X
% 0.74/1.59 ) ) }.
% 0.74/1.59 (4872) {G0,W2,D2,L1,V0,M1} { empty( skol4 ) }.
% 0.74/1.59 (4873) {G0,W2,D2,L1,V0,M1} { ! empty( skol5 ) }.
% 0.74/1.59 (4874) {G0,W2,D2,L1,V0,M1} { relation( skol5 ) }.
% 0.74/1.59 (4875) {G0,W3,D3,L1,V1,M1} { empty( skol6( Y ) ) }.
% 0.74/1.59 (4876) {G0,W5,D3,L1,V1,M1} { element( skol6( X ), powerset( X ) ) }.
% 0.74/1.59 (4877) {G0,W2,D2,L1,V0,M1} { ! empty( skol7 ) }.
% 0.74/1.59 (4878) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.74/1.59 (4879) {G0,W7,D3,L2,V2,M2} { ! relation( X ), subset(
% 0.74/1.59 relation_rng_restriction( Y, X ), X ) }.
% 0.74/1.59 (4880) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.74/1.59 (4881) {G0,W7,D4,L1,V0,M1} { ! subset( relation_rng(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), relation_rng( skol8 ) ) }.
% 0.74/1.59 (4882) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.74/1.59 (4883) {G0,W12,D3,L4,V2,M4} { ! relation( X ), ! relation( Y ), ! subset(
% 0.74/1.59 X, Y ), subset( relation_dom( X ), relation_dom( Y ) ) }.
% 0.74/1.59 (4884) {G0,W12,D3,L4,V2,M4} { ! relation( X ), ! relation( Y ), ! subset(
% 0.74/1.59 X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.74/1.59 (4885) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.74/1.59 (4886) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.74/1.59 }.
% 0.74/1.59 (4887) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.74/1.59 }.
% 0.74/1.59 (4888) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) )
% 0.74/1.59 , element( X, Y ) }.
% 0.74/1.59 (4889) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ),
% 0.74/1.59 ! empty( Z ) }.
% 0.74/1.59 (4890) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.74/1.59 (4891) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.74/1.59 (4892) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Total Proof:
% 0.74/1.59
% 0.74/1.59 subsumption: (3) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.74/1.59 relation_rng_restriction( Y, X ) ) }.
% 0.74/1.59 parent0: (4855) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.74/1.59 relation_rng_restriction( Y, X ) ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 X := X
% 0.74/1.59 Y := Y
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 1 ==> 1
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (25) {G0,W7,D3,L2,V2,M2} I { ! relation( X ), subset(
% 0.74/1.59 relation_rng_restriction( Y, X ), X ) }.
% 0.74/1.59 parent0: (4879) {G0,W7,D3,L2,V2,M2} { ! relation( X ), subset(
% 0.74/1.59 relation_rng_restriction( Y, X ), X ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 X := X
% 0.74/1.59 Y := Y
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 1 ==> 1
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (26) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.74/1.59 parent0: (4880) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (27) {G0,W7,D4,L1,V0,M1} I { ! subset( relation_rng(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), relation_rng( skol8 ) ) }.
% 0.74/1.59 parent0: (4881) {G0,W7,D4,L1,V0,M1} { ! subset( relation_rng(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), relation_rng( skol8 ) ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (30) {G0,W12,D3,L4,V2,M4} I { ! relation( X ), ! relation( Y )
% 0.74/1.59 , ! subset( X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.74/1.59 parent0: (4884) {G0,W12,D3,L4,V2,M4} { ! relation( X ), ! relation( Y ), !
% 0.74/1.59 subset( X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 X := X
% 0.74/1.59 Y := Y
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 1 ==> 1
% 0.74/1.59 2 ==> 2
% 0.74/1.59 3 ==> 3
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 resolution: (4900) {G1,W5,D3,L1,V1,M1} { subset( relation_rng_restriction
% 0.74/1.59 ( X, skol8 ), skol8 ) }.
% 0.74/1.59 parent0[0]: (25) {G0,W7,D3,L2,V2,M2} I { ! relation( X ), subset(
% 0.74/1.59 relation_rng_restriction( Y, X ), X ) }.
% 0.74/1.59 parent1[0]: (26) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 X := skol8
% 0.74/1.59 Y := X
% 0.74/1.59 end
% 0.74/1.59 substitution1:
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (153) {G1,W5,D3,L1,V1,M1} R(25,26) { subset(
% 0.74/1.59 relation_rng_restriction( X, skol8 ), skol8 ) }.
% 0.74/1.59 parent0: (4900) {G1,W5,D3,L1,V1,M1} { subset( relation_rng_restriction( X
% 0.74/1.59 , skol8 ), skol8 ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 X := X
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 resolution: (4901) {G1,W11,D3,L3,V0,M3} { ! relation(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), ! relation( skol8 ), ! subset
% 0.74/1.59 ( relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent0[0]: (27) {G0,W7,D4,L1,V0,M1} I { ! subset( relation_rng(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), relation_rng( skol8 ) ) }.
% 0.74/1.59 parent1[3]: (30) {G0,W12,D3,L4,V2,M4} I { ! relation( X ), ! relation( Y )
% 0.74/1.59 , ! subset( X, Y ), subset( relation_rng( X ), relation_rng( Y ) ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 substitution1:
% 0.74/1.59 X := relation_rng_restriction( skol9, skol8 )
% 0.74/1.59 Y := skol8
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 resolution: (4902) {G1,W9,D3,L3,V0,M3} { ! relation( skol8 ), ! subset(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ), skol8 ), ! relation( skol8 )
% 0.74/1.59 }.
% 0.74/1.59 parent0[0]: (4901) {G1,W11,D3,L3,V0,M3} { ! relation(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ) ), ! relation( skol8 ), ! subset
% 0.74/1.59 ( relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent1[1]: (3) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.74/1.59 relation_rng_restriction( Y, X ) ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 substitution1:
% 0.74/1.59 X := skol8
% 0.74/1.59 Y := skol9
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 factor: (4903) {G1,W7,D3,L2,V0,M2} { ! relation( skol8 ), ! subset(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent0[0, 2]: (4902) {G1,W9,D3,L3,V0,M3} { ! relation( skol8 ), ! subset
% 0.74/1.59 ( relation_rng_restriction( skol9, skol8 ), skol8 ), ! relation( skol8 )
% 0.74/1.59 }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (208) {G1,W7,D3,L2,V0,M2} R(30,27);r(3) { ! relation( skol8 )
% 0.74/1.59 , ! subset( relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent0: (4903) {G1,W7,D3,L2,V0,M2} { ! relation( skol8 ), ! subset(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 0 ==> 0
% 0.74/1.59 1 ==> 1
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 resolution: (4904) {G1,W5,D3,L1,V0,M1} { ! subset(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent0[0]: (208) {G1,W7,D3,L2,V0,M2} R(30,27);r(3) { ! relation( skol8 ),
% 0.74/1.59 ! subset( relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent1[0]: (26) {G0,W2,D2,L1,V0,M1} I { relation( skol8 ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 substitution1:
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 resolution: (4905) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.59 parent0[0]: (4904) {G1,W5,D3,L1,V0,M1} { ! subset(
% 0.74/1.59 relation_rng_restriction( skol9, skol8 ), skol8 ) }.
% 0.74/1.59 parent1[0]: (153) {G1,W5,D3,L1,V1,M1} R(25,26) { subset(
% 0.74/1.59 relation_rng_restriction( X, skol8 ), skol8 ) }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 substitution1:
% 0.74/1.59 X := skol9
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 subsumption: (4847) {G2,W0,D0,L0,V0,M0} S(208);r(26);r(153) { }.
% 0.74/1.59 parent0: (4905) {G2,W0,D0,L0,V0,M0} { }.
% 0.74/1.59 substitution0:
% 0.74/1.59 end
% 0.74/1.59 permutation0:
% 0.74/1.59 end
% 0.74/1.59
% 0.74/1.59 Proof check complete!
% 0.74/1.59
% 0.74/1.59 Memory use:
% 0.74/1.59
% 0.74/1.59 space for terms: 59483
% 0.74/1.59 space for clauses: 225907
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 clauses generated: 35335
% 0.74/1.59 clauses kept: 4848
% 0.74/1.59 clauses selected: 580
% 0.74/1.59 clauses deleted: 209
% 0.74/1.59 clauses inuse deleted: 73
% 0.74/1.59
% 0.74/1.59 subsentry: 93498
% 0.74/1.59 literals s-matched: 67664
% 0.74/1.59 literals matched: 63748
% 0.74/1.59 full subsumption: 6409
% 0.74/1.59
% 0.74/1.59 checksum: 181465051
% 0.74/1.59
% 0.74/1.59
% 0.74/1.59 Bliksem ended
%------------------------------------------------------------------------------