TSTP Solution File: SEU264+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU264+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:59 EDT 2022
% Result : Theorem 0.42s 1.08s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU264+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sun Jun 19 16:18:58 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.42/1.08 *** allocated 10000 integers for termspace/termends
% 0.42/1.08 *** allocated 10000 integers for clauses
% 0.42/1.08 *** allocated 10000 integers for justifications
% 0.42/1.08 Bliksem 1.12
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Automatic Strategy Selection
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Clauses:
% 0.42/1.08
% 0.42/1.08 { ! element( X, powerset( cartesian_product2( Y, Z ) ) ), relation( X ) }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { && }.
% 0.42/1.08 { ! relation_of2_as_subset( Z, X, Y ), element( Z, powerset(
% 0.42/1.08 cartesian_product2( X, Y ) ) ) }.
% 0.42/1.08 { relation_of2( skol1( X, Y ), X, Y ) }.
% 0.42/1.08 { element( skol2( X ), X ) }.
% 0.42/1.08 { relation_of2_as_subset( skol3( X, Y ), X, Y ) }.
% 0.42/1.08 { ! relation_of2_as_subset( Z, X, Y ), relation_of2( Z, X, Y ) }.
% 0.42/1.08 { ! relation_of2( Z, X, Y ), relation_of2_as_subset( Z, X, Y ) }.
% 0.42/1.08 { subset( X, X ) }.
% 0.42/1.08 { ! relation_of2_as_subset( Z, X, Y ), subset( relation_dom( Z ), X ) }.
% 0.42/1.08 { ! relation_of2_as_subset( Z, X, Y ), subset( relation_rng( Z ), Y ) }.
% 0.42/1.08 { ! relation_of2_as_subset( Y, X, Z ), ! subset( relation_rng( Y ), T ),
% 0.42/1.08 relation_of2_as_subset( Y, X, T ) }.
% 0.42/1.08 { relation_of2_as_subset( skol6, skol5, skol4 ) }.
% 0.42/1.08 { subset( skol4, skol7 ) }.
% 0.42/1.08 { ! relation_of2_as_subset( skol6, skol5, skol7 ) }.
% 0.42/1.08 { ! subset( X, Z ), ! subset( Z, Y ), subset( X, Y ) }.
% 0.42/1.08 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.42/1.08 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.42/1.08
% 0.42/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.08 This is a near-Horn, non-equality problem
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Options Used:
% 0.42/1.08
% 0.42/1.08 useres = 1
% 0.42/1.08 useparamod = 0
% 0.42/1.08 useeqrefl = 0
% 0.42/1.08 useeqfact = 0
% 0.42/1.08 usefactor = 1
% 0.42/1.08 usesimpsplitting = 0
% 0.42/1.08 usesimpdemod = 0
% 0.42/1.08 usesimpres = 4
% 0.42/1.08
% 0.42/1.08 resimpinuse = 1000
% 0.42/1.08 resimpclauses = 20000
% 0.42/1.08 substype = standard
% 0.42/1.08 backwardsubs = 1
% 0.42/1.08 selectoldest = 5
% 0.42/1.08
% 0.42/1.08 litorderings [0] = split
% 0.42/1.08 litorderings [1] = liftord
% 0.42/1.08
% 0.42/1.08 termordering = none
% 0.42/1.08
% 0.42/1.08 litapriori = 1
% 0.42/1.08 termapriori = 0
% 0.42/1.08 litaposteriori = 0
% 0.42/1.08 termaposteriori = 0
% 0.42/1.08 demodaposteriori = 0
% 0.42/1.08 ordereqreflfact = 0
% 0.42/1.08
% 0.42/1.08 litselect = negative
% 0.42/1.08
% 0.42/1.08 maxweight = 30000
% 0.42/1.08 maxdepth = 30000
% 0.42/1.08 maxlength = 115
% 0.42/1.08 maxnrvars = 195
% 0.42/1.08 excuselevel = 0
% 0.42/1.08 increasemaxweight = 0
% 0.42/1.08
% 0.42/1.08 maxselected = 10000000
% 0.42/1.08 maxnrclauses = 10000000
% 0.42/1.08
% 0.42/1.08 showgenerated = 0
% 0.42/1.08 showkept = 0
% 0.42/1.08 showselected = 0
% 0.42/1.08 showdeleted = 0
% 0.42/1.08 showresimp = 1
% 0.42/1.08 showstatus = 2000
% 0.42/1.08
% 0.42/1.08 prologoutput = 0
% 0.42/1.08 nrgoals = 5000000
% 0.42/1.08 totalproof = 1
% 0.42/1.08
% 0.42/1.08 Symbols occurring in the translation:
% 0.42/1.08
% 0.42/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.08 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.42/1.08 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.42/1.08 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.42/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.08 cartesian_product2 [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.42/1.08 powerset [39, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.08 element [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.42/1.08 relation [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.08 relation_of2_as_subset [42, 3] (w:1, o:53, a:1, s:1, b:0),
% 0.42/1.08 relation_of2 [43, 3] (w:1, o:54, a:1, s:1, b:0),
% 0.42/1.08 subset [44, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.42/1.08 relation_dom [45, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.08 relation_rng [46, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.08 skol1 [48, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.42/1.08 skol2 [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.42/1.08 skol3 [50, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.42/1.08 skol4 [51, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.42/1.08 skol5 [52, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.42/1.08 skol6 [53, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.42/1.08 skol7 [54, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Starting Search:
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Bliksems!, er is een bewijs:
% 0.42/1.08 % SZS status Theorem
% 0.42/1.08 % SZS output start Refutation
% 0.42/1.08
% 0.42/1.08 (10) {G0,W9,D3,L2,V3,M1} I { subset( relation_rng( Z ), Y ), !
% 0.42/1.08 relation_of2_as_subset( Z, X, Y ) }.
% 0.42/1.08 (11) {G0,W14,D3,L3,V4,M1} I { ! subset( relation_rng( Y ), T ),
% 0.42/1.08 relation_of2_as_subset( Y, X, T ), ! relation_of2_as_subset( Y, X, Z )
% 0.42/1.08 }.
% 0.42/1.08 (12) {G0,W4,D2,L1,V0,M1} I { relation_of2_as_subset( skol6, skol5, skol4 )
% 0.42/1.08 }.
% 0.42/1.08 (13) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol7 ) }.
% 0.42/1.08 (14) {G0,W5,D2,L1,V0,M1} I { ! relation_of2_as_subset( skol6, skol5, skol7
% 0.42/1.08 ) }.
% 0.42/1.08 (15) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Z ), subset( X, Y ), ! subset( Z
% 0.42/1.08 , Y ) }.
% 0.42/1.08 (39) {G1,W4,D3,L1,V0,M1} R(10,12) { subset( relation_rng( skol6 ), skol4 )
% 0.42/1.08 }.
% 0.42/1.08 (45) {G1,W9,D3,L2,V1,M1} R(11,12) { relation_of2_as_subset( skol6, skol5, X
% 0.42/1.08 ), ! subset( relation_rng( skol6 ), X ) }.
% 0.42/1.08 (58) {G1,W7,D2,L2,V1,M1} R(15,13) { subset( X, skol7 ), ! subset( X, skol4
% 0.42/1.08 ) }.
% 0.42/1.08 (61) {G2,W4,D3,L1,V0,M1} R(58,39) { subset( relation_rng( skol6 ), skol7 )
% 0.42/1.08 }.
% 0.42/1.08 (91) {G3,W0,D0,L0,V0,M0} R(45,61);r(14) { }.
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 % SZS output end Refutation
% 0.42/1.08 found a proof!
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Unprocessed initial clauses:
% 0.42/1.08
% 0.42/1.08 (93) {G0,W9,D4,L2,V3,M2} { ! element( X, powerset( cartesian_product2( Y,
% 0.42/1.08 Z ) ) ), relation( X ) }.
% 0.42/1.08 (94) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (95) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (96) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (97) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (98) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (99) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.08 (100) {G0,W11,D4,L2,V3,M2} { ! relation_of2_as_subset( Z, X, Y ), element
% 0.42/1.08 ( Z, powerset( cartesian_product2( X, Y ) ) ) }.
% 0.42/1.08 (101) {G0,W6,D3,L1,V2,M1} { relation_of2( skol1( X, Y ), X, Y ) }.
% 0.42/1.08 (102) {G0,W4,D3,L1,V1,M1} { element( skol2( X ), X ) }.
% 0.42/1.08 (103) {G0,W6,D3,L1,V2,M1} { relation_of2_as_subset( skol3( X, Y ), X, Y )
% 0.42/1.08 }.
% 0.42/1.08 (104) {G0,W9,D2,L2,V3,M2} { ! relation_of2_as_subset( Z, X, Y ),
% 0.42/1.08 relation_of2( Z, X, Y ) }.
% 0.42/1.08 (105) {G0,W9,D2,L2,V3,M2} { ! relation_of2( Z, X, Y ),
% 0.42/1.08 relation_of2_as_subset( Z, X, Y ) }.
% 0.42/1.08 (106) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.42/1.08 (107) {G0,W9,D3,L2,V3,M2} { ! relation_of2_as_subset( Z, X, Y ), subset(
% 0.42/1.08 relation_dom( Z ), X ) }.
% 0.42/1.08 (108) {G0,W9,D3,L2,V3,M2} { ! relation_of2_as_subset( Z, X, Y ), subset(
% 0.42/1.08 relation_rng( Z ), Y ) }.
% 0.42/1.08 (109) {G0,W14,D3,L3,V4,M3} { ! relation_of2_as_subset( Y, X, Z ), ! subset
% 0.42/1.08 ( relation_rng( Y ), T ), relation_of2_as_subset( Y, X, T ) }.
% 0.42/1.08 (110) {G0,W4,D2,L1,V0,M1} { relation_of2_as_subset( skol6, skol5, skol4 )
% 0.42/1.08 }.
% 0.42/1.08 (111) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol7 ) }.
% 0.42/1.08 (112) {G0,W5,D2,L1,V0,M1} { ! relation_of2_as_subset( skol6, skol5, skol7
% 0.42/1.08 ) }.
% 0.42/1.08 (113) {G0,W11,D2,L3,V3,M3} { ! subset( X, Z ), ! subset( Z, Y ), subset( X
% 0.42/1.08 , Y ) }.
% 0.42/1.08 (114) {G0,W8,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.42/1.08 }.
% 0.42/1.08 (115) {G0,W8,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.42/1.08 }.
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Total Proof:
% 0.42/1.08
% 0.42/1.08 subsumption: (10) {G0,W9,D3,L2,V3,M1} I { subset( relation_rng( Z ), Y ), !
% 0.42/1.08 relation_of2_as_subset( Z, X, Y ) }.
% 0.42/1.08 parent0: (108) {G0,W9,D3,L2,V3,M2} { ! relation_of2_as_subset( Z, X, Y ),
% 0.42/1.08 subset( relation_rng( Z ), Y ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 X := X
% 0.42/1.08 Y := Y
% 0.42/1.08 Z := Z
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 1
% 0.42/1.08 1 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (11) {G0,W14,D3,L3,V4,M1} I { ! subset( relation_rng( Y ), T )
% 0.42/1.08 , relation_of2_as_subset( Y, X, T ), ! relation_of2_as_subset( Y, X, Z )
% 0.42/1.08 }.
% 0.42/1.08 parent0: (109) {G0,W14,D3,L3,V4,M3} { ! relation_of2_as_subset( Y, X, Z )
% 0.42/1.08 , ! subset( relation_rng( Y ), T ), relation_of2_as_subset( Y, X, T ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 X := X
% 0.42/1.08 Y := Y
% 0.42/1.08 Z := Z
% 0.42/1.08 T := T
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 2
% 0.42/1.08 1 ==> 0
% 0.42/1.08 2 ==> 1
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (12) {G0,W4,D2,L1,V0,M1} I { relation_of2_as_subset( skol6,
% 0.42/1.08 skol5, skol4 ) }.
% 0.42/1.08 parent0: (110) {G0,W4,D2,L1,V0,M1} { relation_of2_as_subset( skol6, skol5
% 0.42/1.08 , skol4 ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (13) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol7 ) }.
% 0.42/1.08 parent0: (111) {G0,W3,D2,L1,V0,M1} { subset( skol4, skol7 ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (14) {G0,W5,D2,L1,V0,M1} I { ! relation_of2_as_subset( skol6,
% 0.42/1.08 skol5, skol7 ) }.
% 0.42/1.08 parent0: (112) {G0,W5,D2,L1,V0,M1} { ! relation_of2_as_subset( skol6,
% 0.42/1.08 skol5, skol7 ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 subsumption: (15) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Z ), subset( X, Y )
% 0.42/1.08 , ! subset( Z, Y ) }.
% 0.42/1.08 parent0: (113) {G0,W11,D2,L3,V3,M3} { ! subset( X, Z ), ! subset( Z, Y ),
% 0.42/1.08 subset( X, Y ) }.
% 0.42/1.08 substitution0:
% 0.42/1.08 X := X
% 0.42/1.08 Y := Y
% 0.42/1.08 Z := Z
% 0.42/1.08 end
% 0.42/1.08 permutation0:
% 0.42/1.08 0 ==> 0
% 0.42/1.08 1 ==> 2
% 0.42/1.08 2 ==> 1
% 0.42/1.08 end
% 0.42/1.08
% 0.42/1.08 resolution: (117) {G1,W4,D3,L1,V0,M1} { subset( relation_rng( skol6 ),
% 0.42/1.08 skol4 ) }.
% 0.42/1.08 parent0[1]: (10) {G0,W9,D3,L2,V3,M1} I { subset( relation_rng( Z ), Y ), !
% 0.42/1.08 relation_of2_as_subset( Z, X, Y ) }.
% 0.73/1.08 parent1[0]: (12) {G0,W4,D2,L1,V0,M1} I { relation_of2_as_subset( skol6,
% 0.73/1.08 skol5, skol4 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := skol5
% 0.73/1.08 Y := skol4
% 0.73/1.08 Z := skol6
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 subsumption: (39) {G1,W4,D3,L1,V0,M1} R(10,12) { subset( relation_rng(
% 0.73/1.08 skol6 ), skol4 ) }.
% 0.73/1.08 parent0: (117) {G1,W4,D3,L1,V0,M1} { subset( relation_rng( skol6 ), skol4
% 0.73/1.08 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 end
% 0.73/1.08 permutation0:
% 0.73/1.08 0 ==> 0
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 resolution: (118) {G1,W9,D3,L2,V1,M2} { ! subset( relation_rng( skol6 ), X
% 0.73/1.08 ), relation_of2_as_subset( skol6, skol5, X ) }.
% 0.73/1.08 parent0[2]: (11) {G0,W14,D3,L3,V4,M1} I { ! subset( relation_rng( Y ), T )
% 0.73/1.08 , relation_of2_as_subset( Y, X, T ), ! relation_of2_as_subset( Y, X, Z )
% 0.73/1.08 }.
% 0.73/1.08 parent1[0]: (12) {G0,W4,D2,L1,V0,M1} I { relation_of2_as_subset( skol6,
% 0.73/1.08 skol5, skol4 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := skol5
% 0.73/1.08 Y := skol6
% 0.73/1.08 Z := skol4
% 0.73/1.08 T := X
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 subsumption: (45) {G1,W9,D3,L2,V1,M1} R(11,12) { relation_of2_as_subset(
% 0.73/1.08 skol6, skol5, X ), ! subset( relation_rng( skol6 ), X ) }.
% 0.73/1.08 parent0: (118) {G1,W9,D3,L2,V1,M2} { ! subset( relation_rng( skol6 ), X )
% 0.73/1.08 , relation_of2_as_subset( skol6, skol5, X ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := X
% 0.73/1.08 end
% 0.73/1.08 permutation0:
% 0.73/1.08 0 ==> 1
% 0.73/1.08 1 ==> 0
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 resolution: (120) {G1,W7,D2,L2,V1,M2} { ! subset( X, skol4 ), subset( X,
% 0.73/1.08 skol7 ) }.
% 0.73/1.08 parent0[2]: (15) {G0,W11,D2,L3,V3,M1} I { ! subset( X, Z ), subset( X, Y )
% 0.73/1.08 , ! subset( Z, Y ) }.
% 0.73/1.08 parent1[0]: (13) {G0,W3,D2,L1,V0,M1} I { subset( skol4, skol7 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := X
% 0.73/1.08 Y := skol7
% 0.73/1.08 Z := skol4
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 subsumption: (58) {G1,W7,D2,L2,V1,M1} R(15,13) { subset( X, skol7 ), !
% 0.73/1.08 subset( X, skol4 ) }.
% 0.73/1.08 parent0: (120) {G1,W7,D2,L2,V1,M2} { ! subset( X, skol4 ), subset( X,
% 0.73/1.08 skol7 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := X
% 0.73/1.08 end
% 0.73/1.08 permutation0:
% 0.73/1.08 0 ==> 1
% 0.73/1.08 1 ==> 0
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 resolution: (121) {G2,W4,D3,L1,V0,M1} { subset( relation_rng( skol6 ),
% 0.73/1.08 skol7 ) }.
% 0.73/1.08 parent0[1]: (58) {G1,W7,D2,L2,V1,M1} R(15,13) { subset( X, skol7 ), !
% 0.73/1.08 subset( X, skol4 ) }.
% 0.73/1.08 parent1[0]: (39) {G1,W4,D3,L1,V0,M1} R(10,12) { subset( relation_rng( skol6
% 0.73/1.08 ), skol4 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := relation_rng( skol6 )
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 subsumption: (61) {G2,W4,D3,L1,V0,M1} R(58,39) { subset( relation_rng(
% 0.73/1.08 skol6 ), skol7 ) }.
% 0.73/1.08 parent0: (121) {G2,W4,D3,L1,V0,M1} { subset( relation_rng( skol6 ), skol7
% 0.73/1.08 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 end
% 0.73/1.08 permutation0:
% 0.73/1.08 0 ==> 0
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 resolution: (122) {G2,W4,D2,L1,V0,M1} { relation_of2_as_subset( skol6,
% 0.73/1.08 skol5, skol7 ) }.
% 0.73/1.08 parent0[1]: (45) {G1,W9,D3,L2,V1,M1} R(11,12) { relation_of2_as_subset(
% 0.73/1.08 skol6, skol5, X ), ! subset( relation_rng( skol6 ), X ) }.
% 0.73/1.08 parent1[0]: (61) {G2,W4,D3,L1,V0,M1} R(58,39) { subset( relation_rng( skol6
% 0.73/1.08 ), skol7 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 X := skol7
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 resolution: (123) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.08 parent0[0]: (14) {G0,W5,D2,L1,V0,M1} I { ! relation_of2_as_subset( skol6,
% 0.73/1.08 skol5, skol7 ) }.
% 0.73/1.08 parent1[0]: (122) {G2,W4,D2,L1,V0,M1} { relation_of2_as_subset( skol6,
% 0.73/1.08 skol5, skol7 ) }.
% 0.73/1.08 substitution0:
% 0.73/1.08 end
% 0.73/1.08 substitution1:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 subsumption: (91) {G3,W0,D0,L0,V0,M0} R(45,61);r(14) { }.
% 0.73/1.08 parent0: (123) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.08 substitution0:
% 0.73/1.08 end
% 0.73/1.08 permutation0:
% 0.73/1.08 end
% 0.73/1.08
% 0.73/1.08 Proof check complete!
% 0.73/1.08
% 0.73/1.08 Memory use:
% 0.73/1.08
% 0.73/1.08 space for terms: 1015
% 0.73/1.08 space for clauses: 5926
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 clauses generated: 130
% 0.73/1.08 clauses kept: 92
% 0.73/1.08 clauses selected: 66
% 0.73/1.08 clauses deleted: 0
% 0.73/1.08 clauses inuse deleted: 0
% 0.73/1.08
% 0.73/1.08 subsentry: 60
% 0.73/1.08 literals s-matched: 41
% 0.73/1.08 literals matched: 41
% 0.73/1.08 full subsumption: 0
% 0.73/1.08
% 0.73/1.08 checksum: -1989795851
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Bliksem ended
%------------------------------------------------------------------------------