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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET926+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 : 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 00:19:47 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/SystemOnTPTP4237/SET926+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP4237/SET926+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4237/SET926+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 4333
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(set_difference(singleton(X1),X2)=empty_set<=>in(X1,X2)),file('/tmp/SRASS.s.p', l36_zfmisc_1)).
% fof(2, axiom,![X1]:![X2]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2))),file('/tmp/SRASS.s.p', l34_zfmisc_1)).
% fof(7, conjecture,![X1]:![X2]:(set_difference(singleton(X1),X2)=empty_set|set_difference(singleton(X1),X2)=singleton(X1)),file('/tmp/SRASS.s.p', t69_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(set_difference(singleton(X1),X2)=empty_set|set_difference(singleton(X1),X2)=singleton(X1))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, plain,![X1]:![X2]:((~(set_difference(singleton(X1),X2)=empty_set)|in(X1,X2))&(~(in(X1,X2))|set_difference(singleton(X1),X2)=empty_set)),inference(fof_nnf,[status(thm)],[1])).
% fof(13, plain,![X3]:![X4]:((~(set_difference(singleton(X3),X4)=empty_set)|in(X3,X4))&(~(in(X3,X4))|set_difference(singleton(X3),X4)=empty_set)),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(set_difference(singleton(X1),X2)=empty_set|~in(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(16, plain,![X1]:![X2]:((~(set_difference(singleton(X1),X2)=singleton(X1))|~(in(X1,X2)))&(in(X1,X2)|set_difference(singleton(X1),X2)=singleton(X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(17, plain,![X3]:![X4]:((~(set_difference(singleton(X3),X4)=singleton(X3))|~(in(X3,X4)))&(in(X3,X4)|set_difference(singleton(X3),X4)=singleton(X3))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(set_difference(singleton(X1),X2)=singleton(X1)|in(X1,X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(30, negated_conjecture,?[X1]:?[X2]:(~(set_difference(singleton(X1),X2)=empty_set)&~(set_difference(singleton(X1),X2)=singleton(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(31, negated_conjecture,?[X3]:?[X4]:(~(set_difference(singleton(X3),X4)=empty_set)&~(set_difference(singleton(X3),X4)=singleton(X3))),inference(variable_rename,[status(thm)],[30])).
% fof(32, negated_conjecture,(~(set_difference(singleton(esk3_0),esk4_0)=empty_set)&~(set_difference(singleton(esk3_0),esk4_0)=singleton(esk3_0))),inference(skolemize,[status(esa)],[31])).
% cnf(33,negated_conjecture,(set_difference(singleton(esk3_0),esk4_0)!=singleton(esk3_0)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,negated_conjecture,(set_difference(singleton(esk3_0),esk4_0)!=empty_set),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[34,14,theory(equality)])).
% cnf(39,negated_conjecture,(in(esk3_0,esk4_0)),inference(spm,[status(thm)],[33,18,theory(equality)])).
% cnf(45,negated_conjecture,($false),inference(rw,[status(thm)],[35,39,theory(equality)])).
% cnf(46,negated_conjecture,($false),inference(cn,[status(thm)],[45,theory(equality)])).
% cnf(47,negated_conjecture,($false),46,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 22
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 10
% # ...of the previous two non-trivial : 7
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 10
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 11
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 5
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 9
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    15 leaves,   1.07+/-0.249 terms/leaf
% # Paramod-from index:            4 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           14 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.009 s
% # System time            : 0.003 s
% # Total time             : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP4237/SET926+1.tptp
% 
%------------------------------------------------------------------------------