TSTP Solution File: SEU223+3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU223+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:37 EDT 2022
% Result : Theorem 0.82s 1.20s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SEU223+3 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % DateTime : Sun Jun 19 16:18:59 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.82/1.20 *** allocated 10000 integers for termspace/termends
% 0.82/1.20 *** allocated 10000 integers for clauses
% 0.82/1.20 *** allocated 10000 integers for justifications
% 0.82/1.20 Bliksem 1.12
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 Automatic Strategy Selection
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 Clauses:
% 0.82/1.20
% 0.82/1.20 { subset( X, X ) }.
% 0.82/1.20 { empty( empty_set ) }.
% 0.82/1.20 { relation( empty_set ) }.
% 0.82/1.20 { empty( empty_set ) }.
% 0.82/1.20 { relation( empty_set ) }.
% 0.82/1.20 { relation_empty_yielding( empty_set ) }.
% 0.82/1.20 { empty( empty_set ) }.
% 0.82/1.20 { set_intersection2( X, empty_set ) = empty_set }.
% 0.82/1.20 { element( skol1( X ), X ) }.
% 0.82/1.20 { ! empty( X ), function( X ) }.
% 0.82/1.20 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.82/1.20 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.82/1.20 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.82/1.20 { ! empty( powerset( X ) ) }.
% 0.82/1.20 { empty( X ), ! relation( X ), ! empty( relation_dom( X ) ) }.
% 0.82/1.20 { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.82/1.20 { ! empty( X ), relation( relation_dom( X ) ) }.
% 0.82/1.20 { ! relation( X ), ! relation_empty_yielding( X ), relation(
% 0.82/1.20 relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 { ! relation( X ), ! relation_empty_yielding( X ), relation_empty_yielding
% 0.82/1.20 ( relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 { ! empty( X ), relation( X ) }.
% 0.82/1.20 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.82/1.20 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.82/1.20 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.82/1.20 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.82/1.20 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.82/1.20 { ! empty( X ), X = empty_set }.
% 0.82/1.20 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.82/1.20 { set_intersection2( X, Y ) = set_intersection2( Y, X ) }.
% 0.82/1.20 { set_intersection2( X, X ) = X }.
% 0.82/1.20 { ! in( X, Y ), ! in( Y, X ) }.
% 0.82/1.20 { ! relation( X ), relation( relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 { ! relation( X ), ! function( X ), relation( relation_dom_restriction( X,
% 0.82/1.20 Y ) ) }.
% 0.82/1.20 { ! relation( X ), ! function( X ), function( relation_dom_restriction( X,
% 0.82/1.20 Y ) ) }.
% 0.82/1.20 { relation( skol2 ) }.
% 0.82/1.20 { function( skol2 ) }.
% 0.82/1.20 { relation( skol3 ) }.
% 0.82/1.20 { empty( skol3 ) }.
% 0.82/1.20 { function( skol3 ) }.
% 0.82/1.20 { relation( skol4 ) }.
% 0.82/1.20 { function( skol4 ) }.
% 0.82/1.20 { one_to_one( skol4 ) }.
% 0.82/1.20 { empty( X ), ! empty( skol5( Y ) ) }.
% 0.82/1.20 { empty( X ), element( skol5( X ), powerset( X ) ) }.
% 0.82/1.20 { empty( skol6( Y ) ) }.
% 0.82/1.20 { element( skol6( X ), powerset( X ) ) }.
% 0.82/1.20 { ! relation( X ), ! relation( Y ), relation( set_intersection2( X, Y ) ) }
% 0.82/1.20 .
% 0.82/1.20 { empty( skol7 ) }.
% 0.82/1.20 { relation( skol7 ) }.
% 0.82/1.20 { ! empty( skol8 ) }.
% 0.82/1.20 { relation( skol8 ) }.
% 0.82/1.20 { relation( skol9 ) }.
% 0.82/1.20 { relation_empty_yielding( skol9 ) }.
% 0.82/1.20 { empty( skol10 ) }.
% 0.82/1.20 { ! empty( skol11 ) }.
% 0.82/1.20 { ! in( X, Y ), element( X, Y ) }.
% 0.82/1.20 { ! in( X, Y ), ! empty( Y ) }.
% 0.82/1.20 { relation( skol12 ) }.
% 0.82/1.20 { function( skol12 ) }.
% 0.82/1.20 { in( skol15, relation_dom( relation_dom_restriction( skol12, skol14 ) ) )
% 0.82/1.20 }.
% 0.82/1.20 { ! apply( relation_dom_restriction( skol12, skol14 ), skol15 ) = apply(
% 0.82/1.20 skol12, skol15 ) }.
% 0.82/1.20 { ! relation( X ), ! function( X ), ! relation( Y ), ! function( Y ), ! X =
% 0.82/1.20 relation_dom_restriction( Y, Z ), relation_dom( X ) = set_intersection2
% 0.82/1.20 ( relation_dom( Y ), Z ) }.
% 0.82/1.20 { ! relation( X ), ! function( X ), ! relation( Y ), ! function( Y ), ! X =
% 0.82/1.20 relation_dom_restriction( Y, Z ), alpha1( X, Y ) }.
% 0.82/1.20 { ! relation( X ), ! function( X ), ! relation( Y ), ! function( Y ), !
% 0.82/1.20 relation_dom( X ) = set_intersection2( relation_dom( Y ), Z ), ! alpha1(
% 0.82/1.20 X, Y ), X = relation_dom_restriction( Y, Z ) }.
% 0.82/1.20 { ! alpha1( X, Y ), ! in( Z, relation_dom( X ) ), apply( X, Z ) = apply( Y
% 0.82/1.20 , Z ) }.
% 0.82/1.20 { in( skol13( X, Z ), relation_dom( X ) ), alpha1( X, Y ) }.
% 0.82/1.20 { ! apply( X, skol13( X, Y ) ) = apply( Y, skol13( X, Y ) ), alpha1( X, Y )
% 0.82/1.20 }.
% 0.82/1.20
% 0.82/1.20 percentage equality = 0.114035, percentage horn = 0.950000
% 0.82/1.20 This is a problem with some equality
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 Options Used:
% 0.82/1.20
% 0.82/1.20 useres = 1
% 0.82/1.20 useparamod = 1
% 0.82/1.20 useeqrefl = 1
% 0.82/1.20 useeqfact = 1
% 0.82/1.20 usefactor = 1
% 0.82/1.20 usesimpsplitting = 0
% 0.82/1.20 usesimpdemod = 5
% 0.82/1.20 usesimpres = 3
% 0.82/1.20
% 0.82/1.20 resimpinuse = 1000
% 0.82/1.20 resimpclauses = 20000
% 0.82/1.20 substype = eqrewr
% 0.82/1.20 backwardsubs = 1
% 0.82/1.20 selectoldest = 5
% 0.82/1.20
% 0.82/1.20 litorderings [0] = split
% 0.82/1.20 litorderings [1] = extend the termordering, first sorting on arguments
% 0.82/1.20
% 0.82/1.20 termordering = kbo
% 0.82/1.20
% 0.82/1.20 litapriori = 0
% 0.82/1.20 termapriori = 1
% 0.82/1.20 litaposteriori = 0
% 0.82/1.20 termaposteriori = 0
% 0.82/1.20 demodaposteriori = 0
% 0.82/1.20 ordereqreflfact = 0
% 0.82/1.20
% 0.82/1.20 litselect = negord
% 0.82/1.20
% 0.82/1.20 maxweight = 15
% 0.82/1.20 maxdepth = 30000
% 0.82/1.20 maxlength = 115
% 0.82/1.20 maxnrvars = 195
% 0.82/1.20 excuselevel = 1
% 0.82/1.20 increasemaxweight = 1
% 0.82/1.20
% 0.82/1.20 maxselected = 10000000
% 0.82/1.20 maxnrclauses = 10000000
% 0.82/1.20
% 0.82/1.20 showgenerated = 0
% 0.82/1.20 showkept = 0
% 0.82/1.20 showselected = 0
% 0.82/1.20 showdeleted = 0
% 0.82/1.20 showresimp = 1
% 0.82/1.20 showstatus = 2000
% 0.82/1.20
% 0.82/1.20 prologoutput = 0
% 0.82/1.20 nrgoals = 5000000
% 0.82/1.20 totalproof = 1
% 0.82/1.20
% 0.82/1.20 Symbols occurring in the translation:
% 0.82/1.20
% 0.82/1.20 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.82/1.20 . [1, 2] (w:1, o:37, a:1, s:1, b:0),
% 0.82/1.20 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.82/1.20 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.82/1.20 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.82/1.20 subset [37, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.82/1.20 empty_set [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.82/1.20 empty [39, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.82/1.20 relation [40, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.82/1.20 relation_empty_yielding [41, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.82/1.20 set_intersection2 [42, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.82/1.20 element [43, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.82/1.20 function [44, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.82/1.20 one_to_one [45, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.82/1.20 powerset [46, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.82/1.20 relation_dom [47, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.82/1.20 relation_dom_restriction [48, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.82/1.20 in [49, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.82/1.20 apply [51, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.82/1.20 alpha1 [53, 2] (w:1, o:67, a:1, s:1, b:1),
% 0.82/1.20 skol1 [54, 1] (w:1, o:34, a:1, s:1, b:1),
% 0.82/1.20 skol2 [55, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.82/1.20 skol3 [56, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.82/1.20 skol4 [57, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.82/1.20 skol5 [58, 1] (w:1, o:35, a:1, s:1, b:1),
% 0.82/1.20 skol6 [59, 1] (w:1, o:36, a:1, s:1, b:1),
% 0.82/1.20 skol7 [60, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.82/1.20 skol8 [61, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.82/1.20 skol9 [62, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.82/1.20 skol10 [63, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.82/1.20 skol11 [64, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.82/1.20 skol12 [65, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.82/1.20 skol13 [66, 2] (w:1, o:68, a:1, s:1, b:1),
% 0.82/1.20 skol14 [67, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.82/1.20 skol15 [68, 0] (w:1, o:15, a:1, s:1, b:1).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 Starting Search:
% 0.82/1.20
% 0.82/1.20 *** allocated 15000 integers for clauses
% 0.82/1.20 *** allocated 22500 integers for clauses
% 0.82/1.20 *** allocated 33750 integers for clauses
% 0.82/1.20
% 0.82/1.20 Bliksems!, er is een bewijs:
% 0.82/1.20 % SZS status Theorem
% 0.82/1.20 % SZS output start Refutation
% 0.82/1.20
% 0.82/1.20 (25) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.82/1.20 relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (26) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! function( X ), function(
% 0.82/1.20 relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (50) {G0,W2,D2,L1,V0,M1} I { relation( skol12 ) }.
% 0.82/1.20 (51) {G0,W2,D2,L1,V0,M1} I { function( skol12 ) }.
% 0.82/1.20 (52) {G0,W6,D4,L1,V0,M1} I { in( skol15, relation_dom(
% 0.82/1.20 relation_dom_restriction( skol12, skol14 ) ) ) }.
% 0.82/1.20 (53) {G0,W9,D4,L1,V0,M1} I { ! apply( relation_dom_restriction( skol12,
% 0.82/1.20 skol14 ), skol15 ) ==> apply( skol12, skol15 ) }.
% 0.82/1.20 (55) {G0,W16,D3,L6,V3,M6} I { ! relation( X ), ! function( X ), ! relation
% 0.82/1.20 ( Y ), ! function( Y ), ! X = relation_dom_restriction( Y, Z ), alpha1( X
% 0.82/1.20 , Y ) }.
% 0.82/1.20 (57) {G0,W14,D3,L3,V3,M3} I { ! alpha1( X, Y ), ! in( Z, relation_dom( X )
% 0.82/1.20 ), apply( X, Z ) = apply( Y, Z ) }.
% 0.82/1.20 (572) {G1,W12,D3,L2,V1,M2} P(57,53);r(52) { ! apply( X, skol15 ) = apply(
% 0.82/1.20 skol12, skol15 ), ! alpha1( relation_dom_restriction( skol12, skol14 ), X
% 0.82/1.20 ) }.
% 0.82/1.20 (579) {G2,W5,D3,L1,V0,M1} Q(572) { ! alpha1( relation_dom_restriction(
% 0.82/1.20 skol12, skol14 ), skol12 ) }.
% 0.82/1.20 (580) {G3,W15,D3,L4,V1,M4} R(579,55);r(25) { ! function(
% 0.82/1.20 relation_dom_restriction( skol12, skol14 ) ), ! relation( skol12 ), !
% 0.82/1.20 function( skol12 ), ! relation_dom_restriction( skol12, skol14 ) =
% 0.82/1.20 relation_dom_restriction( skol12, X ) }.
% 0.82/1.20 (581) {G4,W4,D2,L2,V0,M2} Q(580);r(26) { ! relation( skol12 ), ! function(
% 0.82/1.20 skol12 ) }.
% 0.82/1.20 (582) {G5,W0,D0,L0,V0,M0} S(581);r(50);r(51) { }.
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 % SZS output end Refutation
% 0.82/1.20 found a proof!
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 Unprocessed initial clauses:
% 0.82/1.20
% 0.82/1.20 (584) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.82/1.20 (585) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.82/1.20 (586) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.82/1.20 (587) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.82/1.20 (588) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.82/1.20 (589) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.82/1.20 (590) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.82/1.20 (591) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, empty_set ) = empty_set
% 0.82/1.20 }.
% 0.82/1.20 (592) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.82/1.20 (593) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 0.82/1.20 (594) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.82/1.20 , relation( X ) }.
% 0.82/1.20 (595) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.82/1.20 , function( X ) }.
% 0.82/1.20 (596) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.82/1.20 , one_to_one( X ) }.
% 0.82/1.20 (597) {G0,W3,D3,L1,V1,M1} { ! empty( powerset( X ) ) }.
% 0.82/1.20 (598) {G0,W7,D3,L3,V1,M3} { empty( X ), ! relation( X ), ! empty(
% 0.82/1.20 relation_dom( X ) ) }.
% 0.82/1.20 (599) {G0,W5,D3,L2,V1,M2} { ! empty( X ), empty( relation_dom( X ) ) }.
% 0.82/1.20 (600) {G0,W5,D3,L2,V1,M2} { ! empty( X ), relation( relation_dom( X ) )
% 0.82/1.20 }.
% 0.82/1.20 (601) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! relation_empty_yielding( X
% 0.82/1.20 ), relation( relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (602) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! relation_empty_yielding( X
% 0.82/1.20 ), relation_empty_yielding( relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (603) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.82/1.20 (604) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.82/1.20 (605) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.82/1.20 }.
% 0.82/1.20 (606) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.82/1.20 }.
% 0.82/1.20 (607) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.82/1.20 element( X, Y ) }.
% 0.82/1.20 (608) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ), !
% 0.82/1.20 empty( Z ) }.
% 0.82/1.20 (609) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.82/1.20 (610) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.82/1.20 (611) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) = set_intersection2
% 0.82/1.20 ( Y, X ) }.
% 0.82/1.20 (612) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, X ) = X }.
% 0.82/1.20 (613) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.82/1.20 (614) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.82/1.20 relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (615) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! function( X ), relation(
% 0.82/1.20 relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (616) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! function( X ), function(
% 0.82/1.20 relation_dom_restriction( X, Y ) ) }.
% 0.82/1.20 (617) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.82/1.20 (618) {G0,W2,D2,L1,V0,M1} { function( skol2 ) }.
% 0.82/1.20 (619) {G0,W2,D2,L1,V0,M1} { relation( skol3 ) }.
% 0.82/1.20 (620) {G0,W2,D2,L1,V0,M1} { empty( skol3 ) }.
% 0.82/1.20 (621) {G0,W2,D2,L1,V0,M1} { function( skol3 ) }.
% 0.82/1.20 (622) {G0,W2,D2,L1,V0,M1} { relation( skol4 ) }.
% 0.82/1.20 (623) {G0,W2,D2,L1,V0,M1} { function( skol4 ) }.
% 0.82/1.20 (624) {G0,W2,D2,L1,V0,M1} { one_to_one( skol4 ) }.
% 0.82/1.20 (625) {G0,W5,D3,L2,V2,M2} { empty( X ), ! empty( skol5( Y ) ) }.
% 0.82/1.20 (626) {G0,W7,D3,L2,V1,M2} { empty( X ), element( skol5( X ), powerset( X )
% 0.82/1.20 ) }.
% 0.82/1.20 (627) {G0,W3,D3,L1,V1,M1} { empty( skol6( Y ) ) }.
% 0.82/1.20 (628) {G0,W5,D3,L1,V1,M1} { element( skol6( X ), powerset( X ) ) }.
% 0.82/1.20 (629) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! relation( Y ), relation(
% 0.82/1.20 set_intersection2( X, Y ) ) }.
% 0.82/1.20 (630) {G0,W2,D2,L1,V0,M1} { empty( skol7 ) }.
% 0.82/1.20 (631) {G0,W2,D2,L1,V0,M1} { relation( skol7 ) }.
% 0.82/1.20 (632) {G0,W2,D2,L1,V0,M1} { ! empty( skol8 ) }.
% 0.82/1.20 (633) {G0,W2,D2,L1,V0,M1} { relation( skol8 ) }.
% 0.82/1.20 (634) {G0,W2,D2,L1,V0,M1} { relation( skol9 ) }.
% 0.82/1.20 (635) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol9 ) }.
% 0.82/1.20 (636) {G0,W2,D2,L1,V0,M1} { empty( skol10 ) }.
% 0.82/1.20 (637) {G0,W2,D2,L1,V0,M1} { ! empty( skol11 ) }.
% 0.82/1.20 (638) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.82/1.20 (639) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.82/1.20 (640) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 0.82/1.20 (641) {G0,W2,D2,L1,V0,M1} { function( skol12 ) }.
% 0.82/1.20 (642) {G0,W6,D4,L1,V0,M1} { in( skol15, relation_dom(
% 0.82/1.20 relation_dom_restriction( skol12, skol14 ) ) ) }.
% 2.69/3.07 (643) {G0,W9,D4,L1,V0,M1} { ! apply( relation_dom_restriction( skol12,
% 2.69/3.07 skol14 ), skol15 ) = apply( skol12, skol15 ) }.
% 2.69/3.07 (644) {G0,W20,D4,L6,V3,M6} { ! relation( X ), ! function( X ), ! relation
% 2.69/3.07 ( Y ), ! function( Y ), ! X = relation_dom_restriction( Y, Z ),
% 2.69/3.07 relation_dom( X ) = set_intersection2( relation_dom( Y ), Z ) }.
% 2.69/3.07 (645) {G0,W16,D3,L6,V3,M6} { ! relation( X ), ! function( X ), ! relation
% 2.69/3.07 ( Y ), ! function( Y ), ! X = relation_dom_restriction( Y, Z ), alpha1( X
% 2.69/3.07 , Y ) }.
% 2.69/3.07 (646) {G0,W23,D4,L7,V3,M7} { ! relation( X ), ! function( X ), ! relation
% 2.69/3.07 ( Y ), ! function( Y ), ! relation_dom( X ) = set_intersection2(
% 2.69/3.07 relation_dom( Y ), Z ), ! alpha1( X, Y ), X = relation_dom_restriction( Y
% 2.69/3.07 , Z ) }.
% 2.69/3.07 (647) {G0,W14,D3,L3,V3,M3} { ! alpha1( X, Y ), ! in( Z, relation_dom( X )
% 2.69/3.07 ), apply( X, Z ) = apply( Y, Z ) }.
% 2.69/3.07 (648) {G0,W9,D3,L2,V3,M2} { in( skol13( X, Z ), relation_dom( X ) ),
% 2.69/3.07 alpha1( X, Y ) }.
% 2.69/3.07 (649) {G0,W14,D4,L2,V2,M2} { ! apply( X, skol13( X, Y ) ) = apply( Y,
% 2.69/3.07 skol13( X, Y ) ), alpha1( X, Y ) }.
% 2.69/3.07
% 2.69/3.07
% 2.69/3.07 Total Proof:
% 2.69/3.07
% 2.69/3.07 subsumption: (25) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 2.69/3.07 relation_dom_restriction( X, Y ) ) }.
% 2.69/3.07 parent0: (614) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 2.69/3.07 relation_dom_restriction( X, Y ) ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 X := X
% 2.69/3.07 Y := Y
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 1 ==> 1
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 subsumption: (26) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! function( X )
% 2.69/3.07 , function( relation_dom_restriction( X, Y ) ) }.
% 2.69/3.07 parent0: (616) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! function( X ),
% 2.69/3.07 function( relation_dom_restriction( X, Y ) ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 X := X
% 2.69/3.07 Y := Y
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 1 ==> 1
% 2.69/3.07 2 ==> 2
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 subsumption: (50) {G0,W2,D2,L1,V0,M1} I { relation( skol12 ) }.
% 2.69/3.07 parent0: (640) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 subsumption: (51) {G0,W2,D2,L1,V0,M1} I { function( skol12 ) }.
% 2.69/3.07 parent0: (641) {G0,W2,D2,L1,V0,M1} { function( skol12 ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 subsumption: (52) {G0,W6,D4,L1,V0,M1} I { in( skol15, relation_dom(
% 2.69/3.07 relation_dom_restriction( skol12, skol14 ) ) ) }.
% 2.69/3.07 parent0: (642) {G0,W6,D4,L1,V0,M1} { in( skol15, relation_dom(
% 2.69/3.07 relation_dom_restriction( skol12, skol14 ) ) ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 subsumption: (53) {G0,W9,D4,L1,V0,M1} I { ! apply( relation_dom_restriction
% 2.69/3.07 ( skol12, skol14 ), skol15 ) ==> apply( skol12, skol15 ) }.
% 2.69/3.07 parent0: (643) {G0,W9,D4,L1,V0,M1} { ! apply( relation_dom_restriction(
% 2.69/3.07 skol12, skol14 ), skol15 ) = apply( skol12, skol15 ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 subsumption: (55) {G0,W16,D3,L6,V3,M6} I { ! relation( X ), ! function( X )
% 2.69/3.07 , ! relation( Y ), ! function( Y ), ! X = relation_dom_restriction( Y, Z
% 2.69/3.07 ), alpha1( X, Y ) }.
% 2.69/3.07 parent0: (645) {G0,W16,D3,L6,V3,M6} { ! relation( X ), ! function( X ), !
% 2.69/3.07 relation( Y ), ! function( Y ), ! X = relation_dom_restriction( Y, Z ),
% 2.69/3.07 alpha1( X, Y ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 X := X
% 2.69/3.07 Y := Y
% 2.69/3.07 Z := Z
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 1 ==> 1
% 2.69/3.07 2 ==> 2
% 2.69/3.07 3 ==> 3
% 2.69/3.07 4 ==> 4
% 2.69/3.07 5 ==> 5
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 *** allocated 50625 integers for clauses
% 2.69/3.07 subsumption: (57) {G0,W14,D3,L3,V3,M3} I { ! alpha1( X, Y ), ! in( Z,
% 2.69/3.07 relation_dom( X ) ), apply( X, Z ) = apply( Y, Z ) }.
% 2.69/3.07 parent0: (647) {G0,W14,D3,L3,V3,M3} { ! alpha1( X, Y ), ! in( Z,
% 2.69/3.07 relation_dom( X ) ), apply( X, Z ) = apply( Y, Z ) }.
% 2.69/3.07 substitution0:
% 2.69/3.07 X := X
% 2.69/3.07 Y := Y
% 2.69/3.07 Z := Z
% 2.69/3.07 end
% 2.69/3.07 permutation0:
% 2.69/3.07 0 ==> 0
% 2.69/3.07 1 ==> 1
% 2.69/3.07 2 ==> 2
% 2.69/3.07 end
% 2.69/3.07
% 2.69/3.07 *** allocated 15000 integers for termspace/termends
% 2.69/3.07 *** allocated 22500 integers for termspace/termends
% 2.69/3.07 *** allocated 33750 integers for termspace/termends
% 2.69/3.07 *** allocated 15000 integers for justifications
% 2.69/3.07 *** allocated 50625 integers for termspace/termends
% 2.69/3.07 *** allocated 22500 integers for justifications
% 2.69/3.07 *** allocated 75937 integers for clauses
% 2.69/3.07 *** allocated 75937 integers for termspace/termends
% 2.69/3.07 *** allocated 33750 integers for justifications
% 2.69/3.07 *** allocated 113905 integers for termspace/termends
% 2.69/3.07 *** allocated 50625 integers for justifications
% 2.69/3.07 *** allocated 113905 inteCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------