%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET640+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 : art04.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:20:34 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP30971/SET640+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30971/SET640+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30971/SET640+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 31067
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 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)=>![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(6, 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', p6)).
% fof(13, 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', p11)).
% 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', p13)).
% fof(16, 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', p8)).
% fof(17, axiom,![X1]:(ilf_type(X1,set_type)=>(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),file('/tmp/SRASS.s.p', p12)).
% fof(19, axiom,![X1]:ilf_type(X1,set_type),file('/tmp/SRASS.s.p', p19)).
% fof(20, conjecture,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,relation_type(X2,X3))=>(subset(X1,X4)=>subset(X1,cross_product(X2,X3))))))),file('/tmp/SRASS.s.p', prove_relset_1_2)).
% fof(21, negated_conjecture,~(![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>![X4]:(ilf_type(X4,relation_type(X2,X3))=>(subset(X1,X4)=>subset(X1,cross_product(X2,X3)))))))),inference(assume_negation,[status(cth)],[20])).
% fof(23, 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(24, plain,![X1]:(ilf_type(X1,set_type)=>(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(42, 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)],[5])).
% fof(43, 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)],[42])).
% fof(44, 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)],[43])).
% fof(45, 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)],[44])).
% cnf(47,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)],[45])).
% fof(48, 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)],[6])).
% fof(49, 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)],[48])).
% fof(50, 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(esk2_2(X4,X5),set_type)&(member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5))))|subset(X4,X5))))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(subset(X4,X5)))&((ilf_type(esk2_2(X4,X5),set_type)&(member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5))))|subset(X4,X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, 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(esk2_2(X4,X5),set_type)|subset(X4,X5))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((member(esk2_2(X4,X5),X4)|subset(X4,X5))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((~(member(esk2_2(X4,X5),X5))|subset(X4,X5))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(subset(X1,X2)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)),inference(split_conjunct,[status(thm)],[52])).
% cnf(56,plain,(member(X3,X2)|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~subset(X1,X2)|~member(X3,X1)|~ilf_type(X3,set_type)),inference(split_conjunct,[status(thm)],[52])).
% fof(99, 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)],[13])).
% fof(100, 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)],[99])).
% fof(101, 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(esk10_2(X4,X5),set_type)&(member(esk10_2(X4,X5),X4)&~(member(esk10_2(X4,X5),X5))))|member(X4,power_set(X5)))))),inference(skolemize,[status(esa)],[100])).
% fof(102, plain,![X4]:![X5]:![X6]:(((((~(ilf_type(X6,set_type))|(~(member(X6,X4))|member(X6,X5)))|~(member(X4,power_set(X5))))&((ilf_type(esk10_2(X4,X5),set_type)&(member(esk10_2(X4,X5),X4)&~(member(esk10_2(X4,X5),X5))))|member(X4,power_set(X5))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[101])).
% fof(103, 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(esk10_2(X4,X5),set_type)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&((((member(esk10_2(X4,X5),X4)|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))&(((~(member(esk10_2(X4,X5),X5))|member(X4,power_set(X5)))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type)))))),inference(distribute,[status(thm)],[102])).
% cnf(107,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)],[103])).
% fof(108, 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)],[23])).
% fof(109, 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)],[108])).
% fof(110, 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)],[109])).
% fof(111, 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)],[110])).
% cnf(113,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)],[111])).
% fof(117, 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)],[16])).
% fof(118, 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)],[117])).
% fof(119, 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)],[118])).
% fof(120, 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)],[119])).
% cnf(122,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)],[120])).
% fof(123, plain,![X1]:(~(ilf_type(X1,set_type))|(~(empty(power_set(X1)))&ilf_type(power_set(X1),set_type))),inference(fof_nnf,[status(thm)],[24])).
% fof(124, plain,![X2]:(~(ilf_type(X2,set_type))|(~(empty(power_set(X2)))&ilf_type(power_set(X2),set_type))),inference(variable_rename,[status(thm)],[123])).
% fof(125, 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)],[124])).
% cnf(127,plain,(~ilf_type(X1,set_type)|~empty(power_set(X1))),inference(split_conjunct,[status(thm)],[125])).
% fof(132, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[19])).
% cnf(133,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[132])).
% fof(134, negated_conjecture,?[X1]:(ilf_type(X1,set_type)&?[X2]:(ilf_type(X2,set_type)&?[X3]:(ilf_type(X3,set_type)&?[X4]:(ilf_type(X4,relation_type(X2,X3))&(subset(X1,X4)&~(subset(X1,cross_product(X2,X3)))))))),inference(fof_nnf,[status(thm)],[21])).
% fof(135, negated_conjecture,?[X5]:(ilf_type(X5,set_type)&?[X6]:(ilf_type(X6,set_type)&?[X7]:(ilf_type(X7,set_type)&?[X8]:(ilf_type(X8,relation_type(X6,X7))&(subset(X5,X8)&~(subset(X5,cross_product(X6,X7)))))))),inference(variable_rename,[status(thm)],[134])).
% fof(136, negated_conjecture,(ilf_type(esk12_0,set_type)&(ilf_type(esk13_0,set_type)&(ilf_type(esk14_0,set_type)&(ilf_type(esk15_0,relation_type(esk13_0,esk14_0))&(subset(esk12_0,esk15_0)&~(subset(esk12_0,cross_product(esk13_0,esk14_0)))))))),inference(skolemize,[status(esa)],[135])).
% cnf(137,negated_conjecture,(~subset(esk12_0,cross_product(esk13_0,esk14_0))),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,negated_conjecture,(subset(esk12_0,esk15_0)),inference(split_conjunct,[status(thm)],[136])).
% cnf(139,negated_conjecture,(ilf_type(esk15_0,relation_type(esk13_0,esk14_0))),inference(split_conjunct,[status(thm)],[136])).
% cnf(153,plain,(~empty(power_set(X1))|$false),inference(rw,[status(thm)],[127,133,theory(equality)])).
% cnf(154,plain,(~empty(power_set(X1))),inference(cn,[status(thm)],[153,theory(equality)])).
% cnf(194,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[54,133,theory(equality)])).
% cnf(195,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)|$false|$false),inference(rw,[status(thm)],[194,133,theory(equality)])).
% cnf(196,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(cn,[status(thm)],[195,theory(equality)])).
% cnf(197,plain,(subset(X1,X2)|$false|~ilf_type(X1,set_type)|~member(esk2_2(X1,X2),X2)),inference(rw,[status(thm)],[53,133,theory(equality)])).
% cnf(198,plain,(subset(X1,X2)|$false|$false|~member(esk2_2(X1,X2),X2)),inference(rw,[status(thm)],[197,133,theory(equality)])).
% cnf(199,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(cn,[status(thm)],[198,theory(equality)])).
% cnf(204,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)],[47,133,theory(equality)])).
% cnf(205,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|$false|$false|~ilf_type(X3,relation_type(X1,X2))),inference(rw,[status(thm)],[204,133,theory(equality)])).
% cnf(206,plain,(ilf_type(X3,subset_type(cross_product(X1,X2)))|~ilf_type(X3,relation_type(X1,X2))),inference(cn,[status(thm)],[205,theory(equality)])).
% cnf(214,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)],[122,133,theory(equality)])).
% cnf(215,plain,(ilf_type(X2,member_type(power_set(X1)))|$false|$false|~ilf_type(X2,subset_type(X1))),inference(rw,[status(thm)],[214,133,theory(equality)])).
% cnf(216,plain,(ilf_type(X2,member_type(power_set(X1)))|~ilf_type(X2,subset_type(X1))),inference(cn,[status(thm)],[215,theory(equality)])).
% cnf(220,plain,(empty(X2)|member(X1,X2)|$false|~ilf_type(X1,set_type)|~ilf_type(X1,member_type(X2))),inference(rw,[status(thm)],[113,133,theory(equality)])).
% cnf(221,plain,(empty(X2)|member(X1,X2)|$false|$false|~ilf_type(X1,member_type(X2))),inference(rw,[status(thm)],[220,133,theory(equality)])).
% cnf(222,plain,(empty(X2)|member(X1,X2)|~ilf_type(X1,member_type(X2))),inference(cn,[status(thm)],[221,theory(equality)])).
% cnf(241,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[56,133,theory(equality)])).
% cnf(242,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)|$false|$false|~ilf_type(X1,set_type)),inference(rw,[status(thm)],[241,133,theory(equality)])).
% cnf(243,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)|$false|$false|$false),inference(rw,[status(thm)],[242,133,theory(equality)])).
% cnf(244,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(cn,[status(thm)],[243,theory(equality)])).
% cnf(263,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)],[107,133,theory(equality)])).
% cnf(264,plain,(member(X3,X2)|~member(X3,X1)|$false|$false|~ilf_type(X1,set_type)|~member(X1,power_set(X2))),inference(rw,[status(thm)],[263,133,theory(equality)])).
% cnf(265,plain,(member(X3,X2)|~member(X3,X1)|$false|$false|$false|~member(X1,power_set(X2))),inference(rw,[status(thm)],[264,133,theory(equality)])).
% cnf(266,plain,(member(X3,X2)|~member(X3,X1)|~member(X1,power_set(X2))),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(290,plain,(empty(power_set(X1))|member(X2,power_set(X1))|~ilf_type(X2,subset_type(X1))),inference(spm,[status(thm)],[222,216,theory(equality)])).
% cnf(291,plain,(member(X2,power_set(X1))|~ilf_type(X2,subset_type(X1))),inference(sr,[status(thm)],[290,154,theory(equality)])).
% cnf(296,negated_conjecture,(member(esk2_2(esk12_0,cross_product(esk13_0,esk14_0)),esk12_0)),inference(spm,[status(thm)],[137,196,theory(equality)])).
% cnf(303,negated_conjecture,(member(X1,esk15_0)|~member(X1,esk12_0)),inference(spm,[status(thm)],[244,138,theory(equality)])).
% cnf(354,plain,(member(X1,power_set(cross_product(X2,X3)))|~ilf_type(X1,relation_type(X2,X3))),inference(spm,[status(thm)],[291,206,theory(equality)])).
% cnf(516,negated_conjecture,(member(esk15_0,power_set(cross_product(esk13_0,esk14_0)))),inference(spm,[status(thm)],[354,139,theory(equality)])).
% cnf(524,negated_conjecture,(member(X1,cross_product(esk13_0,esk14_0))|~member(X1,esk15_0)),inference(spm,[status(thm)],[266,516,theory(equality)])).
% cnf(551,negated_conjecture,(subset(X1,cross_product(esk13_0,esk14_0))|~member(esk2_2(X1,cross_product(esk13_0,esk14_0)),esk15_0)),inference(spm,[status(thm)],[199,524,theory(equality)])).
% cnf(576,negated_conjecture,(~member(esk2_2(esk12_0,cross_product(esk13_0,esk14_0)),esk15_0)),inference(spm,[status(thm)],[137,551,theory(equality)])).
% cnf(583,negated_conjecture,(~member(esk2_2(esk12_0,cross_product(esk13_0,esk14_0)),esk12_0)),inference(spm,[status(thm)],[576,303,theory(equality)])).
% cnf(584,negated_conjecture,($false),inference(rw,[status(thm)],[583,296,theory(equality)])).
% cnf(585,negated_conjecture,($false),inference(cn,[status(thm)],[584,theory(equality)])).
% cnf(586,negated_conjecture,($false),585,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 174
% # ...of these trivial : 11
% # ...subsumed : 35
% # ...remaining for further processing: 128
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 3
% # Generated clauses : 274
% # ...of the previous two non-trivial : 247
% # Contextual simplify-reflections : 11
% # Paramodulations : 272
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 91
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 151
% # ...number of literals in the above : 378
% # Clause-clause subsumption calls (NU) : 161
% # Rec. Clause-clause subsumption calls : 157
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 115 leaves, 1.39+/-0.993 terms/leaf
% # Paramod-from index: 48 leaves, 1.10+/-0.467 terms/leaf
% # Paramod-into index: 105 leaves, 1.25+/-0.673 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.004 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP30971/SET640+3.tptp
%
%------------------------------------------------------------------------------