%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET199+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:08:30 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/SystemOnTPTP26384/SET199+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP26384/SET199+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26384/SET199+4.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 26480
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X1,intersection(X2,X3))<=>(member(X1,X2)&member(X1,X3))),file('/tmp/SRASS.s.p', intersection)).
% fof(2, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:![X1]:![X5]:((subset(X2,X1)&subset(X2,X5))<=>subset(X2,intersection(X1,X5))),file('/tmp/SRASS.s.p', thI46)).
% fof(13, negated_conjecture,~(![X2]:![X1]:![X5]:((subset(X2,X1)&subset(X2,X5))<=>subset(X2,intersection(X1,X5)))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(member(X1,intersection(X2,X3)))|(member(X1,X2)&member(X1,X3)))&((~(member(X1,X2))|~(member(X1,X3)))|member(X1,intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(member(X4,intersection(X5,X6)))|(member(X4,X5)&member(X4,X6)))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:(((member(X4,X5)|~(member(X4,intersection(X5,X6))))&(member(X4,X6)|~(member(X4,intersection(X5,X6)))))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(80, negated_conjecture,?[X2]:?[X1]:?[X5]:(((~(subset(X2,X1))|~(subset(X2,X5)))|~(subset(X2,intersection(X1,X5))))&((subset(X2,X1)&subset(X2,X5))|subset(X2,intersection(X1,X5)))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X6]:?[X7]:?[X8]:(((~(subset(X6,X7))|~(subset(X6,X8)))|~(subset(X6,intersection(X7,X8))))&((subset(X6,X7)&subset(X6,X8))|subset(X6,intersection(X7,X8)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(((~(subset(esk4_0,esk5_0))|~(subset(esk4_0,esk6_0)))|~(subset(esk4_0,intersection(esk5_0,esk6_0))))&((subset(esk4_0,esk5_0)&subset(esk4_0,esk6_0))|subset(esk4_0,intersection(esk5_0,esk6_0)))),inference(skolemize,[status(esa)],[81])).
% fof(83, negated_conjecture,(((~(subset(esk4_0,esk5_0))|~(subset(esk4_0,esk6_0)))|~(subset(esk4_0,intersection(esk5_0,esk6_0))))&((subset(esk4_0,esk5_0)|subset(esk4_0,intersection(esk5_0,esk6_0)))&(subset(esk4_0,esk6_0)|subset(esk4_0,intersection(esk5_0,esk6_0))))),inference(distribute,[status(thm)],[82])).
% cnf(84,negated_conjecture,(subset(esk4_0,intersection(esk5_0,esk6_0))|subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(85,negated_conjecture,(subset(esk4_0,intersection(esk5_0,esk6_0))|subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(86,negated_conjecture,(~subset(esk4_0,intersection(esk5_0,esk6_0))|~subset(esk4_0,esk6_0)|~subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(99,negated_conjecture,(member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk4_0)|~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)),inference(spm,[status(thm)],[86,28,theory(equality)])).
% cnf(102,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),intersection(esk5_0,esk6_0))),inference(spm,[status(thm)],[86,27,theory(equality)])).
% cnf(111,negated_conjecture,(member(X1,intersection(esk5_0,esk6_0))|subset(esk4_0,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[29,85,theory(equality)])).
% cnf(112,negated_conjecture,(member(X1,intersection(esk5_0,esk6_0))|subset(esk4_0,esk6_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[29,84,theory(equality)])).
% cnf(180,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk6_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk5_0)),inference(spm,[status(thm)],[102,19,theory(equality)])).
% cnf(187,negated_conjecture,(member(X1,esk5_0)|subset(esk4_0,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[21,111,theory(equality)])).
% cnf(209,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(csr,[status(thm)],[187,29])).
% cnf(214,negated_conjecture,(member(X1,esk6_0)|subset(esk4_0,esk6_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[20,112,theory(equality)])).
% cnf(237,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk4_0)),inference(csr,[status(thm)],[214,29])).
% cnf(454,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk5_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk4_0)),inference(spm,[status(thm)],[180,237,theory(equality)])).
% cnf(455,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk5_0)),inference(csr,[status(thm)],[454,99])).
% cnf(456,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)|~member(esk1_2(esk4_0,intersection(esk5_0,esk6_0)),esk4_0)),inference(spm,[status(thm)],[455,209,theory(equality)])).
% cnf(557,negated_conjecture,(~subset(esk4_0,esk5_0)|~subset(esk4_0,esk6_0)),inference(csr,[status(thm)],[456,99])).
% cnf(561,negated_conjecture,(member(esk1_2(esk4_0,esk6_0),esk4_0)|~subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[557,28,theory(equality)])).
% cnf(562,negated_conjecture,(~subset(esk4_0,esk5_0)|~member(esk1_2(esk4_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[557,27,theory(equality)])).
% cnf(634,negated_conjecture,(~subset(esk4_0,esk5_0)|~member(esk1_2(esk4_0,esk6_0),esk4_0)),inference(spm,[status(thm)],[562,237,theory(equality)])).
% cnf(635,negated_conjecture,(~subset(esk4_0,esk5_0)),inference(csr,[status(thm)],[634,561])).
% cnf(639,negated_conjecture,(member(esk1_2(esk4_0,esk5_0),esk4_0)),inference(spm,[status(thm)],[635,28,theory(equality)])).
% cnf(640,negated_conjecture,(~member(esk1_2(esk4_0,esk5_0),esk5_0)),inference(spm,[status(thm)],[635,27,theory(equality)])).
% cnf(665,negated_conjecture,(~member(esk1_2(esk4_0,esk5_0),esk4_0)),inference(spm,[status(thm)],[640,209,theory(equality)])).
% cnf(666,negated_conjecture,($false),inference(rw,[status(thm)],[665,639,theory(equality)])).
% cnf(667,negated_conjecture,($false),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(668,negated_conjecture,($false),667,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 182
% # ...of these trivial : 1
% # ...subsumed : 11
% # ...remaining for further processing: 170
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 14
% # Backward-rewritten : 1
% # Generated clauses : 494
% # ...of the previous two non-trivial : 387
% # Contextual simplify-reflections : 7
% # Paramodulations : 483
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 39
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 62
% # Current number of unprocessed clauses: 189
% # ...number of literals in the above : 495
% # Clause-clause subsumption calls (NU) : 318
% # Rec. Clause-clause subsumption calls : 231
% # Unit Clause-clause subsumption calls : 56
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 153
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 94 leaves, 1.79+/-2.083 terms/leaf
% # Paramod-from index: 34 leaves, 1.71+/-2.607 terms/leaf
% # Paramod-into index: 88 leaves, 1.73+/-2.077 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.005 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP26384/SET199+4.tptp
%
%------------------------------------------------------------------------------