%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM466+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 19:27:02 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/SystemOnTPTP9898/NUM466+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9898/NUM466+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9898/NUM466+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 10030
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(3, 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(5, axiom,((aNaturalNumber0(xl)&aNaturalNumber0(xm))&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1218)).
% fof(33, conjecture,((((?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&doDivides0(xl,xm))&?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xm,X1)))&doDivides0(xm,xn))=>(?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xl,X1))|doDivides0(xl,xn))),file('/tmp/SRASS.s.p', m__)).
% fof(34, negated_conjecture,~(((((?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&doDivides0(xl,xm))&?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xm,X1)))&doDivides0(xm,xn))=>(?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xl,X1))|doDivides0(xl,xn)))),inference(assume_negation,[status(cth)],[33])).
% fof(37, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(38, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(43, 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)],[3])).
% fof(44, 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)],[43])).
% cnf(45,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[44])).
% cnf(56,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[5])).
% fof(174, negated_conjecture,((((?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1))&doDivides0(xl,xm))&?[X1]:(aNaturalNumber0(X1)&xn=sdtasdt0(xm,X1)))&doDivides0(xm,xn))&(![X1]:(~(aNaturalNumber0(X1))|~(xn=sdtasdt0(xl,X1)))&~(doDivides0(xl,xn)))),inference(fof_nnf,[status(thm)],[34])).
% fof(175, negated_conjecture,((((?[X2]:(aNaturalNumber0(X2)&xm=sdtasdt0(xl,X2))&doDivides0(xl,xm))&?[X3]:(aNaturalNumber0(X3)&xn=sdtasdt0(xm,X3)))&doDivides0(xm,xn))&(![X4]:(~(aNaturalNumber0(X4))|~(xn=sdtasdt0(xl,X4)))&~(doDivides0(xl,xn)))),inference(variable_rename,[status(thm)],[174])).
% fof(176, negated_conjecture,(((((aNaturalNumber0(esk3_0)&xm=sdtasdt0(xl,esk3_0))&doDivides0(xl,xm))&(aNaturalNumber0(esk4_0)&xn=sdtasdt0(xm,esk4_0)))&doDivides0(xm,xn))&(![X4]:(~(aNaturalNumber0(X4))|~(xn=sdtasdt0(xl,X4)))&~(doDivides0(xl,xn)))),inference(skolemize,[status(esa)],[175])).
% fof(177, negated_conjecture,![X4]:(((~(aNaturalNumber0(X4))|~(xn=sdtasdt0(xl,X4)))&~(doDivides0(xl,xn)))&((((aNaturalNumber0(esk3_0)&xm=sdtasdt0(xl,esk3_0))&doDivides0(xl,xm))&(aNaturalNumber0(esk4_0)&xn=sdtasdt0(xm,esk4_0)))&doDivides0(xm,xn))),inference(shift_quantors,[status(thm)],[176])).
% cnf(179,negated_conjecture,(xn=sdtasdt0(xm,esk4_0)),inference(split_conjunct,[status(thm)],[177])).
% cnf(180,negated_conjecture,(aNaturalNumber0(esk4_0)),inference(split_conjunct,[status(thm)],[177])).
% cnf(182,negated_conjecture,(xm=sdtasdt0(xl,esk3_0)),inference(split_conjunct,[status(thm)],[177])).
% cnf(183,negated_conjecture,(aNaturalNumber0(esk3_0)),inference(split_conjunct,[status(thm)],[177])).
% cnf(185,negated_conjecture,(xn!=sdtasdt0(xl,X1)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[177])).
% cnf(440,negated_conjecture,(sdtasdt0(xm,X1)=sdtasdt0(xl,sdtasdt0(esk3_0,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(esk3_0)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[45,182,theory(equality)])).
% cnf(456,negated_conjecture,(sdtasdt0(xm,X1)=sdtasdt0(xl,sdtasdt0(esk3_0,X1))|~aNaturalNumber0(X1)|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[440,183,theory(equality)])).
% cnf(457,negated_conjecture,(sdtasdt0(xm,X1)=sdtasdt0(xl,sdtasdt0(esk3_0,X1))|~aNaturalNumber0(X1)|$false|$false),inference(rw,[status(thm)],[456,56,theory(equality)])).
% cnf(458,negated_conjecture,(sdtasdt0(xm,X1)=sdtasdt0(xl,sdtasdt0(esk3_0,X1))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[457,theory(equality)])).
% cnf(4382,negated_conjecture,(sdtasdt0(xm,X1)!=xn|~aNaturalNumber0(sdtasdt0(esk3_0,X1))|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[185,458,theory(equality)])).
% cnf(5718,negated_conjecture,(~aNaturalNumber0(sdtasdt0(esk3_0,esk4_0))|~aNaturalNumber0(esk4_0)),inference(spm,[status(thm)],[4382,179,theory(equality)])).
% cnf(5741,negated_conjecture,(~aNaturalNumber0(sdtasdt0(esk3_0,esk4_0))|$false),inference(rw,[status(thm)],[5718,180,theory(equality)])).
% cnf(5742,negated_conjecture,(~aNaturalNumber0(sdtasdt0(esk3_0,esk4_0))),inference(cn,[status(thm)],[5741,theory(equality)])).
% cnf(5773,negated_conjecture,(~aNaturalNumber0(esk4_0)|~aNaturalNumber0(esk3_0)),inference(spm,[status(thm)],[5742,39,theory(equality)])).
% cnf(5774,negated_conjecture,($false|~aNaturalNumber0(esk3_0)),inference(rw,[status(thm)],[5773,180,theory(equality)])).
% cnf(5775,negated_conjecture,($false|$false),inference(rw,[status(thm)],[5774,183,theory(equality)])).
% cnf(5776,negated_conjecture,($false),inference(cn,[status(thm)],[5775,theory(equality)])).
% cnf(5777,negated_conjecture,($false),5776,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 522
% # ...of these trivial : 20
% # ...subsumed : 174
% # ...remaining for further processing: 328
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 24
% # Generated clauses : 1649
% # ...of the previous two non-trivial : 1459
% # Contextual simplify-reflections : 29
% # Paramodulations : 1611
% # Factorizations : 2
% # Equation resolutions : 36
% # Current number of processed clauses: 291
% # Positive orientable unit clauses: 87
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 195
% # Current number of unprocessed clauses: 891
% # ...number of literals in the above : 3344
% # Clause-clause subsumption calls (NU) : 801
% # Rec. Clause-clause subsumption calls : 538
% # Unit Clause-clause subsumption calls : 81
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 31
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 229 leaves, 1.16+/-0.713 terms/leaf
% # Paramod-from index: 145 leaves, 1.10+/-0.516 terms/leaf
% # Paramod-into index: 207 leaves, 1.13+/-0.669 terms/leaf
% # -------------------------------------------------
% # User time : 0.084 s
% # System time : 0.010 s
% # Total time : 0.094 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.32 WC
% FINAL PrfWatch: 0.26 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP9898/NUM466+2.tptp
%
%------------------------------------------------------------------------------