TSTP Solution File: NUM584+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM584+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:25:03 EST 2010
% Result : Theorem 2.15s
% Output : Solution 2.15s
% 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/SystemOnTPTP29558/NUM584+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29558/NUM584+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29558/NUM584+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 29690
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(8, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(27, 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(36, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(37, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(38, axiom,((aFunction0(xc)&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(49, axiom,sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))=xK,file('/tmp/SRASS.s.p', m__4007)).
% fof(50, axiom,aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),file('/tmp/SRASS.s.p', m__4024)).
% fof(89, conjecture,aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),file('/tmp/SRASS.s.p', m__)).
% fof(90, negated_conjecture,~(aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK))),inference(assume_negation,[status(cth)],[89])).
% fof(103, negated_conjecture,~(aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK))),inference(fof_simplification,[status(thm)],[90,theory(equality)])).
% fof(107, 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(108, 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)],[107])).
% fof(109, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[108])).
% fof(110, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[109])).
% fof(111, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk1_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk1_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[110])).
% cnf(114,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[111])).
% cnf(134,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[8])).
% fof(201, 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)],[27])).
% fof(202, 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)],[201])).
% fof(203, 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(esk4_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk4_3(X5,X6,X7),X5))|~(sbrdtbr0(esk4_3(X5,X6,X7))=X6)))&(aElementOf0(esk4_3(X5,X6,X7),X7)|(aSubsetOf0(esk4_3(X5,X6,X7),X5)&sbrdtbr0(esk4_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[202])).
% fof(204, 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(esk4_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk4_3(X5,X6,X7),X5))|~(sbrdtbr0(esk4_3(X5,X6,X7))=X6)))&(aElementOf0(esk4_3(X5,X6,X7),X7)|(aSubsetOf0(esk4_3(X5,X6,X7),X5)&sbrdtbr0(esk4_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[203])).
% fof(205, 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(esk4_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk4_3(X5,X6,X7),X5))|~(sbrdtbr0(esk4_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk4_3(X5,X6,X7),X5)|aElementOf0(esk4_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk4_3(X5,X6,X7))=X6|aElementOf0(esk4_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[204])).
% cnf(210,plain,(aElementOf0(X4,X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|sbrdtbr0(X4)!=X1|~aSubsetOf0(X4,X2)),inference(split_conjunct,[status(thm)],[205])).
% cnf(259,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[36])).
% cnf(261,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(263,plain,(szDzozmdt0(xc)=slbdtsldtrb0(xS,xK)),inference(split_conjunct,[status(thm)],[38])).
% cnf(300,plain,(sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))=xK),inference(split_conjunct,[status(thm)],[49])).
% cnf(301,plain,(aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)),inference(split_conjunct,[status(thm)],[50])).
% cnf(490,negated_conjecture,(~aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK))),inference(split_conjunct,[status(thm)],[103])).
% cnf(492,negated_conjecture,(~aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc))),inference(rw,[status(thm)],[490,263,theory(equality)])).
% cnf(597,plain,(aSet0(xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[114,261,theory(equality)])).
% cnf(602,plain,(aSet0(xS)|$false),inference(rw,[status(thm)],[597,134,theory(equality)])).
% cnf(603,plain,(aSet0(xS)),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(1041,plain,(aElementOf0(X1,slbdtsldtrb0(X2,X3))|sbrdtbr0(X1)!=X3|~aElementOf0(X3,szNzAzT0)|~aSubsetOf0(X1,X2)|~aSet0(X2)),inference(er,[status(thm)],[210,theory(equality)])).
% cnf(15177,plain,(aElementOf0(X1,szDzozmdt0(xc))|sbrdtbr0(X1)!=xK|~aElementOf0(xK,szNzAzT0)|~aSubsetOf0(X1,xS)|~aSet0(xS)),inference(spm,[status(thm)],[1041,263,theory(equality)])).
% cnf(15178,plain,(aElementOf0(X1,szDzozmdt0(xc))|sbrdtbr0(X1)!=xK|$false|~aSubsetOf0(X1,xS)|~aSet0(xS)),inference(rw,[status(thm)],[15177,259,theory(equality)])).
% cnf(15179,plain,(aElementOf0(X1,szDzozmdt0(xc))|sbrdtbr0(X1)!=xK|$false|~aSubsetOf0(X1,xS)|$false),inference(rw,[status(thm)],[15178,603,theory(equality)])).
% cnf(15180,plain,(aElementOf0(X1,szDzozmdt0(xc))|sbrdtbr0(X1)!=xK|~aSubsetOf0(X1,xS)),inference(cn,[status(thm)],[15179,theory(equality)])).
% cnf(16563,plain,(aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc))|~aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)),inference(spm,[status(thm)],[15180,300,theory(equality)])).
% cnf(16571,plain,(aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc))|$false),inference(rw,[status(thm)],[16563,301,theory(equality)])).
% cnf(16572,plain,(aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc))),inference(cn,[status(thm)],[16571,theory(equality)])).
% cnf(16573,plain,($false),inference(sr,[status(thm)],[16572,492,theory(equality)])).
% cnf(16574,plain,($false),16573,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2474
% # ...of these trivial : 68
% # ...subsumed : 1115
% # ...remaining for further processing: 1291
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 78
% # Backward-rewritten : 6
% # Generated clauses : 8380
% # ...of the previous two non-trivial : 7262
% # Contextual simplify-reflections : 824
% # Paramodulations : 8280
% # Factorizations : 4
% # Equation resolutions : 96
% # Current number of processed clauses: 1038
% # Positive orientable unit clauses: 83
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 40
% # Non-unit-clauses : 915
% # Current number of unprocessed clauses: 4682
% # ...number of literals in the above : 28130
% # Clause-clause subsumption calls (NU) : 34510
% # Rec. Clause-clause subsumption calls : 13598
% # Unit Clause-clause subsumption calls : 1373
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 768 leaves, 1.25+/-0.852 terms/leaf
% # Paramod-from index: 349 leaves, 1.02+/-0.140 terms/leaf
% # Paramod-into index: 612 leaves, 1.18+/-0.655 terms/leaf
% # -------------------------------------------------
% # User time : 0.602 s
% # System time : 0.025 s
% # Total time : 0.627 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.95 CPU 1.02 WC
% FINAL PrfWatch: 0.95 CPU 1.02 WC
% SZS output end Solution for /tmp/SystemOnTPTP29558/NUM584+1.tptp
%
%------------------------------------------------------------------------------