%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU153+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 : 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 : Thu Dec 30 01:19:49 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP20636/SEU153+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20636/SEU153+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20636/SEU153+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 20762
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(21, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(30, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(40, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(48, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(76, conjecture,![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2))),file('/tmp/SRASS.s.p', l25_zfmisc_1)).
% fof(77, negated_conjecture,~(![X1]:![X2]:~((disjoint(singleton(X1),X2)&in(X1,X2)))),inference(assume_negation,[status(cth)],[76])).
% fof(111, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(112, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[112])).
% fof(167, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(168, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[167])).
% cnf(170,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[168])).
% fof(200, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[30])).
% cnf(201,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[200])).
% fof(257, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[40])).
% cnf(258,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[257])).
% fof(278, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[48])).
% fof(279, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[278])).
% cnf(280,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[279])).
% fof(352, negated_conjecture,?[X1]:?[X2]:(disjoint(singleton(X1),X2)&in(X1,X2)),inference(fof_nnf,[status(thm)],[77])).
% fof(353, negated_conjecture,?[X3]:?[X4]:(disjoint(singleton(X3),X4)&in(X3,X4)),inference(variable_rename,[status(thm)],[352])).
% fof(354, negated_conjecture,(disjoint(singleton(esk14_0),esk15_0)&in(esk14_0,esk15_0)),inference(skolemize,[status(esa)],[353])).
% cnf(355,negated_conjecture,(in(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[354])).
% cnf(356,negated_conjecture,(disjoint(singleton(esk14_0),esk15_0)),inference(split_conjunct,[status(thm)],[354])).
% cnf(358,negated_conjecture,(disjoint(unordered_pair(esk14_0,esk14_0),esk15_0)),inference(rw,[status(thm)],[356,258,theory(equality)]),['unfolding']).
% cnf(367,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[113,258,theory(equality)]),['unfolding']).
% cnf(373,plain,(unordered_pair(X1,X1)!=empty_set),inference(rw,[status(thm)],[201,258,theory(equality)]),['unfolding']).
% cnf(417,negated_conjecture,(set_difference(unordered_pair(esk14_0,esk14_0),esk15_0)=unordered_pair(esk14_0,esk14_0)),inference(spm,[status(thm)],[170,358,theory(equality)])).
% cnf(544,negated_conjecture,(subset(unordered_pair(esk14_0,esk14_0),esk15_0)),inference(spm,[status(thm)],[367,355,theory(equality)])).
% cnf(1386,negated_conjecture,(set_difference(unordered_pair(esk14_0,esk14_0),esk15_0)=empty_set),inference(spm,[status(thm)],[280,544,theory(equality)])).
% cnf(1513,negated_conjecture,(unordered_pair(esk14_0,esk14_0)=empty_set),inference(rw,[status(thm)],[1386,417,theory(equality)])).
% cnf(1514,negated_conjecture,($false),inference(sr,[status(thm)],[1513,373,theory(equality)])).
% cnf(1515,negated_conjecture,($false),1514,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 241
% # ...of these trivial : 2
% # ...subsumed : 11
% # ...remaining for further processing: 228
% # Other redundant clauses eliminated : 35
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 972
% # ...of the previous two non-trivial : 827
% # Contextual simplify-reflections : 0
% # Paramodulations : 908
% # Factorizations : 14
% # Equation resolutions : 50
% # Current number of processed clauses: 117
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 10
% # Non-unit-clauses : 80
% # Current number of unprocessed clauses: 800
% # ...number of literals in the above : 2593
% # Clause-clause subsumption calls (NU) : 275
% # Rec. Clause-clause subsumption calls : 257
% # Unit Clause-clause subsumption calls : 60
% # Rewrite failures with RHS unbound : 4
% # Indexed BW rewrite attempts : 42
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 76 leaves, 1.75+/-1.763 terms/leaf
% # Paramod-from index: 42 leaves, 1.33+/-0.678 terms/leaf
% # Paramod-into index: 66 leaves, 1.67+/-1.521 terms/leaf
% # -------------------------------------------------
% # User time : 0.053 s
% # System time : 0.006 s
% # Total time : 0.059 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.29 WC
% FINAL PrfWatch: 0.16 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP20636/SEU153+2.tptp
%
%------------------------------------------------------------------------------