%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU162+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:22 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP6924/SEU162+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6924/SEU162+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6924/SEU162+2.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 7020
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(11, axiom,![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2))),file('/tmp/SRASS.s.p', l25_zfmisc_1)).
% fof(12, axiom,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),file('/tmp/SRASS.s.p', l28_zfmisc_1)).
% fof(19, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(22, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(40, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(92, conjecture,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),file('/tmp/SRASS.s.p', t65_zfmisc_1)).
% fof(93, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1)))),inference(assume_negation,[status(cth)],[92])).
% fof(96, plain,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(106, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1)))),inference(fof_simplification,[status(thm)],[93,theory(equality)])).
% fof(156, plain,![X1]:![X2]:(~(disjoint(singleton(X1),X2))|~(in(X1,X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(157, plain,![X3]:![X4]:(~(disjoint(singleton(X3),X4))|~(in(X3,X4))),inference(variable_rename,[status(thm)],[156])).
% cnf(158,plain,(~in(X1,X2)|~disjoint(singleton(X1),X2)),inference(split_conjunct,[status(thm)],[157])).
% fof(159, plain,![X1]:![X2]:(in(X1,X2)|disjoint(singleton(X1),X2)),inference(fof_nnf,[status(thm)],[96])).
% fof(160, plain,![X3]:![X4]:(in(X3,X4)|disjoint(singleton(X3),X4)),inference(variable_rename,[status(thm)],[159])).
% cnf(161,plain,(disjoint(singleton(X1),X2)|in(X1,X2)),inference(split_conjunct,[status(thm)],[160])).
% fof(174, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(175, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[174])).
% cnf(176,plain,(disjoint(X1,X2)|set_difference(X1,X2)!=X1),inference(split_conjunct,[status(thm)],[175])).
% cnf(177,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[175])).
% fof(195, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[22])).
% cnf(196,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(273, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[40])).
% fof(274, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[273])).
% cnf(275,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[274])).
% fof(441, 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)],[106])).
% fof(442, 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)],[441])).
% fof(443, negated_conjecture,((~(set_difference(esk22_0,singleton(esk23_0))=esk22_0)|in(esk23_0,esk22_0))&(set_difference(esk22_0,singleton(esk23_0))=esk22_0|~(in(esk23_0,esk22_0)))),inference(skolemize,[status(esa)],[442])).
% cnf(444,negated_conjecture,(set_difference(esk22_0,singleton(esk23_0))=esk22_0|~in(esk23_0,esk22_0)),inference(split_conjunct,[status(thm)],[443])).
% cnf(445,negated_conjecture,(in(esk23_0,esk22_0)|set_difference(esk22_0,singleton(esk23_0))!=esk22_0),inference(split_conjunct,[status(thm)],[443])).
% cnf(448,plain,(in(X1,X2)|disjoint(unordered_pair(X1,X1),X2)),inference(rw,[status(thm)],[161,196,theory(equality)]),['unfolding']).
% cnf(463,negated_conjecture,(set_difference(esk22_0,unordered_pair(esk23_0,esk23_0))=esk22_0|~in(esk23_0,esk22_0)),inference(rw,[status(thm)],[444,196,theory(equality)]),['unfolding']).
% cnf(464,negated_conjecture,(in(esk23_0,esk22_0)|set_difference(esk22_0,unordered_pair(esk23_0,esk23_0))!=esk22_0),inference(rw,[status(thm)],[445,196,theory(equality)]),['unfolding']).
% cnf(472,plain,(~in(X1,X2)|~disjoint(unordered_pair(X1,X1),X2)),inference(rw,[status(thm)],[158,196,theory(equality)]),['unfolding']).
% cnf(543,negated_conjecture,(in(esk23_0,esk22_0)|~disjoint(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(spm,[status(thm)],[464,177,theory(equality)])).
% cnf(547,negated_conjecture,(disjoint(esk22_0,unordered_pair(esk23_0,esk23_0))|~in(esk23_0,esk22_0)),inference(spm,[status(thm)],[176,463,theory(equality)])).
% cnf(3212,negated_conjecture,(disjoint(unordered_pair(esk23_0,esk23_0),esk22_0)|~in(esk23_0,esk22_0)),inference(spm,[status(thm)],[275,547,theory(equality)])).
% cnf(3453,negated_conjecture,(disjoint(unordered_pair(esk23_0,esk23_0),esk22_0)),inference(csr,[status(thm)],[3212,448])).
% cnf(3455,negated_conjecture,(disjoint(esk22_0,unordered_pair(esk23_0,esk23_0))),inference(spm,[status(thm)],[275,3453,theory(equality)])).
% cnf(3456,negated_conjecture,(~in(esk23_0,esk22_0)),inference(spm,[status(thm)],[472,3453,theory(equality)])).
% cnf(3540,negated_conjecture,(in(esk23_0,esk22_0)|$false),inference(rw,[status(thm)],[543,3455,theory(equality)])).
% cnf(3541,negated_conjecture,(in(esk23_0,esk22_0)),inference(cn,[status(thm)],[3540,theory(equality)])).
% cnf(3542,negated_conjecture,($false),inference(sr,[status(thm)],[3541,3456,theory(equality)])).
% cnf(3543,negated_conjecture,($false),3542,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 374
% # ...of these trivial : 11
% # ...subsumed : 61
% # ...remaining for further processing: 302
% # Other redundant clauses eliminated : 70
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 7
% # Generated clauses : 2694
% # ...of the previous two non-trivial : 2428
% # Contextual simplify-reflections : 2
% # Paramodulations : 2597
% # Factorizations : 8
% # Equation resolutions : 89
% # Current number of processed clauses: 160
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 17
% # Non-unit-clauses : 113
% # Current number of unprocessed clauses: 2228
% # ...number of literals in the above : 8267
% # Clause-clause subsumption calls (NU) : 681
% # Rec. Clause-clause subsumption calls : 569
% # Unit Clause-clause subsumption calls : 44
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 37
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 114 leaves, 1.79+/-2.045 terms/leaf
% # Paramod-from index: 59 leaves, 1.29+/-0.584 terms/leaf
% # Paramod-into index: 108 leaves, 1.61+/-1.580 terms/leaf
% # -------------------------------------------------
% # User time : 0.113 s
% # System time : 0.004 s
% # Total time : 0.117 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.34 WC
% FINAL PrfWatch: 0.26 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP6924/SEU162+2.tptp
%
%------------------------------------------------------------------------------