TSTP Solution File: RNG083+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG083+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 : art07.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:27:52 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP3935/RNG083+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3935/RNG083+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3935/RNG083+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 4031
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aElement0(sz00),file('/tmp/SRASS.s.p', mSortsC)).
% fof(3, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(5, axiom,aElement0(xx),file('/tmp/SRASS.s.p', m__468)).
% fof(7, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),file('/tmp/SRASS.s.p', mAMDistr)).
% fof(8, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', mMulUnit)).
% fof(9, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(10, axiom,![X1]:(aElement0(X1)=>aElement0(smndt0(X1))),file('/tmp/SRASS.s.p', mSortsU)).
% fof(14, axiom,![X1]:(aElement0(X1)=>(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),file('/tmp/SRASS.s.p', mAddInvr)).
% fof(15, axiom,![X1]:(aElement0(X1)=>(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),file('/tmp/SRASS.s.p', mMulMnOne)).
% fof(17, conjecture,(sdtasdt0(xx,sz00)=sz00&sz00=sdtasdt0(sz00,xx)),file('/tmp/SRASS.s.p', m__)).
% fof(18, negated_conjecture,~((sdtasdt0(xx,sz00)=sz00&sz00=sdtasdt0(sz00,xx))),inference(assume_negation,[status(cth)],[17])).
% cnf(20,plain,(aElement0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(24, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(25, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(30,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[5])).
% fof(36, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(37, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))&(sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6))))),inference(distribute,[status(thm)],[37])).
% cnf(40,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aElement0(X1)|~aElement0(X2)|~aElement0(X3)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(42, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aElement0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[42])).
% cnf(45,plain,(sdtasdt0(X1,sz10)=X1|~aElement0(X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[9])).
% fof(47, plain,![X1]:(~(aElement0(X1))|aElement0(smndt0(X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(48, plain,![X2]:(~(aElement0(X2))|aElement0(smndt0(X2))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(aElement0(smndt0(X1))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(59, plain,![X1]:(~(aElement0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(60, plain,![X2]:(~(aElement0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aElement0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aElement0(X2)))),inference(distribute,[status(thm)],[60])).
% cnf(63,plain,(sdtpldt0(X1,smndt0(X1))=sz00|~aElement0(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(64, plain,![X1]:(~(aElement0(X1))|(sdtasdt0(smndt0(sz10),X1)=smndt0(X1)&smndt0(X1)=sdtasdt0(X1,smndt0(sz10)))),inference(fof_nnf,[status(thm)],[15])).
% fof(65, plain,![X2]:(~(aElement0(X2))|(sdtasdt0(smndt0(sz10),X2)=smndt0(X2)&smndt0(X2)=sdtasdt0(X2,smndt0(sz10)))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,![X2]:((sdtasdt0(smndt0(sz10),X2)=smndt0(X2)|~(aElement0(X2)))&(smndt0(X2)=sdtasdt0(X2,smndt0(sz10))|~(aElement0(X2)))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(smndt0(X1)=sdtasdt0(X1,smndt0(sz10))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(71, negated_conjecture,(~(sdtasdt0(xx,sz00)=sz00)|~(sz00=sdtasdt0(sz00,xx))),inference(fof_nnf,[status(thm)],[18])).
% cnf(72,negated_conjecture,(sz00!=sdtasdt0(sz00,xx)|sdtasdt0(xx,sz00)!=sz00),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,plain,(aElement0(smndt0(sz10))),inference(spm,[status(thm)],[49,46,theory(equality)])).
% cnf(77,plain,(sdtasdt0(xx,sz10)=xx),inference(spm,[status(thm)],[45,30,theory(equality)])).
% cnf(88,plain,(sdtpldt0(sz10,smndt0(sz10))=sz00),inference(spm,[status(thm)],[63,46,theory(equality)])).
% cnf(89,plain,(sdtpldt0(xx,smndt0(xx))=sz00),inference(spm,[status(thm)],[63,30,theory(equality)])).
% cnf(101,plain,(sdtasdt0(xx,smndt0(sz10))=smndt0(xx)),inference(spm,[status(thm)],[67,30,theory(equality)])).
% cnf(107,plain,(sdtasdt0(X1,xx)=sdtasdt0(xx,X1)|~aElement0(X1)),inference(spm,[status(thm)],[26,30,theory(equality)])).
% cnf(119,plain,(sdtpldt0(sdtasdt0(xx,X1),sdtasdt0(xx,X2))=sdtasdt0(xx,sdtpldt0(X1,X2))|~aElement0(X1)|~aElement0(X2)),inference(spm,[status(thm)],[40,30,theory(equality)])).
% cnf(583,plain,(sdtasdt0(sz00,xx)=sdtasdt0(xx,sz00)),inference(spm,[status(thm)],[107,20,theory(equality)])).
% cnf(693,negated_conjecture,(sdtasdt0(sz00,xx)!=sz00|sdtasdt0(sz00,xx)!=sz00),inference(rw,[status(thm)],[72,583,theory(equality)])).
% cnf(694,negated_conjecture,(sdtasdt0(sz00,xx)!=sz00),inference(cn,[status(thm)],[693,theory(equality)])).
% cnf(11285,plain,(sdtpldt0(sdtasdt0(xx,sz10),sdtasdt0(xx,X1))=sdtasdt0(xx,sdtpldt0(sz10,X1))|~aElement0(X1)),inference(spm,[status(thm)],[119,46,theory(equality)])).
% cnf(11344,plain,(sdtpldt0(xx,sdtasdt0(xx,X1))=sdtasdt0(xx,sdtpldt0(sz10,X1))|~aElement0(X1)),inference(rw,[status(thm)],[11285,77,theory(equality)])).
% cnf(13983,plain,(sdtpldt0(xx,sdtasdt0(xx,smndt0(sz10)))=sdtasdt0(xx,sdtpldt0(sz10,smndt0(sz10)))),inference(spm,[status(thm)],[11344,73,theory(equality)])).
% cnf(14057,plain,(sz00=sdtasdt0(xx,sdtpldt0(sz10,smndt0(sz10)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13983,101,theory(equality)]),89,theory(equality)])).
% cnf(14058,plain,(sz00=sdtasdt0(sz00,xx)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[14057,88,theory(equality)]),583,theory(equality)])).
% cnf(14059,plain,($false),inference(sr,[status(thm)],[14058,694,theory(equality)])).
% cnf(14060,plain,($false),14059,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 392
% # ...of these trivial : 28
% # ...subsumed : 34
% # ...remaining for further processing: 330
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 112
% # Generated clauses : 13539
% # ...of the previous two non-trivial : 13406
% # Contextual simplify-reflections : 0
% # Paramodulations : 13539
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 218
% # Positive orientable unit clauses: 115
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 102
% # Current number of unprocessed clauses: 7129
% # ...number of literals in the above : 8662
% # Clause-clause subsumption calls (NU) : 979
% # Rec. Clause-clause subsumption calls : 971
% # Unit Clause-clause subsumption calls : 20
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 155
% # Indexed BW rewrite successes : 31
% # Backwards rewriting index: 271 leaves, 1.34+/-0.955 terms/leaf
% # Paramod-from index: 77 leaves, 1.49+/-0.862 terms/leaf
% # Paramod-into index: 152 leaves, 1.26+/-0.676 terms/leaf
% # -------------------------------------------------
% # User time : 0.227 s
% # System time : 0.012 s
% # Total time : 0.239 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.48 CPU 0.57 WC
% FINAL PrfWatch: 0.48 CPU 0.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP3935/RNG083+1.tptp
%
%------------------------------------------------------------------------------