TSTP Solution File: RNG099+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG099+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 : art09.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:34:17 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP4430/RNG099+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4430/RNG099+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4430/RNG099+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 4526
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB)).
% fof(4, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>aElement0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(12, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(18, 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))&aSet0(xJ))&![X1]:(aElementOf0(X1,xJ)=>(![X2]:(aElementOf0(X2,xJ)=>aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__1205)).
% fof(20, axiom,(aElement0(xx)&aElement0(xy)),file('/tmp/SRASS.s.p', m__1217)).
% fof(21, axiom,((aElementOf0(xa,xI)&aElementOf0(xb,xJ))&sdtpldt0(xa,xb)=sz10),file('/tmp/SRASS.s.p', m__1294)).
% fof(22, axiom,xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),file('/tmp/SRASS.s.p', m__1319)).
% fof(23, axiom,aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),file('/tmp/SRASS.s.p', m__1332)).
% fof(24, axiom,aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),file('/tmp/SRASS.s.p', m__1409)).
% fof(35, conjecture,?[X1]:((aElement0(X1)&(aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|sdteqdtlpzmzozddtrp0(X1,xx,xI)))&(aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|sdteqdtlpzmzozddtrp0(X1,xy,xJ))),file('/tmp/SRASS.s.p', m__)).
% fof(36, negated_conjecture,~(?[X1]:((aElement0(X1)&(aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|sdteqdtlpzmzozddtrp0(X1,xx,xI)))&(aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)|sdteqdtlpzmzozddtrp0(X1,xy,xJ)))),inference(assume_negation,[status(cth)],[35])).
% fof(43, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(44, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[43])).
% cnf(45,plain,(aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(47, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(76, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(77, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[77])).
% cnf(79,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(123, 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))&aSet0(xJ))&![X1]:(~(aElementOf0(X1,xJ))|(![X2]:(~(aElementOf0(X2,xJ))|aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),inference(fof_nnf,[status(thm)],[18])).
% fof(124, plain,(((((aSet0(xI)&![X3]:(~(aElementOf0(X3,xI))|(![X4]:(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))&![X5]:(~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X6]:(~(aElementOf0(X6,xJ))|(![X7]:(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))&![X8]:(~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ)))))&aIdeal0(xJ)),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))&(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ)))|~(aElementOf0(X6,xJ)))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))&(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI)))|~(aElementOf0(X3,xI)))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(shift_quantors,[status(thm)],[124])).
% fof(126, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))|~(aElementOf0(X6,xJ)))&((~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))|~(aElementOf0(X6,xJ))))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))|~(aElementOf0(X3,xI)))&((~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))|~(aElementOf0(X3,xI))))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(distribute,[status(thm)],[125])).
% cnf(128,plain,(aSet0(xJ)),inference(split_conjunct,[status(thm)],[126])).
% cnf(130,plain,(aSet0(xI)),inference(split_conjunct,[status(thm)],[126])).
% cnf(143,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[20])).
% cnf(144,plain,(aElement0(xx)),inference(split_conjunct,[status(thm)],[20])).
% cnf(146,plain,(aElementOf0(xb,xJ)),inference(split_conjunct,[status(thm)],[21])).
% cnf(147,plain,(aElementOf0(xa,xI)),inference(split_conjunct,[status(thm)],[21])).
% cnf(148,plain,(xw=sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb))),inference(split_conjunct,[status(thm)],[22])).
% cnf(149,plain,(aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)),inference(split_conjunct,[status(thm)],[23])).
% cnf(150,plain,(aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ)),inference(split_conjunct,[status(thm)],[24])).
% fof(190, negated_conjecture,![X1]:((~(aElement0(X1))|(~(aElementOf0(sdtpldt0(X1,smndt0(xx)),xI))&~(sdteqdtlpzmzozddtrp0(X1,xx,xI))))|(~(aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ))&~(sdteqdtlpzmzozddtrp0(X1,xy,xJ)))),inference(fof_nnf,[status(thm)],[36])).
% fof(191, negated_conjecture,![X2]:((~(aElement0(X2))|(~(aElementOf0(sdtpldt0(X2,smndt0(xx)),xI))&~(sdteqdtlpzmzozddtrp0(X2,xx,xI))))|(~(aElementOf0(sdtpldt0(X2,smndt0(xy)),xJ))&~(sdteqdtlpzmzozddtrp0(X2,xy,xJ)))),inference(variable_rename,[status(thm)],[190])).
% fof(192, negated_conjecture,![X2]:(((~(aElementOf0(sdtpldt0(X2,smndt0(xy)),xJ))|(~(aElementOf0(sdtpldt0(X2,smndt0(xx)),xI))|~(aElement0(X2))))&(~(sdteqdtlpzmzozddtrp0(X2,xy,xJ))|(~(aElementOf0(sdtpldt0(X2,smndt0(xx)),xI))|~(aElement0(X2)))))&((~(aElementOf0(sdtpldt0(X2,smndt0(xy)),xJ))|(~(sdteqdtlpzmzozddtrp0(X2,xx,xI))|~(aElement0(X2))))&(~(sdteqdtlpzmzozddtrp0(X2,xy,xJ))|(~(sdteqdtlpzmzozddtrp0(X2,xx,xI))|~(aElement0(X2)))))),inference(distribute,[status(thm)],[191])).
% cnf(196,negated_conjecture,(~aElement0(X1)|~aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)|~aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)),inference(split_conjunct,[status(thm)],[192])).
% cnf(207,plain,(aElement0(xb)|~aSet0(xJ)),inference(spm,[status(thm)],[79,146,theory(equality)])).
% cnf(208,plain,(aElement0(xa)|~aSet0(xI)),inference(spm,[status(thm)],[79,147,theory(equality)])).
% cnf(209,plain,(aElement0(xb)|$false),inference(rw,[status(thm)],[207,128,theory(equality)])).
% cnf(210,plain,(aElement0(xb)),inference(cn,[status(thm)],[209,theory(equality)])).
% cnf(211,plain,(aElement0(xa)|$false),inference(rw,[status(thm)],[208,130,theory(equality)])).
% cnf(212,plain,(aElement0(xa)),inference(cn,[status(thm)],[211,theory(equality)])).
% cnf(308,negated_conjecture,(~aElementOf0(sdtpldt0(xw,smndt0(xx)),xI)|~aElement0(xw)),inference(spm,[status(thm)],[196,150,theory(equality)])).
% cnf(314,negated_conjecture,($false|~aElement0(xw)),inference(rw,[status(thm)],[308,149,theory(equality)])).
% cnf(315,negated_conjecture,(~aElement0(xw)),inference(cn,[status(thm)],[314,theory(equality)])).
% cnf(461,plain,(aElement0(xw)|~aElement0(sdtasdt0(xx,xb))|~aElement0(sdtasdt0(xy,xa))),inference(spm,[status(thm)],[45,148,theory(equality)])).
% cnf(4822,plain,(~aElement0(sdtasdt0(xx,xb))|~aElement0(sdtasdt0(xy,xa))),inference(sr,[status(thm)],[461,315,theory(equality)])).
% cnf(4823,plain,(~aElement0(sdtasdt0(xx,xb))|~aElement0(xa)|~aElement0(xy)),inference(spm,[status(thm)],[4822,48,theory(equality)])).
% cnf(4827,plain,(~aElement0(sdtasdt0(xx,xb))|$false|~aElement0(xy)),inference(rw,[status(thm)],[4823,212,theory(equality)])).
% cnf(4828,plain,(~aElement0(sdtasdt0(xx,xb))|$false|$false),inference(rw,[status(thm)],[4827,143,theory(equality)])).
% cnf(4829,plain,(~aElement0(sdtasdt0(xx,xb))),inference(cn,[status(thm)],[4828,theory(equality)])).
% cnf(4837,plain,(~aElement0(xb)|~aElement0(xx)),inference(spm,[status(thm)],[4829,48,theory(equality)])).
% cnf(4841,plain,($false|~aElement0(xx)),inference(rw,[status(thm)],[4837,210,theory(equality)])).
% cnf(4842,plain,($false|$false),inference(rw,[status(thm)],[4841,144,theory(equality)])).
% cnf(4843,plain,($false),inference(cn,[status(thm)],[4842,theory(equality)])).
% cnf(4844,plain,($false),4843,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 487
% # ...of these trivial : 10
% # ...subsumed : 255
% # ...remaining for further processing: 222
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 3
% # Generated clauses : 2114
% # ...of the previous two non-trivial : 1732
% # Contextual simplify-reflections : 131
% # Paramodulations : 2104
% # Factorizations : 0
% # Equation resolutions : 10
% # Current number of processed clauses: 212
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 176
% # Current number of unprocessed clauses: 1282
% # ...number of literals in the above : 6602
% # Clause-clause subsumption calls (NU) : 3800
% # Rec. Clause-clause subsumption calls : 3053
% # Unit Clause-clause subsumption calls : 129
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 246 leaves, 1.24+/-0.936 terms/leaf
% # Paramod-from index: 113 leaves, 1.04+/-0.206 terms/leaf
% # Paramod-into index: 220 leaves, 1.12+/-0.456 terms/leaf
% # -------------------------------------------------
% # User time : 0.101 s
% # System time : 0.004 s
% # Total time : 0.105 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.33 WC
% FINAL PrfWatch: 0.23 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP4430/RNG099+2.tptp
%
%------------------------------------------------------------------------------