TSTP Solution File: RNG090+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG090+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 : art03.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:29:50 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP8851/RNG090+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8851/RNG090+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8851/RNG090+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 8981
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 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(3, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),file('/tmp/SRASS.s.p', mAddComm)).
% fof(4, axiom,![X1]:![X2]:![X3]:(((aElement0(X1)&aElement0(X2))&aElement0(X3))=>sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(8, axiom,(aIdeal0(xI)&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__870)).
% fof(10, axiom,((aElementOf0(xk,xI)&aElementOf0(xl,xJ))&xx=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__934)).
% fof(11, axiom,((aElementOf0(xm,xI)&aElementOf0(xn,xJ))&xy=sdtpldt0(xm,xn)),file('/tmp/SRASS.s.p', m__967)).
% fof(12, axiom,(aElementOf0(sdtpldt0(xk,xm),xI)&aElementOf0(sdtpldt0(xl,xn),xJ)),file('/tmp/SRASS.s.p', m__994)).
% fof(14, 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(21, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(31, conjecture,sdtpldt0(xx,xy)=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),file('/tmp/SRASS.s.p', m__)).
% fof(32, negated_conjecture,~(sdtpldt0(xx,xy)=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn))),inference(assume_negation,[status(cth)],[31])).
% fof(35, negated_conjecture,~(sdtpldt0(xx,xy)=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn))),inference(fof_simplification,[status(thm)],[32,theory(equality)])).
% fof(36, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|aElement0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(37, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|aElement0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(42, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|sdtpldt0(X1,X2)=sdtpldt0(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(43, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|sdtpldt0(X3,X4)=sdtpldt0(X4,X3)),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X1]:![X2]:![X3]:(((~(aElement0(X1))|~(aElement0(X2)))|~(aElement0(X3)))|sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(46, plain,![X4]:![X5]:![X6]:(((~(aElement0(X4))|~(aElement0(X5)))|~(aElement0(X6)))|sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[46])).
% cnf(59,plain,(aIdeal0(xJ)),inference(split_conjunct,[status(thm)],[8])).
% cnf(60,plain,(aIdeal0(xI)),inference(split_conjunct,[status(thm)],[8])).
% cnf(64,plain,(xx=sdtpldt0(xk,xl)),inference(split_conjunct,[status(thm)],[10])).
% cnf(65,plain,(aElementOf0(xl,xJ)),inference(split_conjunct,[status(thm)],[10])).
% cnf(66,plain,(aElementOf0(xk,xI)),inference(split_conjunct,[status(thm)],[10])).
% cnf(67,plain,(xy=sdtpldt0(xm,xn)),inference(split_conjunct,[status(thm)],[11])).
% cnf(68,plain,(aElementOf0(xn,xJ)),inference(split_conjunct,[status(thm)],[11])).
% cnf(69,plain,(aElementOf0(xm,xI)),inference(split_conjunct,[status(thm)],[11])).
% cnf(71,plain,(aElementOf0(sdtpldt0(xk,xm),xI)),inference(split_conjunct,[status(thm)],[12])).
% fof(74, 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)],[14])).
% fof(75, 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)],[74])).
% fof(76, 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(esk1_1(X4),X4)&((aElementOf0(esk2_1(X4),X4)&~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|(aElement0(esk3_1(X4))&~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))))))|aIdeal0(X4))),inference(skolemize,[status(esa)],[75])).
% fof(77, 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(esk1_1(X4),X4)&((aElementOf0(esk2_1(X4),X4)&~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|(aElement0(esk3_1(X4))&~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))))))|aIdeal0(X4))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, 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(esk1_1(X4),X4)|~(aSet0(X4)))|aIdeal0(X4))&(((((aElement0(esk3_1(X4))|aElementOf0(esk2_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))|aElementOf0(esk2_1(X4),X4))|~(aSet0(X4)))|aIdeal0(X4)))&((((aElement0(esk3_1(X4))|~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4))&(((~(aElementOf0(sdtasdt0(esk3_1(X4),esk1_1(X4)),X4))|~(aElementOf0(sdtpldt0(esk1_1(X4),esk2_1(X4)),X4)))|~(aSet0(X4)))|aIdeal0(X4)))))),inference(distribute,[status(thm)],[77])).
% cnf(84,plain,(aSet0(X1)|~aIdeal0(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(127, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(128, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[127])).
% fof(129, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[128])).
% cnf(130,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[129])).
% cnf(163,negated_conjecture,(sdtpldt0(xx,xy)!=sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn))),inference(split_conjunct,[status(thm)],[35])).
% cnf(164,plain,(aSet0(xJ)),inference(spm,[status(thm)],[84,59,theory(equality)])).
% cnf(165,plain,(aSet0(xI)),inference(spm,[status(thm)],[84,60,theory(equality)])).
% cnf(186,plain,(aElement0(xn)|~aSet0(xJ)),inference(spm,[status(thm)],[130,68,theory(equality)])).
% cnf(187,plain,(aElement0(xm)|~aSet0(xI)),inference(spm,[status(thm)],[130,69,theory(equality)])).
% cnf(188,plain,(aElement0(xl)|~aSet0(xJ)),inference(spm,[status(thm)],[130,65,theory(equality)])).
% cnf(189,plain,(aElement0(xk)|~aSet0(xI)),inference(spm,[status(thm)],[130,66,theory(equality)])).
% cnf(191,plain,(aElement0(sdtpldt0(xk,xm))|~aSet0(xI)),inference(spm,[status(thm)],[130,71,theory(equality)])).
% cnf(194,plain,(aElement0(xy)|~aElement0(xn)|~aElement0(xm)),inference(spm,[status(thm)],[38,67,theory(equality)])).
% cnf(281,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aElement0(X3)|~aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)),inference(spm,[status(thm)],[44,47,theory(equality)])).
% cnf(292,plain,(sdtpldt0(sdtpldt0(X2,X1),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1)),inference(spm,[status(thm)],[47,44,theory(equality)])).
% cnf(462,plain,(aElement0(xn)|$false),inference(rw,[status(thm)],[186,164,theory(equality)])).
% cnf(463,plain,(aElement0(xn)),inference(cn,[status(thm)],[462,theory(equality)])).
% cnf(464,plain,(aElement0(xm)|$false),inference(rw,[status(thm)],[187,165,theory(equality)])).
% cnf(465,plain,(aElement0(xm)),inference(cn,[status(thm)],[464,theory(equality)])).
% cnf(466,plain,(aElement0(xl)|$false),inference(rw,[status(thm)],[188,164,theory(equality)])).
% cnf(467,plain,(aElement0(xl)),inference(cn,[status(thm)],[466,theory(equality)])).
% cnf(484,plain,(aElement0(xk)|$false),inference(rw,[status(thm)],[189,165,theory(equality)])).
% cnf(485,plain,(aElement0(xk)),inference(cn,[status(thm)],[484,theory(equality)])).
% cnf(503,plain,(aElement0(xy)|$false|~aElement0(xm)),inference(rw,[status(thm)],[194,463,theory(equality)])).
% cnf(504,plain,(aElement0(xy)|$false|$false),inference(rw,[status(thm)],[503,465,theory(equality)])).
% cnf(505,plain,(aElement0(xy)),inference(cn,[status(thm)],[504,theory(equality)])).
% cnf(514,plain,(aElement0(sdtpldt0(xk,xm))|$false),inference(rw,[status(thm)],[191,165,theory(equality)])).
% cnf(515,plain,(aElement0(sdtpldt0(xk,xm))),inference(cn,[status(thm)],[514,theory(equality)])).
% cnf(1423,plain,(sdtpldt0(xx,X1)=sdtpldt0(xl,sdtpldt0(xk,X1))|~aElement0(X1)|~aElement0(xk)|~aElement0(xl)),inference(spm,[status(thm)],[292,64,theory(equality)])).
% cnf(1489,plain,(sdtpldt0(xx,X1)=sdtpldt0(xl,sdtpldt0(xk,X1))|~aElement0(X1)|$false|~aElement0(xl)),inference(rw,[status(thm)],[1423,485,theory(equality)])).
% cnf(1490,plain,(sdtpldt0(xx,X1)=sdtpldt0(xl,sdtpldt0(xk,X1))|~aElement0(X1)|$false|$false),inference(rw,[status(thm)],[1489,467,theory(equality)])).
% cnf(1491,plain,(sdtpldt0(xx,X1)=sdtpldt0(xl,sdtpldt0(xk,X1))|~aElement0(X1)),inference(cn,[status(thm)],[1490,theory(equality)])).
% cnf(2138,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(X3,sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1)|~aElement0(X3)),inference(csr,[status(thm)],[281,38])).
% cnf(2166,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|~aElement0(sdtpldt0(xk,xm))|~aElement0(xn)|~aElement0(xl)),inference(spm,[status(thm)],[163,2138,theory(equality)])).
% cnf(2381,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|$false|~aElement0(xn)|~aElement0(xl)),inference(rw,[status(thm)],[2166,515,theory(equality)])).
% cnf(2382,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|$false|$false|~aElement0(xl)),inference(rw,[status(thm)],[2381,463,theory(equality)])).
% cnf(2383,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)|$false|$false|$false),inference(rw,[status(thm)],[2382,467,theory(equality)])).
% cnf(2384,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xn,sdtpldt0(xk,xm)))!=sdtpldt0(xx,xy)),inference(cn,[status(thm)],[2383,theory(equality)])).
% cnf(2618,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,sdtpldt0(xm,xn)))!=sdtpldt0(xx,xy)|~aElement0(xn)|~aElement0(xm)|~aElement0(xk)),inference(spm,[status(thm)],[2384,2138,theory(equality)])).
% cnf(2624,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|~aElement0(xn)|~aElement0(xm)|~aElement0(xk)),inference(rw,[status(thm)],[2618,67,theory(equality)])).
% cnf(2625,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|$false|~aElement0(xm)|~aElement0(xk)),inference(rw,[status(thm)],[2624,463,theory(equality)])).
% cnf(2626,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|$false|$false|~aElement0(xk)),inference(rw,[status(thm)],[2625,465,theory(equality)])).
% cnf(2627,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)|$false|$false|$false),inference(rw,[status(thm)],[2626,485,theory(equality)])).
% cnf(2628,negated_conjecture,(sdtpldt0(xl,sdtpldt0(xk,xy))!=sdtpldt0(xx,xy)),inference(cn,[status(thm)],[2627,theory(equality)])).
% cnf(2632,negated_conjecture,(~aElement0(xy)),inference(spm,[status(thm)],[2628,1491,theory(equality)])).
% cnf(2637,negated_conjecture,($false),inference(rw,[status(thm)],[2632,505,theory(equality)])).
% cnf(2638,negated_conjecture,($false),inference(cn,[status(thm)],[2637,theory(equality)])).
% cnf(2639,negated_conjecture,($false),2638,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 220
% # ...of these trivial : 14
% # ...subsumed : 70
% # ...remaining for further processing: 136
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 970
% # ...of the previous two non-trivial : 785
% # Contextual simplify-reflections : 18
% # Paramodulations : 961
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 135
% # Positive orientable unit clauses: 47
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 81
% # Current number of unprocessed clauses: 633
% # ...number of literals in the above : 2701
% # Clause-clause subsumption calls (NU) : 583
% # Rec. Clause-clause subsumption calls : 502
% # Unit Clause-clause subsumption calls : 20
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 183 leaves, 1.22+/-0.917 terms/leaf
% # Paramod-from index: 100 leaves, 1.04+/-0.196 terms/leaf
% # Paramod-into index: 167 leaves, 1.11+/-0.465 terms/leaf
% # -------------------------------------------------
% # User time : 0.049 s
% # System time : 0.005 s
% # Total time : 0.054 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.26 WC
% FINAL PrfWatch: 0.16 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP8851/RNG090+1.tptp
%
%------------------------------------------------------------------------------