TSTP Solution File: NUM633+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM633+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 : art04.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:43:40 EST 2010
% Result : Theorem 1.26s
% Output : Solution 1.26s
% 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/SystemOnTPTP18940/NUM633+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18940/NUM633+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18940/NUM633+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 19036
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(58, axiom,(aElementOf0(szDzizrdt0(xd),xT)&isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4854)).
% fof(60, axiom,(aSet0(xO)&isCountable0(xO)),file('/tmp/SRASS.s.p', m__4908)).
% fof(62, axiom,aSubsetOf0(xO,xS),file('/tmp/SRASS.s.p', m__4998)).
% fof(99, conjecture,(![X1]:(aElementOf0(X1,slbdtsldtrb0(xO,xK))=>(((~(X1=slcrc0)&aSubsetOf0(X1,szNzAzT0))&aElementOf0(X1,szDzozmdt0(xc)))&sdtlpdtrp0(xc,X1)=szDzizrdt0(xd)))=>?[X1]:(aElementOf0(X1,xT)&?[X2]:((aSubsetOf0(X2,xS)&isCountable0(X2))&![X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))=>sdtlpdtrp0(xc,X3)=X1)))),file('/tmp/SRASS.s.p', m__)).
% fof(100, negated_conjecture,~((![X1]:(aElementOf0(X1,slbdtsldtrb0(xO,xK))=>(((~(X1=slcrc0)&aSubsetOf0(X1,szNzAzT0))&aElementOf0(X1,szDzozmdt0(xc)))&sdtlpdtrp0(xc,X1)=szDzizrdt0(xd)))=>?[X1]:(aElementOf0(X1,xT)&?[X2]:((aSubsetOf0(X2,xS)&isCountable0(X2))&![X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))=>sdtlpdtrp0(xc,X3)=X1))))),inference(assume_negation,[status(cth)],[99])).
% cnf(358,plain,(aElementOf0(szDzizrdt0(xd),xT)),inference(split_conjunct,[status(thm)],[58])).
% cnf(361,plain,(isCountable0(xO)),inference(split_conjunct,[status(thm)],[60])).
% cnf(370,plain,(aSubsetOf0(xO,xS)),inference(split_conjunct,[status(thm)],[62])).
% fof(558, negated_conjecture,(![X1]:(~(aElementOf0(X1,slbdtsldtrb0(xO,xK)))|(((~(X1=slcrc0)&aSubsetOf0(X1,szNzAzT0))&aElementOf0(X1,szDzozmdt0(xc)))&sdtlpdtrp0(xc,X1)=szDzizrdt0(xd)))&![X1]:(~(aElementOf0(X1,xT))|![X2]:((~(aSubsetOf0(X2,xS))|~(isCountable0(X2)))|?[X3]:(aElementOf0(X3,slbdtsldtrb0(X2,xK))&~(sdtlpdtrp0(xc,X3)=X1))))),inference(fof_nnf,[status(thm)],[100])).
% fof(559, negated_conjecture,(![X4]:(~(aElementOf0(X4,slbdtsldtrb0(xO,xK)))|(((~(X4=slcrc0)&aSubsetOf0(X4,szNzAzT0))&aElementOf0(X4,szDzozmdt0(xc)))&sdtlpdtrp0(xc,X4)=szDzizrdt0(xd)))&![X5]:(~(aElementOf0(X5,xT))|![X6]:((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|?[X7]:(aElementOf0(X7,slbdtsldtrb0(X6,xK))&~(sdtlpdtrp0(xc,X7)=X5))))),inference(variable_rename,[status(thm)],[558])).
% fof(560, negated_conjecture,(![X4]:(~(aElementOf0(X4,slbdtsldtrb0(xO,xK)))|(((~(X4=slcrc0)&aSubsetOf0(X4,szNzAzT0))&aElementOf0(X4,szDzozmdt0(xc)))&sdtlpdtrp0(xc,X4)=szDzizrdt0(xd)))&![X5]:(~(aElementOf0(X5,xT))|![X6]:((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|(aElementOf0(esk26_2(X5,X6),slbdtsldtrb0(X6,xK))&~(sdtlpdtrp0(xc,esk26_2(X5,X6))=X5))))),inference(skolemize,[status(esa)],[559])).
% fof(561, negated_conjecture,![X4]:![X5]:![X6]:((((~(aSubsetOf0(X6,xS))|~(isCountable0(X6)))|(aElementOf0(esk26_2(X5,X6),slbdtsldtrb0(X6,xK))&~(sdtlpdtrp0(xc,esk26_2(X5,X6))=X5)))|~(aElementOf0(X5,xT)))&(~(aElementOf0(X4,slbdtsldtrb0(xO,xK)))|(((~(X4=slcrc0)&aSubsetOf0(X4,szNzAzT0))&aElementOf0(X4,szDzozmdt0(xc)))&sdtlpdtrp0(xc,X4)=szDzizrdt0(xd)))),inference(shift_quantors,[status(thm)],[560])).
% fof(562, negated_conjecture,![X4]:![X5]:![X6]:((((aElementOf0(esk26_2(X5,X6),slbdtsldtrb0(X6,xK))|(~(aSubsetOf0(X6,xS))|~(isCountable0(X6))))|~(aElementOf0(X5,xT)))&((~(sdtlpdtrp0(xc,esk26_2(X5,X6))=X5)|(~(aSubsetOf0(X6,xS))|~(isCountable0(X6))))|~(aElementOf0(X5,xT))))&((((~(X4=slcrc0)|~(aElementOf0(X4,slbdtsldtrb0(xO,xK))))&(aSubsetOf0(X4,szNzAzT0)|~(aElementOf0(X4,slbdtsldtrb0(xO,xK)))))&(aElementOf0(X4,szDzozmdt0(xc))|~(aElementOf0(X4,slbdtsldtrb0(xO,xK)))))&(sdtlpdtrp0(xc,X4)=szDzizrdt0(xd)|~(aElementOf0(X4,slbdtsldtrb0(xO,xK)))))),inference(distribute,[status(thm)],[561])).
% cnf(563,negated_conjecture,(sdtlpdtrp0(xc,X1)=szDzizrdt0(xd)|~aElementOf0(X1,slbdtsldtrb0(xO,xK))),inference(split_conjunct,[status(thm)],[562])).
% cnf(567,negated_conjecture,(~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)|sdtlpdtrp0(xc,esk26_2(X1,X2))!=X1),inference(split_conjunct,[status(thm)],[562])).
% cnf(568,negated_conjecture,(aElementOf0(esk26_2(X1,X2),slbdtsldtrb0(X2,xK))|~aElementOf0(X1,xT)|~isCountable0(X2)|~aSubsetOf0(X2,xS)),inference(split_conjunct,[status(thm)],[562])).
% cnf(846,negated_conjecture,(sdtlpdtrp0(xc,esk26_2(X1,xO))=szDzizrdt0(xd)|~aSubsetOf0(xO,xS)|~isCountable0(xO)|~aElementOf0(X1,xT)),inference(spm,[status(thm)],[563,568,theory(equality)])).
% cnf(855,negated_conjecture,(sdtlpdtrp0(xc,esk26_2(X1,xO))=szDzizrdt0(xd)|$false|~isCountable0(xO)|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[846,370,theory(equality)])).
% cnf(856,negated_conjecture,(sdtlpdtrp0(xc,esk26_2(X1,xO))=szDzizrdt0(xd)|$false|$false|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[855,361,theory(equality)])).
% cnf(857,negated_conjecture,(sdtlpdtrp0(xc,esk26_2(X1,xO))=szDzizrdt0(xd)|~aElementOf0(X1,xT)),inference(cn,[status(thm)],[856,theory(equality)])).
% cnf(2268,negated_conjecture,(szDzizrdt0(xd)!=X1|~aSubsetOf0(xO,xS)|~isCountable0(xO)|~aElementOf0(X1,xT)),inference(spm,[status(thm)],[567,857,theory(equality)])).
% cnf(2274,negated_conjecture,(szDzizrdt0(xd)!=X1|$false|~isCountable0(xO)|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[2268,370,theory(equality)])).
% cnf(2275,negated_conjecture,(szDzizrdt0(xd)!=X1|$false|$false|~aElementOf0(X1,xT)),inference(rw,[status(thm)],[2274,361,theory(equality)])).
% cnf(2276,negated_conjecture,(szDzizrdt0(xd)!=X1|~aElementOf0(X1,xT)),inference(cn,[status(thm)],[2275,theory(equality)])).
% cnf(2360,negated_conjecture,($false),inference(spm,[status(thm)],[2276,358,theory(equality)])).
% cnf(2370,negated_conjecture,($false),2360,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 533
% # ...of these trivial : 2
% # ...subsumed : 38
% # ...remaining for further processing: 493
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 3
% # Generated clauses : 1020
% # ...of the previous two non-trivial : 953
% # Contextual simplify-reflections : 35
% # Paramodulations : 975
% # Factorizations : 0
% # Equation resolutions : 42
% # Current number of processed clauses: 288
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 20
% # Non-unit-clauses : 211
% # Current number of unprocessed clauses: 803
% # ...number of literals in the above : 4285
% # Clause-clause subsumption calls (NU) : 2881
% # Rec. Clause-clause subsumption calls : 909
% # Unit Clause-clause subsumption calls : 1009
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 308 leaves, 1.31+/-0.925 terms/leaf
% # Paramod-from index: 141 leaves, 1.01+/-0.084 terms/leaf
% # Paramod-into index: 269 leaves, 1.16+/-0.568 terms/leaf
% # -------------------------------------------------
% # User time : 0.119 s
% # System time : 0.006 s
% # Total time : 0.125 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.35 WC
% FINAL PrfWatch: 0.26 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP18940/NUM633+1.tptp
%
%------------------------------------------------------------------------------