TSTP Solution File: SET923+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET923+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:19 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP500/SET923+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP500/SET923+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP500/SET923+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 597
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(2, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(7, conjecture,![X1]:![X2]:~(((set_difference(X1,singleton(X2))=empty_set&~(X1=empty_set))&~(X1=singleton(X2)))),file('/tmp/SRASS.s.p', t66_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:~(((set_difference(X1,singleton(X2))=empty_set&~(X1=empty_set))&~(X1=singleton(X2))))),inference(assume_negation,[status(cth)],[7])).
% fof(10, plain,![X1]:![X2]:((~(subset(X1,singleton(X2)))|(X1=empty_set|X1=singleton(X2)))&((~(X1=empty_set)&~(X1=singleton(X2)))|subset(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(11, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)&~(X3=singleton(X4)))|subset(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)|subset(X3,singleton(X4)))&(~(X3=singleton(X4))|subset(X3,singleton(X4))))),inference(distribute,[status(thm)],[11])).
% cnf(15,plain,(X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[12])).
% fof(16, 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)],[2])).
% fof(17, 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)],[16])).
% cnf(19,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[17])).
% fof(29, negated_conjecture,?[X1]:?[X2]:((set_difference(X1,singleton(X2))=empty_set&~(X1=empty_set))&~(X1=singleton(X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(30, negated_conjecture,?[X3]:?[X4]:((set_difference(X3,singleton(X4))=empty_set&~(X3=empty_set))&~(X3=singleton(X4))),inference(variable_rename,[status(thm)],[29])).
% fof(31, negated_conjecture,((set_difference(esk3_0,singleton(esk4_0))=empty_set&~(esk3_0=empty_set))&~(esk3_0=singleton(esk4_0))),inference(skolemize,[status(esa)],[30])).
% cnf(32,negated_conjecture,(esk3_0!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,negated_conjecture,(esk3_0!=empty_set),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,negated_conjecture,(set_difference(esk3_0,singleton(esk4_0))=empty_set),inference(split_conjunct,[status(thm)],[31])).
% cnf(35,negated_conjecture,(subset(esk3_0,singleton(esk4_0))),inference(spm,[status(thm)],[19,34,theory(equality)])).
% cnf(39,negated_conjecture,(singleton(esk4_0)=esk3_0|empty_set=esk3_0),inference(spm,[status(thm)],[15,35,theory(equality)])).
% cnf(40,negated_conjecture,(esk3_0=empty_set),inference(sr,[status(thm)],[39,32,theory(equality)])).
% cnf(41,negated_conjecture,($false),inference(sr,[status(thm)],[40,33,theory(equality)])).
% cnf(42,negated_conjecture,($false),41,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # 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 : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 16 leaves, 1.19+/-0.390 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 15 leaves, 1.13+/-0.340 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.005 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP500/SET923+1.tptp
%
%------------------------------------------------------------------------------