TSTP Solution File: RNG105+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG105+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:37:53 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP6064/RNG105+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6064/RNG105+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6064/RNG105+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 6160
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(2, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(8, axiom,aElement0(xc),file('/tmp/SRASS.s.p', m__1905)).
% fof(9, axiom,((aElementOf0(xx,slsdtgt0(xc))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__1933)).
% fof(10, axiom,(aElement0(xu)&sdtasdt0(xc,xu)=xx),file('/tmp/SRASS.s.p', m__1956)).
% fof(11, axiom,(aElement0(xv)&sdtasdt0(xc,xv)=xy),file('/tmp/SRASS.s.p', m__1979)).
% fof(12, axiom,sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv)),file('/tmp/SRASS.s.p', m__2010)).
% fof(13, axiom,sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz)),file('/tmp/SRASS.s.p', m__2043)).
% fof(14, axiom,![X1]:(aElement0(X1)=>![X2]:(X2=slsdtgt0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))),file('/tmp/SRASS.s.p', mDefPrIdeal)).
% fof(44, conjecture,(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))&aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))),file('/tmp/SRASS.s.p', m__)).
% fof(45, negated_conjecture,~((aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))&aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)))),inference(assume_negation,[status(cth)],[44])).
% fof(50, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(51, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(53, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(54, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[54])).
% cnf(73,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[8])).
% cnf(74,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[9])).
% cnf(78,plain,(aElement0(xu)),inference(split_conjunct,[status(thm)],[10])).
% cnf(80,plain,(aElement0(xv)),inference(split_conjunct,[status(thm)],[11])).
% cnf(81,plain,(sdtpldt0(xx,xy)=sdtasdt0(xc,sdtpldt0(xu,xv))),inference(split_conjunct,[status(thm)],[12])).
% cnf(82,plain,(sdtasdt0(xz,xx)=sdtasdt0(xc,sdtasdt0(xu,xz))),inference(split_conjunct,[status(thm)],[13])).
% fof(83, plain,![X1]:(~(aElement0(X1))|![X2]:((~(X2=slsdtgt0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))&(![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3)))&(aElementOf0(X3,X2)|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))|X2=slsdtgt0(X1)))),inference(fof_nnf,[status(thm)],[14])).
% fof(84, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|?[X8]:(aElement0(X8)&sdtasdt0(X5,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|?[X10]:((~(aElementOf0(X10,X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=X10)))&(aElementOf0(X10,X6)|?[X12]:(aElement0(X12)&sdtasdt0(X5,X12)=X10))))|X6=slsdtgt0(X5)))),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|(aElement0(esk1_3(X5,X6,X7))&sdtasdt0(X5,esk1_3(X5,X6,X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|((~(aElementOf0(esk2_2(X5,X6),X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6))))&(aElementOf0(esk2_2(X5,X6),X6)|(aElement0(esk3_2(X5,X6))&sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6)))))|X6=slsdtgt0(X5)))),inference(skolemize,[status(esa)],[84])).
% fof(86, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6)))|~(aElementOf0(esk2_2(X5,X6),X6)))&(aElementOf0(esk2_2(X5,X6),X6)|(aElement0(esk3_2(X5,X6))&sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6))))|~(aSet0(X6)))|X6=slsdtgt0(X5))&(((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))&(~(aElementOf0(X7,X6))|(aElement0(esk1_3(X5,X6,X7))&sdtasdt0(X5,esk1_3(X5,X6,X7))=X7)))&aSet0(X6))|~(X6=slsdtgt0(X5))))|~(aElement0(X5))),inference(shift_quantors,[status(thm)],[85])).
% fof(87, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6)))|~(aElementOf0(esk2_2(X5,X6),X6)))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&(((((aElement0(esk3_2(X5,X6))|aElementOf0(esk2_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&((((sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6)|aElementOf0(esk2_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))))&((((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&((((aElement0(esk1_3(X5,X6,X7))|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&(((sdtasdt0(X5,esk1_3(X5,X6,X7))=X7|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))))&((aSet0(X6)|~(X6=slsdtgt0(X5)))|~(aElement0(X5))))),inference(distribute,[status(thm)],[86])).
% cnf(91,plain,(aElementOf0(X3,X2)|~aElement0(X1)|X2!=slsdtgt0(X1)|sdtasdt0(X1,X4)!=X3|~aElement0(X4)),inference(split_conjunct,[status(thm)],[87])).
% fof(252, negated_conjecture,(~(aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)))|~(aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)))),inference(fof_nnf,[status(thm)],[45])).
% cnf(253,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))|~aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))),inference(split_conjunct,[status(thm)],[252])).
% cnf(465,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2|~aElement0(sdtasdt0(xu,xz))|~aElement0(xc)),inference(spm,[status(thm)],[91,82,theory(equality)])).
% cnf(466,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2|~aElement0(sdtpldt0(xu,xv))|~aElement0(xc)),inference(spm,[status(thm)],[91,81,theory(equality)])).
% cnf(485,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2|~aElement0(sdtasdt0(xu,xz))|$false),inference(rw,[status(thm)],[465,73,theory(equality)])).
% cnf(486,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2|~aElement0(sdtasdt0(xu,xz))),inference(cn,[status(thm)],[485,theory(equality)])).
% cnf(487,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2|~aElement0(sdtpldt0(xu,xv))|$false),inference(rw,[status(thm)],[466,73,theory(equality)])).
% cnf(488,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2|~aElement0(sdtpldt0(xu,xv))),inference(cn,[status(thm)],[487,theory(equality)])).
% cnf(3099,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2|~aElement0(xz)|~aElement0(xu)),inference(spm,[status(thm)],[486,55,theory(equality)])).
% cnf(3100,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2|$false|~aElement0(xu)),inference(rw,[status(thm)],[3099,74,theory(equality)])).
% cnf(3101,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2|$false|$false),inference(rw,[status(thm)],[3100,78,theory(equality)])).
% cnf(3102,plain,(aElementOf0(X1,X2)|sdtasdt0(xz,xx)!=X1|slsdtgt0(xc)!=X2),inference(cn,[status(thm)],[3101,theory(equality)])).
% cnf(3109,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2|~aElement0(xv)|~aElement0(xu)),inference(spm,[status(thm)],[488,52,theory(equality)])).
% cnf(3110,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2|$false|~aElement0(xu)),inference(rw,[status(thm)],[3109,80,theory(equality)])).
% cnf(3111,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2|$false|$false),inference(rw,[status(thm)],[3110,78,theory(equality)])).
% cnf(3112,plain,(aElementOf0(X1,X2)|sdtpldt0(xx,xy)!=X1|slsdtgt0(xc)!=X2),inference(cn,[status(thm)],[3111,theory(equality)])).
% cnf(3628,plain,(aElementOf0(sdtasdt0(xz,xx),X1)|slsdtgt0(xc)!=X1),inference(er,[status(thm)],[3102,theory(equality)])).
% cnf(3773,plain,(aElementOf0(sdtpldt0(xx,xy),X1)|slsdtgt0(xc)!=X1),inference(er,[status(thm)],[3112,theory(equality)])).
% cnf(3783,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))),inference(spm,[status(thm)],[253,3773,theory(equality)])).
% cnf(3850,negated_conjecture,($false),inference(spm,[status(thm)],[3783,3628,theory(equality)])).
% cnf(3868,negated_conjecture,($false),3850,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 740
% # ...of these trivial : 14
% # ...subsumed : 301
% # ...remaining for further processing: 425
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 2
% # Generated clauses : 2015
% # ...of the previous two non-trivial : 1827
% # Contextual simplify-reflections : 180
% # Paramodulations : 1977
% # Factorizations : 0
% # Equation resolutions : 38
% # Current number of processed clauses: 309
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 274
% # Current number of unprocessed clauses: 1231
% # ...number of literals in the above : 6738
% # Clause-clause subsumption calls (NU) : 4794
% # Rec. Clause-clause subsumption calls : 2987
% # Unit Clause-clause subsumption calls : 146
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 234 leaves, 1.27+/-0.996 terms/leaf
% # Paramod-from index: 117 leaves, 1.07+/-0.252 terms/leaf
% # Paramod-into index: 200 leaves, 1.19+/-0.611 terms/leaf
% # -------------------------------------------------
% # User time : 0.140 s
% # System time : 0.007 s
% # Total time : 0.147 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.28 CPU 0.37 WC
% FINAL PrfWatch: 0.28 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP6064/RNG105+1.tptp
%
%------------------------------------------------------------------------------