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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : CSR031+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.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 : Tue Dec 28 22:55:56 EST 2010

% Result   : Theorem 0.97s
% Output   : Solution 0.97s
% 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/SystemOnTPTP9058/CSR031+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP9058/CSR031+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9058/CSR031+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 9154
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,individual(c_tptptptpcol_16_8398),file('/tmp/SRASS.s.p', just6)).
% fof(7, axiom,![X8]:![X7]:(disjointwith(X8,X7)=>collection(X8)),file('/tmp/SRASS.s.p', just34)).
% fof(12, axiom,![X3]:~((collection(X3)&individual(X3))),file('/tmp/SRASS.s.p', just4)).
% fof(56, conjecture,~(disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488)),file('/tmp/SRASS.s.p', query31)).
% fof(57, negated_conjecture,~(~(disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488))),inference(assume_negation,[status(cth)],[56])).
% fof(58, negated_conjecture,disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),inference(fof_simplification,[status(thm)],[57,theory(equality)])).
% cnf(68,plain,(individual(c_tptptptpcol_16_8398)),inference(split_conjunct,[status(thm)],[4])).
% fof(75, plain,![X8]:![X7]:(~(disjointwith(X8,X7))|collection(X8)),inference(fof_nnf,[status(thm)],[7])).
% fof(76, plain,![X9]:![X10]:(~(disjointwith(X9,X10))|collection(X9)),inference(variable_rename,[status(thm)],[75])).
% cnf(77,plain,(collection(X1)|~disjointwith(X1,X2)),inference(split_conjunct,[status(thm)],[76])).
% fof(88, plain,![X3]:(~(collection(X3))|~(individual(X3))),inference(fof_nnf,[status(thm)],[12])).
% fof(89, plain,![X4]:(~(collection(X4))|~(individual(X4))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(~individual(X1)|~collection(X1)),inference(split_conjunct,[status(thm)],[89])).
% cnf(204,negated_conjecture,(disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488)),inference(split_conjunct,[status(thm)],[58])).
% cnf(205,plain,(~collection(c_tptptptpcol_16_8398)),inference(spm,[status(thm)],[90,68,theory(equality)])).
% cnf(209,negated_conjecture,(collection(c_tptptptpcol_16_8398)),inference(spm,[status(thm)],[77,204,theory(equality)])).
% cnf(240,negated_conjecture,($false),inference(sr,[status(thm)],[209,205,theory(equality)])).
% cnf(241,negated_conjecture,($false),240,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 60
% # ...of these trivial                : 0
% # ...subsumed                        : 12
% # ...remaining for further processing: 48
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 28
% # ...of the previous two non-trivial : 22
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 28
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 47
% #    Positive orientable unit clauses: 13
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 33
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 29
% # Rec. Clause-clause subsumption calls : 29
% # 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:    45 leaves,   1.47+/-1.087 terms/leaf
% # Paramod-from index:           16 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           36 leaves,   1.33+/-0.745 terms/leaf
% # -------------------------------------------------
% # User time              : 0.013 s
% # System time            : 0.004 s
% # Total time             : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP9058/CSR031+1.tptp
% 
%------------------------------------------------------------------------------