%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET956+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 : Thu Dec 30 00:23:19 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP10545/SET956+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10545/SET956+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10545/SET956+1.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 10641
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:~(((subset(X1,cartesian_product2(X2,X3))&in(X4,X1))&![X5]:![X6]:~(((in(X5,X2)&in(X6,X3))&X4=ordered_pair(X5,X6))))),file('/tmp/SRASS.s.p', t103_zfmisc_1)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(9, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(10, conjecture,![X1]:![X2]:![X3]:![X4]:((subset(X1,cartesian_product2(X2,X3))&![X5]:![X6]:(in(ordered_pair(X5,X6),X1)=>in(ordered_pair(X5,X6),X4)))=>subset(X1,X4)),file('/tmp/SRASS.s.p', t109_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((subset(X1,cartesian_product2(X2,X3))&![X5]:![X6]:(in(ordered_pair(X5,X6),X1)=>in(ordered_pair(X5,X6),X4)))=>subset(X1,X4))),inference(assume_negation,[status(cth)],[10])).
% fof(18, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[21])).
% cnf(23,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(28, plain,![X1]:![X2]:![X3]:![X4]:((~(subset(X1,cartesian_product2(X2,X3)))|~(in(X4,X1)))|?[X5]:?[X6]:((in(X5,X2)&in(X6,X3))&X4=ordered_pair(X5,X6))),inference(fof_nnf,[status(thm)],[4])).
% fof(29, plain,![X7]:![X8]:![X9]:![X10]:((~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7)))|?[X11]:?[X12]:((in(X11,X8)&in(X12,X9))&X10=ordered_pair(X11,X12))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X7]:![X8]:![X9]:![X10]:((~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7)))|((in(esk2_4(X7,X8,X9,X10),X8)&in(esk3_4(X7,X8,X9,X10),X9))&X10=ordered_pair(esk2_4(X7,X8,X9,X10),esk3_4(X7,X8,X9,X10)))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X7]:![X8]:![X9]:![X10]:(((in(esk2_4(X7,X8,X9,X10),X8)|(~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7))))&(in(esk3_4(X7,X8,X9,X10),X9)|(~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7)))))&(X10=ordered_pair(esk2_4(X7,X8,X9,X10),esk3_4(X7,X8,X9,X10))|(~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7))))),inference(distribute,[status(thm)],[30])).
% cnf(32,plain,(X1=ordered_pair(esk2_4(X2,X3,X4,X1),esk3_4(X2,X3,X4,X1))|~in(X1,X2)|~subset(X2,cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[31])).
% fof(43, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(44,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(46,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(X1,cartesian_product2(X2,X3))&![X5]:![X6]:(~(in(ordered_pair(X5,X6),X1))|in(ordered_pair(X5,X6),X4)))&~(subset(X1,X4))),inference(fof_nnf,[status(thm)],[11])).
% fof(48, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:((subset(X7,cartesian_product2(X8,X9))&![X11]:![X12]:(~(in(ordered_pair(X11,X12),X7))|in(ordered_pair(X11,X12),X10)))&~(subset(X7,X10))),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,((subset(esk6_0,cartesian_product2(esk7_0,esk8_0))&![X11]:![X12]:(~(in(ordered_pair(X11,X12),esk6_0))|in(ordered_pair(X11,X12),esk9_0)))&~(subset(esk6_0,esk9_0))),inference(skolemize,[status(esa)],[48])).
% fof(50, negated_conjecture,![X11]:![X12]:(((~(in(ordered_pair(X11,X12),esk6_0))|in(ordered_pair(X11,X12),esk9_0))&subset(esk6_0,cartesian_product2(esk7_0,esk8_0)))&~(subset(esk6_0,esk9_0))),inference(shift_quantors,[status(thm)],[49])).
% cnf(51,negated_conjecture,(~subset(esk6_0,esk9_0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,negated_conjecture,(subset(esk6_0,cartesian_product2(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[50])).
% cnf(53,negated_conjecture,(in(ordered_pair(X1,X2),esk9_0)|~in(ordered_pair(X1,X2),esk6_0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(54,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk6_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[53,46,theory(equality)]),46,theory(equality)]),['unfolding']).
% cnf(55,plain,(unordered_pair(unordered_pair(esk2_4(X2,X3,X4,X1),esk3_4(X2,X3,X4,X1)),singleton(esk2_4(X2,X3,X4,X1)))=X1|~in(X1,X2)|~subset(X2,cartesian_product2(X3,X4))),inference(rw,[status(thm)],[32,46,theory(equality)]),['unfolding']).
% cnf(57,plain,(unordered_pair(singleton(esk2_4(X2,X3,X4,X1)),unordered_pair(esk2_4(X2,X3,X4,X1),esk3_4(X2,X3,X4,X1)))=X1|~in(X1,X2)|~subset(X2,cartesian_product2(X3,X4))),inference(rw,[status(thm)],[55,44,theory(equality)])).
% cnf(70,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk6_0)),inference(spm,[status(thm)],[54,44,theory(equality)])).
% cnf(104,negated_conjecture,(in(X4,esk9_0)|~in(X4,esk6_0)|~subset(X1,cartesian_product2(X2,X3))|~in(X4,X1)),inference(spm,[status(thm)],[70,57,theory(equality)])).
% cnf(115,negated_conjecture,(in(X1,esk9_0)|~in(X1,esk6_0)),inference(spm,[status(thm)],[104,52,theory(equality)])).
% cnf(117,negated_conjecture,(subset(X1,esk9_0)|~in(esk1_2(X1,esk9_0),esk6_0)),inference(spm,[status(thm)],[23,115,theory(equality)])).
% cnf(120,negated_conjecture,(subset(esk6_0,esk9_0)),inference(spm,[status(thm)],[117,24,theory(equality)])).
% cnf(121,negated_conjecture,($false),inference(sr,[status(thm)],[120,51,theory(equality)])).
% cnf(122,negated_conjecture,($false),121,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 52
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 61
% # ...of the previous two non-trivial : 57
% # Contextual simplify-reflections : 0
% # Paramodulations : 61
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 43
% # Clause-clause subsumption calls (NU) : 50
% # Rec. Clause-clause subsumption calls : 50
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 45 leaves, 1.27+/-0.611 terms/leaf
% # Paramod-from index: 10 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-into index: 38 leaves, 1.21+/-0.408 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.005 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP10545/SET956+1.tptp
%
%------------------------------------------------------------------------------