TSTP Solution File: SET925+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET925+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 : art01.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:36 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP760/SET925+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP760/SET925+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP760/SET925+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 856
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 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)=empty_set<=>in(X1,X2)),file('/tmp/SRASS.s.p', l36_zfmisc_1)).
% fof(6, conjecture,![X1]:![X2]:(set_difference(singleton(X1),X2)=empty_set<=>in(X1,X2)),file('/tmp/SRASS.s.p', t68_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:(set_difference(singleton(X1),X2)=empty_set<=>in(X1,X2))),inference(assume_negation,[status(cth)],[6])).
% fof(13, 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)],[2])).
% fof(14, 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)],[13])).
% cnf(15,plain,(set_difference(singleton(X1),X2)=empty_set|~in(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(in(X1,X2)|set_difference(singleton(X1),X2)!=empty_set),inference(split_conjunct,[status(thm)],[14])).
% fof(24, negated_conjecture,?[X1]:?[X2]:((~(set_difference(singleton(X1),X2)=empty_set)|~(in(X1,X2)))&(set_difference(singleton(X1),X2)=empty_set|in(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(25, negated_conjecture,?[X3]:?[X4]:((~(set_difference(singleton(X3),X4)=empty_set)|~(in(X3,X4)))&(set_difference(singleton(X3),X4)=empty_set|in(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,((~(set_difference(singleton(esk3_0),esk4_0)=empty_set)|~(in(esk3_0,esk4_0)))&(set_difference(singleton(esk3_0),esk4_0)=empty_set|in(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(in(esk3_0,esk4_0)|set_difference(singleton(esk3_0),esk4_0)=empty_set),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,negated_conjecture,(~in(esk3_0,esk4_0)|set_difference(singleton(esk3_0),esk4_0)!=empty_set),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,negated_conjecture,(set_difference(singleton(esk3_0),esk4_0)!=empty_set),inference(csr,[status(thm)],[28,16])).
% cnf(30,negated_conjecture,(in(esk3_0,esk4_0)),inference(sr,[status(thm)],[27,29,theory(equality)])).
% cnf(32,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[29,15,theory(equality)])).
% cnf(33,negated_conjecture,($false),inference(rw,[status(thm)],[32,30,theory(equality)])).
% cnf(34,negated_conjecture,($false),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(35,negated_conjecture,($false),34,['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 : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 1
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # 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: 15 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP760/SET925+1.tptp
%
%------------------------------------------------------------------------------