TSTP Solution File: SEU247+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:51 EDT 2022
% Result : Theorem 0.41s 1.07s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jun 19 18:17:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.07 *** allocated 10000 integers for termspace/termends
% 0.41/1.07 *** allocated 10000 integers for clauses
% 0.41/1.07 *** allocated 10000 integers for justifications
% 0.41/1.07 Bliksem 1.12
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Automatic Strategy Selection
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Clauses:
% 0.41/1.07
% 0.41/1.07 { set_intersection2( X, Y ) = set_intersection2( Y, X ) }.
% 0.41/1.07 { ! relation( X ), relation_restriction( X, Y ) = set_intersection2( X,
% 0.41/1.07 cartesian_product2( Y, Y ) ) }.
% 0.41/1.07 { ! relation( X ), relation( relation_restriction( X, Y ) ) }.
% 0.41/1.07 { && }.
% 0.41/1.07 { && }.
% 0.41/1.07 { ! relation( X ), relation( relation_dom_restriction( X, Y ) ) }.
% 0.41/1.07 { ! relation( X ), relation( relation_rng_restriction( Y, X ) ) }.
% 0.41/1.07 { set_intersection2( X, X ) = X }.
% 0.41/1.07 { ! relation( X ), relation_dom_restriction( relation_rng_restriction( Y, X
% 0.41/1.07 ), Z ) = relation_rng_restriction( Y, relation_dom_restriction( X, Z ) )
% 0.41/1.07 }.
% 0.41/1.07 { ! relation( X ), relation_restriction( X, Y ) = relation_dom_restriction
% 0.41/1.07 ( relation_rng_restriction( Y, X ), Y ) }.
% 0.41/1.07 { relation( skol1 ) }.
% 0.41/1.07 { ! relation_restriction( skol1, skol2 ) = relation_rng_restriction( skol2
% 0.41/1.07 , relation_dom_restriction( skol1, skol2 ) ) }.
% 0.41/1.07
% 0.41/1.07 percentage equality = 0.352941, percentage horn = 1.000000
% 0.41/1.07 This is a problem with some equality
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Options Used:
% 0.41/1.07
% 0.41/1.07 useres = 1
% 0.41/1.07 useparamod = 1
% 0.41/1.07 useeqrefl = 1
% 0.41/1.07 useeqfact = 1
% 0.41/1.07 usefactor = 1
% 0.41/1.07 usesimpsplitting = 0
% 0.41/1.07 usesimpdemod = 5
% 0.41/1.07 usesimpres = 3
% 0.41/1.07
% 0.41/1.07 resimpinuse = 1000
% 0.41/1.07 resimpclauses = 20000
% 0.41/1.07 substype = eqrewr
% 0.41/1.07 backwardsubs = 1
% 0.41/1.07 selectoldest = 5
% 0.41/1.07
% 0.41/1.07 litorderings [0] = split
% 0.41/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.07
% 0.41/1.07 termordering = kbo
% 0.41/1.07
% 0.41/1.07 litapriori = 0
% 0.41/1.07 termapriori = 1
% 0.41/1.07 litaposteriori = 0
% 0.41/1.07 termaposteriori = 0
% 0.41/1.07 demodaposteriori = 0
% 0.41/1.07 ordereqreflfact = 0
% 0.41/1.07
% 0.41/1.07 litselect = negord
% 0.41/1.07
% 0.41/1.07 maxweight = 15
% 0.41/1.07 maxdepth = 30000
% 0.41/1.07 maxlength = 115
% 0.41/1.07 maxnrvars = 195
% 0.41/1.07 excuselevel = 1
% 0.41/1.07 increasemaxweight = 1
% 0.41/1.07
% 0.41/1.07 maxselected = 10000000
% 0.41/1.07 maxnrclauses = 10000000
% 0.41/1.07
% 0.41/1.07 showgenerated = 0
% 0.41/1.07 showkept = 0
% 0.41/1.07 showselected = 0
% 0.41/1.07 showdeleted = 0
% 0.41/1.07 showresimp = 1
% 0.41/1.07 showstatus = 2000
% 0.41/1.07
% 0.41/1.07 prologoutput = 0
% 0.41/1.07 nrgoals = 5000000
% 0.41/1.07 totalproof = 1
% 0.41/1.07
% 0.41/1.07 Symbols occurring in the translation:
% 0.41/1.07
% 0.41/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.07 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.41/1.07 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.41/1.07 ! [4, 1] (w:0, o:11, a:1, s:1, b:0),
% 0.41/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.07 set_intersection2 [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.41/1.07 relation [38, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.41/1.07 relation_restriction [39, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.41/1.07 cartesian_product2 [40, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.41/1.07 relation_dom_restriction [41, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.41/1.07 relation_rng_restriction [42, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.41/1.07 skol1 [44, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.41/1.07 skol2 [45, 0] (w:1, o:10, a:1, s:1, b:1).
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Starting Search:
% 0.41/1.07
% 0.41/1.07 *** allocated 15000 integers for clauses
% 0.41/1.07
% 0.41/1.07 Bliksems!, er is een bewijs:
% 0.41/1.07 % SZS status Theorem
% 0.41/1.07 % SZS output start Refutation
% 0.41/1.07
% 0.41/1.07 (7) {G0,W13,D4,L2,V3,M2} I { ! relation( X ), relation_rng_restriction( Y,
% 0.41/1.07 relation_dom_restriction( X, Z ) ) ==> relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( Y, X ), Z ) }.
% 0.41/1.07 (8) {G0,W11,D4,L2,V2,M2} I { ! relation( X ), relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( Y, X ), Y ) ==> relation_restriction( X, Y )
% 0.41/1.07 }.
% 0.41/1.07 (9) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.41/1.07 (10) {G0,W9,D4,L1,V0,M1} I { ! relation_rng_restriction( skol2,
% 0.41/1.07 relation_dom_restriction( skol1, skol2 ) ) ==> relation_restriction(
% 0.41/1.07 skol1, skol2 ) }.
% 0.41/1.07 (58) {G1,W11,D4,L1,V2,M1} R(7,9) { relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( skol1, Y ) ) ==> relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), Y ) }.
% 0.41/1.07 (73) {G1,W9,D4,L1,V1,M1} R(8,9) { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), X ) ==> relation_restriction( skol1
% 0.41/1.07 , X ) }.
% 0.41/1.07 (123) {G2,W0,D0,L0,V0,M0} S(10);d(58);d(73);q { }.
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 % SZS output end Refutation
% 0.41/1.07 found a proof!
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Unprocessed initial clauses:
% 0.41/1.07
% 0.41/1.07 (125) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) = set_intersection2
% 0.41/1.07 ( Y, X ) }.
% 0.41/1.07 (126) {G0,W11,D4,L2,V2,M2} { ! relation( X ), relation_restriction( X, Y )
% 0.41/1.07 = set_intersection2( X, cartesian_product2( Y, Y ) ) }.
% 0.41/1.07 (127) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.41/1.07 relation_restriction( X, Y ) ) }.
% 0.41/1.07 (128) {G0,W1,D1,L1,V0,M1} { && }.
% 0.41/1.07 (129) {G0,W1,D1,L1,V0,M1} { && }.
% 0.41/1.07 (130) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.41/1.07 relation_dom_restriction( X, Y ) ) }.
% 0.41/1.07 (131) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.41/1.07 relation_rng_restriction( Y, X ) ) }.
% 0.41/1.07 (132) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, X ) = X }.
% 0.41/1.07 (133) {G0,W13,D4,L2,V3,M2} { ! relation( X ), relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( Y, X ), Z ) = relation_rng_restriction( Y,
% 0.41/1.07 relation_dom_restriction( X, Z ) ) }.
% 0.41/1.07 (134) {G0,W11,D4,L2,V2,M2} { ! relation( X ), relation_restriction( X, Y )
% 0.41/1.07 = relation_dom_restriction( relation_rng_restriction( Y, X ), Y ) }.
% 0.41/1.07 (135) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.41/1.07 (136) {G0,W9,D4,L1,V0,M1} { ! relation_restriction( skol1, skol2 ) =
% 0.41/1.07 relation_rng_restriction( skol2, relation_dom_restriction( skol1, skol2 )
% 0.41/1.07 ) }.
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 Total Proof:
% 0.41/1.07
% 0.41/1.07 eqswap: (139) {G0,W13,D4,L2,V3,M2} { relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( Y, Z ) ) = relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, Y ), Z ), ! relation( Y ) }.
% 0.41/1.07 parent0[1]: (133) {G0,W13,D4,L2,V3,M2} { ! relation( X ),
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( Y, X ), Z ) =
% 0.41/1.07 relation_rng_restriction( Y, relation_dom_restriction( X, Z ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := Y
% 0.41/1.07 Y := X
% 0.41/1.07 Z := Z
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (7) {G0,W13,D4,L2,V3,M2} I { ! relation( X ),
% 0.41/1.07 relation_rng_restriction( Y, relation_dom_restriction( X, Z ) ) ==>
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( Y, X ), Z ) }.
% 0.41/1.07 parent0: (139) {G0,W13,D4,L2,V3,M2} { relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( Y, Z ) ) = relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, Y ), Z ), ! relation( Y ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := Y
% 0.41/1.07 Y := X
% 0.41/1.07 Z := Z
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 1
% 0.41/1.07 1 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 eqswap: (143) {G0,W11,D4,L2,V2,M2} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( Y, X ), Y ) = relation_restriction( X, Y ), !
% 0.41/1.07 relation( X ) }.
% 0.41/1.07 parent0[1]: (134) {G0,W11,D4,L2,V2,M2} { ! relation( X ),
% 0.41/1.07 relation_restriction( X, Y ) = relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( Y, X ), Y ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (8) {G0,W11,D4,L2,V2,M2} I { ! relation( X ),
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( Y, X ), Y ) ==>
% 0.41/1.07 relation_restriction( X, Y ) }.
% 0.41/1.07 parent0: (143) {G0,W11,D4,L2,V2,M2} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( Y, X ), Y ) = relation_restriction( X, Y ), !
% 0.41/1.07 relation( X ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 1
% 0.41/1.07 1 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (9) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.41/1.07 parent0: (135) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 eqswap: (152) {G0,W9,D4,L1,V0,M1} { ! relation_rng_restriction( skol2,
% 0.41/1.07 relation_dom_restriction( skol1, skol2 ) ) = relation_restriction( skol1
% 0.41/1.07 , skol2 ) }.
% 0.41/1.07 parent0[0]: (136) {G0,W9,D4,L1,V0,M1} { ! relation_restriction( skol1,
% 0.41/1.07 skol2 ) = relation_rng_restriction( skol2, relation_dom_restriction(
% 0.41/1.07 skol1, skol2 ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (10) {G0,W9,D4,L1,V0,M1} I { ! relation_rng_restriction( skol2
% 0.41/1.07 , relation_dom_restriction( skol1, skol2 ) ) ==> relation_restriction(
% 0.41/1.07 skol1, skol2 ) }.
% 0.41/1.07 parent0: (152) {G0,W9,D4,L1,V0,M1} { ! relation_rng_restriction( skol2,
% 0.41/1.07 relation_dom_restriction( skol1, skol2 ) ) = relation_restriction( skol1
% 0.41/1.07 , skol2 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 eqswap: (153) {G0,W13,D4,L2,V3,M2} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, Y ), Z ) ==> relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( Y, Z ) ), ! relation( Y ) }.
% 0.41/1.07 parent0[1]: (7) {G0,W13,D4,L2,V3,M2} I { ! relation( X ),
% 0.41/1.07 relation_rng_restriction( Y, relation_dom_restriction( X, Z ) ) ==>
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( Y, X ), Z ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := Y
% 0.41/1.07 Y := X
% 0.41/1.07 Z := Z
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (154) {G1,W11,D4,L1,V2,M1} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), Y ) ==> relation_rng_restriction( X
% 0.41/1.07 , relation_dom_restriction( skol1, Y ) ) }.
% 0.41/1.07 parent0[1]: (153) {G0,W13,D4,L2,V3,M2} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, Y ), Z ) ==> relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( Y, Z ) ), ! relation( Y ) }.
% 0.41/1.07 parent1[0]: (9) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := skol1
% 0.41/1.07 Z := Y
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 eqswap: (155) {G1,W11,D4,L1,V2,M1} { relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( skol1, Y ) ) ==> relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), Y ) }.
% 0.41/1.07 parent0[0]: (154) {G1,W11,D4,L1,V2,M1} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), Y ) ==> relation_rng_restriction( X
% 0.41/1.07 , relation_dom_restriction( skol1, Y ) ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (58) {G1,W11,D4,L1,V2,M1} R(7,9) { relation_rng_restriction( X
% 0.41/1.07 , relation_dom_restriction( skol1, Y ) ) ==> relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), Y ) }.
% 0.41/1.07 parent0: (155) {G1,W11,D4,L1,V2,M1} { relation_rng_restriction( X,
% 0.41/1.07 relation_dom_restriction( skol1, Y ) ) ==> relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), Y ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := Y
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 eqswap: (156) {G0,W11,D4,L2,V2,M2} { relation_restriction( Y, X ) ==>
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( X, Y ), X ), !
% 0.41/1.07 relation( Y ) }.
% 0.41/1.07 parent0[1]: (8) {G0,W11,D4,L2,V2,M2} I { ! relation( X ),
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( Y, X ), Y ) ==>
% 0.41/1.07 relation_restriction( X, Y ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := Y
% 0.41/1.07 Y := X
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 resolution: (157) {G1,W9,D4,L1,V1,M1} { relation_restriction( skol1, X )
% 0.41/1.07 ==> relation_dom_restriction( relation_rng_restriction( X, skol1 ), X )
% 0.41/1.07 }.
% 0.41/1.07 parent0[1]: (156) {G0,W11,D4,L2,V2,M2} { relation_restriction( Y, X ) ==>
% 0.41/1.07 relation_dom_restriction( relation_rng_restriction( X, Y ), X ), !
% 0.41/1.07 relation( Y ) }.
% 0.41/1.07 parent1[0]: (9) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 Y := skol1
% 0.41/1.07 end
% 0.41/1.07 substitution1:
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 eqswap: (158) {G1,W9,D4,L1,V1,M1} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), X ) ==> relation_restriction( skol1
% 0.41/1.07 , X ) }.
% 0.41/1.07 parent0[0]: (157) {G1,W9,D4,L1,V1,M1} { relation_restriction( skol1, X )
% 0.41/1.07 ==> relation_dom_restriction( relation_rng_restriction( X, skol1 ), X )
% 0.41/1.07 }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 subsumption: (73) {G1,W9,D4,L1,V1,M1} R(8,9) { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), X ) ==> relation_restriction( skol1
% 0.41/1.07 , X ) }.
% 0.41/1.07 parent0: (158) {G1,W9,D4,L1,V1,M1} { relation_dom_restriction(
% 0.41/1.07 relation_rng_restriction( X, skol1 ), X ) ==> relation_restriction( skol1
% 0.41/1.07 , X ) }.
% 0.41/1.07 substitution0:
% 0.41/1.07 X := X
% 0.41/1.07 end
% 0.41/1.07 permutation0:
% 0.41/1.07 0 ==> 0
% 0.41/1.07 end
% 0.41/1.07
% 0.41/1.07 paramod: (162) {G1,W9,D4,L1,V0,M1} { ! relation_dom_restriction(
% 0.41/1.08 relation_rng_restriction( skol2, skol1 ), skol2 ) ==>
% 0.41/1.08 relation_restriction( skol1, skol2 ) }.
% 0.41/1.08 parent0[0]: (58) {G1,W11,D4,L1,V2,M1} R(7,9) { relation_rng_restriction( X
% 0.41/1.08 , relation_dom_restriction( skol1, Y ) ) ==> relation_dom_restriction(
% 0.41/1.08 relation_rng_restriction( X, skol1 ), Y ) }.
% 0.41/1.08 parent1[0; 2]: (10) {G0,W9,D4,L1,V0,M1} I { ! relation_rng_restriction(
% 0.41/1.08 skol2, relation_dom_restriction( skol1, skol2 ) ) ==>
% 0.41/1.08 relation_restriction( skol1, skol2 ) }.
% 0.41/1.08 substitution0:
% 0.41/1.08 X := skol2
% 0.41/1.08 Y := skol2
% 0.41/1.08 end
% 0.41/1.08 substitution1:
% 0.41/1.08 end
% 0.41/1.08
% 0.41/1.08 paramod: (163) {G2,W7,D3,L1,V0,M1} { ! relation_restriction( skol1, skol2
% 0.41/1.08 ) ==> relation_restriction( skol1, skol2 ) }.
% 0.41/1.08 parent0[0]: (73) {G1,W9,D4,L1,V1,M1} R(8,9) { relation_dom_restriction(
% 0.41/1.08 relation_rng_restriction( X, skol1 ), X ) ==> relation_restriction( skol1
% 0.41/1.08 , X ) }.
% 0.41/1.08 parent1[0; 2]: (162) {G1,W9,D4,L1,V0,M1} { ! relation_dom_restriction(
% 0.41/1.08 relation_rng_restriction( skol2, skol1 ), skol2 ) ==>
% 0.41/1.08 relation_restriction( skol1, skol2 ) }.
% 0.41/1.08 substitution0:
% 0.41/1.08 X := skol2
% 0.41/1.08 end
% 0.41/1.08 substitution1:
% 0.41/1.08 end
% 0.41/1.08
% 0.41/1.08 eqrefl: (164) {G0,W0,D0,L0,V0,M0} { }.
% 0.41/1.08 parent0[0]: (163) {G2,W7,D3,L1,V0,M1} { ! relation_restriction( skol1,
% 0.41/1.08 skol2 ) ==> relation_restriction( skol1, skol2 ) }.
% 0.41/1.08 substitution0:
% 0.41/1.08 end
% 0.41/1.08
% 0.41/1.08 subsumption: (123) {G2,W0,D0,L0,V0,M0} S(10);d(58);d(73);q { }.
% 0.41/1.08 parent0: (164) {G0,W0,D0,L0,V0,M0} { }.
% 0.41/1.08 substitution0:
% 0.41/1.08 end
% 0.41/1.08 permutation0:
% 0.41/1.08 end
% 0.41/1.08
% 0.41/1.08 Proof check complete!
% 0.41/1.08
% 0.41/1.08 Memory use:
% 0.41/1.08
% 0.41/1.08 space for terms: 1482
% 0.41/1.08 space for clauses: 10812
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 clauses generated: 214
% 0.41/1.08 clauses kept: 124
% 0.41/1.08 clauses selected: 24
% 0.41/1.08 clauses deleted: 2
% 0.41/1.08 clauses inuse deleted: 0
% 0.41/1.08
% 0.41/1.08 subsentry: 248
% 0.41/1.08 literals s-matched: 186
% 0.41/1.08 literals matched: 186
% 0.41/1.08 full subsumption: 0
% 0.41/1.08
% 0.41/1.08 checksum: 592450255
% 0.41/1.08
% 0.41/1.08
% 0.41/1.08 Bliksem ended
%------------------------------------------------------------------------------