TSTP Solution File: RNG060+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : RNG060+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 : art05.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 22:13:59 EST 2010

% Result   : Theorem 11.79s
% Output   : Solution 11.79s
% 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/SystemOnTPTP22813/RNG060+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22813/RNG060+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22813/RNG060+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 22909
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.03 WC
% PrfWatch: 3.92 CPU 4.03 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.91 CPU 6.04 WC
% PrfWatch: 7.91 CPU 8.04 WC
% PrfWatch: 9.89 CPU 10.05 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(3, axiom,![X1]:(aScalar0(X1)=>aScalar0(smndt0(X1))),file('/tmp/SRASS.s.p', mNegSc)).
% fof(6, axiom,![X1]:![X2]:![X3]:![X4]:((((aScalar0(X1)&aScalar0(X2))&aScalar0(X3))&aScalar0(X4))=>sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))=sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))),file('/tmp/SRASS.s.p', mDistr2)).
% fof(7, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>(sdtasdt0(X1,smndt0(X2))=smndt0(sdtasdt0(X1,X2))&sdtasdt0(smndt0(X1),X2)=smndt0(sdtasdt0(X1,X2)))),file('/tmp/SRASS.s.p', mMNeg)).
% fof(26, axiom,(aScalar0(xD)&xD=sdtasasdt0(xq,xq)),file('/tmp/SRASS.s.p', m__1800)).
% fof(28, axiom,(aScalar0(xF)&xF=sdtasdt0(xA,xA)),file('/tmp/SRASS.s.p', m__1837)).
% fof(31, axiom,(aScalar0(xR)&xR=sdtasdt0(xC,xG)),file('/tmp/SRASS.s.p', m__1892)).
% fof(33, axiom,(aScalar0(xS)&xS=sdtasdt0(xF,xD)),file('/tmp/SRASS.s.p', m__1930)).
% fof(37, axiom,((sdtasdt0(xR,smndt0(xS))=smndt0(xN)&sdtasdt0(smndt0(xS),xR)=smndt0(xN))&sdtasdt0(smndt0(xS),smndt0(xS))=sdtasdt0(xS,xS)),file('/tmp/SRASS.s.p', m__2144)).
% fof(59, conjecture,sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),file('/tmp/SRASS.s.p', m__)).
% fof(60, negated_conjecture,~(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),inference(assume_negation,[status(cth)],[59])).
% fof(66, negated_conjecture,~(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),inference(fof_simplification,[status(thm)],[60,theory(equality)])).
% fof(70, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(71, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(74, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(88, plain,![X1]:![X2]:![X3]:![X4]:((((~(aScalar0(X1))|~(aScalar0(X2)))|~(aScalar0(X3)))|~(aScalar0(X4)))|sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))=sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))),inference(fof_nnf,[status(thm)],[6])).
% fof(89, plain,![X5]:![X6]:![X7]:![X8]:((((~(aScalar0(X5))|~(aScalar0(X6)))|~(aScalar0(X7)))|~(aScalar0(X8)))|sdtasdt0(sdtpldt0(X5,X6),sdtpldt0(X7,X8))=sdtpldt0(sdtpldt0(sdtasdt0(X5,X7),sdtasdt0(X5,X8)),sdtpldt0(sdtasdt0(X6,X7),sdtasdt0(X6,X8)))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(sdtasdt0(sdtpldt0(X1,X2),sdtpldt0(X3,X4))=sdtpldt0(sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X1,X4)),sdtpldt0(sdtasdt0(X2,X3),sdtasdt0(X2,X4)))|~aScalar0(X4)|~aScalar0(X3)|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(91, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|(sdtasdt0(X1,smndt0(X2))=smndt0(sdtasdt0(X1,X2))&sdtasdt0(smndt0(X1),X2)=smndt0(sdtasdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(92, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|(sdtasdt0(X3,smndt0(X4))=smndt0(sdtasdt0(X3,X4))&sdtasdt0(smndt0(X3),X4)=smndt0(sdtasdt0(X3,X4)))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X3]:![X4]:((sdtasdt0(X3,smndt0(X4))=smndt0(sdtasdt0(X3,X4))|(~(aScalar0(X3))|~(aScalar0(X4))))&(sdtasdt0(smndt0(X3),X4)=smndt0(sdtasdt0(X3,X4))|(~(aScalar0(X3))|~(aScalar0(X4))))),inference(distribute,[status(thm)],[92])).
% cnf(95,plain,(sdtasdt0(X2,smndt0(X1))=smndt0(sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[93])).
% cnf(141,plain,(aScalar0(xD)),inference(split_conjunct,[status(thm)],[26])).
% cnf(145,plain,(aScalar0(xF)),inference(split_conjunct,[status(thm)],[28])).
% cnf(151,plain,(aScalar0(xR)),inference(split_conjunct,[status(thm)],[31])).
% cnf(154,plain,(xS=sdtasdt0(xF,xD)),inference(split_conjunct,[status(thm)],[33])).
% cnf(160,plain,(sdtasdt0(smndt0(xS),smndt0(xS))=sdtasdt0(xS,xS)),inference(split_conjunct,[status(thm)],[37])).
% cnf(161,plain,(sdtasdt0(smndt0(xS),xR)=smndt0(xN)),inference(split_conjunct,[status(thm)],[37])).
% cnf(162,plain,(sdtasdt0(xR,smndt0(xS))=smndt0(xN)),inference(split_conjunct,[status(thm)],[37])).
% cnf(239,negated_conjecture,(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))!=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),inference(split_conjunct,[status(thm)],[66])).
% cnf(359,plain,(aScalar0(sdtasdt0(X1,smndt0(X2)))|~aScalar0(sdtasdt0(X1,X2))|~aScalar0(X1)|~aScalar0(X2)),inference(spm,[status(thm)],[75,95,theory(equality)])).
% cnf(368,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))|~aScalar0(xF)|~aScalar0(xD)),inference(spm,[status(thm)],[95,154,theory(equality)])).
% cnf(386,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))|$false|~aScalar0(xD)),inference(rw,[status(thm)],[368,145,theory(equality)])).
% cnf(387,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))|$false|$false),inference(rw,[status(thm)],[386,141,theory(equality)])).
% cnf(388,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))),inference(cn,[status(thm)],[387,theory(equality)])).
% cnf(1025,plain,(sdtpldt0(sdtpldt0(sdtasdt0(X1,xR),sdtasdt0(X1,X2)),sdtpldt0(smndt0(xN),sdtasdt0(smndt0(xS),X2)))=sdtasdt0(sdtpldt0(X1,smndt0(xS)),sdtpldt0(xR,X2))|~aScalar0(X2)|~aScalar0(xR)|~aScalar0(smndt0(xS))|~aScalar0(X1)),inference(spm,[status(thm)],[90,161,theory(equality)])).
% cnf(1122,plain,(sdtpldt0(sdtpldt0(sdtasdt0(X1,xR),sdtasdt0(X1,X2)),sdtpldt0(smndt0(xN),sdtasdt0(smndt0(xS),X2)))=sdtasdt0(sdtpldt0(X1,smndt0(xS)),sdtpldt0(xR,X2))|~aScalar0(X2)|$false|~aScalar0(smndt0(xS))|~aScalar0(X1)),inference(rw,[status(thm)],[1025,151,theory(equality)])).
% cnf(1123,plain,(sdtpldt0(sdtpldt0(sdtasdt0(X1,xR),sdtasdt0(X1,X2)),sdtpldt0(smndt0(xN),sdtasdt0(smndt0(xS),X2)))=sdtasdt0(sdtpldt0(X1,smndt0(xS)),sdtpldt0(xR,X2))|~aScalar0(X2)|~aScalar0(smndt0(xS))|~aScalar0(X1)),inference(cn,[status(thm)],[1122,theory(equality)])).
% cnf(5422,plain,(aScalar0(sdtasdt0(X1,smndt0(X2)))|~aScalar0(X1)|~aScalar0(X2)),inference(csr,[status(thm)],[359,72])).
% cnf(8550,plain,(aScalar0(smndt0(xS))|~aScalar0(xF)|~aScalar0(xD)),inference(spm,[status(thm)],[5422,388,theory(equality)])).
% cnf(8584,plain,(aScalar0(smndt0(xS))|$false|~aScalar0(xD)),inference(rw,[status(thm)],[8550,145,theory(equality)])).
% cnf(8585,plain,(aScalar0(smndt0(xS))|$false|$false),inference(rw,[status(thm)],[8584,141,theory(equality)])).
% cnf(8586,plain,(aScalar0(smndt0(xS))),inference(cn,[status(thm)],[8585,theory(equality)])).
% cnf(424393,plain,(sdtpldt0(sdtpldt0(sdtasdt0(X1,xR),sdtasdt0(X1,X2)),sdtpldt0(smndt0(xN),sdtasdt0(smndt0(xS),X2)))=sdtasdt0(sdtpldt0(X1,smndt0(xS)),sdtpldt0(xR,X2))|~aScalar0(X2)|$false|~aScalar0(X1)),inference(rw,[status(thm)],[1123,8586,theory(equality)])).
% cnf(424394,plain,(sdtpldt0(sdtpldt0(sdtasdt0(X1,xR),sdtasdt0(X1,X2)),sdtpldt0(smndt0(xN),sdtasdt0(smndt0(xS),X2)))=sdtasdt0(sdtpldt0(X1,smndt0(xS)),sdtpldt0(xR,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(cn,[status(thm)],[424393,theory(equality)])).
% cnf(424612,plain,(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(smndt0(xS),smndt0(xS))))=sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))|~aScalar0(smndt0(xS))|~aScalar0(xR)),inference(spm,[status(thm)],[424394,162,theory(equality)])).
% cnf(425899,plain,(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))=sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))|~aScalar0(smndt0(xS))|~aScalar0(xR)),inference(rw,[status(thm)],[424612,160,theory(equality)])).
% cnf(425900,plain,(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))=sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))|$false|~aScalar0(xR)),inference(rw,[status(thm)],[425899,8586,theory(equality)])).
% cnf(425901,plain,(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))=sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))|$false|$false),inference(rw,[status(thm)],[425900,151,theory(equality)])).
% cnf(425902,plain,(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))=sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))),inference(cn,[status(thm)],[425901,theory(equality)])).
% cnf(425903,plain,($false),inference(sr,[status(thm)],[425902,239,theory(equality)])).
% cnf(425904,plain,($false),425903,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 3311
% # ...of these trivial                : 1234
% # ...subsumed                        : 85
% # ...remaining for further processing: 1992
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 11
% # Backward-rewritten                 : 585
% # Generated clauses                  : 122866
% # ...of the previous two non-trivial : 113321
% # Contextual simplify-reflections    : 124
% # Paramodulations                    : 122841
% # Factorizations                     : 2
% # Equation resolutions               : 23
% # Current number of processed clauses: 1396
% #    Positive orientable unit clauses: 1121
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 11
% #    Non-unit-clauses                : 264
% # Current number of unprocessed clauses: 101013
% # ...number of literals in the above : 327459
% # Clause-clause subsumption calls (NU) : 9177
% # Rec. Clause-clause subsumption calls : 3613
% # Unit Clause-clause subsumption calls : 162
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2684
% # Indexed BW rewrite successes       : 246
% # Backwards rewriting index:  1284 leaves,   1.66+/-1.845 terms/leaf
% # Paramod-from index:          771 leaves,   1.69+/-1.835 terms/leaf
% # Paramod-into index:         1077 leaves,   1.66+/-1.747 terms/leaf
% # -------------------------------------------------
% # User time              : 4.977 s
% # System time            : 0.226 s
% # Total time             : 5.203 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.89 CPU 11.06 WC
% FINAL PrfWatch: 10.89 CPU 11.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP22813/RNG060+1.tptp
% 
%------------------------------------------------------------------------------