TSTP Solution File: NUM552+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM552+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 20:08:45 EST 2010
% Result : Theorem 1.49s
% Output : Solution 1.49s
% 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/SystemOnTPTP14284/NUM552+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14284/NUM552+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14284/NUM552+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 14416
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(13, 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(16, axiom,aElementOf0(xk,szNzAzT0),file('/tmp/SRASS.s.p', m__2202)).
% fof(17, axiom,((aSet0(xS)&aSet0(xT))&~(xk=sz00)),file('/tmp/SRASS.s.p', m__2202_02)).
% fof(18, axiom,(aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))&~(slbdtsldtrb0(xS,xk)=slcrc0)),file('/tmp/SRASS.s.p', m__2227)).
% fof(20, axiom,aElementOf0(xQ,slbdtsldtrb0(xS,xk)),file('/tmp/SRASS.s.p', m__2270)).
% fof(68, conjecture,(aElementOf0(xx,xQ)=>aElementOf0(xx,xT)),file('/tmp/SRASS.s.p', m__)).
% fof(69, negated_conjecture,~((aElementOf0(xx,xQ)=>aElementOf0(xx,xT))),inference(assume_negation,[status(cth)],[68])).
% fof(94, 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)],[4])).
% fof(95, 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)],[94])).
% fof(96, 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)],[95])).
% fof(97, 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)],[96])).
% fof(98, 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)],[97])).
% cnf(102,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[98])).
% fof(130, 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)],[13])).
% fof(131, 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)],[130])).
% fof(132, 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)],[131])).
% fof(133, 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)],[132])).
% fof(134, 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)],[133])).
% cnf(138,plain,(aSet0(X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)),inference(split_conjunct,[status(thm)],[134])).
% cnf(141,plain,(aSubsetOf0(X4,X2)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[134])).
% cnf(150,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[16])).
% cnf(152,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[17])).
% cnf(155,plain,(aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))),inference(split_conjunct,[status(thm)],[18])).
% cnf(157,plain,(aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(split_conjunct,[status(thm)],[20])).
% fof(359, negated_conjecture,(aElementOf0(xx,xQ)&~(aElementOf0(xx,xT))),inference(fof_nnf,[status(thm)],[69])).
% cnf(360,negated_conjecture,(~aElementOf0(xx,xT)),inference(split_conjunct,[status(thm)],[359])).
% cnf(361,negated_conjecture,(aElementOf0(xx,xQ)),inference(split_conjunct,[status(thm)],[359])).
% cnf(504,plain,(aElementOf0(X1,slbdtsldtrb0(xT,xk))|~aElementOf0(X1,slbdtsldtrb0(xS,xk))|~aSet0(slbdtsldtrb0(xT,xk))),inference(spm,[status(thm)],[102,155,theory(equality)])).
% cnf(520,plain,(aSet0(slbdtsldtrb0(X1,X2))|~aElementOf0(X2,szNzAzT0)|~aSet0(X1)),inference(er,[status(thm)],[138,theory(equality)])).
% cnf(691,plain,(aSubsetOf0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aElementOf0(X1,slbdtsldtrb0(X2,X3))|~aSet0(X2)),inference(er,[status(thm)],[141,theory(equality)])).
% cnf(2823,plain,(aSubsetOf0(X1,xT)|~aElementOf0(xk,szNzAzT0)|~aSet0(xT)|~aElementOf0(X1,slbdtsldtrb0(xS,xk))|~aSet0(slbdtsldtrb0(xT,xk))),inference(spm,[status(thm)],[691,504,theory(equality)])).
% cnf(2827,plain,(aSubsetOf0(X1,xT)|$false|~aSet0(xT)|~aElementOf0(X1,slbdtsldtrb0(xS,xk))|~aSet0(slbdtsldtrb0(xT,xk))),inference(rw,[status(thm)],[2823,150,theory(equality)])).
% cnf(2828,plain,(aSubsetOf0(X1,xT)|$false|$false|~aElementOf0(X1,slbdtsldtrb0(xS,xk))|~aSet0(slbdtsldtrb0(xT,xk))),inference(rw,[status(thm)],[2827,152,theory(equality)])).
% cnf(2829,plain,(aSubsetOf0(X1,xT)|~aElementOf0(X1,slbdtsldtrb0(xS,xk))|~aSet0(slbdtsldtrb0(xT,xk))),inference(cn,[status(thm)],[2828,theory(equality)])).
% cnf(4486,plain,(aSubsetOf0(xQ,xT)|~aSet0(slbdtsldtrb0(xT,xk))),inference(spm,[status(thm)],[2829,157,theory(equality)])).
% cnf(4497,plain,(aSubsetOf0(xQ,xT)|~aElementOf0(xk,szNzAzT0)|~aSet0(xT)),inference(spm,[status(thm)],[4486,520,theory(equality)])).
% cnf(4498,plain,(aSubsetOf0(xQ,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[4497,150,theory(equality)])).
% cnf(4499,plain,(aSubsetOf0(xQ,xT)|$false|$false),inference(rw,[status(thm)],[4498,152,theory(equality)])).
% cnf(4500,plain,(aSubsetOf0(xQ,xT)),inference(cn,[status(thm)],[4499,theory(equality)])).
% cnf(4507,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,xQ)|~aSet0(xT)),inference(spm,[status(thm)],[102,4500,theory(equality)])).
% cnf(4524,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,xQ)|$false),inference(rw,[status(thm)],[4507,152,theory(equality)])).
% cnf(4525,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,xQ)),inference(cn,[status(thm)],[4524,theory(equality)])).
% cnf(4573,negated_conjecture,(~aElementOf0(xx,xQ)),inference(spm,[status(thm)],[360,4525,theory(equality)])).
% cnf(4588,negated_conjecture,($false),inference(rw,[status(thm)],[4573,361,theory(equality)])).
% cnf(4589,negated_conjecture,($false),inference(cn,[status(thm)],[4588,theory(equality)])).
% cnf(4590,negated_conjecture,($false),4589,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1040
% # ...of these trivial : 18
% # ...subsumed : 432
% # ...remaining for further processing: 590
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 34
% # Backward-rewritten : 6
% # Generated clauses : 2402
% # ...of the previous two non-trivial : 2166
% # Contextual simplify-reflections : 398
% # Paramodulations : 2348
% # Factorizations : 0
% # Equation resolutions : 54
% # Current number of processed clauses: 428
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 16
% # Non-unit-clauses : 379
% # Current number of unprocessed clauses: 1225
% # ...number of literals in the above : 7706
% # Clause-clause subsumption calls (NU) : 6999
% # Rec. Clause-clause subsumption calls : 4081
% # Unit Clause-clause subsumption calls : 166
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 340 leaves, 1.29+/-0.811 terms/leaf
% # Paramod-from index: 175 leaves, 1.05+/-0.209 terms/leaf
% # Paramod-into index: 294 leaves, 1.21+/-0.676 terms/leaf
% # -------------------------------------------------
% # User time : 0.183 s
% # System time : 0.008 s
% # Total time : 0.191 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.35 CPU 0.41 WC
% FINAL PrfWatch: 0.35 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP14284/NUM552+1.tptp
%
%------------------------------------------------------------------------------