TSTP Solution File: SET645+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET645+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 23:21:09 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP361/SET645+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP361/SET645+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP361/SET645+3.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 467
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,set_type)=>(member(ordered_pair(X1,X2),cross_product(X3,X4))<=>(member(X1,X3)&member(X2,X4))))))),file('/tmp/SRASS.s.p', p1)).
% fof(9, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(member(X1,power_set(X2))<=>![X3]:(ilf_type(X3,set_type)=>(member(X3,X1)=>member(X3,X2)))))),file('/tmp/SRASS.s.p', p13)).
% fof(10, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(![X3]:(ilf_type(X3,subset_type(cross_product(X1,X2)))=>ilf_type(X3,relation_type(X1,X2)))&![X4]:(ilf_type(X4,relation_type(X1,X2))=>ilf_type(X4,subset_type(cross_product(X1,X2))))))),file('/tmp/SRASS.s.p', p4)).
% fof(14, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:((~(empty(X2))&ilf_type(X2,set_type))=>(ilf_type(X1,member_type(X2))<=>member(X1,X2)))),file('/tmp/SRASS.s.p', p15)).
% fof(18, axiom,![X1]:(ilf_type(X1,set_type)=>(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),file('/tmp/SRASS.s.p', p14)).
% fof(20, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(ilf_type(X2,subset_type(X1))<=>ilf_type(X2,member_type(power_set(X1)))))),file('/tmp/SRASS.s.p', p10)).
% fof(21, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p21)).
% fof(22, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,set_type)=>![X5]:(ilf_type(X5,relation_type(X1,X2))=>(member(ordered_pair(X3,X4),X5)=>(member(X3,X1)&member(X4,X2)))))))),file('/tmp/SRASS.s.p', prove_relset_1_7)).
% fof(23, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,set_type)=>![X5]:(ilf_type(X5,relation_type(X1,X2))=>(member(ordered_pair(X3,X4),X5)=>(member(X3,X1)&member(X4,X2))))))))),inference(assume_negation,[status(cth)],[22])).
% fof(25, plain,![X1]:(ilf_type(X1,set_type)=>![X2]:((~(empty(X2))&ilf_type(X2,set_type))=>(ilf_type(X1,member_type(X2))<=>member(X1,X2)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(26, plain,![X1]:(ilf_type(X1,set_type)=>(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(37, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|((~(member(ordered_pair(X1,X2),cross_product(X3,X4)))|(member(X1,X3)&member(X2,X4)))&((~(member(X1,X3))|~(member(X2,X4)))|member(ordered_pair(X1,X2),cross_product(X3,X4)))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(38, plain,![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|![X7]:(~(ilf_type(X7,set_type))|![X8]:(~(ilf_type(X8,set_type))|((~(member(ordered_pair(X5,X6),cross_product(X7,X8)))|(member(X5,X7)&member(X6,X8)))&((~(member(X5,X7))|~(member(X6,X8)))|member(ordered_pair(X5,X6),cross_product(X7,X8)))))))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,set_type))|((~(member(ordered_pair(X5,X6),cross_product(X7,X8)))|(member(X5,X7)&member(X6,X8)))&((~(member(X5,X7))|~(member(X6,X8)))|member(ordered_pair(X5,X6),cross_product(X7,X8)))))|~(ilf_type(X7,set_type)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X7]:![X8]:(((((((member(X5,X7)|~(member(ordered_pair(X5,X6),cross_product(X7,X8))))|~(ilf_type(X8,set_type)))|~(ilf_type(X7,set_type)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type)))&(((((member(X6,X8)|~(member(ordered_pair(X5,X6),cross_product(X7,X8))))|~(ilf_type(X8,set_type)))|~(ilf_type(X7,set_type)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type))))&((((((~(member(X5,X7))|~(member(X6,X8)))|member(ordered_pair(X5,X6),cross_product(X7,X8)))|~(ilf_type(X8,set_type)))|~(ilf_type(X7,set_type)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type)))),inference(distribute,[status(thm)],[39])).
% cnf(42,plain,(member(X2,X4)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,set_type)|~ilf_type(X4,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,plain,(member(X1,X3)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,set_type)|~ilf_type(X4,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(split_conjunct,[status(thm)],[40])).
% fof(81, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(member(X1,power_set(X2)))|![X3]:(~(ilf_type(X3,set_type))|(~(member(X3,X1))|member(X3,X2))))&(?[X3]:(ilf_type(X3,set_type)&(member(X3,X1)&~(member(X3,X2))))|member(X1,power_set(X2)))))),inference(fof_nnf,[status(thm)],[9])).
% fof(82, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|((~(member(X4,power_set(X5)))|![X6]:(~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5))))&(?[X7]:(ilf_type(X7,set_type)&(member(X7,X4)&~(member(X7,X5))))|member(X4,power_set(X5)))))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|((~(member(X4,power_set(X5)))|![X6]:(~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5))))&((ilf_type(esk8_2(X4,X5),set_type)&(member(esk8_2(X4,X5),X4)&~(member(esk8_2(X4,X5),X5))))|member(X4,power_set(X5)))))),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(member(X4,power_set(X5))))&((ilf_type(esk8_2(X4,X5),set_type)&(member(esk8_2(X4,X5),X4)&~(member(esk8_2(X4,X5),X5))))|member(X4,power_set(X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[83])).
% fof(85, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(member(X4,power_set(X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((ilf_type(esk8_2(X4,X5),set_type)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((member(esk8_2(X4,X5),X4)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((~(member(esk8_2(X4,X5),X5))|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))))),inference(distribute,[status(thm)],[84])).
% cnf(89,plain,(member(X3,X2)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~member(X1,power_set(X2))|~member(X3,X1)|~ilf_type(X3,set_type)),inference(split_conjunct,[status(thm)],[85])).
% fof(90, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|(![X3]:(~(ilf_type(X3,subset_type(cross_product(X1,X2))))|ilf_type(X3,relation_type(X1,X2)))&![X4]:(~(ilf_type(X4,relation_type(X1,X2)))|ilf_type(X4,subset_type(cross_product(X1,X2))))))),inference(fof_nnf,[status(thm)],[10])).
% fof(91, plain,![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|(![X7]:(~(ilf_type(X7,subset_type(cross_product(X5,X6))))|ilf_type(X7,relation_type(X5,X6)))&![X8]:(~(ilf_type(X8,relation_type(X5,X6)))|ilf_type(X8,subset_type(cross_product(X5,X6))))))),inference(variable_rename,[status(thm)],[90])).
% fof(92, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,relation_type(X5,X6)))|ilf_type(X8,subset_type(cross_product(X5,X6))))&(~(ilf_type(X7,subset_type(cross_product(X5,X6))))|ilf_type(X7,relation_type(X5,X6))))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type))),inference(shift_quantors,[status(thm)],[91])).
% fof(93, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,relation_type(X5,X6)))|ilf_type(X8,subset_type(cross_product(X5,X6))))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type)))&(((~(ilf_type(X7,subset_type(cross_product(X5,X6))))|ilf_type(X7,relation_type(X5,X6)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type)))),inference(distribute,[status(thm)],[92])).
% cnf(95,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(split_conjunct,[status(thm)],[93])).
% fof(107, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:((empty(X2)|~(ilf_type(X2,set_type)))|((~(ilf_type(X1,member_type(X2)))|member(X1,X2))&(~(member(X1,X2))|ilf_type(X1,member_type(X2)))))),inference(fof_nnf,[status(thm)],[25])).
% fof(108, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:((empty(X4)|~(ilf_type(X4,set_type)))|((~(ilf_type(X3,member_type(X4)))|member(X3,X4))&(~(member(X3,X4))|ilf_type(X3,member_type(X4)))))),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X3]:![X4]:(((empty(X4)|~(ilf_type(X4,set_type)))|((~(ilf_type(X3,member_type(X4)))|member(X3,X4))&(~(member(X3,X4))|ilf_type(X3,member_type(X4)))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[108])).
% fof(110, plain,![X3]:![X4]:((((~(ilf_type(X3,member_type(X4)))|member(X3,X4))|(empty(X4)|~(ilf_type(X4,set_type))))|~(ilf_type(X3,set_type)))&(((~(member(X3,X4))|ilf_type(X3,member_type(X4)))|(empty(X4)|~(ilf_type(X4,set_type))))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[109])).
% cnf(112,plain,(empty(X2)|member(X1,X2)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,member_type(X2))),inference(split_conjunct,[status(thm)],[110])).
% fof(126, plain,![X1]:(~(ilf_type(X1,set_type))|(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),inference(fof_nnf,[status(thm)],[26])).
% fof(127, plain,![X2]:(~(ilf_type(X2,set_type))|(~(empty(power_set(X2)))&ilf_type(power_set(X2),set_type))),inference(variable_rename,[status(thm)],[126])).
% fof(128, plain,![X2]:((~(empty(power_set(X2)))|~(ilf_type(X2,set_type)))&(ilf_type(power_set(X2),set_type)|~(ilf_type(X2,set_type)))),inference(distribute,[status(thm)],[127])).
% cnf(130,plain,(~ilf_type(X1,set_type)|~empty(power_set(X1))),inference(split_conjunct,[status(thm)],[128])).
% fof(135, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(ilf_type(X2,subset_type(X1)))|ilf_type(X2,member_type(power_set(X1))))&(~(ilf_type(X2,member_type(power_set(X1))))|ilf_type(X2,subset_type(X1)))))),inference(fof_nnf,[status(thm)],[20])).
% fof(136, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|((~(ilf_type(X4,subset_type(X3)))|ilf_type(X4,member_type(power_set(X3))))&(~(ilf_type(X4,member_type(power_set(X3))))|ilf_type(X4,subset_type(X3)))))),inference(variable_rename,[status(thm)],[135])).
% fof(137, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|((~(ilf_type(X4,subset_type(X3)))|ilf_type(X4,member_type(power_set(X3))))&(~(ilf_type(X4,member_type(power_set(X3))))|ilf_type(X4,subset_type(X3)))))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[136])).
% fof(138, plain,![X3]:![X4]:((((~(ilf_type(X4,subset_type(X3)))|ilf_type(X4,member_type(power_set(X3))))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))&(((~(ilf_type(X4,member_type(power_set(X3))))|ilf_type(X4,subset_type(X3)))|~(ilf_type(X4,set_type)))|~(ilf_type(X3,set_type)))),inference(distribute,[status(thm)],[137])).
% cnf(140,plain,(ilf_type(X2,member_type(power_set(X1)))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X2,subset_type(X1))),inference(split_conjunct,[status(thm)],[138])).
% fof(141, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[21])).
% cnf(142,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[141])).
% fof(143, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&?[X3]:(ilf_type(X3,set_type)&?[X4]:(ilf_type(X4,set_type)&?[X5]:(ilf_type(X5,relation_type(X1,X2))&(member(ordered_pair(X3,X4),X5)&(~(member(X3,X1))|~(member(X4,X2))))))))),inference(fof_nnf,[status(thm)],[23])).
% fof(144, negated_conjecture,?[X6]:(ilf_type(X6,set_type)&?[X7]:(ilf_type(X7,set_type)&?[X8]:(ilf_type(X8,set_type)&?[X9]:(ilf_type(X9,set_type)&?[X10]:(ilf_type(X10,relation_type(X6,X7))&(member(ordered_pair(X8,X9),X10)&(~(member(X8,X6))|~(member(X9,X7))))))))),inference(variable_rename,[status(thm)],[143])).
% fof(145, negated_conjecture,(ilf_type(esk10_0,set_type)&(ilf_type(esk11_0,set_type)&(ilf_type(esk12_0,set_type)&(ilf_type(esk13_0,set_type)&(ilf_type(esk14_0,relation_type(esk10_0,esk11_0))&(member(ordered_pair(esk12_0,esk13_0),esk14_0)&(~(member(esk12_0,esk10_0))|~(member(esk13_0,esk11_0))))))))),inference(skolemize,[status(esa)],[144])).
% cnf(146,negated_conjecture,(~member(esk13_0,esk11_0)|~member(esk12_0,esk10_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(147,negated_conjecture,(member(ordered_pair(esk12_0,esk13_0),esk14_0)),inference(split_conjunct,[status(thm)],[145])).
% cnf(148,negated_conjecture,(ilf_type(esk14_0,relation_type(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[145])).
% cnf(165,plain,(~empty(power_set(X1))|$false),inference(rw,[status(thm)],[130,142,theory(equality)])).
% cnf(166,plain,(~empty(power_set(X1))),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(223,plain,(empty(X2)|member(X1,X2)|$false|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(X2))),inference(rw,[status(thm)],[112,142,theory(equality)])).
% cnf(224,plain,(empty(X2)|member(X1,X2)|$false|$false|~ilf_type(X1,member_type(X2))),inference(rw,[status(thm)],[223,142,theory(equality)])).
% cnf(225,plain,(empty(X2)|member(X1,X2)|~ilf_type(X1,member_type(X2))),inference(cn,[status(thm)],[224,theory(equality)])).
% cnf(234,plain,(member(X3,X2)|~member(X3,X1)|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(X1,power_set(X2))),inference(rw,[status(thm)],[89,142,theory(equality)])).
% cnf(235,plain,(member(X3,X2)|~member(X3,X1)|$false|$false|~ilf_type(X1,set_type)|~member(X1,power_set(X2))),inference(rw,[status(thm)],[234,142,theory(equality)])).
% cnf(236,plain,(member(X3,X2)|~member(X3,X1)|$false|$false|$false|~member(X1,power_set(X2))),inference(rw,[status(thm)],[235,142,theory(equality)])).
% cnf(237,plain,(member(X3,X2)|~member(X3,X1)|~member(X1,power_set(X2))),inference(cn,[status(thm)],[236,theory(equality)])).
% cnf(238,plain,(ilf_type(X2,member_type(power_set(X1)))|$false|~ilf_type(X1,set_type)|~ilf_type(X2,subset_type(X1))),inference(rw,[status(thm)],[140,142,theory(equality)])).
% cnf(239,plain,(ilf_type(X2,member_type(power_set(X1)))|$false|$false|~ilf_type(X2,subset_type(X1))),inference(rw,[status(thm)],[238,142,theory(equality)])).
% cnf(240,plain,(ilf_type(X2,member_type(power_set(X1)))|~ilf_type(X2,subset_type(X1))),inference(cn,[status(thm)],[239,theory(equality)])).
% cnf(248,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|$false|~ilf_type(X1,set_type)|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[95,142,theory(equality)])).
% cnf(249,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|$false|$false|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[248,142,theory(equality)])).
% cnf(250,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|~ilf_type(X3,relation_type(X1,X2))),inference(cn,[status(thm)],[249,theory(equality)])).
% cnf(257,plain,(member(X2,X4)|$false|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[42,142,theory(equality)])).
% cnf(258,plain,(member(X2,X4)|$false|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[257,142,theory(equality)])).
% cnf(259,plain,(member(X2,X4)|$false|$false|$false|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[258,142,theory(equality)])).
% cnf(260,plain,(member(X2,X4)|$false|$false|$false|$false|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[259,142,theory(equality)])).
% cnf(261,plain,(member(X2,X4)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(cn,[status(thm)],[260,theory(equality)])).
% cnf(262,plain,(member(X1,X3)|$false|~ilf_type(X3,set_type)|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[43,142,theory(equality)])).
% cnf(263,plain,(member(X1,X3)|$false|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[262,142,theory(equality)])).
% cnf(264,plain,(member(X1,X3)|$false|$false|$false|~ilf_type(X1,set_type)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[263,142,theory(equality)])).
% cnf(265,plain,(member(X1,X3)|$false|$false|$false|$false|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(rw,[status(thm)],[264,142,theory(equality)])).
% cnf(266,plain,(member(X1,X3)|~member(ordered_pair(X1,X2),cross_product(X3,X4))),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(308,negated_conjecture,(ilf_type(esk14_0,subset_type(cross_product(esk10_0,esk11_0)))),inference(spm,[status(thm)],[250,148,theory(equality)])).
% cnf(351,negated_conjecture,(ilf_type(esk14_0,member_type(power_set(cross_product(esk10_0,esk11_0))))),inference(spm,[status(thm)],[240,308,theory(equality)])).
% cnf(372,negated_conjecture,(empty(power_set(cross_product(esk10_0,esk11_0)))|member(esk14_0,power_set(cross_product(esk10_0,esk11_0)))),inference(spm,[status(thm)],[225,351,theory(equality)])).
% cnf(374,negated_conjecture,(member(esk14_0,power_set(cross_product(esk10_0,esk11_0)))),inference(sr,[status(thm)],[372,166,theory(equality)])).
% cnf(387,negated_conjecture,(member(X1,cross_product(esk10_0,esk11_0))|~member(X1,esk14_0)),inference(spm,[status(thm)],[237,374,theory(equality)])).
% cnf(398,negated_conjecture,(member(ordered_pair(esk12_0,esk13_0),cross_product(esk10_0,esk11_0))),inference(spm,[status(thm)],[387,147,theory(equality)])).
% cnf(406,negated_conjecture,(member(esk13_0,esk11_0)),inference(spm,[status(thm)],[261,398,theory(equality)])).
% cnf(407,negated_conjecture,(member(esk12_0,esk10_0)),inference(spm,[status(thm)],[266,398,theory(equality)])).
% cnf(414,negated_conjecture,(~member(esk12_0,esk10_0)|$false),inference(rw,[status(thm)],[146,406,theory(equality)])).
% cnf(415,negated_conjecture,(~member(esk12_0,esk10_0)),inference(cn,[status(thm)],[414,theory(equality)])).
% cnf(418,negated_conjecture,($false),inference(sr,[status(thm)],[407,415,theory(equality)])).
% cnf(419,negated_conjecture,($false),418,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 109
% # ...of these trivial : 11
% # ...subsumed : 4
% # ...remaining for further processing: 94
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 109
% # ...of the previous two non-trivial : 95
% # Contextual simplify-reflections : 1
% # Paramodulations : 105
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 65
% # ...number of literals in the above : 146
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 17
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 84 leaves, 1.31+/-0.756 terms/leaf
% # Paramod-from index: 33 leaves, 1.09+/-0.287 terms/leaf
% # Paramod-into index: 78 leaves, 1.27+/-0.654 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.003 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.20 WC
% FINAL PrfWatch: 0.10 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP361/SET645+3.tptp
%
%------------------------------------------------------------------------------