%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET044+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 22:53:03 EST 2010
% Result : Theorem 0.85s
% Output : Solution 0.85s
% 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/SystemOnTPTP18102/SET044+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18102/SET044+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18102/SET044+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 18199
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(?[X1]:![X2]:(element(X2,X1)<=>element(X2,X2))=>~(![X3]:?[X4]:![X5]:(element(X5,X4)<=>~(element(X5,X3))))),file('/tmp/SRASS.s.p', pel40)).
% fof(2, negated_conjecture,~((?[X1]:![X2]:(element(X2,X1)<=>element(X2,X2))=>~(![X3]:?[X4]:![X5]:(element(X5,X4)<=>~(element(X5,X3)))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((?[X1]:![X2]:(element(X2,X1)<=>element(X2,X2))=>~(![X3]:?[X4]:![X5]:(element(X5,X4)<=>~(element(X5,X3)))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,(?[X1]:![X2]:((~(element(X2,X1))|element(X2,X2))&(~(element(X2,X2))|element(X2,X1)))&![X3]:?[X4]:![X5]:((~(element(X5,X4))|~(element(X5,X3)))&(element(X5,X3)|element(X5,X4)))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,(?[X6]:![X7]:((~(element(X7,X6))|element(X7,X7))&(~(element(X7,X7))|element(X7,X6)))&![X8]:?[X9]:![X10]:((~(element(X10,X9))|~(element(X10,X8)))&(element(X10,X8)|element(X10,X9)))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,(![X7]:((~(element(X7,esk1_0))|element(X7,X7))&(~(element(X7,X7))|element(X7,esk1_0)))&![X8]:![X10]:((~(element(X10,esk2_1(X8)))|~(element(X10,X8)))&(element(X10,X8)|element(X10,esk2_1(X8))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X7]:![X8]:![X10]:(((~(element(X10,esk2_1(X8)))|~(element(X10,X8)))&(element(X10,X8)|element(X10,esk2_1(X8))))&((~(element(X7,esk1_0))|element(X7,X7))&(~(element(X7,X7))|element(X7,esk1_0)))),inference(shift_quantors,[status(thm)],[6])).
% cnf(8,negated_conjecture,(element(X1,esk1_0)|~element(X1,X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(element(X1,X1)|~element(X1,esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(element(X1,esk2_1(X2))|element(X1,X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(~element(X1,X2)|~element(X1,esk2_1(X2))),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(element(esk2_1(X1),esk1_0)|element(esk2_1(X1),X1)),inference(spm,[status(thm)],[8,10,theory(equality)])).
% cnf(14,negated_conjecture,(element(esk2_1(esk1_0),esk1_0)),inference(ef,[status(thm)],[12,theory(equality)])).
% cnf(27,negated_conjecture,(element(esk2_1(esk1_0),esk2_1(esk1_0))),inference(spm,[status(thm)],[9,14,theory(equality)])).
% cnf(29,negated_conjecture,(~element(esk2_1(esk1_0),esk1_0)),inference(spm,[status(thm)],[11,27,theory(equality)])).
% cnf(31,negated_conjecture,($false),inference(rw,[status(thm)],[29,14,theory(equality)])).
% cnf(32,negated_conjecture,($false),inference(cn,[status(thm)],[31,theory(equality)])).
% cnf(33,negated_conjecture,($false),32,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 17
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 0
% # Paramodulations : 13
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 9
% # Clause-clause subsumption calls (NU) : 12
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 17 leaves, 1.35+/-0.588 terms/leaf
% # Paramod-from index: 8 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 16 leaves, 1.25+/-0.433 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.002 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP18102/SET044+1.tptp
%
%------------------------------------------------------------------------------