TSTP Solution File: NUM547+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM547+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 : 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 20:02:18 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP31037/NUM547+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31037/NUM547+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31037/NUM547+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 31133
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.024 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(2, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(7, axiom,aElementOf0(xk,szNzAzT0),file('/tmp/SRASS.s.p', m__2202)).
% fof(8, axiom,((aSet0(xS)&aSet0(xT))&~(xk=sz00)),file('/tmp/SRASS.s.p', m__2202_02)).
% fof(9, axiom,(aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))&~(slbdtsldtrb0(xS,xk)=slcrc0)),file('/tmp/SRASS.s.p', m__2227)).
% fof(12, axiom,![X1]:![X2]:((aSet0(X1)&aElementOf0(X2,szNzAzT0))=>![X3]:(X3=slbdtsldtrb0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))),file('/tmp/SRASS.s.p', mDefSel)).
% fof(65, conjecture,?[X1]:aElementOf0(X1,slbdtsldtrb0(xS,xk)),file('/tmp/SRASS.s.p', m__)).
% fof(66, negated_conjecture,~(?[X1]:aElementOf0(X1,slbdtsldtrb0(xS,xk))),inference(assume_negation,[status(cth)],[65])).
% fof(78, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[1])).
% fof(79, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[78])).
% fof(80, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[79])).
% fof(81, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[80])).
% fof(82, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[81])).
% cnf(83,plain,(X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(86, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(87, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[86])).
% fof(88, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[87])).
% fof(89, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[88])).
% fof(90, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk2_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk2_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[89])).
% cnf(93,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[90])).
% cnf(105,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(107,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[8])).
% cnf(109,plain,(slbdtsldtrb0(xS,xk)!=slcrc0),inference(split_conjunct,[status(thm)],[9])).
% cnf(110,plain,(aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))),inference(split_conjunct,[status(thm)],[9])).
% fof(116, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElementOf0(X2,szNzAzT0)))|![X3]:((~(X3=slbdtsldtrb0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))&((~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|(~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2)))&(aElementOf0(X4,X3)|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))|X3=slbdtsldtrb0(X1,X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(117, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|(~(aSubsetOf0(X9,X5))|~(sbrdtbr0(X9)=X6)))&(aElementOf0(X9,X7)|(aSubsetOf0(X9,X5)&sbrdtbr0(X9)=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(variable_rename,[status(thm)],[116])).
% fof(118, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk3_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk3_3(X5,X6,X7),X5))|~(sbrdtbr0(esk3_3(X5,X6,X7))=X6)))&(aElementOf0(esk3_3(X5,X6,X7),X7)|(aSubsetOf0(esk3_3(X5,X6,X7),X5)&sbrdtbr0(esk3_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[117])).
% fof(119, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=slbdtsldtrb0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk3_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk3_3(X5,X6,X7),X5))|~(sbrdtbr0(esk3_3(X5,X6,X7))=X6)))&(aElementOf0(esk3_3(X5,X6,X7),X7)|(aSubsetOf0(esk3_3(X5,X6,X7),X5)&sbrdtbr0(esk3_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[118])).
% fof(120, plain,![X5]:![X6]:![X7]:![X8]:(((((((aSubsetOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((sbrdtbr0(X8)=X6|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((aSet0(X7)|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&(((((~(aElementOf0(esk3_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk3_3(X5,X6,X7),X5))|~(sbrdtbr0(esk3_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk3_3(X5,X6,X7),X5)|aElementOf0(esk3_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk3_3(X5,X6,X7))=X6|aElementOf0(esk3_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[119])).
% cnf(124,plain,(aSet0(X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(350, negated_conjecture,![X1]:~(aElementOf0(X1,slbdtsldtrb0(xS,xk))),inference(fof_nnf,[status(thm)],[66])).
% fof(351, negated_conjecture,![X2]:~(aElementOf0(X2,slbdtsldtrb0(xS,xk))),inference(variable_rename,[status(thm)],[350])).
% cnf(352,negated_conjecture,(~aElementOf0(X1,slbdtsldtrb0(xS,xk))),inference(split_conjunct,[status(thm)],[351])).
% cnf(412,plain,(aSet0(slbdtsldtrb0(xS,xk))|~aSet0(slbdtsldtrb0(xT,xk))),inference(spm,[status(thm)],[93,110,theory(equality)])).
% cnf(414,negated_conjecture,(slcrc0=slbdtsldtrb0(xS,xk)|~aSet0(slbdtsldtrb0(xS,xk))),inference(spm,[status(thm)],[352,83,theory(equality)])).
% cnf(417,negated_conjecture,(~aSet0(slbdtsldtrb0(xS,xk))),inference(sr,[status(thm)],[414,109,theory(equality)])).
% cnf(458,plain,(aSet0(slbdtsldtrb0(X1,X2))|~aElementOf0(X2,szNzAzT0)|~aSet0(X1)),inference(er,[status(thm)],[124,theory(equality)])).
% cnf(799,plain,(~aSet0(slbdtsldtrb0(xT,xk))),inference(sr,[status(thm)],[412,417,theory(equality)])).
% cnf(883,plain,(~aElementOf0(xk,szNzAzT0)|~aSet0(xT)),inference(spm,[status(thm)],[799,458,theory(equality)])).
% cnf(885,plain,($false|~aSet0(xT)),inference(rw,[status(thm)],[883,105,theory(equality)])).
% cnf(886,plain,($false|$false),inference(rw,[status(thm)],[885,107,theory(equality)])).
% cnf(887,plain,($false),inference(cn,[status(thm)],[886,theory(equality)])).
% cnf(888,plain,($false),887,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 285
% # ...of these trivial : 2
% # ...subsumed : 26
% # ...remaining for further processing: 257
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 400
% # ...of the previous two non-trivial : 351
% # Contextual simplify-reflections : 40
% # Paramodulations : 368
% # Factorizations : 0
% # Equation resolutions : 32
% # Current number of processed clauses: 141
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 117
% # Current number of unprocessed clauses: 289
% # ...number of literals in the above : 1640
% # Clause-clause subsumption calls (NU) : 627
% # Rec. Clause-clause subsumption calls : 337
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 123 leaves, 1.43+/-1.013 terms/leaf
% # Paramod-from index: 64 leaves, 1.03+/-0.174 terms/leaf
% # Paramod-into index: 111 leaves, 1.27+/-0.782 terms/leaf
% # -------------------------------------------------
% # User time : 0.054 s
% # System time : 0.006 s
% # Total time : 0.060 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP31037/NUM547+1.tptp
%
%------------------------------------------------------------------------------