TSTP Solution File: NUM560+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM560+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:11:25 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP16099/NUM560+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16099/NUM560+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16099/NUM560+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 16231
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(68, conjecture,((aSet0(sdtlbdtrb0(xF,xy))&![X1]:(aElementOf0(X1,sdtlbdtrb0(xF,xy))<=>(aElementOf0(X1,szDzozmdt0(xF))&sdtlpdtrp0(xF,X1)=xy)))=>(![X1]:(aElementOf0(X1,sdtlbdtrb0(xF,xy))=>aElementOf0(X1,szDzozmdt0(xF)))|aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)))),file('/tmp/SRASS.s.p', m__)).
% fof(69, negated_conjecture,~(((aSet0(sdtlbdtrb0(xF,xy))&![X1]:(aElementOf0(X1,sdtlbdtrb0(xF,xy))<=>(aElementOf0(X1,szDzozmdt0(xF))&sdtlpdtrp0(xF,X1)=xy)))=>(![X1]:(aElementOf0(X1,sdtlbdtrb0(xF,xy))=>aElementOf0(X1,szDzozmdt0(xF)))|aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))))),inference(assume_negation,[status(cth)],[68])).
% fof(382, negated_conjecture,((aSet0(sdtlbdtrb0(xF,xy))&![X1]:((~(aElementOf0(X1,sdtlbdtrb0(xF,xy)))|(aElementOf0(X1,szDzozmdt0(xF))&sdtlpdtrp0(xF,X1)=xy))&((~(aElementOf0(X1,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X1)=xy))|aElementOf0(X1,sdtlbdtrb0(xF,xy)))))&(?[X1]:(aElementOf0(X1,sdtlbdtrb0(xF,xy))&~(aElementOf0(X1,szDzozmdt0(xF))))&~(aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))))),inference(fof_nnf,[status(thm)],[69])).
% fof(383, negated_conjecture,((aSet0(sdtlbdtrb0(xF,xy))&![X2]:((~(aElementOf0(X2,sdtlbdtrb0(xF,xy)))|(aElementOf0(X2,szDzozmdt0(xF))&sdtlpdtrp0(xF,X2)=xy))&((~(aElementOf0(X2,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X2)=xy))|aElementOf0(X2,sdtlbdtrb0(xF,xy)))))&(?[X3]:(aElementOf0(X3,sdtlbdtrb0(xF,xy))&~(aElementOf0(X3,szDzozmdt0(xF))))&~(aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))))),inference(variable_rename,[status(thm)],[382])).
% fof(384, negated_conjecture,((aSet0(sdtlbdtrb0(xF,xy))&![X2]:((~(aElementOf0(X2,sdtlbdtrb0(xF,xy)))|(aElementOf0(X2,szDzozmdt0(xF))&sdtlpdtrp0(xF,X2)=xy))&((~(aElementOf0(X2,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X2)=xy))|aElementOf0(X2,sdtlbdtrb0(xF,xy)))))&((aElementOf0(esk14_0,sdtlbdtrb0(xF,xy))&~(aElementOf0(esk14_0,szDzozmdt0(xF))))&~(aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))))),inference(skolemize,[status(esa)],[383])).
% fof(385, negated_conjecture,![X2]:((((~(aElementOf0(X2,sdtlbdtrb0(xF,xy)))|(aElementOf0(X2,szDzozmdt0(xF))&sdtlpdtrp0(xF,X2)=xy))&((~(aElementOf0(X2,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X2)=xy))|aElementOf0(X2,sdtlbdtrb0(xF,xy))))&aSet0(sdtlbdtrb0(xF,xy)))&((aElementOf0(esk14_0,sdtlbdtrb0(xF,xy))&~(aElementOf0(esk14_0,szDzozmdt0(xF))))&~(aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))))),inference(shift_quantors,[status(thm)],[384])).
% fof(386, negated_conjecture,![X2]:(((((aElementOf0(X2,szDzozmdt0(xF))|~(aElementOf0(X2,sdtlbdtrb0(xF,xy))))&(sdtlpdtrp0(xF,X2)=xy|~(aElementOf0(X2,sdtlbdtrb0(xF,xy)))))&((~(aElementOf0(X2,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X2)=xy))|aElementOf0(X2,sdtlbdtrb0(xF,xy))))&aSet0(sdtlbdtrb0(xF,xy)))&((aElementOf0(esk14_0,sdtlbdtrb0(xF,xy))&~(aElementOf0(esk14_0,szDzozmdt0(xF))))&~(aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))))),inference(distribute,[status(thm)],[385])).
% cnf(388,negated_conjecture,(~aElementOf0(esk14_0,szDzozmdt0(xF))),inference(split_conjunct,[status(thm)],[386])).
% cnf(389,negated_conjecture,(aElementOf0(esk14_0,sdtlbdtrb0(xF,xy))),inference(split_conjunct,[status(thm)],[386])).
% cnf(393,negated_conjecture,(aElementOf0(X1,szDzozmdt0(xF))|~aElementOf0(X1,sdtlbdtrb0(xF,xy))),inference(split_conjunct,[status(thm)],[386])).
% cnf(427,negated_conjecture,(~aElementOf0(esk14_0,sdtlbdtrb0(xF,xy))),inference(spm,[status(thm)],[388,393,theory(equality)])).
% cnf(429,negated_conjecture,($false),inference(rw,[status(thm)],[427,389,theory(equality)])).
% cnf(430,negated_conjecture,($false),inference(cn,[status(thm)],[429,theory(equality)])).
% cnf(431,negated_conjecture,($false),430,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 156
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 156
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 12
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 19
% # Paramodulations : 8
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 105
% # ...number of literals in the above : 449
% # Clause-clause subsumption calls (NU) : 1196
% # Rec. Clause-clause subsumption calls : 269
% # 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: 39 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-from index: 17 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 33 leaves, 1.03+/-0.171 terms/leaf
% # -------------------------------------------------
% # User time : 0.037 s
% # System time : 0.003 s
% # Total time : 0.040 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP16099/NUM560+2.tptp
%
%------------------------------------------------------------------------------