%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM525+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 : 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 19:59:03 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP6111/NUM525+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6111/NUM525+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6111/NUM525+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 6243
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(4, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))),file('/tmp/SRASS.s.p', mMulAsso)).
% fof(9, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>((~(X1=sz00)&doDivides0(X1,X2))=>![X3]:(X3=sdtsldt0(X2,X1)<=>(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3))))),file('/tmp/SRASS.s.p', mDefQuot)).
% fof(13, axiom,(((((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp))&~(xn=sz00))&~(xm=sz00))&~(xp=sz00)),file('/tmp/SRASS.s.p', m__2987)).
% fof(15, axiom,sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn),file('/tmp/SRASS.s.p', m__3014)).
% fof(17, axiom,(doDivides0(xp,sdtasdt0(xn,xn))&doDivides0(xp,xn)),file('/tmp/SRASS.s.p', m__3046)).
% fof(18, axiom,xq=sdtsldt0(xn,xp),file('/tmp/SRASS.s.p', m__3059)).
% fof(46, conjecture,sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))),file('/tmp/SRASS.s.p', m__)).
% fof(47, negated_conjecture,~(sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))),inference(assume_negation,[status(cth)],[46])).
% fof(51, negated_conjecture,~(sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% fof(56, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(57, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[56])).
% cnf(58,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(60, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(84, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|((X1=sz00|~(doDivides0(X1,X2)))|![X3]:((~(X3=sdtsldt0(X2,X1))|(aNaturalNumber0(X3)&X2=sdtasdt0(X1,X3)))&((~(aNaturalNumber0(X3))|~(X2=sdtasdt0(X1,X3)))|X3=sdtsldt0(X2,X1))))),inference(fof_nnf,[status(thm)],[9])).
% fof(85, plain,![X4]:![X5]:((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|((X4=sz00|~(doDivides0(X4,X5)))|![X6]:((~(X6=sdtsldt0(X5,X4))|(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4))))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X4]:![X5]:![X6]:((((~(X6=sdtsldt0(X5,X4))|(aNaturalNumber0(X6)&X5=sdtasdt0(X4,X6)))&((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))),inference(shift_quantors,[status(thm)],[85])).
% fof(87, plain,![X4]:![X5]:![X6]:(((((aNaturalNumber0(X6)|~(X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))&(((X5=sdtasdt0(X4,X6)|~(X6=sdtsldt0(X5,X4)))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))))&((((~(aNaturalNumber0(X6))|~(X5=sdtasdt0(X4,X6)))|X6=sdtsldt0(X5,X4))|(X4=sz00|~(doDivides0(X4,X5))))|(~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5))))),inference(distribute,[status(thm)],[86])).
% cnf(89,plain,(X2=sz00|X1=sdtasdt0(X2,X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)|X3!=sdtsldt0(X1,X2)),inference(split_conjunct,[status(thm)],[87])).
% cnf(90,plain,(X2=sz00|aNaturalNumber0(X3)|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~doDivides0(X2,X1)|X3!=sdtsldt0(X1,X2)),inference(split_conjunct,[status(thm)],[87])).
% cnf(101,plain,(xp!=sz00),inference(split_conjunct,[status(thm)],[13])).
% cnf(104,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[13])).
% cnf(106,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[13])).
% cnf(110,plain,(sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn)),inference(split_conjunct,[status(thm)],[15])).
% cnf(112,plain,(doDivides0(xp,xn)),inference(split_conjunct,[status(thm)],[17])).
% cnf(114,plain,(xq=sdtsldt0(xn,xp)),inference(split_conjunct,[status(thm)],[18])).
% cnf(238,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xm,xm))!=sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(239,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))!=sdtasdt0(xn,xn)),inference(rw,[status(thm)],[238,110,theory(equality)])).
% cnf(594,plain,(sz00=xp|aNaturalNumber0(X1)|xq!=X1|~doDivides0(xp,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[90,114,theory(equality)])).
% cnf(595,plain,(sz00=xp|aNaturalNumber0(X1)|xq!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[594,112,theory(equality)])).
% cnf(596,plain,(sz00=xp|aNaturalNumber0(X1)|xq!=X1|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[595,104,theory(equality)])).
% cnf(597,plain,(sz00=xp|aNaturalNumber0(X1)|xq!=X1|$false|$false|$false),inference(rw,[status(thm)],[596,106,theory(equality)])).
% cnf(598,plain,(sz00=xp|aNaturalNumber0(X1)|xq!=X1),inference(cn,[status(thm)],[597,theory(equality)])).
% cnf(599,plain,(aNaturalNumber0(X1)|xq!=X1),inference(sr,[status(thm)],[598,101,theory(equality)])).
% cnf(601,plain,(sdtasdt0(xp,X1)=xn|sz00=xp|xq!=X1|~doDivides0(xp,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[89,114,theory(equality)])).
% cnf(602,plain,(sdtasdt0(xp,X1)=xn|sz00=xp|xq!=X1|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[601,112,theory(equality)])).
% cnf(603,plain,(sdtasdt0(xp,X1)=xn|sz00=xp|xq!=X1|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[602,104,theory(equality)])).
% cnf(604,plain,(sdtasdt0(xp,X1)=xn|sz00=xp|xq!=X1|$false|$false|$false),inference(rw,[status(thm)],[603,106,theory(equality)])).
% cnf(605,plain,(sdtasdt0(xp,X1)=xn|sz00=xp|xq!=X1),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(606,plain,(sdtasdt0(xp,X1)=xn|xq!=X1),inference(sr,[status(thm)],[605,101,theory(equality)])).
% cnf(963,plain,(sdtasdt0(xp,xq)=xn),inference(er,[status(thm)],[606,theory(equality)])).
% cnf(969,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(xq)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[61,963,theory(equality)])).
% cnf(993,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(xq)|$false),inference(rw,[status(thm)],[969,104,theory(equality)])).
% cnf(994,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(xq)),inference(cn,[status(thm)],[993,theory(equality)])).
% cnf(1084,plain,(aNaturalNumber0(xq)),inference(er,[status(thm)],[599,theory(equality)])).
% cnf(1175,plain,(sdtasdt0(xp,sdtasdt0(xq,X1))=sdtasdt0(xn,X1)|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[994,1084,theory(equality)])).
% cnf(1176,plain,(sdtasdt0(xp,sdtasdt0(xq,X1))=sdtasdt0(xn,X1)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[1175,theory(equality)])).
% cnf(1193,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xn,xq))!=sdtasdt0(xn,xn)|~aNaturalNumber0(xq)),inference(spm,[status(thm)],[239,1176,theory(equality)])).
% cnf(1196,plain,(sdtasdt0(xp,sdtasdt0(X1,xq))=sdtasdt0(xn,X1)|~aNaturalNumber0(X1)|~aNaturalNumber0(xq)),inference(spm,[status(thm)],[1176,58,theory(equality)])).
% cnf(1232,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xn,xq))!=sdtasdt0(xn,xn)|$false),inference(rw,[status(thm)],[1193,1084,theory(equality)])).
% cnf(1233,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xn,xq))!=sdtasdt0(xn,xn)),inference(cn,[status(thm)],[1232,theory(equality)])).
% cnf(1241,plain,(sdtasdt0(xp,sdtasdt0(X1,xq))=sdtasdt0(xn,X1)|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[1196,1084,theory(equality)])).
% cnf(1242,plain,(sdtasdt0(xp,sdtasdt0(X1,xq))=sdtasdt0(xn,X1)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[1241,theory(equality)])).
% cnf(1953,negated_conjecture,(~aNaturalNumber0(xn)),inference(spm,[status(thm)],[1233,1242,theory(equality)])).
% cnf(1996,negated_conjecture,($false),inference(rw,[status(thm)],[1953,106,theory(equality)])).
% cnf(1997,negated_conjecture,($false),inference(cn,[status(thm)],[1996,theory(equality)])).
% cnf(1998,negated_conjecture,($false),1997,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 185
% # ...of these trivial : 4
% # ...subsumed : 53
% # ...remaining for further processing: 128
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 614
% # ...of the previous two non-trivial : 539
% # Contextual simplify-reflections : 7
% # Paramodulations : 587
% # Factorizations : 2
% # Equation resolutions : 25
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 80
% # Current number of unprocessed clauses: 398
% # ...number of literals in the above : 1753
% # Clause-clause subsumption calls (NU) : 363
% # Rec. Clause-clause subsumption calls : 165
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 110 leaves, 1.29+/-1.003 terms/leaf
% # Paramod-from index: 57 leaves, 1.09+/-0.339 terms/leaf
% # Paramod-into index: 90 leaves, 1.20+/-0.859 terms/leaf
% # -------------------------------------------------
% # User time : 0.039 s
% # System time : 0.008 s
% # Total time : 0.047 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP6111/NUM525+1.tptp
%
%------------------------------------------------------------------------------