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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET924+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:24:13 EST 2010

% Result   : Theorem 1.10s
% Output   : Solution 1.10s
% 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/SystemOnTPTP1093/SET924+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1093/SET924+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1093/SET924+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 1234
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2))),file('/tmp/SRASS.s.p', l34_zfmisc_1)).
% fof(5, conjecture,![X1]:![X2]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2))),file('/tmp/SRASS.s.p', t67_zfmisc_1)).
% fof(6, negated_conjecture,~(![X1]:![X2]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2)))),inference(assume_negation,[status(cth)],[5])).
% fof(8, plain,![X1]:![X2]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(10, negated_conjecture,~(![X1]:![X2]:(set_difference(singleton(X1),X2)=singleton(X1)<=>~(in(X1,X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(14, 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)],[8])).
% fof(15, 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)],[14])).
% cnf(16,plain,(set_difference(singleton(X1),X2)=singleton(X1)|in(X1,X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,plain,(~in(X1,X2)|set_difference(singleton(X1),X2)!=singleton(X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(24, negated_conjecture,?[X1]:?[X2]:((~(set_difference(singleton(X1),X2)=singleton(X1))|in(X1,X2))&(set_difference(singleton(X1),X2)=singleton(X1)|~(in(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(25, negated_conjecture,?[X3]:?[X4]:((~(set_difference(singleton(X3),X4)=singleton(X3))|in(X3,X4))&(set_difference(singleton(X3),X4)=singleton(X3)|~(in(X3,X4)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,((~(set_difference(singleton(esk3_0),esk4_0)=singleton(esk3_0))|in(esk3_0,esk4_0))&(set_difference(singleton(esk3_0),esk4_0)=singleton(esk3_0)|~(in(esk3_0,esk4_0)))),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(set_difference(singleton(esk3_0),esk4_0)=singleton(esk3_0)|~in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,negated_conjecture,(in(esk3_0,esk4_0)|set_difference(singleton(esk3_0),esk4_0)!=singleton(esk3_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(30,negated_conjecture,(in(esk3_0,esk4_0)),inference(spm,[status(thm)],[28,16,theory(equality)])).
% cnf(35,negated_conjecture,(set_difference(singleton(esk3_0),esk4_0)=singleton(esk3_0)|$false),inference(rw,[status(thm)],[27,30,theory(equality)])).
% cnf(36,negated_conjecture,(set_difference(singleton(esk3_0),esk4_0)=singleton(esk3_0)),inference(cn,[status(thm)],[35,theory(equality)])).
% cnf(37,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[17,36,theory(equality)])).
% cnf(38,negated_conjecture,($false),inference(rw,[status(thm)],[37,30,theory(equality)])).
% cnf(39,negated_conjecture,($false),inference(cn,[status(thm)],[38,theory(equality)])).
% cnf(40,negated_conjecture,($false),39,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 16
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 2
% # Generated clauses                  : 6
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 6
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 7
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 3
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # 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:    13 leaves,   1.08+/-0.266 terms/leaf
% # Paramod-from index:            4 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           12 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.008 s
% # System time            : 0.003 s
% # Total time             : 0.011 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/SystemOnTPTP1093/SET924+1.tptp
% 
%------------------------------------------------------------------------------