%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM457+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 : 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 19:17:34 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP18401/NUM457+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18401/NUM457+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18401/NUM457+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 18497
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aNaturalNumber0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(5, axiom,![X1]:(aNaturalNumber0(X1)=>(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),file('/tmp/SRASS.s.p', m_MulZero)).
% fof(6, axiom,![X1]:(aNaturalNumber0(X1)=>(~(X1=sz00)=>![X2]:![X3]:((aNaturalNumber0(X2)&aNaturalNumber0(X3))=>((sdtasdt0(X1,X2)=sdtasdt0(X1,X3)|sdtasdt0(X2,X1)=sdtasdt0(X3,X1))=>X2=X3)))),file('/tmp/SRASS.s.p', mMulCanc)).
% fof(7, axiom,(aNaturalNumber0(xm)&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__624)).
% fof(18, conjecture,(sdtasdt0(xm,xn)=sz00=>(xm=sz00|xn=sz00)),file('/tmp/SRASS.s.p', m__)).
% fof(19, negated_conjecture,~((sdtasdt0(xm,xn)=sz00=>(xm=sz00|xn=sz00))),inference(assume_negation,[status(cth)],[18])).
% cnf(21,plain,(aNaturalNumber0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(31, plain,![X1]:(~(aNaturalNumber0(X1))|(sdtasdt0(X1,sz00)=sz00&sz00=sdtasdt0(sz00,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(32, plain,![X2]:(~(aNaturalNumber0(X2))|(sdtasdt0(X2,sz00)=sz00&sz00=sdtasdt0(sz00,X2))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X2]:((sdtasdt0(X2,sz00)=sz00|~(aNaturalNumber0(X2)))&(sz00=sdtasdt0(sz00,X2)|~(aNaturalNumber0(X2)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(sz00=sdtasdt0(sz00,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X1]:(~(aNaturalNumber0(X1))|(X1=sz00|![X2]:![X3]:((~(aNaturalNumber0(X2))|~(aNaturalNumber0(X3)))|((~(sdtasdt0(X1,X2)=sdtasdt0(X1,X3))&~(sdtasdt0(X2,X1)=sdtasdt0(X3,X1)))|X2=X3)))),inference(fof_nnf,[status(thm)],[6])).
% fof(37, plain,![X4]:(~(aNaturalNumber0(X4))|(X4=sz00|![X5]:![X6]:((~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6)))|((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))|X5=X6)))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:((((~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6)))|((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))&~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4)))|X5=X6))|X4=sz00)|~(aNaturalNumber0(X4))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:(((((~(sdtasdt0(X4,X5)=sdtasdt0(X4,X6))|X5=X6)|(~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6))))|X4=sz00)|~(aNaturalNumber0(X4)))&((((~(sdtasdt0(X5,X4)=sdtasdt0(X6,X4))|X5=X6)|(~(aNaturalNumber0(X5))|~(aNaturalNumber0(X6))))|X4=sz00)|~(aNaturalNumber0(X4)))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(X1=sz00|X3=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtasdt0(X3,X1)!=sdtasdt0(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[7])).
% cnf(43,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[7])).
% fof(82, negated_conjecture,(sdtasdt0(xm,xn)=sz00&(~(xm=sz00)&~(xn=sz00))),inference(fof_nnf,[status(thm)],[19])).
% cnf(83,negated_conjecture,(xn!=sz00),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(xm!=sz00),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,negated_conjecture,(sdtasdt0(xm,xn)=sz00),inference(split_conjunct,[status(thm)],[82])).
% cnf(191,negated_conjecture,(sz00=xn|X1=xm|sdtasdt0(X1,xn)!=sz00|~aNaturalNumber0(xm)|~aNaturalNumber0(X1)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[40,85,theory(equality)])).
% cnf(206,negated_conjecture,(sz00=xn|X1=xm|sdtasdt0(X1,xn)!=sz00|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[191,43,theory(equality)])).
% cnf(207,negated_conjecture,(sz00=xn|X1=xm|sdtasdt0(X1,xn)!=sz00|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[206,42,theory(equality)])).
% cnf(208,negated_conjecture,(sz00=xn|X1=xm|sdtasdt0(X1,xn)!=sz00|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[207,theory(equality)])).
% cnf(209,negated_conjecture,(X1=xm|sdtasdt0(X1,xn)!=sz00|~aNaturalNumber0(X1)),inference(sr,[status(thm)],[208,83,theory(equality)])).
% cnf(417,negated_conjecture,(sz00=xm|~aNaturalNumber0(sz00)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[209,34,theory(equality)])).
% cnf(425,negated_conjecture,(sz00=xm|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[417,21,theory(equality)])).
% cnf(426,negated_conjecture,(sz00=xm|$false|$false),inference(rw,[status(thm)],[425,42,theory(equality)])).
% cnf(427,negated_conjecture,(sz00=xm),inference(cn,[status(thm)],[426,theory(equality)])).
% cnf(428,negated_conjecture,($false),inference(sr,[status(thm)],[427,84,theory(equality)])).
% cnf(429,negated_conjecture,($false),428,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 57
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 163
% # ...of the previous two non-trivial : 147
% # Contextual simplify-reflections : 0
% # Paramodulations : 159
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 21
% # Current number of unprocessed clauses: 146
% # ...number of literals in the above : 663
% # Clause-clause subsumption calls (NU) : 128
% # Rec. Clause-clause subsumption calls : 96
% # 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: 29 leaves, 1.45+/-1.302 terms/leaf
% # Paramod-from index: 18 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 23 leaves, 1.43+/-1.279 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.002 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18401/NUM457+1.tptp
%
%------------------------------------------------------------------------------