TSTP Solution File: SET636+3 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SET636+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n006.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  : 300s
% DateTime : Tue Apr 30 20:40:03 EDT 2024

% Result   : Theorem 0.16s 0.32s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem  : SET636+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30  % Computer : n006.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 300
% 0.10/0.30  % DateTime : Mon Apr 29 21:42:35 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.16/0.31  % Drodi V3.6.0
% 0.16/0.32  % Refutation found
% 0.16/0.32  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.32  % SZS output start CNFRefutation for theBenchmark
% 0.16/0.32  fof(f1,axiom,(
% 0.16/0.32    (! [B,C,D] :( member(D,intersection(B,C))<=> ( member(D,B)& member(D,C) ) ) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f2,axiom,(
% 0.16/0.32    (! [B,C] :( intersect(B,C)<=> (? [D] :( member(D,B)& member(D,C) ) )) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f3,axiom,(
% 0.16/0.32    (! [B] : ~ member(B,empty_set) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f4,axiom,(
% 0.16/0.32    (! [B,C] :( disjoint(B,C)<=> ~ intersect(B,C) ) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f5,axiom,(
% 0.16/0.32    (! [B,C] :( B = C<=> ( subset(B,C)& subset(C,B) ) ) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f6,axiom,(
% 0.16/0.32    (! [B,C] : intersection(B,C) = intersection(C,B) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f8,axiom,(
% 0.16/0.32    (! [B,C] :( subset(B,C)<=> (! [D] :( member(D,B)=> member(D,C) ) )) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f10,axiom,(
% 0.16/0.32    (! [B] :( empty(B)<=> (! [C] : ~ member(C,B) )) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f12,conjecture,(
% 0.16/0.32    (! [B,C] :( disjoint(B,C)<=> intersection(B,C) = empty_set ) )),
% 0.16/0.32    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32  fof(f13,negated_conjecture,(
% 0.16/0.32    ~((! [B,C] :( disjoint(B,C)<=> intersection(B,C) = empty_set ) ))),
% 0.16/0.32    inference(negated_conjecture,[status(cth)],[f12])).
% 0.16/0.32  fof(f14,plain,(
% 0.16/0.32    ![B,C,D]: ((~member(D,intersection(B,C))|(member(D,B)&member(D,C)))&(member(D,intersection(B,C))|(~member(D,B)|~member(D,C))))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f1])).
% 0.16/0.32  fof(f15,plain,(
% 0.16/0.32    (![B,C,D]: (~member(D,intersection(B,C))|(member(D,B)&member(D,C))))&(![B,C,D]: (member(D,intersection(B,C))|(~member(D,B)|~member(D,C))))),
% 0.16/0.32    inference(miniscoping,[status(esa)],[f14])).
% 0.16/0.32  fof(f16,plain,(
% 0.16/0.32    ![X0,X1,X2]: (~member(X0,intersection(X1,X2))|member(X0,X1))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f15])).
% 0.16/0.32  fof(f17,plain,(
% 0.16/0.32    ![X0,X1,X2]: (~member(X0,intersection(X1,X2))|member(X0,X2))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f15])).
% 0.16/0.32  fof(f18,plain,(
% 0.16/0.32    ![X0,X1,X2]: (member(X0,intersection(X1,X2))|~member(X0,X1)|~member(X0,X2))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f15])).
% 0.16/0.32  fof(f19,plain,(
% 0.16/0.32    ![B,C]: ((~intersect(B,C)|(?[D]: (member(D,B)&member(D,C))))&(intersect(B,C)|(![D]: (~member(D,B)|~member(D,C)))))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f2])).
% 0.16/0.32  fof(f20,plain,(
% 0.16/0.32    (![B,C]: (~intersect(B,C)|(?[D]: (member(D,B)&member(D,C)))))&(![B,C]: (intersect(B,C)|(![D]: (~member(D,B)|~member(D,C)))))),
% 0.16/0.32    inference(miniscoping,[status(esa)],[f19])).
% 0.16/0.32  fof(f21,plain,(
% 0.16/0.32    (![B,C]: (~intersect(B,C)|(member(sk0_0(C,B),B)&member(sk0_0(C,B),C))))&(![B,C]: (intersect(B,C)|(![D]: (~member(D,B)|~member(D,C)))))),
% 0.16/0.32    inference(skolemization,[status(esa)],[f20])).
% 0.16/0.32  fof(f22,plain,(
% 0.16/0.32    ![X0,X1]: (~intersect(X0,X1)|member(sk0_0(X1,X0),X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f21])).
% 0.16/0.32  fof(f23,plain,(
% 0.16/0.32    ![X0,X1]: (~intersect(X0,X1)|member(sk0_0(X1,X0),X1))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f21])).
% 0.16/0.32  fof(f24,plain,(
% 0.16/0.32    ![X0,X1,X2]: (intersect(X0,X1)|~member(X2,X0)|~member(X2,X1))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f21])).
% 0.16/0.32  fof(f25,plain,(
% 0.16/0.32    ![X0]: (~member(X0,empty_set))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f3])).
% 0.16/0.32  fof(f26,plain,(
% 0.16/0.32    ![B,C]: ((~disjoint(B,C)|~intersect(B,C))&(disjoint(B,C)|intersect(B,C)))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f4])).
% 0.16/0.32  fof(f27,plain,(
% 0.16/0.32    (![B,C]: (~disjoint(B,C)|~intersect(B,C)))&(![B,C]: (disjoint(B,C)|intersect(B,C)))),
% 0.16/0.32    inference(miniscoping,[status(esa)],[f26])).
% 0.16/0.32  fof(f28,plain,(
% 0.16/0.32    ![X0,X1]: (~disjoint(X0,X1)|~intersect(X0,X1))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f27])).
% 0.16/0.32  fof(f29,plain,(
% 0.16/0.32    ![X0,X1]: (disjoint(X0,X1)|intersect(X0,X1))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f27])).
% 0.16/0.32  fof(f30,plain,(
% 0.16/0.32    ![B,C]: ((~B=C|(subset(B,C)&subset(C,B)))&(B=C|(~subset(B,C)|~subset(C,B))))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f5])).
% 0.16/0.32  fof(f31,plain,(
% 0.16/0.32    (![B,C]: (~B=C|(subset(B,C)&subset(C,B))))&(![B,C]: (B=C|(~subset(B,C)|~subset(C,B))))),
% 0.16/0.32    inference(miniscoping,[status(esa)],[f30])).
% 0.16/0.32  fof(f34,plain,(
% 0.16/0.32    ![X0,X1]: (X0=X1|~subset(X0,X1)|~subset(X1,X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f31])).
% 0.16/0.32  fof(f35,plain,(
% 0.16/0.32    ![X0,X1]: (intersection(X0,X1)=intersection(X1,X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f6])).
% 0.16/0.32  fof(f38,plain,(
% 0.16/0.32    ![B,C]: (subset(B,C)<=>(![D]: (~member(D,B)|member(D,C))))),
% 0.16/0.32    inference(pre_NNF_transformation,[status(esa)],[f8])).
% 0.16/0.32  fof(f39,plain,(
% 0.16/0.32    ![B,C]: ((~subset(B,C)|(![D]: (~member(D,B)|member(D,C))))&(subset(B,C)|(?[D]: (member(D,B)&~member(D,C)))))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f38])).
% 0.16/0.32  fof(f40,plain,(
% 0.16/0.32    (![B,C]: (~subset(B,C)|(![D]: (~member(D,B)|member(D,C)))))&(![B,C]: (subset(B,C)|(?[D]: (member(D,B)&~member(D,C)))))),
% 0.16/0.32    inference(miniscoping,[status(esa)],[f39])).
% 0.16/0.32  fof(f41,plain,(
% 0.16/0.32    (![B,C]: (~subset(B,C)|(![D]: (~member(D,B)|member(D,C)))))&(![B,C]: (subset(B,C)|(member(sk0_1(C,B),B)&~member(sk0_1(C,B),C))))),
% 0.16/0.32    inference(skolemization,[status(esa)],[f40])).
% 0.16/0.32  fof(f43,plain,(
% 0.16/0.32    ![X0,X1]: (subset(X0,X1)|member(sk0_1(X1,X0),X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f41])).
% 0.16/0.32  fof(f46,plain,(
% 0.16/0.32    ![B]: ((~empty(B)|(![C]: ~member(C,B)))&(empty(B)|(?[C]: member(C,B))))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f10])).
% 0.16/0.32  fof(f47,plain,(
% 0.16/0.32    (![B]: (~empty(B)|(![C]: ~member(C,B))))&(![B]: (empty(B)|(?[C]: member(C,B))))),
% 0.16/0.32    inference(miniscoping,[status(esa)],[f46])).
% 0.16/0.32  fof(f48,plain,(
% 0.16/0.32    (![B]: (~empty(B)|(![C]: ~member(C,B))))&(![B]: (empty(B)|member(sk0_2(B),B)))),
% 0.16/0.32    inference(skolemization,[status(esa)],[f47])).
% 0.16/0.32  fof(f49,plain,(
% 0.16/0.32    ![X0,X1]: (~empty(X0)|~member(X1,X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f48])).
% 0.16/0.32  fof(f50,plain,(
% 0.16/0.32    ![X0]: (empty(X0)|member(sk0_2(X0),X0))),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f48])).
% 0.16/0.32  fof(f58,plain,(
% 0.16/0.32    (?[B,C]: (disjoint(B,C)<~>intersection(B,C)=empty_set))),
% 0.16/0.32    inference(pre_NNF_transformation,[status(esa)],[f13])).
% 0.16/0.32  fof(f59,plain,(
% 0.16/0.32    ?[B,C]: ((disjoint(B,C)|intersection(B,C)=empty_set)&(~disjoint(B,C)|~intersection(B,C)=empty_set))),
% 0.16/0.32    inference(NNF_transformation,[status(esa)],[f58])).
% 0.16/0.32  fof(f60,plain,(
% 0.16/0.32    ((disjoint(sk0_4,sk0_5)|intersection(sk0_4,sk0_5)=empty_set)&(~disjoint(sk0_4,sk0_5)|~intersection(sk0_4,sk0_5)=empty_set))),
% 0.16/0.32    inference(skolemization,[status(esa)],[f59])).
% 0.16/0.32  fof(f61,plain,(
% 0.16/0.32    disjoint(sk0_4,sk0_5)|intersection(sk0_4,sk0_5)=empty_set),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f60])).
% 0.16/0.32  fof(f62,plain,(
% 0.16/0.32    ~disjoint(sk0_4,sk0_5)|~intersection(sk0_4,sk0_5)=empty_set),
% 0.16/0.32    inference(cnf_transformation,[status(esa)],[f60])).
% 0.16/0.32  fof(f63,plain,(
% 0.16/0.32    spl0_0 <=> disjoint(sk0_4,sk0_5)),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f64,plain,(
% 0.16/0.32    disjoint(sk0_4,sk0_5)|~spl0_0),
% 0.16/0.32    inference(component_clause,[status(thm)],[f63])).
% 0.16/0.32  fof(f65,plain,(
% 0.16/0.32    ~disjoint(sk0_4,sk0_5)|spl0_0),
% 0.16/0.32    inference(component_clause,[status(thm)],[f63])).
% 0.16/0.32  fof(f66,plain,(
% 0.16/0.32    spl0_1 <=> intersection(sk0_4,sk0_5)=empty_set),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f67,plain,(
% 0.16/0.32    intersection(sk0_4,sk0_5)=empty_set|~spl0_1),
% 0.16/0.32    inference(component_clause,[status(thm)],[f66])).
% 0.16/0.32  fof(f69,plain,(
% 0.16/0.32    spl0_0|spl0_1),
% 0.16/0.32    inference(split_clause,[status(thm)],[f61,f63,f66])).
% 0.16/0.32  fof(f70,plain,(
% 0.16/0.32    ~spl0_0|~spl0_1),
% 0.16/0.32    inference(split_clause,[status(thm)],[f62,f63,f66])).
% 0.16/0.32  fof(f77,plain,(
% 0.16/0.32    ![X0,X1]: (empty(intersection(X0,X1))|member(sk0_2(intersection(X0,X1)),X1))),
% 0.16/0.32    inference(resolution,[status(thm)],[f50,f17])).
% 0.16/0.32  fof(f78,plain,(
% 0.16/0.32    ![X0,X1]: (empty(intersection(X0,X1))|member(sk0_2(intersection(X0,X1)),X0))),
% 0.16/0.32    inference(resolution,[status(thm)],[f50,f16])).
% 0.16/0.32  fof(f84,plain,(
% 0.16/0.32    ![X0]: (empty(intersection(X0,empty_set)))),
% 0.16/0.32    inference(resolution,[status(thm)],[f77,f25])).
% 0.16/0.32  fof(f90,plain,(
% 0.16/0.32    ![X0]: (empty(intersection(empty_set,X0)))),
% 0.16/0.32    inference(resolution,[status(thm)],[f78,f25])).
% 0.16/0.32  fof(f94,plain,(
% 0.16/0.32    ![X0,X1]: (~member(X0,intersection(X1,empty_set)))),
% 0.16/0.32    inference(resolution,[status(thm)],[f84,f49])).
% 0.16/0.32  fof(f97,plain,(
% 0.16/0.32    ![X0,X1]: (~member(X0,intersection(empty_set,X1)))),
% 0.16/0.32    inference(resolution,[status(thm)],[f90,f49])).
% 0.16/0.32  fof(f134,plain,(
% 0.16/0.32    intersect(sk0_4,sk0_5)|spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f65,f29])).
% 0.16/0.32  fof(f135,plain,(
% 0.16/0.32    member(sk0_0(sk0_5,sk0_4),sk0_5)|spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f134,f23])).
% 0.16/0.32  fof(f136,plain,(
% 0.16/0.32    member(sk0_0(sk0_5,sk0_4),sk0_4)|spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f134,f22])).
% 0.16/0.32  fof(f153,plain,(
% 0.16/0.32    ![X0]: (member(sk0_0(sk0_5,sk0_4),intersection(X0,sk0_5))|~member(sk0_0(sk0_5,sk0_4),X0)|spl0_0)),
% 0.16/0.32    inference(resolution,[status(thm)],[f135,f18])).
% 0.16/0.32  fof(f155,plain,(
% 0.16/0.32    member(sk0_0(sk0_5,sk0_4),intersection(sk0_4,sk0_5))|spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f153,f136])).
% 0.16/0.32  fof(f156,plain,(
% 0.16/0.32    member(sk0_0(sk0_5,sk0_4),empty_set)|~spl0_1|spl0_0),
% 0.16/0.32    inference(forward_demodulation,[status(thm)],[f67,f155])).
% 0.16/0.32  fof(f157,plain,(
% 0.16/0.32    $false|~spl0_1|spl0_0),
% 0.16/0.32    inference(forward_subsumption_resolution,[status(thm)],[f156,f25])).
% 0.16/0.32  fof(f158,plain,(
% 0.16/0.32    ~spl0_1|spl0_0),
% 0.16/0.32    inference(contradiction_clause,[status(thm)],[f157])).
% 0.16/0.32  fof(f159,plain,(
% 0.16/0.32    ~intersect(sk0_4,sk0_5)|~spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f64,f28])).
% 0.16/0.32  fof(f160,plain,(
% 0.16/0.32    ![X0]: (~member(X0,sk0_4)|~member(X0,sk0_5)|~spl0_0)),
% 0.16/0.32    inference(resolution,[status(thm)],[f159,f24])).
% 0.16/0.32  fof(f164,plain,(
% 0.16/0.32    ![X0]: (~member(sk0_2(intersection(sk0_5,X0)),sk0_4)|empty(intersection(sk0_5,X0))|~spl0_0)),
% 0.16/0.32    inference(resolution,[status(thm)],[f160,f78])).
% 0.16/0.32  fof(f174,plain,(
% 0.16/0.32    spl0_7 <=> empty(intersection(sk0_5,sk0_4))),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f175,plain,(
% 0.16/0.32    empty(intersection(sk0_5,sk0_4))|~spl0_7),
% 0.16/0.32    inference(component_clause,[status(thm)],[f174])).
% 0.16/0.32  fof(f177,plain,(
% 0.16/0.32    empty(intersection(sk0_5,sk0_4))|empty(intersection(sk0_5,sk0_4))|~spl0_0),
% 0.16/0.32    inference(resolution,[status(thm)],[f164,f77])).
% 0.16/0.32  fof(f178,plain,(
% 0.16/0.32    spl0_7|~spl0_0),
% 0.16/0.32    inference(split_clause,[status(thm)],[f177,f174,f63])).
% 0.16/0.32  fof(f181,plain,(
% 0.16/0.32    empty(intersection(sk0_4,sk0_5))|~spl0_7),
% 0.16/0.32    inference(forward_demodulation,[status(thm)],[f35,f175])).
% 0.16/0.32  fof(f182,plain,(
% 0.16/0.32    ![X0]: (~member(X0,intersection(sk0_4,sk0_5))|~spl0_7)),
% 0.16/0.32    inference(resolution,[status(thm)],[f181,f49])).
% 0.16/0.32  fof(f322,plain,(
% 0.16/0.32    ![X0]: (subset(intersection(sk0_4,sk0_5),X0)|~spl0_7)),
% 0.16/0.32    inference(resolution,[status(thm)],[f43,f182])).
% 0.16/0.32  fof(f323,plain,(
% 0.16/0.32    ![X0,X1]: (subset(intersection(empty_set,X0),X1))),
% 0.16/0.32    inference(resolution,[status(thm)],[f43,f97])).
% 0.16/0.32  fof(f327,plain,(
% 0.16/0.32    ![X0,X1]: (subset(intersection(X0,empty_set),X1))),
% 0.16/0.32    inference(resolution,[status(thm)],[f43,f94])).
% 0.16/0.32  fof(f330,plain,(
% 0.16/0.32    ![X0]: (subset(empty_set,X0))),
% 0.16/0.32    inference(resolution,[status(thm)],[f43,f25])).
% 0.16/0.32  fof(f332,plain,(
% 0.16/0.32    ![X0]: (X0=empty_set|~subset(X0,empty_set))),
% 0.16/0.32    inference(resolution,[status(thm)],[f330,f34])).
% 0.16/0.32  fof(f339,plain,(
% 0.16/0.32    ![X0]: (intersection(empty_set,X0)=empty_set)),
% 0.16/0.32    inference(resolution,[status(thm)],[f332,f323])).
% 0.16/0.32  fof(f340,plain,(
% 0.16/0.32    ![X0]: (intersection(X0,empty_set)=empty_set)),
% 0.16/0.32    inference(resolution,[status(thm)],[f332,f327])).
% 0.16/0.32  fof(f388,plain,(
% 0.16/0.32    spl0_10 <=> empty(intersection(empty_set,X0))),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f391,plain,(
% 0.16/0.32    spl0_11 <=> member(sk0_2(empty_set),empty_set)),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f392,plain,(
% 0.16/0.32    member(sk0_2(empty_set),empty_set)|~spl0_11),
% 0.16/0.32    inference(component_clause,[status(thm)],[f391])).
% 0.16/0.32  fof(f394,plain,(
% 0.16/0.32    ![X0]: (empty(intersection(empty_set,X0))|member(sk0_2(empty_set),empty_set))),
% 0.16/0.32    inference(paramodulation,[status(thm)],[f339,f78])).
% 0.16/0.32  fof(f395,plain,(
% 0.16/0.32    spl0_10|spl0_11),
% 0.16/0.32    inference(split_clause,[status(thm)],[f394,f388,f391])).
% 0.16/0.32  fof(f437,plain,(
% 0.16/0.32    spl0_12 <=> empty(intersection(X0,empty_set))),
% 0.16/0.32    introduced(split_symbol_definition)).
% 0.16/0.32  fof(f440,plain,(
% 0.16/0.32    ![X0]: (empty(intersection(X0,empty_set))|member(sk0_2(empty_set),empty_set))),
% 0.16/0.32    inference(paramodulation,[status(thm)],[f340,f77])).
% 0.16/0.32  fof(f441,plain,(
% 0.16/0.32    spl0_12|spl0_11),
% 0.16/0.32    inference(split_clause,[status(thm)],[f440,f437,f391])).
% 0.16/0.32  fof(f445,plain,(
% 0.16/0.32    $false|~spl0_11),
% 0.16/0.32    inference(forward_subsumption_resolution,[status(thm)],[f392,f25])).
% 0.16/0.32  fof(f446,plain,(
% 0.16/0.32    ~spl0_11),
% 0.16/0.32    inference(contradiction_clause,[status(thm)],[f445])).
% 0.16/0.33  fof(f479,plain,(
% 0.16/0.33    intersection(sk0_4,sk0_5)=empty_set|~spl0_7),
% 0.16/0.33    inference(resolution,[status(thm)],[f322,f332])).
% 0.16/0.33  fof(f480,plain,(
% 0.16/0.33    spl0_1|~spl0_7),
% 0.16/0.33    inference(split_clause,[status(thm)],[f479,f66,f174])).
% 0.16/0.33  fof(f483,plain,(
% 0.16/0.33    $false),
% 0.16/0.33    inference(sat_refutation,[status(thm)],[f69,f70,f158,f178,f395,f441,f446,f480])).
% 0.16/0.33  % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.33  % Elapsed time: 0.021433 seconds
% 0.16/0.33  % CPU time: 0.065028 seconds
% 0.16/0.33  % Total memory used: 15.635 MB
% 0.16/0.33  % Net memory used: 15.541 MB
%------------------------------------------------------------------------------