%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU162+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 01:22:14 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP22819/SEU162+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP22819/SEU162+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22819/SEU162+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 22915
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(3, axiom,![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2))),file('/tmp/SRASS.s.p', l25_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),file('/tmp/SRASS.s.p', l28_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(8, conjecture,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),file('/tmp/SRASS.s.p', t65_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1)))),inference(assume_negation,[status(cth)],[8])).
% fof(11, plain,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(12, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1)))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(16, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(disjoint(X1,X2)|set_difference(X1,X2)!=X1),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(20, plain,![X1]:![X2]:(~(disjoint(singleton(X1),X2))|~(in(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(21, plain,![X3]:![X4]:(~(disjoint(singleton(X3),X4))|~(in(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(~in(X1,X2)|~disjoint(singleton(X1),X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X2]:(in(X1,X2)|disjoint(singleton(X1),X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(24, plain,![X3]:![X4]:(in(X3,X4)|disjoint(singleton(X3),X4)),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(disjoint(singleton(X1),X2)|in(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(31, negated_conjecture,?[X1]:?[X2]:((~(set_difference(X1,singleton(X2))=X1)|in(X2,X1))&(set_difference(X1,singleton(X2))=X1|~(in(X2,X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(32, negated_conjecture,?[X3]:?[X4]:((~(set_difference(X3,singleton(X4))=X3)|in(X4,X3))&(set_difference(X3,singleton(X4))=X3|~(in(X4,X3)))),inference(variable_rename,[status(thm)],[31])).
% fof(33, negated_conjecture,((~(set_difference(esk1_0,singleton(esk2_0))=esk1_0)|in(esk2_0,esk1_0))&(set_difference(esk1_0,singleton(esk2_0))=esk1_0|~(in(esk2_0,esk1_0)))),inference(skolemize,[status(esa)],[32])).
% cnf(34,negated_conjecture,(set_difference(esk1_0,singleton(esk2_0))=esk1_0|~in(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,negated_conjecture,(in(esk2_0,esk1_0)|set_difference(esk1_0,singleton(esk2_0))!=esk1_0),inference(split_conjunct,[status(thm)],[33])).
% cnf(37,negated_conjecture,(in(esk2_0,esk1_0)|~disjoint(esk1_0,singleton(esk2_0))),inference(spm,[status(thm)],[35,19,theory(equality)])).
% cnf(40,plain,(disjoint(X1,singleton(X2))|in(X2,X1)),inference(spm,[status(thm)],[28,25,theory(equality)])).
% cnf(44,negated_conjecture,(in(esk2_0,esk1_0)),inference(spm,[status(thm)],[37,40,theory(equality)])).
% cnf(51,negated_conjecture,(set_difference(esk1_0,singleton(esk2_0))=esk1_0|$false),inference(rw,[status(thm)],[34,44,theory(equality)])).
% cnf(52,negated_conjecture,(set_difference(esk1_0,singleton(esk2_0))=esk1_0),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(54,negated_conjecture,(disjoint(esk1_0,singleton(esk2_0))),inference(spm,[status(thm)],[18,52,theory(equality)])).
% cnf(55,negated_conjecture,(disjoint(singleton(esk2_0),esk1_0)),inference(spm,[status(thm)],[28,54,theory(equality)])).
% cnf(57,negated_conjecture,(~in(esk2_0,esk1_0)),inference(spm,[status(thm)],[22,55,theory(equality)])).
% cnf(59,negated_conjecture,($false),inference(rw,[status(thm)],[57,44,theory(equality)])).
% cnf(60,negated_conjecture,($false),inference(cn,[status(thm)],[59,theory(equality)])).
% cnf(61,negated_conjecture,($false),60,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 16
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 0
% # Paramodulations : 16
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 16 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 15 leaves, 1.07+/-0.249 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP22819/SEU162+1.tptp
%
%------------------------------------------------------------------------------