TSTP Solution File: MSC010+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : MSC010+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.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 16:11:55 EST 2010

% Result   : Theorem 1.09s
% Output   : Solution 1.09s
% 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/SystemOnTPTP31738/MSC010+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP31738/MSC010+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31738/MSC010+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 31834
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(((((((((((((((((~(pv63=pv64)&leq(n0,pv5))&leq(n0,pv63))&leq(n0,pv64))&leq(pv5,n998))&leq(pv63,n5))&leq(pv64,n5))&![X1]:![X2]:((((leq(n0,X1)&leq(n0,X2))&leq(X1,n2))&leq(X2,n5))=>a_select3(h_ds1_filter_init,X1,X2)=init))&![X3]:![X4]:((((leq(n0,X3)&leq(n0,X4))&leq(X3,n5))&leq(X4,n5))=>a_select3(phi_ds1_filter_init,X3,X4)=init))&![X5]:![X6]:((((leq(n0,X5)&leq(n0,X6))&leq(X5,n5))&leq(X6,n0))=>a_select3(dv_ds1_filter_init,X5,X6)=init))&![X7]:![X8]:((((leq(n0,X7)&leq(n0,X8))&leq(X7,n5))&leq(X8,n5))=>a_select3(q_ds1_filter_init,X7,X8)=init))&![X9]:![X10]:((((leq(n0,X9)&leq(n0,X10))&leq(X9,n2))&leq(X10,n2))=>a_select3(r_ds1_filter_init,X9,X10)=init))&![X11]:![X12]:((((leq(n0,X11)&leq(n0,X12))&leq(X11,n5))&leq(X12,n0))=>a_select3(xhatmin_ds1_filter_init,X11,X12)=init))&![X13]:![X14]:((((leq(n0,X13)&leq(n0,X14))&leq(X13,n5))&leq(X14,n5))=>a_select3(pminus_ds1_filter_init,X13,X14)=init))&![X15]:![X16]:((((leq(n0,X15)&leq(n0,X16))&leq(X15,n5))&leq(X16,n5))=>((X15=pv63>(pv64,X16))=>a_select3(id_ds1_filter_init,X15,X16)=init)))&![X17]:![X18]:((((leq(n0,X17)&leq(n0,X18))&leq(X17,n5))&leq(X18,n5))=>(gt(pv63,X17)=>a_select3(id_ds1_filter_init,X17,X18)=init)))&![X19]:((leq(n0,X19)&leq(X19,pred(pv63)))=>![X20]:((leq(n0,X20)&leq(X20,n5))=>a_select3(id_ds1_filter_init,X19,X20)=init)))=>![X21]:![X22]:((((leq(n0,X21)&leq(n0,X22))&leq(X21,n5))&leq(X22,n5))=>(((~(pv64=X22)&X21=pv63)&leq(X22,pv64))=>a_select3(id_ds1_filter_init,X21,X22)=init))),file('/tmp/SRASS.s.p', n1)).
% fof(2, conjecture,~(~((((((((((((((((((~(pv63=pv64)&leq(n0,pv5))&leq(n0,pv63))&leq(n0,pv64))&leq(pv5,n998))&leq(pv63,n5))&leq(pv64,n5))&![X1]:![X2]:((((leq(n0,X1)&leq(n0,X2))&leq(X1,n2))&leq(X2,n5))=>a_select3(h_ds1_filter_init,X1,X2)=init))&![X3]:![X4]:((((leq(n0,X3)&leq(n0,X4))&leq(X3,n5))&leq(X4,n5))=>a_select3(phi_ds1_filter_init,X3,X4)=init))&![X5]:![X6]:((((leq(n0,X5)&leq(n0,X6))&leq(X5,n5))&leq(X6,n0))=>a_select3(dv_ds1_filter_init,X5,X6)=init))&![X7]:![X8]:((((leq(n0,X7)&leq(n0,X8))&leq(X7,n5))&leq(X8,n5))=>a_select3(q_ds1_filter_init,X7,X8)=init))&![X9]:![X10]:((((leq(n0,X9)&leq(n0,X10))&leq(X9,n2))&leq(X10,n2))=>a_select3(r_ds1_filter_init,X9,X10)=init))&![X11]:![X12]:((((leq(n0,X11)&leq(n0,X12))&leq(X11,n5))&leq(X12,n0))=>a_select3(xhatmin_ds1_filter_init,X11,X12)=init))&![X13]:![X14]:((((leq(n0,X13)&leq(n0,X14))&leq(X13,n5))&leq(X14,n5))=>a_select3(pminus_ds1_filter_init,X13,X14)=init))&![X15]:![X16]:((((leq(n0,X15)&leq(n0,X16))&leq(X15,n5))&leq(X16,n5))=>((X15=pv63>(pv64,X16))=>a_select3(id_ds1_filter_init,X15,X16)=init)))&![X17]:![X18]:((((leq(n0,X17)&leq(n0,X18))&leq(X17,n5))&leq(X18,n5))=>(gt(pv63,X17)=>a_select3(id_ds1_filter_init,X17,X18)=init)))&![X19]:((leq(n0,X19)&leq(X19,pred(pv63)))=>![X20]:((leq(n0,X20)&leq(X20,n5))=>a_select3(id_ds1_filter_init,X19,X20)=init)))=>![X21]:![X22]:((((leq(n0,X21)&leq(n0,X22))&leq(X21,n5))&leq(X22,n5))=>(((~(pv64=X22)&X21=pv63)&leq(X22,pv64))=>a_select3(id_ds1_filter_init,X21,X22)=init))))),file('/tmp/SRASS.s.p', n91)).
% fof(3, negated_conjecture,~(~(~((((((((((((((((((~(pv63=pv64)&leq(n0,pv5))&leq(n0,pv63))&leq(n0,pv64))&leq(pv5,n998))&leq(pv63,n5))&leq(pv64,n5))&![X1]:![X2]:((((leq(n0,X1)&leq(n0,X2))&leq(X1,n2))&leq(X2,n5))=>a_select3(h_ds1_filter_init,X1,X2)=init))&![X3]:![X4]:((((leq(n0,X3)&leq(n0,X4))&leq(X3,n5))&leq(X4,n5))=>a_select3(phi_ds1_filter_init,X3,X4)=init))&![X5]:![X6]:((((leq(n0,X5)&leq(n0,X6))&leq(X5,n5))&leq(X6,n0))=>a_select3(dv_ds1_filter_init,X5,X6)=init))&![X7]:![X8]:((((leq(n0,X7)&leq(n0,X8))&leq(X7,n5))&leq(X8,n5))=>a_select3(q_ds1_filter_init,X7,X8)=init))&![X9]:![X10]:((((leq(n0,X9)&leq(n0,X10))&leq(X9,n2))&leq(X10,n2))=>a_select3(r_ds1_filter_init,X9,X10)=init))&![X11]:![X12]:((((leq(n0,X11)&leq(n0,X12))&leq(X11,n5))&leq(X12,n0))=>a_select3(xhatmin_ds1_filter_init,X11,X12)=init))&![X13]:![X14]:((((leq(n0,X13)&leq(n0,X14))&leq(X13,n5))&leq(X14,n5))=>a_select3(pminus_ds1_filter_init,X13,X14)=init))&![X15]:![X16]:((((leq(n0,X15)&leq(n0,X16))&leq(X15,n5))&leq(X16,n5))=>((X15=pv63>(pv64,X16))=>a_select3(id_ds1_filter_init,X15,X16)=init)))&![X17]:![X18]:((((leq(n0,X17)&leq(n0,X18))&leq(X17,n5))&leq(X18,n5))=>(gt(pv63,X17)=>a_select3(id_ds1_filter_init,X17,X18)=init)))&![X19]:((leq(n0,X19)&leq(X19,pred(pv63)))=>![X20]:((leq(n0,X20)&leq(X20,n5))=>a_select3(id_ds1_filter_init,X19,X20)=init)))=>![X21]:![X22]:((((leq(n0,X21)&leq(n0,X22))&leq(X21,n5))&leq(X22,n5))=>(((~(pv64=X22)&X21=pv63)&leq(X22,pv64))=>a_select3(id_ds1_filter_init,X21,X22)=init)))))),inference(assume_negation,[status(cth)],[2])).
% fof(8, plain,(epred5_0<=>((((((((((((((((~(pv63=pv64)&leq(n0,pv5))&leq(n0,pv63))&leq(n0,pv64))&leq(pv5,n998))&leq(pv63,n5))&leq(pv64,n5))&![X1]:![X2]:((((leq(n0,X1)&leq(n0,X2))&leq(X1,n2))&leq(X2,n5))=>a_select3(h_ds1_filter_init,X1,X2)=init))&![X3]:![X4]:((((leq(n0,X3)&leq(n0,X4))&leq(X3,n5))&leq(X4,n5))=>a_select3(phi_ds1_filter_init,X3,X4)=init))&![X5]:![X6]:((((leq(n0,X5)&leq(n0,X6))&leq(X5,n5))&leq(X6,n0))=>a_select3(dv_ds1_filter_init,X5,X6)=init))&![X7]:![X8]:((((leq(n0,X7)&leq(n0,X8))&leq(X7,n5))&leq(X8,n5))=>a_select3(q_ds1_filter_init,X7,X8)=init))&![X9]:![X10]:((((leq(n0,X9)&leq(n0,X10))&leq(X9,n2))&leq(X10,n2))=>a_select3(r_ds1_filter_init,X9,X10)=init))&![X11]:![X12]:((((leq(n0,X11)&leq(n0,X12))&leq(X11,n5))&leq(X12,n0))=>a_select3(xhatmin_ds1_filter_init,X11,X12)=init))&![X13]:![X14]:((((leq(n0,X13)&leq(n0,X14))&leq(X13,n5))&leq(X14,n5))=>a_select3(pminus_ds1_filter_init,X13,X14)=init))&![X15]:![X16]:((((leq(n0,X15)&leq(n0,X16))&leq(X15,n5))&leq(X16,n5))=>((X15=pv63>(pv64,X16))=>a_select3(id_ds1_filter_init,X15,X16)=init)))&![X17]:![X18]:((((leq(n0,X17)&leq(n0,X18))&leq(X17,n5))&leq(X18,n5))=>(gt(pv63,X17)=>a_select3(id_ds1_filter_init,X17,X18)=init)))&![X19]:((leq(n0,X19)&leq(X19,pred(pv63)))=>![X20]:((leq(n0,X20)&leq(X20,n5))=>a_select3(id_ds1_filter_init,X19,X20)=init)))),introduced(definition)).
% fof(9, plain,(epred5_0=>![X21]:![X22]:((((leq(n0,X21)&leq(n0,X22))&leq(X21,n5))&leq(X22,n5))=>(((~(pv64=X22)&X21=pv63)&leq(X22,pv64))=>a_select3(id_ds1_filter_init,X21,X22)=init))),inference(apply_def,[status(esa)],[1,8,theory(equality)])).
% fof(10, negated_conjecture,~(~(~((epred5_0=>![X21]:![X22]:((((leq(n0,X21)&leq(n0,X22))&leq(X21,n5))&leq(X22,n5))=>(((~(pv64=X22)&X21=pv63)&leq(X22,pv64))=>a_select3(id_ds1_filter_init,X21,X22)=init)))))),inference(apply_def,[status(esa)],[3,8,theory(equality)])).
% fof(15, plain,(~(epred5_0)|![X21]:![X22]:((((~(leq(n0,X21))|~(leq(n0,X22)))|~(leq(X21,n5)))|~(leq(X22,n5)))|(((pv64=X22|~(X21=pv63))|~(leq(X22,pv64)))|a_select3(id_ds1_filter_init,X21,X22)=init))),inference(fof_nnf,[status(thm)],[9])).
% fof(16, plain,(~(epred5_0)|![X23]:![X24]:((((~(leq(n0,X23))|~(leq(n0,X24)))|~(leq(X23,n5)))|~(leq(X24,n5)))|(((pv64=X24|~(X23=pv63))|~(leq(X24,pv64)))|a_select3(id_ds1_filter_init,X23,X24)=init))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X23]:![X24]:(((((~(leq(n0,X23))|~(leq(n0,X24)))|~(leq(X23,n5)))|~(leq(X24,n5)))|(((pv64=X24|~(X23=pv63))|~(leq(X24,pv64)))|a_select3(id_ds1_filter_init,X23,X24)=init))|~(epred5_0)),inference(shift_quantors,[status(thm)],[16])).
% cnf(18,plain,(a_select3(id_ds1_filter_init,X1,X2)=init|pv64=X2|~epred5_0|~leq(X2,pv64)|X1!=pv63|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, negated_conjecture,(epred5_0&?[X21]:?[X22]:((((leq(n0,X21)&leq(n0,X22))&leq(X21,n5))&leq(X22,n5))&(((~(pv64=X22)&X21=pv63)&leq(X22,pv64))&~(a_select3(id_ds1_filter_init,X21,X22)=init)))),inference(fof_nnf,[status(thm)],[10])).
% fof(20, negated_conjecture,(epred5_0&?[X23]:?[X24]:((((leq(n0,X23)&leq(n0,X24))&leq(X23,n5))&leq(X24,n5))&(((~(pv64=X24)&X23=pv63)&leq(X24,pv64))&~(a_select3(id_ds1_filter_init,X23,X24)=init)))),inference(variable_rename,[status(thm)],[19])).
% fof(21, negated_conjecture,(epred5_0&((((leq(n0,esk1_0)&leq(n0,esk2_0))&leq(esk1_0,n5))&leq(esk2_0,n5))&(((~(pv64=esk2_0)&esk1_0=pv63)&leq(esk2_0,pv64))&~(a_select3(id_ds1_filter_init,esk1_0,esk2_0)=init)))),inference(skolemize,[status(esa)],[20])).
% cnf(22,negated_conjecture,(a_select3(id_ds1_filter_init,esk1_0,esk2_0)!=init),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,negated_conjecture,(leq(esk2_0,pv64)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,negated_conjecture,(esk1_0=pv63),inference(split_conjunct,[status(thm)],[21])).
% cnf(25,negated_conjecture,(pv64!=esk2_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(26,negated_conjecture,(leq(esk2_0,n5)),inference(split_conjunct,[status(thm)],[21])).
% cnf(27,negated_conjecture,(leq(esk1_0,n5)),inference(split_conjunct,[status(thm)],[21])).
% cnf(28,negated_conjecture,(leq(n0,esk2_0)),inference(split_conjunct,[status(thm)],[21])).
% cnf(29,negated_conjecture,(leq(n0,esk1_0)),inference(split_conjunct,[status(thm)],[21])).
% cnf(30,negated_conjecture,(epred5_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(217,negated_conjecture,(leq(n0,pv63)),inference(rw,[status(thm)],[29,24,theory(equality)])).
% cnf(218,negated_conjecture,(leq(pv63,n5)),inference(rw,[status(thm)],[27,24,theory(equality)])).
% cnf(227,negated_conjecture,(a_select3(id_ds1_filter_init,pv63,esk2_0)!=init),inference(rw,[status(thm)],[22,24,theory(equality)])).
% cnf(476,plain,(pv64=X2|a_select3(id_ds1_filter_init,X1,X2)=init|pv63!=X1|$false|~leq(X2,pv64)|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1)),inference(rw,[status(thm)],[18,30,theory(equality)])).
% cnf(477,plain,(pv64=X2|a_select3(id_ds1_filter_init,X1,X2)=init|pv63!=X1|~leq(X2,pv64)|~leq(X2,n5)|~leq(X1,n5)|~leq(n0,X2)|~leq(n0,X1)),inference(cn,[status(thm)],[476,theory(equality)])).
% cnf(478,plain,(a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|~leq(pv63,n5)|~leq(n0,X1)|~leq(n0,pv63)),inference(er,[status(thm)],[477,theory(equality)])).
% cnf(479,plain,(a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|$false|~leq(n0,X1)|~leq(n0,pv63)),inference(rw,[status(thm)],[478,218,theory(equality)])).
% cnf(480,plain,(a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|$false|~leq(n0,X1)|$false),inference(rw,[status(thm)],[479,217,theory(equality)])).
% cnf(481,plain,(a_select3(id_ds1_filter_init,pv63,X1)=init|pv64=X1|~leq(X1,pv64)|~leq(X1,n5)|~leq(n0,X1)),inference(cn,[status(thm)],[480,theory(equality)])).
% cnf(723,negated_conjecture,(a_select3(id_ds1_filter_init,pv63,esk2_0)=init|pv64=esk2_0|~leq(esk2_0,n5)|~leq(n0,esk2_0)),inference(spm,[status(thm)],[481,23,theory(equality)])).
% cnf(725,negated_conjecture,(a_select3(id_ds1_filter_init,pv63,esk2_0)=init|pv64=esk2_0|$false|~leq(n0,esk2_0)),inference(rw,[status(thm)],[723,26,theory(equality)])).
% cnf(726,negated_conjecture,(a_select3(id_ds1_filter_init,pv63,esk2_0)=init|pv64=esk2_0|$false|$false),inference(rw,[status(thm)],[725,28,theory(equality)])).
% cnf(727,negated_conjecture,(a_select3(id_ds1_filter_init,pv63,esk2_0)=init|pv64=esk2_0),inference(cn,[status(thm)],[726,theory(equality)])).
% cnf(728,negated_conjecture,(esk2_0=pv64),inference(sr,[status(thm)],[727,227,theory(equality)])).
% cnf(729,negated_conjecture,($false),inference(sr,[status(thm)],[728,25,theory(equality)])).
% cnf(730,negated_conjecture,($false),729,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 216
% # ...of these trivial                : 92
% # ...subsumed                        : 1
% # ...remaining for further processing: 123
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 61
% # Generated clauses                  : 45
% # ...of the previous two non-trivial : 54
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 43
% # Factorizations                     : 0
% # Equation resolutions               : 2
% # Current number of processed clauses: 62
% #    Positive orientable unit clauses: 33
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 4
% #    Non-unit-clauses                : 25
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 27
% # Clause-clause subsumption calls (NU) : 371
% # Rec. Clause-clause subsumption calls : 126
% # Unit Clause-clause subsumption calls : 44
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 21
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:    64 leaves,   1.42+/-0.806 terms/leaf
% # Paramod-from index:           21 leaves,   1.57+/-0.904 terms/leaf
% # Paramod-into index:           44 leaves,   1.30+/-0.693 terms/leaf
% # -------------------------------------------------
% # User time              : 0.026 s
% # System time            : 0.007 s
% # Total time             : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP31738/MSC010+1.tptp
% 
%------------------------------------------------------------------------------