TSTP Solution File: NUM479+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM479+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 : art03.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:28:03 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP29010/NUM479+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29010/NUM479+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29010/NUM479+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 29106
% 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(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(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(11, axiom,(aNaturalNumber0(xl)&aNaturalNumber0(xm)),file('/tmp/SRASS.s.p', m__1524)).
% fof(12, axiom,((~(xl=sz00)&?[X1]:(aNaturalNumber0(X1)&xm=sdtasdt0(xl,X1)))&doDivides0(xl,xm)),file('/tmp/SRASS.s.p', m__1524_04)).
% fof(13, axiom,aNaturalNumber0(xn),file('/tmp/SRASS.s.p', m__1553)).
% fof(39, conjecture,((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>((aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))&sdtasdt0(xn,xm)=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)))=>sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)))),file('/tmp/SRASS.s.p', m__)).
% fof(40, negated_conjecture,~(((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>((aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))&sdtasdt0(xn,xm)=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)))=>sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))))),inference(assume_negation,[status(cth)],[39])).
% fof(44, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(45, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(48, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, 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(51, 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)],[50])).
% cnf(52,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(58, 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(59, 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)],[58])).
% fof(60, 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)],[59])).
% fof(61, 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)],[60])).
% cnf(63,plain,(X1=sz00|X3=X2|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtasdt0(X1,X3)!=sdtasdt0(X1,X2)),inference(split_conjunct,[status(thm)],[61])).
% cnf(86,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[11])).
% fof(87, plain,((~(xl=sz00)&?[X2]:(aNaturalNumber0(X2)&xm=sdtasdt0(xl,X2)))&doDivides0(xl,xm)),inference(variable_rename,[status(thm)],[12])).
% fof(88, plain,((~(xl=sz00)&(aNaturalNumber0(esk2_0)&xm=sdtasdt0(xl,esk2_0)))&doDivides0(xl,xm)),inference(skolemize,[status(esa)],[87])).
% cnf(90,plain,(xm=sdtasdt0(xl,esk2_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(91,plain,(aNaturalNumber0(esk2_0)),inference(split_conjunct,[status(thm)],[88])).
% cnf(92,plain,(xl!=sz00),inference(split_conjunct,[status(thm)],[88])).
% cnf(93,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[13])).
% fof(198, negated_conjecture,((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))&((aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))&sdtasdt0(xn,xm)=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)))&~(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))))),inference(fof_nnf,[status(thm)],[40])).
% cnf(199,negated_conjecture,(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))!=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))),inference(split_conjunct,[status(thm)],[198])).
% cnf(200,negated_conjecture,(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))),inference(split_conjunct,[status(thm)],[198])).
% cnf(202,negated_conjecture,(xm=sdtasdt0(xl,sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[198])).
% cnf(203,negated_conjecture,(aNaturalNumber0(sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[198])).
% cnf(204,negated_conjecture,(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))!=sdtasdt0(xn,xm)),inference(rw,[status(thm)],[199,200,theory(equality)])).
% cnf(373,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aNaturalNumber0(sdtasdt0(X2,X3))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(spm,[status(thm)],[49,52,theory(equality)])).
% cnf(521,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(esk2_0)|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[63,90,theory(equality)])).
% cnf(543,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|$false|~aNaturalNumber0(X1)|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[521,91,theory(equality)])).
% cnf(544,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|$false|~aNaturalNumber0(X1)|$false),inference(rw,[status(thm)],[543,86,theory(equality)])).
% cnf(545,plain,(sz00=xl|X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[544,theory(equality)])).
% cnf(546,plain,(X1=esk2_0|sdtasdt0(xl,X1)!=xm|~aNaturalNumber0(X1)),inference(sr,[status(thm)],[545,92,theory(equality)])).
% cnf(1514,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0|~aNaturalNumber0(sdtsldt0(xm,xl))),inference(spm,[status(thm)],[546,202,theory(equality)])).
% cnf(1531,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0|$false),inference(rw,[status(thm)],[1514,203,theory(equality)])).
% cnf(1532,negated_conjecture,(sdtsldt0(xm,xl)=esk2_0),inference(cn,[status(thm)],[1531,theory(equality)])).
% cnf(1544,negated_conjecture,(sdtasdt0(sdtasdt0(xl,xn),esk2_0)!=sdtasdt0(xn,xm)),inference(rw,[status(thm)],[204,1532,theory(equality)])).
% cnf(1561,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xl,xn))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|~aNaturalNumber0(esk2_0)),inference(spm,[status(thm)],[1544,49,theory(equality)])).
% cnf(1564,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xl,xn))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|$false),inference(rw,[status(thm)],[1561,91,theory(equality)])).
% cnf(1565,negated_conjecture,(sdtasdt0(esk2_0,sdtasdt0(xl,xn))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))),inference(cn,[status(thm)],[1564,theory(equality)])).
% cnf(3286,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(csr,[status(thm)],[373,46])).
% cnf(3287,negated_conjecture,(sdtasdt0(xn,sdtasdt0(esk2_0,xl))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|~aNaturalNumber0(xn)|~aNaturalNumber0(xl)|~aNaturalNumber0(esk2_0)),inference(spm,[status(thm)],[1565,3286,theory(equality)])).
% cnf(3397,negated_conjecture,(sdtasdt0(xn,sdtasdt0(esk2_0,xl))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|$false|~aNaturalNumber0(xl)|~aNaturalNumber0(esk2_0)),inference(rw,[status(thm)],[3287,93,theory(equality)])).
% cnf(3398,negated_conjecture,(sdtasdt0(xn,sdtasdt0(esk2_0,xl))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|$false|$false|~aNaturalNumber0(esk2_0)),inference(rw,[status(thm)],[3397,86,theory(equality)])).
% cnf(3399,negated_conjecture,(sdtasdt0(xn,sdtasdt0(esk2_0,xl))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|$false|$false|$false),inference(rw,[status(thm)],[3398,91,theory(equality)])).
% cnf(3400,negated_conjecture,(sdtasdt0(xn,sdtasdt0(esk2_0,xl))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))),inference(cn,[status(thm)],[3399,theory(equality)])).
% cnf(4945,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xl,esk2_0))!=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtasdt0(xl,xn))|~aNaturalNumber0(esk2_0)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[3400,49,theory(equality)])).
% cnf(4949,negated_conjecture,($false|~aNaturalNumber0(sdtasdt0(xl,xn))|~aNaturalNumber0(esk2_0)|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[4945,90,theory(equality)])).
% cnf(4950,negated_conjecture,($false|~aNaturalNumber0(sdtasdt0(xl,xn))|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[4949,91,theory(equality)])).
% cnf(4951,negated_conjecture,($false|~aNaturalNumber0(sdtasdt0(xl,xn))|$false|$false),inference(rw,[status(thm)],[4950,86,theory(equality)])).
% cnf(4952,negated_conjecture,(~aNaturalNumber0(sdtasdt0(xl,xn))),inference(cn,[status(thm)],[4951,theory(equality)])).
% cnf(4965,negated_conjecture,(~aNaturalNumber0(xn)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[4952,46,theory(equality)])).
% cnf(4970,negated_conjecture,($false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[4965,93,theory(equality)])).
% cnf(4971,negated_conjecture,($false|$false),inference(rw,[status(thm)],[4970,86,theory(equality)])).
% cnf(4972,negated_conjecture,($false),inference(cn,[status(thm)],[4971,theory(equality)])).
% cnf(4973,negated_conjecture,($false),4972,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 562
% # ...of these trivial : 13
% # ...subsumed : 232
% # ...remaining for further processing: 317
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 17
% # Backward-rewritten : 17
% # Generated clauses : 1859
% # ...of the previous two non-trivial : 1676
% # Contextual simplify-reflections : 76
% # Paramodulations : 1826
% # Factorizations : 0
% # Equation resolutions : 32
% # Current number of processed clauses: 218
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 180
% # Current number of unprocessed clauses: 1175
% # ...number of literals in the above : 5673
% # Clause-clause subsumption calls (NU) : 2002
% # Rec. Clause-clause subsumption calls : 1062
% # Unit Clause-clause subsumption calls : 86
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 172 leaves, 1.24+/-0.895 terms/leaf
% # Paramod-from index: 98 leaves, 1.09+/-0.289 terms/leaf
% # Paramod-into index: 135 leaves, 1.21+/-0.754 terms/leaf
% # -------------------------------------------------
% # User time : 0.103 s
% # System time : 0.009 s
% # Total time : 0.112 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.35 WC
% FINAL PrfWatch: 0.25 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP29010/NUM479+2.tptp
%
%------------------------------------------------------------------------------