↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : RNG123+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art02.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:48:42 EST 2010

% Result   : Theorem 1.01s
% Output   : Solution 1.01s
% 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/SystemOnTPTP17329/RNG123+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP17329/RNG123+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17329/RNG123+4.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 17425
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.028 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(28, axiom,((((((aSet0(xI)&![X1]:(aElementOf0(X1,xI)=>(![X2]:(aElementOf0(X2,xI)=>aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&![X1]:(aElementOf0(X1,slsdtgt0(xa))<=>?[X2]:(aElement0(X2)&sdtasdt0(xa,X2)=X1)))&![X1]:(aElementOf0(X1,slsdtgt0(xb))<=>?[X2]:(aElement0(X2)&sdtasdt0(xb,X2)=X1)))&![X1]:(aElementOf0(X1,xI)<=>?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),file('/tmp/SRASS.s.p', m__2174)).
% fof(38, axiom,(?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=smndt0(sdtasdt0(xq,xu)))&aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),file('/tmp/SRASS.s.p', m__2690)).
% fof(39, axiom,((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb)&?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb))&aElementOf0(xb,xI)),file('/tmp/SRASS.s.p', m__2699)).
% fof(40, axiom,xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb),file('/tmp/SRASS.s.p', m__2718)).
% fof(55, conjecture,(?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xr)|aElementOf0(xr,xI)),file('/tmp/SRASS.s.p', m__)).
% fof(56, negated_conjecture,~((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xr)|aElementOf0(xr,xI))),inference(assume_negation,[status(cth)],[55])).
% fof(58, plain,(?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xb)&aElementOf0(xb,xI)),inference(fof_simplification,[status(thm)],[39,theory(equality)])).
% fof(245, plain,((((((aSet0(xI)&![X1]:(~(aElementOf0(X1,xI))|(![X2]:(~(aElementOf0(X2,xI))|aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&![X1]:((~(aElementOf0(X1,slsdtgt0(xa)))|?[X2]:(aElement0(X2)&sdtasdt0(xa,X2)=X1))&(![X2]:(~(aElement0(X2))|~(sdtasdt0(xa,X2)=X1))|aElementOf0(X1,slsdtgt0(xa)))))&![X1]:((~(aElementOf0(X1,slsdtgt0(xb)))|?[X2]:(aElement0(X2)&sdtasdt0(xb,X2)=X1))&(![X2]:(~(aElement0(X2))|~(sdtasdt0(xb,X2)=X1))|aElementOf0(X1,slsdtgt0(xb)))))&![X1]:((~(aElementOf0(X1,xI))|?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1))&(![X2]:![X3]:((~(aElementOf0(X2,slsdtgt0(xa)))|~(aElementOf0(X3,slsdtgt0(xb))))|~(sdtpldt0(X2,X3)=X1))|aElementOf0(X1,xI))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(fof_nnf,[status(thm)],[28])).
% fof(246, plain,((((((aSet0(xI)&![X4]:(~(aElementOf0(X4,xI))|(![X5]:(~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI))&![X6]:(~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI)))))&aIdeal0(xI))&![X7]:((~(aElementOf0(X7,slsdtgt0(xa)))|?[X8]:(aElement0(X8)&sdtasdt0(xa,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))))&![X10]:((~(aElementOf0(X10,slsdtgt0(xb)))|?[X11]:(aElement0(X11)&sdtasdt0(xb,X11)=X10))&(![X12]:(~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))))&![X13]:((~(aElementOf0(X13,xI))|?[X14]:?[X15]:((aElementOf0(X14,slsdtgt0(xa))&aElementOf0(X15,slsdtgt0(xb)))&sdtpldt0(X14,X15)=X13))&(![X16]:![X17]:((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(variable_rename,[status(thm)],[245])).
% fof(247, plain,((((((aSet0(xI)&![X4]:(~(aElementOf0(X4,xI))|(![X5]:(~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI))&![X6]:(~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI)))))&aIdeal0(xI))&![X7]:((~(aElementOf0(X7,slsdtgt0(xa)))|(aElement0(esk21_1(X7))&sdtasdt0(xa,esk21_1(X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))))&![X10]:((~(aElementOf0(X10,slsdtgt0(xb)))|(aElement0(esk22_1(X10))&sdtasdt0(xb,esk22_1(X10))=X10))&(![X12]:(~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))))&![X13]:((~(aElementOf0(X13,xI))|((aElementOf0(esk23_1(X13),slsdtgt0(xa))&aElementOf0(esk24_1(X13),slsdtgt0(xb)))&sdtpldt0(esk23_1(X13),esk24_1(X13))=X13))&(![X16]:![X17]:((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(skolemize,[status(esa)],[246])).
% fof(248, plain,![X4]:![X5]:![X6]:![X7]:![X9]:![X10]:![X12]:![X13]:![X16]:![X17]:((((((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))&(~(aElementOf0(X13,xI))|((aElementOf0(esk23_1(X13),slsdtgt0(xa))&aElementOf0(esk24_1(X13),slsdtgt0(xb)))&sdtpldt0(esk23_1(X13),esk24_1(X13))=X13)))&((((~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))&(~(aElementOf0(X10,slsdtgt0(xb)))|(aElement0(esk22_1(X10))&sdtasdt0(xb,esk22_1(X10))=X10)))&((((~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))&(~(aElementOf0(X7,slsdtgt0(xa)))|(aElement0(esk21_1(X7))&sdtasdt0(xa,esk21_1(X7))=X7)))&(((((~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI))&(~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI)))|~(aElementOf0(X4,xI)))&aSet0(xI))&aIdeal0(xI)))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(shift_quantors,[status(thm)],[247])).
% fof(249, plain,![X4]:![X5]:![X6]:![X7]:![X9]:![X10]:![X12]:![X13]:![X16]:![X17]:((((((~(aElementOf0(X16,slsdtgt0(xa)))|~(aElementOf0(X17,slsdtgt0(xb))))|~(sdtpldt0(X16,X17)=X13))|aElementOf0(X13,xI))&(((aElementOf0(esk23_1(X13),slsdtgt0(xa))|~(aElementOf0(X13,xI)))&(aElementOf0(esk24_1(X13),slsdtgt0(xb))|~(aElementOf0(X13,xI))))&(sdtpldt0(esk23_1(X13),esk24_1(X13))=X13|~(aElementOf0(X13,xI)))))&((((~(aElement0(X12))|~(sdtasdt0(xb,X12)=X10))|aElementOf0(X10,slsdtgt0(xb)))&((aElement0(esk22_1(X10))|~(aElementOf0(X10,slsdtgt0(xb))))&(sdtasdt0(xb,esk22_1(X10))=X10|~(aElementOf0(X10,slsdtgt0(xb))))))&((((~(aElement0(X9))|~(sdtasdt0(xa,X9)=X7))|aElementOf0(X7,slsdtgt0(xa)))&((aElement0(esk21_1(X7))|~(aElementOf0(X7,slsdtgt0(xa))))&(sdtasdt0(xa,esk21_1(X7))=X7|~(aElementOf0(X7,slsdtgt0(xa))))))&(((((~(aElement0(X6))|aElementOf0(sdtasdt0(X6,X4),xI))|~(aElementOf0(X4,xI)))&((~(aElementOf0(X5,xI))|aElementOf0(sdtpldt0(X4,X5),xI))|~(aElementOf0(X4,xI))))&aSet0(xI))&aIdeal0(xI)))))&xI=sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),inference(distribute,[status(thm)],[248])).
% cnf(253,plain,(aElementOf0(sdtpldt0(X1,X2),xI)|~aElementOf0(X1,xI)|~aElementOf0(X2,xI)),inference(split_conjunct,[status(thm)],[249])).
% fof(341, plain,(?[X3]:?[X4]:((aElementOf0(X3,slsdtgt0(xa))&aElementOf0(X4,slsdtgt0(xb)))&sdtpldt0(X3,X4)=smndt0(sdtasdt0(xq,xu)))&aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(variable_rename,[status(thm)],[38])).
% fof(342, plain,(((aElementOf0(esk39_0,slsdtgt0(xa))&aElementOf0(esk40_0,slsdtgt0(xb)))&sdtpldt0(esk39_0,esk40_0)=smndt0(sdtasdt0(xq,xu)))&aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(skolemize,[status(esa)],[341])).
% cnf(343,plain,(aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)),inference(split_conjunct,[status(thm)],[342])).
% cnf(344,plain,(sdtpldt0(esk39_0,esk40_0)=smndt0(sdtasdt0(xq,xu))),inference(split_conjunct,[status(thm)],[342])).
% fof(347, plain,(?[X3]:?[X4]:((aElementOf0(X3,slsdtgt0(xa))&aElementOf0(X4,slsdtgt0(xb)))&sdtpldt0(X3,X4)=xb)&aElementOf0(xb,xI)),inference(variable_rename,[status(thm)],[58])).
% fof(348, plain,(((aElementOf0(esk41_0,slsdtgt0(xa))&aElementOf0(esk42_0,slsdtgt0(xb)))&sdtpldt0(esk41_0,esk42_0)=xb)&aElementOf0(xb,xI)),inference(skolemize,[status(esa)],[347])).
% cnf(349,plain,(aElementOf0(xb,xI)),inference(split_conjunct,[status(thm)],[348])).
% cnf(353,plain,(xr=sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)),inference(split_conjunct,[status(thm)],[40])).
% fof(413, negated_conjecture,(![X1]:![X2]:((~(aElementOf0(X1,slsdtgt0(xa)))|~(aElementOf0(X2,slsdtgt0(xb))))|~(sdtpldt0(X1,X2)=xr))&~(aElementOf0(xr,xI))),inference(fof_nnf,[status(thm)],[56])).
% fof(414, negated_conjecture,(![X3]:![X4]:((~(aElementOf0(X3,slsdtgt0(xa)))|~(aElementOf0(X4,slsdtgt0(xb))))|~(sdtpldt0(X3,X4)=xr))&~(aElementOf0(xr,xI))),inference(variable_rename,[status(thm)],[413])).
% fof(415, negated_conjecture,![X3]:![X4]:(((~(aElementOf0(X3,slsdtgt0(xa)))|~(aElementOf0(X4,slsdtgt0(xb))))|~(sdtpldt0(X3,X4)=xr))&~(aElementOf0(xr,xI))),inference(shift_quantors,[status(thm)],[414])).
% cnf(416,negated_conjecture,(~aElementOf0(xr,xI)),inference(split_conjunct,[status(thm)],[415])).
% cnf(427,plain,(aElementOf0(sdtpldt0(esk39_0,esk40_0),xI)),inference(rw,[status(thm)],[343,344,theory(equality)])).
% cnf(428,plain,(sdtpldt0(sdtpldt0(esk39_0,esk40_0),xb)=xr),inference(rw,[status(thm)],[353,344,theory(equality)])).
% cnf(475,plain,(aElementOf0(xr,xI)|~aElementOf0(xb,xI)|~aElementOf0(sdtpldt0(esk39_0,esk40_0),xI)),inference(spm,[status(thm)],[253,428,theory(equality)])).
% cnf(485,plain,(aElementOf0(xr,xI)|$false|~aElementOf0(sdtpldt0(esk39_0,esk40_0),xI)),inference(rw,[status(thm)],[475,349,theory(equality)])).
% cnf(486,plain,(aElementOf0(xr,xI)|$false|$false),inference(rw,[status(thm)],[485,427,theory(equality)])).
% cnf(487,plain,(aElementOf0(xr,xI)),inference(cn,[status(thm)],[486,theory(equality)])).
% cnf(488,plain,($false),inference(sr,[status(thm)],[487,416,theory(equality)])).
% cnf(489,plain,($false),488,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 295
% # ...of these trivial                : 1
% # ...subsumed                        : 10
% # ...remaining for further processing: 284
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 3
% # Generated clauses                  : 27
% # ...of the previous two non-trivial : 19
% # Contextual simplify-reflections    : 4
% # Paramodulations                    : 26
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 82
% #    Positive orientable unit clauses: 55
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 7
% #    Non-unit-clauses                : 20
% # Current number of unprocessed clauses: 131
% # ...number of literals in the above : 530
% # Clause-clause subsumption calls (NU) : 355
% # Rec. Clause-clause subsumption calls : 165
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:   125 leaves,   1.03+/-0.176 terms/leaf
% # Paramod-from index:           70 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          119 leaves,   1.01+/-0.091 terms/leaf
% # -------------------------------------------------
% # User time              : 0.045 s
% # System time            : 0.005 s
% # Total time             : 0.050 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP17329/RNG123+4.tptp
% 
%------------------------------------------------------------------------------