TSTP Solution File: NUM561+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM561+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 : 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 : Wed Dec 29 20:06:53 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP22341/NUM561+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22341/NUM561+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22341/NUM561+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 22437
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,aElementOf0(xx,szDzozmdt0(xF)),file('/tmp/SRASS.s.p', m__2911_02)).
% fof(71, conjecture,(?[X1]:(aElementOf0(X1,szDzozmdt0(xF))&sdtlpdtrp0(xF,X1)=sdtlpdtrp0(xF,xx))|aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF)))),file('/tmp/SRASS.s.p', m__)).
% fof(72, negated_conjecture,~((?[X1]:(aElementOf0(X1,szDzozmdt0(xF))&sdtlpdtrp0(xF,X1)=sdtlpdtrp0(xF,xx))|aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))))),inference(assume_negation,[status(cth)],[71])).
% cnf(86,plain,(aElementOf0(xx,szDzozmdt0(xF))),inference(split_conjunct,[status(thm)],[2])).
% fof(400, negated_conjecture,(![X1]:(~(aElementOf0(X1,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X1)=sdtlpdtrp0(xF,xx)))&~(aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))))),inference(fof_nnf,[status(thm)],[72])).
% fof(401, negated_conjecture,(![X2]:(~(aElementOf0(X2,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X2)=sdtlpdtrp0(xF,xx)))&~(aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))))),inference(variable_rename,[status(thm)],[400])).
% fof(402, negated_conjecture,![X2]:((~(aElementOf0(X2,szDzozmdt0(xF)))|~(sdtlpdtrp0(xF,X2)=sdtlpdtrp0(xF,xx)))&~(aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))))),inference(shift_quantors,[status(thm)],[401])).
% cnf(404,negated_conjecture,(sdtlpdtrp0(xF,X1)!=sdtlpdtrp0(xF,xx)|~aElementOf0(X1,szDzozmdt0(xF))),inference(split_conjunct,[status(thm)],[402])).
% cnf(434,negated_conjecture,(~aElementOf0(xx,szDzozmdt0(xF))),inference(er,[status(thm)],[404,theory(equality)])).
% cnf(435,negated_conjecture,($false),inference(rw,[status(thm)],[434,86,theory(equality)])).
% cnf(436,negated_conjecture,($false),inference(cn,[status(thm)],[435,theory(equality)])).
% cnf(437,negated_conjecture,($false),436,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 154
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 154
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 10
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 20
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 112
% # ...number of literals in the above : 491
% # Clause-clause subsumption calls (NU) : 519
% # Rec. Clause-clause subsumption calls : 169
% # 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: 33 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 15 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 29 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP22341/NUM561+2.tptp
%
%------------------------------------------------------------------------------