TSTP Solution File: RNG095+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG095+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:36:00 EST 2010
% Result : Theorem 42.34s
% Output : Solution 42.34s
% 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/SystemOnTPTP6289/RNG095+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6289/RNG095+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6289/RNG095+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 6421
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% PrfWatch: 1.95 CPU 2.04 WC
% PrfWatch: 3.95 CPU 4.05 WC
% PrfWatch: 5.95 CPU 6.06 WC
% PrfWatch: 7.95 CPU 8.08 WC
% PrfWatch: 9.95 CPU 10.09 WC
% PrfWatch: 11.95 CPU 12.10 WC
% PrfWatch: 13.95 CPU 14.11 WC
% PrfWatch: 15.95 CPU 16.13 WC
% PrfWatch: 17.95 CPU 18.14 WC
% PrfWatch: 19.94 CPU 20.15 WC
% PrfWatch: 21.92 CPU 22.17 WC
% PrfWatch: 23.91 CPU 24.18 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 25.92 CPU 26.19 WC
% PrfWatch: 27.90 CPU 28.20 WC
% PrfWatch: 29.90 CPU 30.22 WC
% PrfWatch: 31.90 CPU 32.23 WC
% PrfWatch: 33.90 CPU 34.24 WC
% PrfWatch: 35.90 CPU 36.25 WC
% PrfWatch: 37.89 CPU 38.27 WC
% PrfWatch: 39.89 CPU 40.28 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,aElement0(sz10),file('/tmp/SRASS.s.p', mSortsC_01)).
% fof(6, axiom,(aIdeal0(xI)&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__1205)).
% fof(7, axiom,![X1]:(aElement0(X1)=>aElementOf0(X1,sdtpldt1(xI,xJ))),file('/tmp/SRASS.s.p', m__1205_03)).
% fof(9, axiom,![X1]:![X2]:((aSet0(X1)&aSet0(X2))=>![X3]:(X3=sdtpldt1(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>?[X5]:?[X6]:((aElementOf0(X5,X1)&aElementOf0(X6,X2))&sdtpldt0(X5,X6)=X4))))),file('/tmp/SRASS.s.p', mDefSSum)).
% fof(13, axiom,![X1]:(aIdeal0(X1)<=>(aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>(![X3]:(aElementOf0(X3,X1)=>aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(aElement0(X3)=>aElementOf0(sdtasdt0(X3,X2),X1)))))),file('/tmp/SRASS.s.p', mDefIdeal)).
% fof(31, conjecture,?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&sdtpldt0(X1,X2)=sz10),file('/tmp/SRASS.s.p', m__)).
% fof(32, negated_conjecture,~(?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&sdtpldt0(X1,X2)=sz10)),inference(assume_negation,[status(cth)],[31])).
% cnf(35,plain,(aElement0(sz10)),inference(split_conjunct,[status(thm)],[1])).
% cnf(48,plain,(aIdeal0(xJ)),inference(split_conjunct,[status(thm)],[6])).
% cnf(49,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[6])).
% fof(50, plain,![X1]:(~(aElement0(X1))|aElementOf0(X1,sdtpldt1(xI,xJ))),inference(fof_nnf,[status(thm)],[7])).
% fof(51, plain,![X2]:(~(aElement0(X2))|aElementOf0(X2,sdtpldt1(xI,xJ))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(aElementOf0(X1,sdtpldt1(xI,xJ))|~aElement0(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(55, plain,![X1]:![X2]:((~(aSet0(X1))|~(aSet0(X2)))|![X3]:((~(X3=sdtpldt1(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|?[X5]:?[X6]:((aElementOf0(X5,X1)&aElementOf0(X6,X2))&sdtpldt0(X5,X6)=X4))&(![X5]:![X6]:((~(aElementOf0(X5,X1))|~(aElementOf0(X6,X2)))|~(sdtpldt0(X5,X6)=X4))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|![X5]:![X6]:((~(aElementOf0(X5,X1))|~(aElementOf0(X6,X2)))|~(sdtpldt0(X5,X6)=X4)))&(aElementOf0(X4,X3)|?[X5]:?[X6]:((aElementOf0(X5,X1)&aElementOf0(X6,X2))&sdtpldt0(X5,X6)=X4))))|X3=sdtpldt1(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(56, plain,![X7]:![X8]:((~(aSet0(X7))|~(aSet0(X8)))|![X9]:((~(X9=sdtpldt1(X7,X8))|(aSet0(X9)&![X10]:((~(aElementOf0(X10,X9))|?[X11]:?[X12]:((aElementOf0(X11,X7)&aElementOf0(X12,X8))&sdtpldt0(X11,X12)=X10))&(![X13]:![X14]:((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9)))))&((~(aSet0(X9))|?[X15]:((~(aElementOf0(X15,X9))|![X16]:![X17]:((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=X15)))&(aElementOf0(X15,X9)|?[X18]:?[X19]:((aElementOf0(X18,X7)&aElementOf0(X19,X8))&sdtpldt0(X18,X19)=X15))))|X9=sdtpldt1(X7,X8)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X7]:![X8]:((~(aSet0(X7))|~(aSet0(X8)))|![X9]:((~(X9=sdtpldt1(X7,X8))|(aSet0(X9)&![X10]:((~(aElementOf0(X10,X9))|((aElementOf0(esk1_4(X7,X8,X9,X10),X7)&aElementOf0(esk2_4(X7,X8,X9,X10),X8))&sdtpldt0(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))=X10))&(![X13]:![X14]:((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9)))))&((~(aSet0(X9))|((~(aElementOf0(esk3_3(X7,X8,X9),X9))|![X16]:![X17]:((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=esk3_3(X7,X8,X9))))&(aElementOf0(esk3_3(X7,X8,X9),X9)|((aElementOf0(esk4_3(X7,X8,X9),X7)&aElementOf0(esk5_3(X7,X8,X9),X8))&sdtpldt0(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))=esk3_3(X7,X8,X9)))))|X9=sdtpldt1(X7,X8)))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=esk3_3(X7,X8,X9)))|~(aElementOf0(esk3_3(X7,X8,X9),X9)))&(aElementOf0(esk3_3(X7,X8,X9),X9)|((aElementOf0(esk4_3(X7,X8,X9),X7)&aElementOf0(esk5_3(X7,X8,X9),X8))&sdtpldt0(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))=esk3_3(X7,X8,X9))))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))&((((((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9))&(~(aElementOf0(X10,X9))|((aElementOf0(esk1_4(X7,X8,X9,X10),X7)&aElementOf0(esk2_4(X7,X8,X9,X10),X8))&sdtpldt0(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))=X10)))&aSet0(X9))|~(X9=sdtpldt1(X7,X8))))|(~(aSet0(X7))|~(aSet0(X8)))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((((~(aElementOf0(X16,X7))|~(aElementOf0(X17,X8)))|~(sdtpldt0(X16,X17)=esk3_3(X7,X8,X9)))|~(aElementOf0(esk3_3(X7,X8,X9),X9)))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8))))&((((((aElementOf0(esk4_3(X7,X8,X9),X7)|aElementOf0(esk3_3(X7,X8,X9),X9))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8))))&((((aElementOf0(esk5_3(X7,X8,X9),X8)|aElementOf0(esk3_3(X7,X8,X9),X9))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8)))))&((((sdtpldt0(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))=esk3_3(X7,X8,X9)|aElementOf0(esk3_3(X7,X8,X9),X9))|~(aSet0(X9)))|X9=sdtpldt1(X7,X8))|(~(aSet0(X7))|~(aSet0(X8))))))&(((((((~(aElementOf0(X13,X7))|~(aElementOf0(X14,X8)))|~(sdtpldt0(X13,X14)=X10))|aElementOf0(X10,X9))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8))))&(((((aElementOf0(esk1_4(X7,X8,X9,X10),X7)|~(aElementOf0(X10,X9)))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8))))&(((aElementOf0(esk2_4(X7,X8,X9,X10),X8)|~(aElementOf0(X10,X9)))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8)))))&(((sdtpldt0(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))=X10|~(aElementOf0(X10,X9)))|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8))))))&((aSet0(X9)|~(X9=sdtpldt1(X7,X8)))|(~(aSet0(X7))|~(aSet0(X8)))))),inference(distribute,[status(thm)],[58])).
% cnf(61,plain,(sdtpldt0(esk1_4(X2,X1,X3,X4),esk2_4(X2,X1,X3,X4))=X4|~aSet0(X1)|~aSet0(X2)|X3!=sdtpldt1(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[59])).
% cnf(62,plain,(aElementOf0(esk2_4(X2,X1,X3,X4),X1)|~aSet0(X1)|~aSet0(X2)|X3!=sdtpldt1(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[59])).
% cnf(63,plain,(aElementOf0(esk1_4(X2,X1,X3,X4),X2)|~aSet0(X1)|~aSet0(X2)|X3!=sdtpldt1(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[59])).
% fof(84, plain,![X1]:((~(aIdeal0(X1))|(aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|(![X3]:(~(aElementOf0(X3,X1))|aElementOf0(sdtpldt0(X2,X3),X1))&![X3]:(~(aElement0(X3))|aElementOf0(sdtasdt0(X3,X2),X1))))))&((~(aSet0(X1))|?[X2]:(aElementOf0(X2,X1)&(?[X3]:(aElementOf0(X3,X1)&~(aElementOf0(sdtpldt0(X2,X3),X1)))|?[X3]:(aElement0(X3)&~(aElementOf0(sdtasdt0(X3,X2),X1))))))|aIdeal0(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(85, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|?[X8]:(aElementOf0(X8,X4)&(?[X9]:(aElementOf0(X9,X4)&~(aElementOf0(sdtpldt0(X8,X9),X4)))|?[X10]:(aElement0(X10)&~(aElementOf0(sdtasdt0(X10,X8),X4))))))|aIdeal0(X4))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X4]:((~(aIdeal0(X4))|(aSet0(X4)&![X5]:(~(aElementOf0(X5,X4))|(![X6]:(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))&![X7]:(~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))))))&((~(aSet0(X4))|(aElementOf0(esk6_1(X4),X4)&((aElementOf0(esk7_1(X4),X4)&~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|(aElement0(esk8_1(X4))&~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[85])).
% fof(87, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))&(~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4)))|~(aElementOf0(X5,X4)))&aSet0(X4))|~(aIdeal0(X4)))&((~(aSet0(X4))|(aElementOf0(esk6_1(X4),X4)&((aElementOf0(esk7_1(X4),X4)&~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|(aElement0(esk8_1(X4))&~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[86])).
% fof(88, plain,![X4]:![X5]:![X6]:![X7]:((((((~(aElement0(X7))|aElementOf0(sdtasdt0(X7,X5),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4)))&(((~(aElementOf0(X6,X4))|aElementOf0(sdtpldt0(X5,X6),X4))|~(aElementOf0(X5,X4)))|~(aIdeal0(X4))))&(aSet0(X4)|~(aIdeal0(X4))))&(((aElementOf0(esk6_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk8_1(X4))|aElementOf0(esk7_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))|aElementOf0(esk7_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk8_1(X4))|~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk8_1(X4),esk6_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk6_1(X4),esk7_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[87])).
% cnf(94,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(165, negated_conjecture,![X1]:![X2]:((~(aElementOf0(X1,xI))|~(aElementOf0(X2,xJ)))|~(sdtpldt0(X1,X2)=sz10)),inference(fof_nnf,[status(thm)],[32])).
% fof(166, negated_conjecture,![X3]:![X4]:((~(aElementOf0(X3,xI))|~(aElementOf0(X4,xJ)))|~(sdtpldt0(X3,X4)=sz10)),inference(variable_rename,[status(thm)],[165])).
% cnf(167,negated_conjecture,(sdtpldt0(X1,X2)!=sz10|~aElementOf0(X2,xJ)|~aElementOf0(X1,xI)),inference(split_conjunct,[status(thm)],[166])).
% cnf(168,plain,(aSet0(xJ)),inference(spm,[status(thm)],[94,48,theory(equality)])).
% cnf(169,plain,(aSet0(xI)),inference(spm,[status(thm)],[94,49,theory(equality)])).
% cnf(375,negated_conjecture,(X4!=sz10|~aElementOf0(esk2_4(X1,X2,X3,X4),xJ)|~aElementOf0(esk1_4(X1,X2,X3,X4),xI)|sdtpldt1(X1,X2)!=X3|~aSet0(X1)|~aSet0(X2)|~aElementOf0(X4,X3)),inference(spm,[status(thm)],[167,61,theory(equality)])).
% cnf(5123,negated_conjecture,(sdtpldt1(X1,xJ)!=X2|X3!=sz10|~aSet0(X1)|~aSet0(xJ)|~aElementOf0(esk1_4(X1,xJ,X2,X3),xI)|~aElementOf0(X3,X2)),inference(spm,[status(thm)],[375,62,theory(equality)])).
% cnf(5124,negated_conjecture,(sdtpldt1(X1,xJ)!=X2|X3!=sz10|~aSet0(X1)|$false|~aElementOf0(esk1_4(X1,xJ,X2,X3),xI)|~aElementOf0(X3,X2)),inference(rw,[status(thm)],[5123,168,theory(equality)])).
% cnf(5125,negated_conjecture,(sdtpldt1(X1,xJ)!=X2|X3!=sz10|~aSet0(X1)|~aElementOf0(esk1_4(X1,xJ,X2,X3),xI)|~aElementOf0(X3,X2)),inference(cn,[status(thm)],[5124,theory(equality)])).
% cnf(1129469,negated_conjecture,(sdtpldt1(xI,xJ)!=X1|X2!=sz10|~aSet0(xI)|~aElementOf0(X2,X1)|~aSet0(xJ)),inference(spm,[status(thm)],[5125,63,theory(equality)])).
% cnf(1129477,negated_conjecture,(sdtpldt1(xI,xJ)!=X1|X2!=sz10|$false|~aElementOf0(X2,X1)|~aSet0(xJ)),inference(rw,[status(thm)],[1129469,169,theory(equality)])).
% cnf(1129478,negated_conjecture,(sdtpldt1(xI,xJ)!=X1|X2!=sz10|$false|~aElementOf0(X2,X1)|$false),inference(rw,[status(thm)],[1129477,168,theory(equality)])).
% cnf(1129479,negated_conjecture,(sdtpldt1(xI,xJ)!=X1|X2!=sz10|~aElementOf0(X2,X1)),inference(cn,[status(thm)],[1129478,theory(equality)])).
% cnf(1129482,negated_conjecture,(X1!=sz10|~aElementOf0(X1,sdtpldt1(xI,xJ))),inference(er,[status(thm)],[1129479,theory(equality)])).
% cnf(1129575,negated_conjecture,(X1!=sz10|~aElement0(X1)),inference(spm,[status(thm)],[1129482,52,theory(equality)])).
% cnf(1129677,negated_conjecture,($false),inference(spm,[status(thm)],[1129575,35,theory(equality)])).
% cnf(1129678,negated_conjecture,($false),1129677,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11434
% # ...of these trivial : 20
% # ...subsumed : 9692
% # ...remaining for further processing: 1722
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 47
% # Backward-rewritten : 2
% # Generated clauses : 643487
% # ...of the previous two non-trivial : 636702
% # Contextual simplify-reflections : 5672
% # Paramodulations : 643413
% # Factorizations : 0
% # Equation resolutions : 69
% # Current number of processed clauses: 1671
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1641
% # Current number of unprocessed clauses: 621268
% # ...number of literals in the above : 4474580
% # Clause-clause subsumption calls (NU) : 393404
% # Rec. Clause-clause subsumption calls : 145636
% # Unit Clause-clause subsumption calls : 37
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 764 leaves, 2.45+/-3.462 terms/leaf
% # Paramod-from index: 454 leaves, 1.53+/-1.581 terms/leaf
% # Paramod-into index: 654 leaves, 2.06+/-2.535 terms/leaf
% # -------------------------------------------------
% # User time : 23.606 s
% # System time : 0.848 s
% # Total time : 24.454 s
% # Maximum resident set size: 0 pages
% PrfWatch: 41.17 CPU 41.58 WC
% FINAL PrfWatch: 41.17 CPU 41.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP6289/RNG095+1.tptp
%
%------------------------------------------------------------------------------