TSTP Solution File: SET900+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET900+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 00:21:48 EST 2010

% Result   : Theorem 1.09s
% Output   : Solution 1.09s
% 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/SystemOnTPTP32076/SET900+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP32076/SET900+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32076/SET900+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 32208
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:~(((~(X1=singleton(X2))&~(X1=empty_set))&![X3]:~((in(X3,X1)&~(X3=X2))))),file('/tmp/SRASS.s.p', l45_zfmisc_1)).
% fof(6, conjecture,![X1]:![X2]:~(((~(X1=singleton(X2))&~(X1=empty_set))&![X3]:~((in(X3,X1)&~(X3=X2))))),file('/tmp/SRASS.s.p', t41_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:~(((~(X1=singleton(X2))&~(X1=empty_set))&![X3]:~((in(X3,X1)&~(X3=X2)))))),inference(assume_negation,[status(cth)],[6])).
% fof(13, plain,![X1]:![X2]:((X1=singleton(X2)|X1=empty_set)|?[X3]:(in(X3,X1)&~(X3=X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X4]:![X5]:((X4=singleton(X5)|X4=empty_set)|?[X6]:(in(X6,X4)&~(X6=X5))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X4]:![X5]:((X4=singleton(X5)|X4=empty_set)|(in(esk1_2(X4,X5),X4)&~(esk1_2(X4,X5)=X5))),inference(skolemize,[status(esa)],[14])).
% fof(16, plain,![X4]:![X5]:((in(esk1_2(X4,X5),X4)|(X4=singleton(X5)|X4=empty_set))&(~(esk1_2(X4,X5)=X5)|(X4=singleton(X5)|X4=empty_set))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(X1=empty_set|X1=singleton(X2)|esk1_2(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(X1=empty_set|X1=singleton(X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(26, negated_conjecture,?[X1]:?[X2]:((~(X1=singleton(X2))&~(X1=empty_set))&![X3]:(~(in(X3,X1))|X3=X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(27, negated_conjecture,?[X4]:?[X5]:((~(X4=singleton(X5))&~(X4=empty_set))&![X6]:(~(in(X6,X4))|X6=X5)),inference(variable_rename,[status(thm)],[26])).
% fof(28, negated_conjecture,((~(esk4_0=singleton(esk5_0))&~(esk4_0=empty_set))&![X6]:(~(in(X6,esk4_0))|X6=esk5_0)),inference(skolemize,[status(esa)],[27])).
% fof(29, negated_conjecture,![X6]:((~(in(X6,esk4_0))|X6=esk5_0)&(~(esk4_0=singleton(esk5_0))&~(esk4_0=empty_set))),inference(shift_quantors,[status(thm)],[28])).
% cnf(30,negated_conjecture,(esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,negated_conjecture,(esk4_0!=singleton(esk5_0)),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,negated_conjecture,(X1=esk5_0|~in(X1,esk4_0)),inference(split_conjunct,[status(thm)],[29])).
% cnf(33,negated_conjecture,(esk5_0=esk1_2(esk4_0,X1)|singleton(X1)=esk4_0|empty_set=esk4_0),inference(spm,[status(thm)],[32,18,theory(equality)])).
% cnf(34,negated_conjecture,(esk1_2(esk4_0,X1)=esk5_0|singleton(X1)=esk4_0),inference(sr,[status(thm)],[33,30,theory(equality)])).
% cnf(36,negated_conjecture,(singleton(X1)=esk4_0|empty_set=esk4_0|esk5_0!=X1),inference(spm,[status(thm)],[17,34,theory(equality)])).
% cnf(38,negated_conjecture,(singleton(X1)=esk4_0|esk5_0!=X1),inference(sr,[status(thm)],[36,30,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(spm,[status(thm)],[31,38,theory(equality)])).
% cnf(41,negated_conjecture,($false),40,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 20
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 5
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 5
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 11
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 6
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 5
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    16 leaves,   1.06+/-0.242 terms/leaf
% # Paramod-from index:            5 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           15 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.007 s
% # System time            : 0.005 s
% # Total time             : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP32076/SET900+1.tptp
% 
%------------------------------------------------------------------------------