TSTP Solution File: NUM533+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM533+2 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 20:01:38 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP7451/NUM533+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7451/NUM533+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7451/NUM533+2.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 7583
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(15, conjecture,((((![X1]:(aElementOf0(X1,xA)=>aElementOf0(X1,xB))&aSubsetOf0(xA,xB))&![X1]:(aElementOf0(X1,xB)=>aElementOf0(X1,xC)))&aSubsetOf0(xB,xC))=>(![X1]:(aElementOf0(X1,xA)=>aElementOf0(X1,xC))|aSubsetOf0(xA,xC))),file('/tmp/SRASS.s.p', m__)).
% fof(16, negated_conjecture,~(((((![X1]:(aElementOf0(X1,xA)=>aElementOf0(X1,xB))&aSubsetOf0(xA,xB))&![X1]:(aElementOf0(X1,xB)=>aElementOf0(X1,xC)))&aSubsetOf0(xB,xC))=>(![X1]:(aElementOf0(X1,xA)=>aElementOf0(X1,xC))|aSubsetOf0(xA,xC)))),inference(assume_negation,[status(cth)],[15])).
% fof(71, negated_conjecture,((((![X1]:(~(aElementOf0(X1,xA))|aElementOf0(X1,xB))&aSubsetOf0(xA,xB))&![X1]:(~(aElementOf0(X1,xB))|aElementOf0(X1,xC)))&aSubsetOf0(xB,xC))&(?[X1]:(aElementOf0(X1,xA)&~(aElementOf0(X1,xC)))&~(aSubsetOf0(xA,xC)))),inference(fof_nnf,[status(thm)],[16])).
% fof(72, negated_conjecture,((((![X2]:(~(aElementOf0(X2,xA))|aElementOf0(X2,xB))&aSubsetOf0(xA,xB))&![X3]:(~(aElementOf0(X3,xB))|aElementOf0(X3,xC)))&aSubsetOf0(xB,xC))&(?[X4]:(aElementOf0(X4,xA)&~(aElementOf0(X4,xC)))&~(aSubsetOf0(xA,xC)))),inference(variable_rename,[status(thm)],[71])).
% fof(73, negated_conjecture,((((![X2]:(~(aElementOf0(X2,xA))|aElementOf0(X2,xB))&aSubsetOf0(xA,xB))&![X3]:(~(aElementOf0(X3,xB))|aElementOf0(X3,xC)))&aSubsetOf0(xB,xC))&((aElementOf0(esk3_0,xA)&~(aElementOf0(esk3_0,xC)))&~(aSubsetOf0(xA,xC)))),inference(skolemize,[status(esa)],[72])).
% fof(74, negated_conjecture,![X2]:![X3]:((((~(aElementOf0(X3,xB))|aElementOf0(X3,xC))&((~(aElementOf0(X2,xA))|aElementOf0(X2,xB))&aSubsetOf0(xA,xB)))&aSubsetOf0(xB,xC))&((aElementOf0(esk3_0,xA)&~(aElementOf0(esk3_0,xC)))&~(aSubsetOf0(xA,xC)))),inference(shift_quantors,[status(thm)],[73])).
% cnf(76,negated_conjecture,(~aElementOf0(esk3_0,xC)),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,negated_conjecture,(aElementOf0(esk3_0,xA)),inference(split_conjunct,[status(thm)],[74])).
% cnf(80,negated_conjecture,(aElementOf0(X1,xB)|~aElementOf0(X1,xA)),inference(split_conjunct,[status(thm)],[74])).
% cnf(81,negated_conjecture,(aElementOf0(X1,xC)|~aElementOf0(X1,xB)),inference(split_conjunct,[status(thm)],[74])).
% cnf(84,negated_conjecture,(aElementOf0(esk3_0,xB)),inference(spm,[status(thm)],[80,77,theory(equality)])).
% cnf(85,negated_conjecture,(~aElementOf0(esk3_0,xB)),inference(spm,[status(thm)],[76,81,theory(equality)])).
% cnf(141,negated_conjecture,($false),inference(rw,[status(thm)],[85,84,theory(equality)])).
% cnf(142,negated_conjecture,($false),inference(cn,[status(thm)],[141,theory(equality)])).
% cnf(143,negated_conjecture,($false),142,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 54
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 54
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 27
% # ...of the previous two non-trivial : 21
% # Contextual simplify-reflections : 2
% # Paramodulations : 27
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 15
% # ...number of literals in the above : 35
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 20
% # 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: 32 leaves, 1.28+/-0.672 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.21+/-0.619 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 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/SystemOnTPTP7451/NUM533+2.tptp
%
%------------------------------------------------------------------------------