TSTP Solution File: NUM525+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM525+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:54:28 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP16660/NUM525+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16660/NUM525+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16660/NUM525+3.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 16756
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.022 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))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(4, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(5, 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(17, axiom,(((((aNaturalNumber0(xn)&aNaturalNumber0(xm))&aNaturalNumber0(xp))&~(xn=sz00))&~(xm=sz00))&~(xp=sz00)),file('/tmp/SRASS.s.p', m__2987)).
% fof(19, axiom,sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn),file('/tmp/SRASS.s.p', m__3014)).
% fof(22, axiom,((aNaturalNumber0(xq)&xn=sdtasdt0(xp,xq))&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(50, negated_conjecture,~(sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% fof(54, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(55, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(57, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(58, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, 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)],[5])).
% fof(61, 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)],[60])).
% cnf(62,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[61])).
% cnf(129,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[17])).
% cnf(131,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[17])).
% cnf(143,plain,(sdtasdt0(xp,sdtasdt0(xm,xm))=sdtasdt0(xn,xn)),inference(split_conjunct,[status(thm)],[19])).
% cnf(161,plain,(xn=sdtasdt0(xp,xq)),inference(split_conjunct,[status(thm)],[22])).
% cnf(162,plain,(aNaturalNumber0(xq)),inference(split_conjunct,[status(thm)],[22])).
% cnf(260,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xm,xm))!=sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))),inference(split_conjunct,[status(thm)],[50])).
% cnf(308,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq)))!=sdtasdt0(xn,xn)),inference(rw,[status(thm)],[260,143,theory(equality)])).
% cnf(673,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)],[59,62,theory(equality)])).
% cnf(686,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(xq)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[62,161,theory(equality)])).
% cnf(705,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[686,162,theory(equality)])).
% cnf(706,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)|$false|$false),inference(rw,[status(thm)],[705,129,theory(equality)])).
% cnf(707,plain,(sdtasdt0(xn,X1)=sdtasdt0(xp,sdtasdt0(xq,X1))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[706,theory(equality)])).
% cnf(3481,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xn,xq))!=sdtasdt0(xn,xn)|~aNaturalNumber0(xq)),inference(spm,[status(thm)],[308,707,theory(equality)])).
% cnf(3572,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xn,xq))!=sdtasdt0(xn,xn)|$false),inference(rw,[status(thm)],[3481,162,theory(equality)])).
% cnf(3573,negated_conjecture,(sdtasdt0(xp,sdtasdt0(xn,xq))!=sdtasdt0(xn,xn)),inference(cn,[status(thm)],[3572,theory(equality)])).
% cnf(6016,plain,(sdtasdt0(X1,sdtasdt0(X2,X3))=sdtasdt0(X2,sdtasdt0(X3,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)),inference(csr,[status(thm)],[673,56])).
% cnf(6107,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xq,xp))!=sdtasdt0(xn,xn)|~aNaturalNumber0(xp)|~aNaturalNumber0(xq)|~aNaturalNumber0(xn)),inference(spm,[status(thm)],[3573,6016,theory(equality)])).
% cnf(6304,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xq,xp))!=sdtasdt0(xn,xn)|$false|~aNaturalNumber0(xq)|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[6107,129,theory(equality)])).
% cnf(6305,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xq,xp))!=sdtasdt0(xn,xn)|$false|$false|~aNaturalNumber0(xn)),inference(rw,[status(thm)],[6304,162,theory(equality)])).
% cnf(6306,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xq,xp))!=sdtasdt0(xn,xn)|$false|$false|$false),inference(rw,[status(thm)],[6305,131,theory(equality)])).
% cnf(6307,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xq,xp))!=sdtasdt0(xn,xn)),inference(cn,[status(thm)],[6306,theory(equality)])).
% cnf(6756,negated_conjecture,(sdtasdt0(xn,sdtasdt0(xp,xq))!=sdtasdt0(xn,xn)|~aNaturalNumber0(xq)|~aNaturalNumber0(xp)),inference(spm,[status(thm)],[6307,59,theory(equality)])).
% cnf(6759,negated_conjecture,($false|~aNaturalNumber0(xq)|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[6756,161,theory(equality)])).
% cnf(6760,negated_conjecture,($false|$false|~aNaturalNumber0(xp)),inference(rw,[status(thm)],[6759,162,theory(equality)])).
% cnf(6761,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[6760,129,theory(equality)])).
% cnf(6762,negated_conjecture,($false),inference(cn,[status(thm)],[6761,theory(equality)])).
% cnf(6763,negated_conjecture,($false),6762,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 698
% # ...of these trivial : 20
% # ...subsumed : 387
% # ...remaining for further processing: 291
% # Other redundant clauses eliminated : 30
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 13
% # Generated clauses : 2558
% # ...of the previous two non-trivial : 2339
% # Contextual simplify-reflections : 91
% # Paramodulations : 2496
% # Factorizations : 1
% # Equation resolutions : 61
% # Current number of processed clauses: 273
% # Positive orientable unit clauses: 39
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 215
% # Current number of unprocessed clauses: 1645
% # ...number of literals in the above : 9377
% # Clause-clause subsumption calls (NU) : 2096
% # Rec. Clause-clause subsumption calls : 1117
% # Unit Clause-clause subsumption calls : 78
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 175 leaves, 1.32+/-1.090 terms/leaf
% # Paramod-from index: 101 leaves, 1.08+/-0.270 terms/leaf
% # Paramod-into index: 150 leaves, 1.27+/-1.039 terms/leaf
% # -------------------------------------------------
% # User time : 0.139 s
% # System time : 0.011 s
% # Total time : 0.150 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.36 CPU 0.45 WC
% FINAL PrfWatch: 0.36 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP16660/NUM525+3.tptp
%
%------------------------------------------------------------------------------