TSTP Solution File: NUM480+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM480+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 : 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:28:37 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP29173/NUM480+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29173/NUM480+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29173/NUM480+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 29269
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.04 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(11, axiom,(aNaturalNumber0(xl)&aNaturalNumber0(xm)),file('/tmp/SRASS.s.p', m__1524)).
% fof(13, axiom,aNaturalNumber0(xn),file('/tmp/SRASS.s.p', m__1553)).
% fof(14, axiom,((((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__1594)).
% fof(40, conjecture,((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))|sdtasdt0(xn,sdtsldt0(xm,xl))=sdtsldt0(sdtasdt0(xn,xm),xl))),file('/tmp/SRASS.s.p', m__)).
% fof(41, negated_conjecture,~(((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))=>(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))|sdtasdt0(xn,sdtsldt0(xm,xl))=sdtsldt0(sdtasdt0(xn,xm),xl)))),inference(assume_negation,[status(cth)],[40])).
% fof(51, 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(52, 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)],[51])).
% cnf(53,plain,(sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aNaturalNumber0(X3)|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[52])).
% cnf(87,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[11])).
% cnf(94,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[13])).
% cnf(95,plain,(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))),inference(split_conjunct,[status(thm)],[14])).
% cnf(96,plain,(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))),inference(split_conjunct,[status(thm)],[14])).
% cnf(99,plain,(aNaturalNumber0(sdtsldt0(xm,xl))),inference(split_conjunct,[status(thm)],[14])).
% fof(204, negated_conjecture,((aNaturalNumber0(sdtsldt0(xm,xl))&xm=sdtasdt0(xl,sdtsldt0(xm,xl)))&(~(sdtasdt0(xn,xm)=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))))&~(sdtasdt0(xn,sdtsldt0(xm,xl))=sdtsldt0(sdtasdt0(xn,xm),xl)))),inference(fof_nnf,[status(thm)],[41])).
% cnf(206,negated_conjecture,(sdtasdt0(xn,xm)!=sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))),inference(split_conjunct,[status(thm)],[204])).
% cnf(212,plain,(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl))=sdtasdt0(xn,xm)),inference(rw,[status(thm)],[95,96,theory(equality)])).
% cnf(403,plain,(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))=sdtasdt0(xn,xm)|~aNaturalNumber0(sdtsldt0(xm,xl))|~aNaturalNumber0(xn)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[212,53,theory(equality)])).
% cnf(418,plain,(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))=sdtasdt0(xn,xm)|$false|~aNaturalNumber0(xn)|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[403,99,theory(equality)])).
% cnf(419,plain,(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))=sdtasdt0(xn,xm)|$false|$false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[418,94,theory(equality)])).
% cnf(420,plain,(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))=sdtasdt0(xn,xm)|$false|$false|$false),inference(rw,[status(thm)],[419,87,theory(equality)])).
% cnf(421,plain,(sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))=sdtasdt0(xn,xm)),inference(cn,[status(thm)],[420,theory(equality)])).
% cnf(422,plain,($false),inference(sr,[status(thm)],[421,206,theory(equality)])).
% cnf(423,plain,($false),422,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 111
% # ...of these trivial : 2
% # ...subsumed : 5
% # ...remaining for further processing: 104
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 87
% # ...of the previous two non-trivial : 64
% # Contextual simplify-reflections : 6
% # Paramodulations : 86
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 21
% # Current number of unprocessed clauses: 90
% # ...number of literals in the above : 339
% # Clause-clause subsumption calls (NU) : 267
% # Rec. Clause-clause subsumption calls : 103
% # 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: 48 leaves, 1.15+/-0.500 terms/leaf
% # Paramod-from index: 30 leaves, 1.07+/-0.249 terms/leaf
% # Paramod-into index: 45 leaves, 1.04+/-0.206 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.005 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP29173/NUM480+2.tptp
%
%------------------------------------------------------------------------------