TSTP Solution File: MGT059+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT059+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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 : Sun Jul 17 21:57:58 EDT 2022
% Result : Theorem 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT059+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.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 : Thu Jun 9 08:42:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { ! smaller_or_equal( X, Y ), smaller( X, Y ), X = Y }.
% 0.69/1.10 { ! smaller( X, Y ), smaller_or_equal( X, Y ) }.
% 0.69/1.10 { ! X = Y, smaller_or_equal( X, Y ) }.
% 0.69/1.10 { ! greater_or_equal( X, Y ), greater( X, Y ), X = Y }.
% 0.69/1.10 { ! greater( X, Y ), greater_or_equal( X, Y ) }.
% 0.69/1.10 { ! X = Y, greater_or_equal( X, Y ) }.
% 0.69/1.10 { ! smaller( X, Y ), greater( Y, X ) }.
% 0.69/1.10 { ! greater( Y, X ), smaller( X, Y ) }.
% 0.69/1.10 { ! greater( X, Y ), ! greater( Y, X ) }.
% 0.69/1.10 { ! greater( X, Z ), ! greater( Z, Y ), greater( X, Y ) }.
% 0.69/1.10 { smaller( X, Y ), X = Y, greater( X, Y ) }.
% 0.69/1.10 { ! organization( X ), ! has_immunity( X, Y ), hazard_of_mortality( X, Y )
% 0.69/1.10 = very_low }.
% 0.69/1.10 { ! organization( X ), has_immunity( X, Y ), ! is_aligned( X, Y ), !
% 0.69/1.10 positional_advantage( X, Y ), hazard_of_mortality( X, Y ) = low }.
% 0.69/1.10 { ! organization( X ), has_immunity( X, Y ), is_aligned( X, Y ), !
% 0.69/1.10 positional_advantage( X, Y ), hazard_of_mortality( X, Y ) = mod1 }.
% 0.69/1.10 { ! organization( X ), has_immunity( X, Y ), ! is_aligned( X, Y ),
% 0.69/1.10 positional_advantage( X, Y ), hazard_of_mortality( X, Y ) = mod2 }.
% 0.69/1.10 { ! organization( X ), has_immunity( X, Y ), is_aligned( X, Y ),
% 0.69/1.10 positional_advantage( X, Y ), hazard_of_mortality( X, Y ) = high }.
% 0.69/1.10 { organization( skol1 ) }.
% 0.69/1.10 { has_immunity( skol1, skol2 ) }.
% 0.69/1.10 { has_immunity( skol1, skol3 ) }.
% 0.69/1.10 { ! hazard_of_mortality( skol1, skol2 ) = hazard_of_mortality( skol1, skol3
% 0.69/1.10 ) }.
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.207547, percentage horn = 0.650000
% 0.69/1.10 This is a problem with some equality
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 1
% 0.69/1.10 useeqrefl = 1
% 0.69/1.10 useeqfact = 1
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 5
% 0.69/1.10 usesimpres = 3
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = eqrewr
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.10
% 0.69/1.10 termordering = kbo
% 0.69/1.10
% 0.69/1.10 litapriori = 0
% 0.69/1.10 termapriori = 1
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negord
% 0.69/1.10
% 0.69/1.10 maxweight = 15
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 1
% 0.69/1.10 increasemaxweight = 1
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 0
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 smaller_or_equal [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.69/1.10 smaller [38, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.69/1.10 greater_or_equal [39, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.69/1.10 greater [40, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.69/1.10 organization [43, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.69/1.10 has_immunity [44, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.69/1.10 hazard_of_mortality [45, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.69/1.10 very_low [46, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.69/1.10 is_aligned [47, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.69/1.10 positional_advantage [48, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.69/1.10 low [49, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.69/1.10 mod1 [50, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.10 mod2 [51, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.10 high [52, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.10 skol1 [54, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.69/1.10 skol2 [55, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.69/1.10 skol3 [56, 0] (w:1, o:18, a:1, s:1, b:1).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Theorem
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 (11) {G0,W10,D3,L3,V2,M3} I { ! organization( X ), ! has_immunity( X, Y ),
% 0.69/1.10 hazard_of_mortality( X, Y ) ==> very_low }.
% 0.69/1.10 (16) {G0,W2,D2,L1,V0,M1} I { organization( skol1 ) }.
% 0.69/1.10 (17) {G0,W3,D2,L1,V0,M1} I { has_immunity( skol1, skol2 ) }.
% 0.69/1.10 (18) {G0,W3,D2,L1,V0,M1} I { has_immunity( skol1, skol3 ) }.
% 0.69/1.10 (19) {G0,W7,D3,L1,V0,M1} I { ! hazard_of_mortality( skol1, skol3 ) ==>
% 0.69/1.10 hazard_of_mortality( skol1, skol2 ) }.
% 0.69/1.10 (184) {G1,W5,D3,L1,V0,M1} R(11,17);r(16) { hazard_of_mortality( skol1,
% 0.69/1.10 skol2 ) ==> very_low }.
% 0.69/1.10 (187) {G2,W3,D2,L1,V0,M1} P(11,19);d(184);q;r(16) { ! has_immunity( skol1,
% 0.69/1.10 skol3 ) }.
% 0.69/1.10 (188) {G3,W0,D0,L0,V0,M0} S(187);r(18) { }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Unprocessed initial clauses:
% 0.69/1.10
% 0.69/1.10 (190) {G0,W9,D2,L3,V2,M3} { ! smaller_or_equal( X, Y ), smaller( X, Y ), X
% 0.69/1.10 = Y }.
% 0.69/1.10 (191) {G0,W6,D2,L2,V2,M2} { ! smaller( X, Y ), smaller_or_equal( X, Y )
% 0.69/1.10 }.
% 0.69/1.10 (192) {G0,W6,D2,L2,V2,M2} { ! X = Y, smaller_or_equal( X, Y ) }.
% 0.69/1.10 (193) {G0,W9,D2,L3,V2,M3} { ! greater_or_equal( X, Y ), greater( X, Y ), X
% 0.69/1.10 = Y }.
% 0.69/1.10 (194) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), greater_or_equal( X, Y )
% 0.69/1.10 }.
% 0.69/1.10 (195) {G0,W6,D2,L2,V2,M2} { ! X = Y, greater_or_equal( X, Y ) }.
% 0.69/1.10 (196) {G0,W6,D2,L2,V2,M2} { ! smaller( X, Y ), greater( Y, X ) }.
% 0.69/1.10 (197) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), smaller( X, Y ) }.
% 0.69/1.10 (198) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! greater( Y, X ) }.
% 0.69/1.10 (199) {G0,W9,D2,L3,V3,M3} { ! greater( X, Z ), ! greater( Z, Y ), greater
% 0.69/1.10 ( X, Y ) }.
% 0.69/1.10 (200) {G0,W9,D2,L3,V2,M3} { smaller( X, Y ), X = Y, greater( X, Y ) }.
% 0.69/1.10 (201) {G0,W10,D3,L3,V2,M3} { ! organization( X ), ! has_immunity( X, Y ),
% 0.69/1.10 hazard_of_mortality( X, Y ) = very_low }.
% 0.69/1.10 (202) {G0,W16,D3,L5,V2,M5} { ! organization( X ), has_immunity( X, Y ), !
% 0.69/1.10 is_aligned( X, Y ), ! positional_advantage( X, Y ), hazard_of_mortality(
% 0.69/1.10 X, Y ) = low }.
% 0.69/1.10 (203) {G0,W16,D3,L5,V2,M5} { ! organization( X ), has_immunity( X, Y ),
% 0.69/1.10 is_aligned( X, Y ), ! positional_advantage( X, Y ), hazard_of_mortality(
% 0.69/1.10 X, Y ) = mod1 }.
% 0.69/1.10 (204) {G0,W16,D3,L5,V2,M5} { ! organization( X ), has_immunity( X, Y ), !
% 0.69/1.10 is_aligned( X, Y ), positional_advantage( X, Y ), hazard_of_mortality( X
% 0.69/1.10 , Y ) = mod2 }.
% 0.69/1.10 (205) {G0,W16,D3,L5,V2,M5} { ! organization( X ), has_immunity( X, Y ),
% 0.69/1.10 is_aligned( X, Y ), positional_advantage( X, Y ), hazard_of_mortality( X
% 0.69/1.10 , Y ) = high }.
% 0.69/1.10 (206) {G0,W2,D2,L1,V0,M1} { organization( skol1 ) }.
% 0.69/1.10 (207) {G0,W3,D2,L1,V0,M1} { has_immunity( skol1, skol2 ) }.
% 0.69/1.10 (208) {G0,W3,D2,L1,V0,M1} { has_immunity( skol1, skol3 ) }.
% 0.69/1.10 (209) {G0,W7,D3,L1,V0,M1} { ! hazard_of_mortality( skol1, skol2 ) =
% 0.69/1.10 hazard_of_mortality( skol1, skol3 ) }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Total Proof:
% 0.69/1.10
% 0.69/1.10 subsumption: (11) {G0,W10,D3,L3,V2,M3} I { ! organization( X ), !
% 0.69/1.10 has_immunity( X, Y ), hazard_of_mortality( X, Y ) ==> very_low }.
% 0.69/1.10 parent0: (201) {G0,W10,D3,L3,V2,M3} { ! organization( X ), ! has_immunity
% 0.69/1.10 ( X, Y ), hazard_of_mortality( X, Y ) = very_low }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 2 ==> 2
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 *** allocated 15000 integers for clauses
% 0.69/1.10 subsumption: (16) {G0,W2,D2,L1,V0,M1} I { organization( skol1 ) }.
% 0.69/1.10 parent0: (206) {G0,W2,D2,L1,V0,M1} { organization( skol1 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (17) {G0,W3,D2,L1,V0,M1} I { has_immunity( skol1, skol2 ) }.
% 0.69/1.10 parent0: (207) {G0,W3,D2,L1,V0,M1} { has_immunity( skol1, skol2 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (18) {G0,W3,D2,L1,V0,M1} I { has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent0: (208) {G0,W3,D2,L1,V0,M1} { has_immunity( skol1, skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (266) {G0,W7,D3,L1,V0,M1} { ! hazard_of_mortality( skol1, skol3 )
% 0.69/1.10 = hazard_of_mortality( skol1, skol2 ) }.
% 0.69/1.10 parent0[0]: (209) {G0,W7,D3,L1,V0,M1} { ! hazard_of_mortality( skol1,
% 0.69/1.10 skol2 ) = hazard_of_mortality( skol1, skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (19) {G0,W7,D3,L1,V0,M1} I { ! hazard_of_mortality( skol1,
% 0.69/1.10 skol3 ) ==> hazard_of_mortality( skol1, skol2 ) }.
% 0.69/1.10 parent0: (266) {G0,W7,D3,L1,V0,M1} { ! hazard_of_mortality( skol1, skol3 )
% 0.69/1.10 = hazard_of_mortality( skol1, skol2 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (267) {G0,W10,D3,L3,V2,M3} { very_low ==> hazard_of_mortality( X,
% 0.69/1.10 Y ), ! organization( X ), ! has_immunity( X, Y ) }.
% 0.69/1.10 parent0[2]: (11) {G0,W10,D3,L3,V2,M3} I { ! organization( X ), !
% 0.69/1.10 has_immunity( X, Y ), hazard_of_mortality( X, Y ) ==> very_low }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (268) {G1,W7,D3,L2,V0,M2} { very_low ==> hazard_of_mortality(
% 0.69/1.10 skol1, skol2 ), ! organization( skol1 ) }.
% 0.69/1.10 parent0[2]: (267) {G0,W10,D3,L3,V2,M3} { very_low ==> hazard_of_mortality
% 0.69/1.10 ( X, Y ), ! organization( X ), ! has_immunity( X, Y ) }.
% 0.69/1.10 parent1[0]: (17) {G0,W3,D2,L1,V0,M1} I { has_immunity( skol1, skol2 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := skol1
% 0.69/1.10 Y := skol2
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (269) {G1,W5,D3,L1,V0,M1} { very_low ==> hazard_of_mortality(
% 0.69/1.10 skol1, skol2 ) }.
% 0.69/1.10 parent0[1]: (268) {G1,W7,D3,L2,V0,M2} { very_low ==> hazard_of_mortality(
% 0.69/1.10 skol1, skol2 ), ! organization( skol1 ) }.
% 0.69/1.10 parent1[0]: (16) {G0,W2,D2,L1,V0,M1} I { organization( skol1 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (270) {G1,W5,D3,L1,V0,M1} { hazard_of_mortality( skol1, skol2 )
% 0.69/1.10 ==> very_low }.
% 0.69/1.10 parent0[0]: (269) {G1,W5,D3,L1,V0,M1} { very_low ==> hazard_of_mortality(
% 0.69/1.10 skol1, skol2 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (184) {G1,W5,D3,L1,V0,M1} R(11,17);r(16) { hazard_of_mortality
% 0.69/1.10 ( skol1, skol2 ) ==> very_low }.
% 0.69/1.10 parent0: (270) {G1,W5,D3,L1,V0,M1} { hazard_of_mortality( skol1, skol2 )
% 0.69/1.10 ==> very_low }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (272) {G0,W7,D3,L1,V0,M1} { ! hazard_of_mortality( skol1, skol2 )
% 0.69/1.10 ==> hazard_of_mortality( skol1, skol3 ) }.
% 0.69/1.10 parent0[0]: (19) {G0,W7,D3,L1,V0,M1} I { ! hazard_of_mortality( skol1,
% 0.69/1.10 skol3 ) ==> hazard_of_mortality( skol1, skol2 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (275) {G1,W10,D3,L3,V0,M3} { ! hazard_of_mortality( skol1, skol2
% 0.69/1.10 ) ==> very_low, ! organization( skol1 ), ! has_immunity( skol1, skol3 )
% 0.69/1.10 }.
% 0.69/1.10 parent0[2]: (11) {G0,W10,D3,L3,V2,M3} I { ! organization( X ), !
% 0.69/1.10 has_immunity( X, Y ), hazard_of_mortality( X, Y ) ==> very_low }.
% 0.69/1.10 parent1[0; 5]: (272) {G0,W7,D3,L1,V0,M1} { ! hazard_of_mortality( skol1,
% 0.69/1.10 skol2 ) ==> hazard_of_mortality( skol1, skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := skol1
% 0.69/1.10 Y := skol3
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 paramod: (278) {G2,W8,D2,L3,V0,M3} { ! very_low ==> very_low, !
% 0.69/1.10 organization( skol1 ), ! has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent0[0]: (184) {G1,W5,D3,L1,V0,M1} R(11,17);r(16) { hazard_of_mortality
% 0.69/1.10 ( skol1, skol2 ) ==> very_low }.
% 0.69/1.10 parent1[0; 2]: (275) {G1,W10,D3,L3,V0,M3} { ! hazard_of_mortality( skol1,
% 0.69/1.10 skol2 ) ==> very_low, ! organization( skol1 ), ! has_immunity( skol1,
% 0.69/1.10 skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqrefl: (279) {G0,W5,D2,L2,V0,M2} { ! organization( skol1 ), !
% 0.69/1.10 has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent0[0]: (278) {G2,W8,D2,L3,V0,M3} { ! very_low ==> very_low, !
% 0.69/1.10 organization( skol1 ), ! has_immunity( skol1, skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (280) {G1,W3,D2,L1,V0,M1} { ! has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent0[0]: (279) {G0,W5,D2,L2,V0,M2} { ! organization( skol1 ), !
% 0.69/1.10 has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent1[0]: (16) {G0,W2,D2,L1,V0,M1} I { organization( skol1 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (187) {G2,W3,D2,L1,V0,M1} P(11,19);d(184);q;r(16) { !
% 0.69/1.10 has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent0: (280) {G1,W3,D2,L1,V0,M1} { ! has_immunity( skol1, skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (281) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 parent0[0]: (187) {G2,W3,D2,L1,V0,M1} P(11,19);d(184);q;r(16) { !
% 0.69/1.10 has_immunity( skol1, skol3 ) }.
% 0.69/1.10 parent1[0]: (18) {G0,W3,D2,L1,V0,M1} I { has_immunity( skol1, skol3 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (188) {G3,W0,D0,L0,V0,M0} S(187);r(18) { }.
% 0.69/1.10 parent0: (281) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 Proof check complete!
% 0.69/1.10
% 0.69/1.10 Memory use:
% 0.69/1.10
% 0.69/1.10 space for terms: 2524
% 0.69/1.10 space for clauses: 9211
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 clauses generated: 394
% 0.69/1.10 clauses kept: 189
% 0.69/1.10 clauses selected: 34
% 0.69/1.10 clauses deleted: 3
% 0.69/1.10 clauses inuse deleted: 0
% 0.69/1.10
% 0.69/1.10 subsentry: 676
% 0.69/1.10 literals s-matched: 569
% 0.69/1.10 literals matched: 569
% 0.69/1.10 full subsumption: 68
% 0.69/1.10
% 0.69/1.10 checksum: -1291583583
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksem ended
%------------------------------------------------------------------------------