TSTP Solution File: SET899+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET899+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 : art06.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:16:54 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP2376/SET899+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2376/SET899+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2376/SET899+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 2473
% 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(3, axiom,![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),file('/tmp/SRASS.s.p', l3_zfmisc_1)).
% fof(6, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),file('/tmp/SRASS.s.p', t40_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3)))))),inference(assume_negation,[status(cth)],[6])).
% fof(15, plain,![X1]:![X2]:![X3]:(~(subset(X1,X2))|(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X4]:![X5]:![X6]:(~(subset(X4,X5))|(in(X6,X4)|subset(X4,set_difference(X5,singleton(X6))))),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(subset(X1,set_difference(X2,singleton(X3)))|in(X3,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(24, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&(~(in(X3,X1))&~(subset(X1,set_difference(X2,singleton(X3)))))),inference(fof_nnf,[status(thm)],[7])).
% fof(25, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&(~(in(X6,X4))&~(subset(X4,set_difference(X5,singleton(X6)))))),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,(subset(esk3_0,esk4_0)&(~(in(esk5_0,esk3_0))&~(subset(esk3_0,set_difference(esk4_0,singleton(esk5_0)))))),inference(skolemize,[status(esa)],[25])).
% cnf(27,negated_conjecture,(~subset(esk3_0,set_difference(esk4_0,singleton(esk5_0)))),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,negated_conjecture,(~in(esk5_0,esk3_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(29,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[26])).
% cnf(30,negated_conjecture,(in(esk5_0,esk3_0)|~subset(esk3_0,esk4_0)),inference(spm,[status(thm)],[27,17,theory(equality)])).
% cnf(31,negated_conjecture,(in(esk5_0,esk3_0)|$false),inference(rw,[status(thm)],[30,29,theory(equality)])).
% cnf(32,negated_conjecture,(in(esk5_0,esk3_0)),inference(cn,[status(thm)],[31,theory(equality)])).
% cnf(33,negated_conjecture,($false),inference(sr,[status(thm)],[32,28,theory(equality)])).
% cnf(34,negated_conjecture,($false),33,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # 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 : 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 : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 16 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 15 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.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP2376/SET899+1.tptp
%
%------------------------------------------------------------------------------