%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET642+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:46 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP31230/SET642+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31230/SET642+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31230/SET642+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 31326
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 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,relation_type(X2,X3))=>(subset(X1,X4)=>subset(X1,cross_product(X2,X3))))))),file('/tmp/SRASS.s.p', p1)).
% fof(4, axiom,![X1]:(ilf_type(X1,set_type)=>![X2]:(ilf_type(X2,set_type)=>![X3]:(ilf_type(X3,set_type)=>(subset(X1,cross_product(X2,X3))=>ilf_type(X1,relation_type(X2,X3)))))),file('/tmp/SRASS.s.p', p2)).
% 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)=>ilf_type(X1,relation_type(X2,X3))))))),file('/tmp/SRASS.s.p', prove_relset_1_4)).
% 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)=>ilf_type(X1,relation_type(X2,X3)))))))),inference(assume_negation,[status(cth)],[20])).
% fof(34, plain,![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)],[3])).
% fof(35, plain,![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)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:((((~(ilf_type(X8,relation_type(X6,X7)))|(~(subset(X5,X8))|subset(X5,cross_product(X6,X7))))|~(ilf_type(X7,set_type)))|~(ilf_type(X6,set_type)))|~(ilf_type(X5,set_type))),inference(shift_quantors,[status(thm)],[35])).
% cnf(37,plain,(subset(X1,cross_product(X2,X3))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~ilf_type(X3,set_type)|~subset(X1,X4)|~ilf_type(X4,relation_type(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:(~(ilf_type(X1,set_type))|![X2]:(~(ilf_type(X2,set_type))|![X3]:(~(ilf_type(X3,set_type))|(~(subset(X1,cross_product(X2,X3)))|ilf_type(X1,relation_type(X2,X3)))))),inference(fof_nnf,[status(thm)],[4])).
% fof(39, plain,![X4]:(~(ilf_type(X4,set_type))|![X5]:(~(ilf_type(X5,set_type))|![X6]:(~(ilf_type(X6,set_type))|(~(subset(X4,cross_product(X5,X6)))|ilf_type(X4,relation_type(X5,X6)))))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:(((~(ilf_type(X6,set_type))|(~(subset(X4,cross_product(X5,X6)))|ilf_type(X4,relation_type(X5,X6))))|~(ilf_type(X5,set_type)))|~(ilf_type(X4,set_type))),inference(shift_quantors,[status(thm)],[39])).
% cnf(41,plain,(ilf_type(X1,relation_type(X2,X3))|~ilf_type(X1,set_type)|~ilf_type(X2,set_type)|~subset(X1,cross_product(X2,X3))|~ilf_type(X3,set_type)),inference(split_conjunct,[status(thm)],[40])).
% fof(125, plain,![X2]:ilf_type(X2,set_type),inference(variable_rename,[status(thm)],[19])).
% cnf(126,plain,(ilf_type(X1,set_type)),inference(split_conjunct,[status(thm)],[125])).
% fof(127, 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)&~(ilf_type(X1,relation_type(X2,X3)))))))),inference(fof_nnf,[status(thm)],[21])).
% fof(128, 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)&~(ilf_type(X5,relation_type(X6,X7)))))))),inference(variable_rename,[status(thm)],[127])).
% fof(129, negated_conjecture,(ilf_type(esk10_0,set_type)&(ilf_type(esk11_0,set_type)&(ilf_type(esk12_0,set_type)&(ilf_type(esk13_0,relation_type(esk11_0,esk12_0))&(subset(esk10_0,esk13_0)&~(ilf_type(esk10_0,relation_type(esk11_0,esk12_0)))))))),inference(skolemize,[status(esa)],[128])).
% cnf(130,negated_conjecture,(~ilf_type(esk10_0,relation_type(esk11_0,esk12_0))),inference(split_conjunct,[status(thm)],[129])).
% cnf(131,negated_conjecture,(subset(esk10_0,esk13_0)),inference(split_conjunct,[status(thm)],[129])).
% cnf(132,negated_conjecture,(ilf_type(esk13_0,relation_type(esk11_0,esk12_0))),inference(split_conjunct,[status(thm)],[129])).
% cnf(195,plain,(ilf_type(X1,relation_type(X2,X3))|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~subset(X1,cross_product(X2,X3))),inference(rw,[status(thm)],[41,126,theory(equality)])).
% cnf(196,plain,(ilf_type(X1,relation_type(X2,X3))|$false|$false|~ilf_type(X1,set_type)|~subset(X1,cross_product(X2,X3))),inference(rw,[status(thm)],[195,126,theory(equality)])).
% cnf(197,plain,(ilf_type(X1,relation_type(X2,X3))|$false|$false|$false|~subset(X1,cross_product(X2,X3))),inference(rw,[status(thm)],[196,126,theory(equality)])).
% cnf(198,plain,(ilf_type(X1,relation_type(X2,X3))|~subset(X1,cross_product(X2,X3))),inference(cn,[status(thm)],[197,theory(equality)])).
% cnf(241,plain,(subset(X1,cross_product(X2,X3))|~subset(X1,X4)|$false|~ilf_type(X2,set_type)|~ilf_type(X1,set_type)|~ilf_type(X4,relation_type(X2,X3))),inference(rw,[status(thm)],[37,126,theory(equality)])).
% cnf(242,plain,(subset(X1,cross_product(X2,X3))|~subset(X1,X4)|$false|$false|~ilf_type(X1,set_type)|~ilf_type(X4,relation_type(X2,X3))),inference(rw,[status(thm)],[241,126,theory(equality)])).
% cnf(243,plain,(subset(X1,cross_product(X2,X3))|~subset(X1,X4)|$false|$false|$false|~ilf_type(X4,relation_type(X2,X3))),inference(rw,[status(thm)],[242,126,theory(equality)])).
% cnf(244,plain,(subset(X1,cross_product(X2,X3))|~subset(X1,X4)|~ilf_type(X4,relation_type(X2,X3))),inference(cn,[status(thm)],[243,theory(equality)])).
% cnf(271,negated_conjecture,(subset(X1,cross_product(esk11_0,esk12_0))|~subset(X1,esk13_0)),inference(spm,[status(thm)],[244,132,theory(equality)])).
% cnf(305,negated_conjecture,(ilf_type(X1,relation_type(esk11_0,esk12_0))|~subset(X1,esk13_0)),inference(spm,[status(thm)],[198,271,theory(equality)])).
% cnf(322,negated_conjecture,(~subset(esk10_0,esk13_0)),inference(spm,[status(thm)],[130,305,theory(equality)])).
% cnf(324,negated_conjecture,($false),inference(rw,[status(thm)],[322,131,theory(equality)])).
% cnf(325,negated_conjecture,($false),inference(cn,[status(thm)],[324,theory(equality)])).
% cnf(326,negated_conjecture,($false),325,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 101
% # ...of these trivial : 10
% # ...subsumed : 5
% # ...remaining for further processing: 86
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 67
% # ...of the previous two non-trivial : 54
% # Contextual simplify-reflections : 1
% # Paramodulations : 67
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 53
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 58
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 75 leaves, 1.24+/-0.585 terms/leaf
% # Paramod-from index: 33 leaves, 1.06+/-0.239 terms/leaf
% # Paramod-into index: 71 leaves, 1.20+/-0.463 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.004 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31230/SET642+3.tptp
%
%------------------------------------------------------------------------------