%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM491+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 19:32:44 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/SystemOnTPTP29167/NUM491+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29167/NUM491+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29167/NUM491+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 29263
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(17, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>(doDivides0(X1,X2)<=>?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))),file('/tmp/SRASS.s.p', mDefDiv)).
% fof(21, axiom,((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp)),file('/tmp/SRASS.s.p', m__1837)).
% fof(48, conjecture,doDivides0(xp,sdtasdt0(xp,xm)),file('/tmp/SRASS.s.p', m__)).
% fof(49, negated_conjecture,~(doDivides0(xp,sdtasdt0(xp,xm))),inference(assume_negation,[status(cth)],[48])).
% fof(52, negated_conjecture,~(doDivides0(xp,sdtasdt0(xp,xm))),inference(fof_simplification,[status(thm)],[49,theory(equality)])).
% fof(56, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(57, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(121, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((~(doDivides0(X1,X2))|?[X3]:(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&(![X3]:(~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|doDivides0(X1,X2)))),inference(fof_nnf,[status(thm)],[17])).
% fof(122, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|?[X6]:(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5))))&(![X7]:(~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5)))),inference(skolemize,[status(esa)],[122])).
% fof(124, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))&(~(doDivides0(X4,X5))|(aNaturalNumber0(esk2_2(X4,X5))&X5=sdtasdt0(X4,esk2_2(X4,X5)))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[123])).
% fof(125, plain,![X4]:![X5]:![X7]:((((~(aNaturalNumber0(X7))|~(X5=sdtasdt0(X4,X7)))|doDivides0(X4,X5))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((aNaturalNumber0(esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&((X5=sdtasdt0(X4,esk2_2(X4,X5))|~(doDivides0(X4,X5)))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))),inference(distribute,[status(thm)],[124])).
% cnf(128,plain,(doDivides0(X2,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|X1!=sdtasdt0(X2,X3)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[125])).
% cnf(138,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[21])).
% cnf(139,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[21])).
% cnf(237,negated_conjecture,(~doDivides0(xp,sdtasdt0(xp,xm))),inference(split_conjunct,[status(thm)],[52])).
% cnf(421,plain,(doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)|~aNaturalNumber0(sdtasdt0(X1,X2))),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(4841,plain,(doDivides0(X1,sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(csr,[status(thm)],[421,58])).
% cnf(4843,negated_conjecture,(~aNaturalNumber0(xm)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[237,4841,theory(equality)])).
% cnf(4889,negated_conjecture,($false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[4843,139,theory(equality)])).
% cnf(4890,negated_conjecture,($false|$false),inference(rw,[status(thm)],[4889,138,theory(equality)])).
% cnf(4891,negated_conjecture,($false),inference(cn,[status(thm)],[4890,theory(equality)])).
% cnf(4892,negated_conjecture,($false),4891,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 486
% # ...of these trivial : 17
% # ...subsumed : 140
% # ...remaining for further processing: 329
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 10
% # Generated clauses : 1647
% # ...of the previous two non-trivial : 1268
% # Contextual simplify-reflections : 50
% # Paramodulations : 1595
% # Factorizations : 2
% # Equation resolutions : 50
% # Current number of processed clauses: 235
% # Positive orientable unit clauses: 62
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 167
% # Current number of unprocessed clauses: 876
% # ...number of literals in the above : 3958
% # Clause-clause subsumption calls (NU) : 1462
% # Rec. Clause-clause subsumption calls : 919
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 214 leaves, 1.23+/-0.748 terms/leaf
% # Paramod-from index: 141 leaves, 1.09+/-0.313 terms/leaf
% # Paramod-into index: 192 leaves, 1.16+/-0.669 terms/leaf
% # -------------------------------------------------
% # User time : 0.096 s
% # System time : 0.006 s
% # Total time : 0.102 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.33 WC
% FINAL PrfWatch: 0.24 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP29167/NUM491+1.tptp
%
%------------------------------------------------------------------------------