TSTP Solution File: NUM540+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM540+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 : art07.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 19:58:52 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP15521/NUM540+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15521/NUM540+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15521/NUM540+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 15617
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.021 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(7, axiom,aElementOf0(sz00,szNzAzT0),file('/tmp/SRASS.s.p', mZeroNum)).
% fof(13, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>![X2]:(X2=slbdtrb0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>(aElementOf0(X3,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X3),X1)))))),file('/tmp/SRASS.s.p', mDefSeg)).
% fof(30, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>~(sdtlseqdt0(szszuzczcdt0(X1),sz00))),file('/tmp/SRASS.s.p', mNoScLessZr)).
% fof(52, conjecture,slbdtrb0(sz00)=slcrc0,file('/tmp/SRASS.s.p', m__)).
% fof(53, negated_conjecture,~(slbdtrb0(sz00)=slcrc0),inference(assume_negation,[status(cth)],[52])).
% fof(57, plain,![X1]:(aElementOf0(X1,szNzAzT0)=>~(sdtlseqdt0(szszuzczcdt0(X1),sz00))),inference(fof_simplification,[status(thm)],[30,theory(equality)])).
% fof(64, negated_conjecture,~(slbdtrb0(sz00)=slcrc0),inference(fof_simplification,[status(thm)],[53,theory(equality)])).
% fof(65, 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(66, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[65])).
% fof(67, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[67])).
% fof(69, 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)],[68])).
% cnf(70,plain,(X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[69])).
% cnf(88,plain,(aElementOf0(sz00,szNzAzT0)),inference(split_conjunct,[status(thm)],[7])).
% fof(108, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|![X2]:((~(X2=slbdtrb0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|(aElementOf0(X3,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X3),X1)))&((~(aElementOf0(X3,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X3),X1)))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|(~(aElementOf0(X3,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X3),X1))))&(aElementOf0(X3,X2)|(aElementOf0(X3,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X3),X1)))))|X2=slbdtrb0(X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(109, plain,![X4]:(~(aElementOf0(X4,szNzAzT0))|![X5]:((~(X5=slbdtrb0(X4))|(aSet0(X5)&![X6]:((~(aElementOf0(X6,X5))|(aElementOf0(X6,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X6),X4)))&((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5)))))&((~(aSet0(X5))|?[X7]:((~(aElementOf0(X7,X5))|(~(aElementOf0(X7,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X7),X4))))&(aElementOf0(X7,X5)|(aElementOf0(X7,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X7),X4)))))|X5=slbdtrb0(X4)))),inference(variable_rename,[status(thm)],[108])).
% fof(110, plain,![X4]:(~(aElementOf0(X4,szNzAzT0))|![X5]:((~(X5=slbdtrb0(X4))|(aSet0(X5)&![X6]:((~(aElementOf0(X6,X5))|(aElementOf0(X6,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X6),X4)))&((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5)))))&((~(aSet0(X5))|((~(aElementOf0(esk3_2(X4,X5),X5))|(~(aElementOf0(esk3_2(X4,X5),szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(esk3_2(X4,X5)),X4))))&(aElementOf0(esk3_2(X4,X5),X5)|(aElementOf0(esk3_2(X4,X5),szNzAzT0)&sdtlseqdt0(szszuzczcdt0(esk3_2(X4,X5)),X4)))))|X5=slbdtrb0(X4)))),inference(skolemize,[status(esa)],[109])).
% fof(111, plain,![X4]:![X5]:![X6]:((((((~(aElementOf0(X6,X5))|(aElementOf0(X6,szNzAzT0)&sdtlseqdt0(szszuzczcdt0(X6),X4)))&((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5)))&aSet0(X5))|~(X5=slbdtrb0(X4)))&((~(aSet0(X5))|((~(aElementOf0(esk3_2(X4,X5),X5))|(~(aElementOf0(esk3_2(X4,X5),szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(esk3_2(X4,X5)),X4))))&(aElementOf0(esk3_2(X4,X5),X5)|(aElementOf0(esk3_2(X4,X5),szNzAzT0)&sdtlseqdt0(szszuzczcdt0(esk3_2(X4,X5)),X4)))))|X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))),inference(shift_quantors,[status(thm)],[110])).
% fof(112, plain,![X4]:![X5]:![X6]:(((((((aElementOf0(X6,szNzAzT0)|~(aElementOf0(X6,X5)))|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0)))&(((sdtlseqdt0(szszuzczcdt0(X6),X4)|~(aElementOf0(X6,X5)))|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))))&((((~(aElementOf0(X6,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X6),X4)))|aElementOf0(X6,X5))|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))))&((aSet0(X5)|~(X5=slbdtrb0(X4)))|~(aElementOf0(X4,szNzAzT0))))&(((((~(aElementOf0(esk3_2(X4,X5),X5))|(~(aElementOf0(esk3_2(X4,X5),szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(esk3_2(X4,X5)),X4))))|~(aSet0(X5)))|X5=slbdtrb0(X4))|~(aElementOf0(X4,szNzAzT0)))&(((((aElementOf0(esk3_2(X4,X5),szNzAzT0)|aElementOf0(esk3_2(X4,X5),X5))|~(aSet0(X5)))|X5=slbdtrb0(X4))|~(aElementOf0(X4,szNzAzT0)))&((((sdtlseqdt0(szszuzczcdt0(esk3_2(X4,X5)),X4)|aElementOf0(esk3_2(X4,X5),X5))|~(aSet0(X5)))|X5=slbdtrb0(X4))|~(aElementOf0(X4,szNzAzT0)))))),inference(distribute,[status(thm)],[111])).
% cnf(116,plain,(aSet0(X2)|~aElementOf0(X1,szNzAzT0)|X2!=slbdtrb0(X1)),inference(split_conjunct,[status(thm)],[112])).
% cnf(118,plain,(sdtlseqdt0(szszuzczcdt0(X3),X1)|~aElementOf0(X1,szNzAzT0)|X2!=slbdtrb0(X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[112])).
% cnf(119,plain,(aElementOf0(X3,szNzAzT0)|~aElementOf0(X1,szNzAzT0)|X2!=slbdtrb0(X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[112])).
% fof(174, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X1),sz00))),inference(fof_nnf,[status(thm)],[57])).
% fof(175, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|~(sdtlseqdt0(szszuzczcdt0(X2),sz00))),inference(variable_rename,[status(thm)],[174])).
% cnf(176,plain,(~sdtlseqdt0(szszuzczcdt0(X1),sz00)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[175])).
% cnf(285,negated_conjecture,(slbdtrb0(sz00)!=slcrc0),inference(split_conjunct,[status(thm)],[64])).
% cnf(361,plain,(aElementOf0(esk1_1(X1),szNzAzT0)|slcrc0=X1|slbdtrb0(X2)!=X1|~aElementOf0(X2,szNzAzT0)|~aSet0(X1)),inference(spm,[status(thm)],[119,70,theory(equality)])).
% cnf(373,plain,(sdtlseqdt0(szszuzczcdt0(esk1_1(X1)),X2)|slcrc0=X1|slbdtrb0(X2)!=X1|~aElementOf0(X2,szNzAzT0)|~aSet0(X1)),inference(spm,[status(thm)],[118,70,theory(equality)])).
% cnf(927,plain,(slcrc0=X1|aElementOf0(esk1_1(X1),szNzAzT0)|slbdtrb0(X2)!=X1|~aElementOf0(X2,szNzAzT0)),inference(csr,[status(thm)],[361,116])).
% cnf(928,plain,(slcrc0=slbdtrb0(X1)|aElementOf0(esk1_1(slbdtrb0(X1)),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(er,[status(thm)],[927,theory(equality)])).
% cnf(1145,plain,(slcrc0=X1|sdtlseqdt0(szszuzczcdt0(esk1_1(X1)),X2)|slbdtrb0(X2)!=X1|~aElementOf0(X2,szNzAzT0)),inference(csr,[status(thm)],[373,116])).
% cnf(1153,plain,(slcrc0=X1|~aElementOf0(esk1_1(X1),szNzAzT0)|slbdtrb0(sz00)!=X1|~aElementOf0(sz00,szNzAzT0)),inference(spm,[status(thm)],[176,1145,theory(equality)])).
% cnf(1159,plain,(slcrc0=X1|~aElementOf0(esk1_1(X1),szNzAzT0)|slbdtrb0(sz00)!=X1|$false),inference(rw,[status(thm)],[1153,88,theory(equality)])).
% cnf(1160,plain,(slcrc0=X1|~aElementOf0(esk1_1(X1),szNzAzT0)|slbdtrb0(sz00)!=X1),inference(cn,[status(thm)],[1159,theory(equality)])).
% cnf(1163,plain,(slcrc0=slbdtrb0(X1)|slbdtrb0(sz00)!=slbdtrb0(X1)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[1160,928,theory(equality)])).
% cnf(1167,plain,(slbdtrb0(sz00)=slcrc0|~aElementOf0(sz00,szNzAzT0)),inference(er,[status(thm)],[1163,theory(equality)])).
% cnf(1168,plain,(slbdtrb0(sz00)=slcrc0|$false),inference(rw,[status(thm)],[1167,88,theory(equality)])).
% cnf(1169,plain,(slbdtrb0(sz00)=slcrc0),inference(cn,[status(thm)],[1168,theory(equality)])).
% cnf(1170,plain,($false),inference(sr,[status(thm)],[1169,285,theory(equality)])).
% cnf(1171,plain,($false),1170,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 355
% # ...of these trivial : 7
% # ...subsumed : 75
% # ...remaining for further processing: 273
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 1
% # Generated clauses : 572
% # ...of the previous two non-trivial : 505
% # Contextual simplify-reflections : 130
% # Paramodulations : 536
% # Factorizations : 0
% # Equation resolutions : 36
% # Current number of processed clauses: 175
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 165
% # Current number of unprocessed clauses: 315
% # ...number of literals in the above : 1996
% # Clause-clause subsumption calls (NU) : 1216
% # Rec. Clause-clause subsumption calls : 745
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 125 leaves, 1.45+/-1.039 terms/leaf
% # Paramod-from index: 76 leaves, 1.04+/-0.195 terms/leaf
% # Paramod-into index: 115 leaves, 1.30+/-0.854 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.004 s
% # Total time : 0.070 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/SystemOnTPTP15521/NUM540+1.tptp
%
%------------------------------------------------------------------------------