TSTP Solution File: SET656+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET656+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 : art09.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:22:31 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP31164/SET656+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31164/SET656+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31164/SET656+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 31260
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p30)).
% fof(7, 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', p6)).
% fof(8, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(subset(X1,X2)=>intersection(X1,X2)=X1))),file('/tmp/SRASS.s.p', p1)).
% fof(22, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>(subset(X1,X2)<=>![X3]:(ilf_type(X3,set_type)=>(member(X3,X1)=>member(X3,X2)))))),file('/tmp/SRASS.s.p', p17)).
% fof(23, 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', p19)).
% fof(26, 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', p21)).
% fof(28, 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', p13)).
% fof(29, axiom,![X1]:(ilf_type(X1,set_type)=>(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),file('/tmp/SRASS.s.p', p20)).
% fof(31, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,relation_type(X1,X2))=>intersection(X3,cross_product(X1,X2))=X3))),file('/tmp/SRASS.s.p', prove_relset_1_18)).
% fof(32, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,relation_type(X1,X2))=>intersection(X3,cross_product(X1,X2))=X3)))),inference(assume_negation,[status(cth)],[31])).
% fof(34, 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)],[26,theory(equality)])).
% fof(35, plain,![X1]:(ilf_type(X1,set_type)=>(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(54, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[5])).
% cnf(55,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[54])).
% fof(60, 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)],[7])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% fof(63, 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)],[62])).
% cnf(65,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)],[63])).
% fof(66, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|(~(subset(X1,X2))|intersection(X1,X2)=X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(67, plain,![X3]:(~(ilf_type(X3,set_type))|![X4]:(~(ilf_type(X4,set_type))|(~(subset(X3,X4))|intersection(X3,X4)=X3))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X3]:![X4]:((~(ilf_type(X4,set_type))|(~(subset(X3,X4))|intersection(X3,X4)=X3))|~(ilf_type(X3,set_type))),inference(shift_quantors,[status(thm)],[67])).
% cnf(69,plain,(intersection(X1,X2)=X1|~ilf_type(X1,set_type)|~subset(X1,X2)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[68])).
% fof(149, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|((~(subset(X1,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))))|subset(X1,X2))))),inference(fof_nnf,[status(thm)],[22])).
% fof(150, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|((~(subset(X4,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))))|subset(X4,X5))))),inference(variable_rename,[status(thm)],[149])).
% fof(151, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|((~(subset(X4,X5))|![X6]:(~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5))))&((ilf_type(esk12_2(X4,X5),set_type)&(member(esk12_2(X4,X5),X4)&~(member(esk12_2(X4,X5),X5))))|subset(X4,X5))))),inference(skolemize,[status(esa)],[150])).
% fof(152, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(subset(X4,X5)))&((ilf_type(esk12_2(X4,X5),set_type)&(member(esk12_2(X4,X5),X4)&~(member(esk12_2(X4,X5),X5))))|subset(X4,X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[151])).
% fof(153, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(subset(X4,X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((ilf_type(esk12_2(X4,X5),set_type)|subset(X4,X5))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((member(esk12_2(X4,X5),X4)|subset(X4,X5))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((~(member(esk12_2(X4,X5),X5))|subset(X4,X5))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))))),inference(distribute,[status(thm)],[152])).
% cnf(154,plain,(subset(X1,X2)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~member(esk12_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[153])).
% cnf(155,plain,(subset(X1,X2)|member(esk12_2(X1,X2),X1)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[153])).
% fof(158, 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)],[23])).
% fof(159, 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)],[158])).
% fof(160, 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(esk13_2(X4,X5),set_type)&(member(esk13_2(X4,X5),X4)&~(member(esk13_2(X4,X5),X5))))|member(X4,power_set(X5)))))),inference(skolemize,[status(esa)],[159])).
% fof(161, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(member(X4,power_set(X5))))&((ilf_type(esk13_2(X4,X5),set_type)&(member(esk13_2(X4,X5),X4)&~(member(esk13_2(X4,X5),X5))))|member(X4,power_set(X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[160])).
% fof(162, 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(esk13_2(X4,X5),set_type)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((member(esk13_2(X4,X5),X4)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((~(member(esk13_2(X4,X5),X5))|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))))),inference(distribute,[status(thm)],[161])).
% cnf(166,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)],[162])).
% fof(181, 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)],[34])).
% fof(182, 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)],[181])).
% fof(183, 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)],[182])).
% fof(184, 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)],[183])).
% cnf(186,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)],[184])).
% fof(190, 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)],[28])).
% fof(191, 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)],[190])).
% fof(192, 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)],[191])).
% fof(193, 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)],[192])).
% cnf(195,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)],[193])).
% fof(196, plain,![X1]:(~(ilf_type(X1,set_type))|(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),inference(fof_nnf,[status(thm)],[35])).
% fof(197, plain,![X2]:(~(ilf_type(X2,set_type))|(~(empty(power_set(X2)))&ilf_type(power_set(X2),set_type))),inference(variable_rename,[status(thm)],[196])).
% fof(198, 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)],[197])).
% cnf(200,plain,(~ilf_type(X1,set_type)|~empty(power_set(X1))),inference(split_conjunct,[status(thm)],[198])).
% fof(205, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&?[X3]:(ilf_type(X3,relation_type(X1,X2))&~(intersection(X3,cross_product(X1,X2))=X3)))),inference(fof_nnf,[status(thm)],[32])).
% fof(206, negated_conjecture,?[X4]:(ilf_type(X4,set_type)&?[X5]:(ilf_type(X5,set_type)&?[X6]:(ilf_type(X6,relation_type(X4,X5))&~(intersection(X6,cross_product(X4,X5))=X6)))),inference(variable_rename,[status(thm)],[205])).
% fof(207, negated_conjecture,(ilf_type(esk16_0,set_type)&(ilf_type(esk17_0,set_type)&(ilf_type(esk18_0,relation_type(esk16_0,esk17_0))&~(intersection(esk18_0,cross_product(esk16_0,esk17_0))=esk18_0)))),inference(skolemize,[status(esa)],[206])).
% cnf(208,negated_conjecture,(intersection(esk18_0,cross_product(esk16_0,esk17_0))!=esk18_0),inference(split_conjunct,[status(thm)],[207])).
% cnf(209,negated_conjecture,(ilf_type(esk18_0,relation_type(esk16_0,esk17_0))),inference(split_conjunct,[status(thm)],[207])).
% cnf(219,plain,(~empty(power_set(X1))|$false),inference(rw,[status(thm)],[200,55,theory(equality)])).
% cnf(220,plain,(~empty(power_set(X1))),inference(cn,[status(thm)],[219,theory(equality)])).
% cnf(263,plain,(intersection(X1,X2)=X1|~subset(X1,X2)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[69,55,theory(equality)])).
% cnf(264,plain,(intersection(X1,X2)=X1|~subset(X1,X2)|$false|$false),inference(rw,[status(thm)],[263,55,theory(equality)])).
% cnf(265,plain,(intersection(X1,X2)=X1|~subset(X1,X2)),inference(cn,[status(thm)],[264,theory(equality)])).
% cnf(278,plain,(subset(X1,X2)|member(esk12_2(X1,X2),X1)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[155,55,theory(equality)])).
% cnf(279,plain,(subset(X1,X2)|member(esk12_2(X1,X2),X1)|$false|$false),inference(rw,[status(thm)],[278,55,theory(equality)])).
% cnf(280,plain,(subset(X1,X2)|member(esk12_2(X1,X2),X1)),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(281,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)],[65,55,theory(equality)])).
% cnf(282,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|$false|$false|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[281,55,theory(equality)])).
% cnf(283,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|~ilf_type(X3,relation_type(X1,X2))),inference(cn,[status(thm)],[282,theory(equality)])).
% cnf(287,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)],[195,55,theory(equality)])).
% cnf(288,plain,(ilf_type(X2,member_type(power_set(X1)))|$false|$false|~ilf_type(X2,subset_type(X1))),inference(rw,[status(thm)],[287,55,theory(equality)])).
% cnf(289,plain,(ilf_type(X2,member_type(power_set(X1)))|~ilf_type(X2,subset_type(X1))),inference(cn,[status(thm)],[288,theory(equality)])).
% cnf(290,plain,(subset(X1,X2)|$false|~ilf_type(X1,set_type)|~member(esk12_2(X1,X2),X2)),inference(rw,[status(thm)],[154,55,theory(equality)])).
% cnf(291,plain,(subset(X1,X2)|$false|$false|~member(esk12_2(X1,X2),X2)),inference(rw,[status(thm)],[290,55,theory(equality)])).
% cnf(292,plain,(subset(X1,X2)|~member(esk12_2(X1,X2),X2)),inference(cn,[status(thm)],[291,theory(equality)])).
% cnf(304,plain,(empty(X2)|member(X1,X2)|$false|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(X2))),inference(rw,[status(thm)],[186,55,theory(equality)])).
% cnf(305,plain,(empty(X2)|member(X1,X2)|$false|$false|~ilf_type(X1,member_type(X2))),inference(rw,[status(thm)],[304,55,theory(equality)])).
% cnf(306,plain,(empty(X2)|member(X1,X2)|~ilf_type(X1,member_type(X2))),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(362,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)],[166,55,theory(equality)])).
% cnf(363,plain,(member(X3,X2)|~member(X3,X1)|$false|$false|~ilf_type(X1,set_type)|~member(X1,power_set(X2))),inference(rw,[status(thm)],[362,55,theory(equality)])).
% cnf(364,plain,(member(X3,X2)|~member(X3,X1)|$false|$false|$false|~member(X1,power_set(X2))),inference(rw,[status(thm)],[363,55,theory(equality)])).
% cnf(365,plain,(member(X3,X2)|~member(X3,X1)|~member(X1,power_set(X2))),inference(cn,[status(thm)],[364,theory(equality)])).
% cnf(392,negated_conjecture,(~subset(esk18_0,cross_product(esk16_0,esk17_0))),inference(spm,[status(thm)],[208,265,theory(equality)])).
% cnf(417,plain,(empty(power_set(X1))|member(X2,power_set(X1))|~ilf_type(X2,subset_type(X1))),inference(spm,[status(thm)],[306,289,theory(equality)])).
% cnf(419,plain,(member(X2,power_set(X1))|~ilf_type(X2,subset_type(X1))),inference(sr,[status(thm)],[417,220,theory(equality)])).
% cnf(506,plain,(member(X1,power_set(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3))),inference(spm,[status(thm)],[419,283,theory(equality)])).
% cnf(607,negated_conjecture,(member(esk18_0,power_set(cross_product(esk16_0,esk17_0)))),inference(spm,[status(thm)],[506,209,theory(equality)])).
% cnf(615,negated_conjecture,(member(X1,cross_product(esk16_0,esk17_0))|~member(X1,esk18_0)),inference(spm,[status(thm)],[365,607,theory(equality)])).
% cnf(623,negated_conjecture,(subset(X1,cross_product(esk16_0,esk17_0))|~member(esk12_2(X1,cross_product(esk16_0,esk17_0)),esk18_0)),inference(spm,[status(thm)],[292,615,theory(equality)])).
% cnf(9311,negated_conjecture,(subset(esk18_0,cross_product(esk16_0,esk17_0))),inference(spm,[status(thm)],[623,280,theory(equality)])).
% cnf(9312,negated_conjecture,($false),inference(sr,[status(thm)],[9311,392,theory(equality)])).
% cnf(9313,negated_conjecture,($false),9312,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1044
% # ...of these trivial : 24
% # ...subsumed : 608
% # ...remaining for further processing: 412
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 8343
% # ...of the previous two non-trivial : 7830
% # Contextual simplify-reflections : 129
% # Paramodulations : 8327
% # Factorizations : 14
% # Equation resolutions : 2
% # Current number of processed clauses: 361
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 306
% # Current number of unprocessed clauses: 6833
% # ...number of literals in the above : 24055
% # Clause-clause subsumption calls (NU) : 11256
% # Rec. Clause-clause subsumption calls : 9893
% # Unit Clause-clause subsumption calls : 105
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 38
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 286 leaves, 1.59+/-1.573 terms/leaf
% # Paramod-from index: 119 leaves, 1.59+/-1.362 terms/leaf
% # Paramod-into index: 250 leaves, 1.51+/-1.327 terms/leaf
% # -------------------------------------------------
% # User time : 0.259 s
% # System time : 0.014 s
% # Total time : 0.273 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.46 CPU 0.56 WC
% FINAL PrfWatch: 0.46 CPU 0.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP31164/SET656+3.tptp
%
%------------------------------------------------------------------------------