TSTP Solution File: SWV167+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV167+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 : Thu Dec 30 08:39:57 EST 2010
% Result : Theorem 7.10s
% Output : Solution 7.10s
% 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/SystemOnTPTP22228/SWV167+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22228/SWV167+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22228/SWV167+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 22324
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.03 WC
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:((leq(X1,X2)&~(X1=X2))=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt2)).
% fof(8, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(27, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(92, conjecture,((((((((((((a_select2(mu_init,pv40)=init&a_select2(sigma_init,pv40)=init)&leq(n0,pv40))&leq(pv40,n4))&![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select2(rho_init,X17)=init))&![X24]:((leq(n0,X24)&leq(X24,pred(pv40)))=>a_select2(mu_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,pred(pv40)))=>a_select2(sigma_init,X25)=init))&![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select3(center_init,X26,n0)=init))&(gt(loopcounter,n1)=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(muold_init,X28)=init)))&(gt(loopcounter,n1)=>![X29]:((leq(n0,X29)&leq(X29,n4))=>a_select2(rhoold_init,X29)=init)))&(gt(loopcounter,n1)=>![X4]:((leq(n0,X4)&leq(X4,n4))=>a_select2(sigmaold_init,X4)=init)))=>![X10]:((leq(n0,X10)&leq(X10,pv40))=>a_select2(mu_init,X10)=init)),file('/tmp/SRASS.s.p', cl5_nebula_init_0011)).
% fof(93, negated_conjecture,~(((((((((((((a_select2(mu_init,pv40)=init&a_select2(sigma_init,pv40)=init)&leq(n0,pv40))&leq(pv40,n4))&![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select2(rho_init,X17)=init))&![X24]:((leq(n0,X24)&leq(X24,pred(pv40)))=>a_select2(mu_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,pred(pv40)))=>a_select2(sigma_init,X25)=init))&![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select3(center_init,X26,n0)=init))&(gt(loopcounter,n1)=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(muold_init,X28)=init)))&(gt(loopcounter,n1)=>![X29]:((leq(n0,X29)&leq(X29,n4))=>a_select2(rhoold_init,X29)=init)))&(gt(loopcounter,n1)=>![X4]:((leq(n0,X4)&leq(X4,n4))=>a_select2(sigmaold_init,X4)=init)))=>![X10]:((leq(n0,X10)&leq(X10,pv40))=>a_select2(mu_init,X10)=init))),inference(assume_negation,[status(cth)],[92])).
% fof(96, plain,(epred2_0=>(((((((((((a_select2(mu_init,pv40)=init&a_select2(sigma_init,pv40)=init)&leq(n0,pv40))&leq(pv40,n4))&![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select2(rho_init,X17)=init))&![X24]:((leq(n0,X24)&leq(X24,pred(pv40)))=>a_select2(mu_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,pred(pv40)))=>a_select2(sigma_init,X25)=init))&![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select3(center_init,X26,n0)=init))&(gt(loopcounter,n1)=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(muold_init,X28)=init)))&(gt(loopcounter,n1)=>![X29]:((leq(n0,X29)&leq(X29,n4))=>a_select2(rhoold_init,X29)=init)))&(gt(loopcounter,n1)=>![X4]:((leq(n0,X4)&leq(X4,n4))=>a_select2(sigmaold_init,X4)=init)))),introduced(definition)).
% fof(98, negated_conjecture,~((epred2_0=>![X10]:((leq(n0,X10)&leq(X10,pv40))=>a_select2(mu_init,X10)=init))),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% fof(114, plain,![X1]:![X2]:((~(leq(X1,X2))|X1=X2)|gt(X2,X1)),inference(fof_nnf,[status(thm)],[7])).
% fof(115, plain,![X3]:![X4]:((~(leq(X3,X4))|X3=X4)|gt(X4,X3)),inference(variable_rename,[status(thm)],[114])).
% cnf(116,plain,(gt(X1,X2)|X2=X1|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[115])).
% fof(117, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(118, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[117])).
% cnf(119,plain,(leq(X1,pred(X2))|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[118])).
% fof(244, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[27])).
% cnf(245,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[244])).
% fof(390, negated_conjecture,(epred2_0&?[X10]:((leq(n0,X10)&leq(X10,pv40))&~(a_select2(mu_init,X10)=init))),inference(fof_nnf,[status(thm)],[98])).
% fof(391, negated_conjecture,(epred2_0&?[X11]:((leq(n0,X11)&leq(X11,pv40))&~(a_select2(mu_init,X11)=init))),inference(variable_rename,[status(thm)],[390])).
% fof(392, negated_conjecture,(epred2_0&((leq(n0,esk24_0)&leq(esk24_0,pv40))&~(a_select2(mu_init,esk24_0)=init))),inference(skolemize,[status(esa)],[391])).
% cnf(393,negated_conjecture,(a_select2(mu_init,esk24_0)!=init),inference(split_conjunct,[status(thm)],[392])).
% cnf(394,negated_conjecture,(leq(esk24_0,pv40)),inference(split_conjunct,[status(thm)],[392])).
% cnf(395,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[392])).
% cnf(396,negated_conjecture,(epred2_0),inference(split_conjunct,[status(thm)],[392])).
% fof(426, plain,(~(epred2_0)|(((((((((((a_select2(mu_init,pv40)=init&a_select2(sigma_init,pv40)=init)&leq(n0,pv40))&leq(pv40,n4))&![X8]:((~(leq(n0,X8))|~(leq(X8,n135299)))|![X12]:((~(leq(n0,X12))|~(leq(X12,n4)))|a_select3(q_init,X8,X12)=init)))&![X17]:((~(leq(n0,X17))|~(leq(X17,n4)))|a_select2(rho_init,X17)=init))&![X24]:((~(leq(n0,X24))|~(leq(X24,pred(pv40))))|a_select2(mu_init,X24)=init))&![X25]:((~(leq(n0,X25))|~(leq(X25,pred(pv40))))|a_select2(sigma_init,X25)=init))&![X26]:((~(leq(n0,X26))|~(leq(X26,n4)))|a_select3(center_init,X26,n0)=init))&(~(gt(loopcounter,n1))|![X28]:((~(leq(n0,X28))|~(leq(X28,n4)))|a_select2(muold_init,X28)=init)))&(~(gt(loopcounter,n1))|![X29]:((~(leq(n0,X29))|~(leq(X29,n4)))|a_select2(rhoold_init,X29)=init)))&(~(gt(loopcounter,n1))|![X4]:((~(leq(n0,X4))|~(leq(X4,n4)))|a_select2(sigmaold_init,X4)=init)))),inference(fof_nnf,[status(thm)],[96])).
% fof(427, plain,(~(epred2_0)|(((((((((((a_select2(mu_init,pv40)=init&a_select2(sigma_init,pv40)=init)&leq(n0,pv40))&leq(pv40,n4))&![X30]:((~(leq(n0,X30))|~(leq(X30,n135299)))|![X31]:((~(leq(n0,X31))|~(leq(X31,n4)))|a_select3(q_init,X30,X31)=init)))&![X32]:((~(leq(n0,X32))|~(leq(X32,n4)))|a_select2(rho_init,X32)=init))&![X33]:((~(leq(n0,X33))|~(leq(X33,pred(pv40))))|a_select2(mu_init,X33)=init))&![X34]:((~(leq(n0,X34))|~(leq(X34,pred(pv40))))|a_select2(sigma_init,X34)=init))&![X35]:((~(leq(n0,X35))|~(leq(X35,n4)))|a_select3(center_init,X35,n0)=init))&(~(gt(loopcounter,n1))|![X36]:((~(leq(n0,X36))|~(leq(X36,n4)))|a_select2(muold_init,X36)=init)))&(~(gt(loopcounter,n1))|![X37]:((~(leq(n0,X37))|~(leq(X37,n4)))|a_select2(rhoold_init,X37)=init)))&(~(gt(loopcounter,n1))|![X38]:((~(leq(n0,X38))|~(leq(X38,n4)))|a_select2(sigmaold_init,X38)=init)))),inference(variable_rename,[status(thm)],[426])).
% fof(428, plain,![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:![X36]:![X37]:![X38]:(((((~(leq(n0,X38))|~(leq(X38,n4)))|a_select2(sigmaold_init,X38)=init)|~(gt(loopcounter,n1)))&((((~(leq(n0,X37))|~(leq(X37,n4)))|a_select2(rhoold_init,X37)=init)|~(gt(loopcounter,n1)))&((((~(leq(n0,X36))|~(leq(X36,n4)))|a_select2(muold_init,X36)=init)|~(gt(loopcounter,n1)))&(((~(leq(n0,X35))|~(leq(X35,n4)))|a_select3(center_init,X35,n0)=init)&(((~(leq(n0,X34))|~(leq(X34,pred(pv40))))|a_select2(sigma_init,X34)=init)&(((~(leq(n0,X33))|~(leq(X33,pred(pv40))))|a_select2(mu_init,X33)=init)&(((~(leq(n0,X32))|~(leq(X32,n4)))|a_select2(rho_init,X32)=init)&((((~(leq(n0,X31))|~(leq(X31,n4)))|a_select3(q_init,X30,X31)=init)|(~(leq(n0,X30))|~(leq(X30,n135299))))&(((a_select2(mu_init,pv40)=init&a_select2(sigma_init,pv40)=init)&leq(n0,pv40))&leq(pv40,n4))))))))))|~(epred2_0)),inference(shift_quantors,[status(thm)],[427])).
% fof(429, plain,![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:![X36]:![X37]:![X38]:(((((~(leq(n0,X38))|~(leq(X38,n4)))|a_select2(sigmaold_init,X38)=init)|~(gt(loopcounter,n1)))|~(epred2_0))&(((((~(leq(n0,X37))|~(leq(X37,n4)))|a_select2(rhoold_init,X37)=init)|~(gt(loopcounter,n1)))|~(epred2_0))&(((((~(leq(n0,X36))|~(leq(X36,n4)))|a_select2(muold_init,X36)=init)|~(gt(loopcounter,n1)))|~(epred2_0))&((((~(leq(n0,X35))|~(leq(X35,n4)))|a_select3(center_init,X35,n0)=init)|~(epred2_0))&((((~(leq(n0,X34))|~(leq(X34,pred(pv40))))|a_select2(sigma_init,X34)=init)|~(epred2_0))&((((~(leq(n0,X33))|~(leq(X33,pred(pv40))))|a_select2(mu_init,X33)=init)|~(epred2_0))&((((~(leq(n0,X32))|~(leq(X32,n4)))|a_select2(rho_init,X32)=init)|~(epred2_0))&(((((~(leq(n0,X31))|~(leq(X31,n4)))|a_select3(q_init,X30,X31)=init)|(~(leq(n0,X30))|~(leq(X30,n135299))))|~(epred2_0))&((((a_select2(mu_init,pv40)=init|~(epred2_0))&(a_select2(sigma_init,pv40)=init|~(epred2_0)))&(leq(n0,pv40)|~(epred2_0)))&(leq(pv40,n4)|~(epred2_0))))))))))),inference(distribute,[status(thm)],[428])).
% cnf(433,plain,(a_select2(mu_init,pv40)=init|~epred2_0),inference(split_conjunct,[status(thm)],[429])).
% cnf(436,plain,(a_select2(mu_init,X1)=init|~epred2_0|~leq(X1,pred(pv40))|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[429])).
% cnf(445,plain,(leq(X1,minus(X2,n1))|~gt(X2,X1)),inference(rw,[status(thm)],[119,245,theory(equality)]),['unfolding']).
% cnf(446,plain,(a_select2(mu_init,X1)=init|~epred2_0|~leq(n0,X1)|~leq(X1,minus(pv40,n1))),inference(rw,[status(thm)],[436,245,theory(equality)]),['unfolding']).
% cnf(476,plain,(a_select2(mu_init,pv40)=init|$false),inference(rw,[status(thm)],[433,396,theory(equality)])).
% cnf(477,plain,(a_select2(mu_init,pv40)=init),inference(cn,[status(thm)],[476,theory(equality)])).
% cnf(486,plain,(a_select2(mu_init,X1)=init|$false|~leq(n0,X1)|~leq(X1,minus(pv40,n1))),inference(rw,[status(thm)],[446,396,theory(equality)])).
% cnf(487,plain,(a_select2(mu_init,X1)=init|~leq(n0,X1)|~leq(X1,minus(pv40,n1))),inference(cn,[status(thm)],[486,theory(equality)])).
% cnf(585,plain,(a_select2(mu_init,X1)=init|~leq(n0,X1)|~gt(pv40,X1)),inference(spm,[status(thm)],[487,445,theory(equality)])).
% cnf(14754,plain,(a_select2(mu_init,X1)=init|pv40=X1|~leq(n0,X1)|~leq(X1,pv40)),inference(spm,[status(thm)],[585,116,theory(equality)])).
% cnf(131860,negated_conjecture,(pv40=esk24_0|~leq(n0,esk24_0)|~leq(esk24_0,pv40)),inference(spm,[status(thm)],[393,14754,theory(equality)])).
% cnf(131861,negated_conjecture,(pv40=esk24_0|$false|~leq(esk24_0,pv40)),inference(rw,[status(thm)],[131860,395,theory(equality)])).
% cnf(131862,negated_conjecture,(pv40=esk24_0|$false|$false),inference(rw,[status(thm)],[131861,394,theory(equality)])).
% cnf(131863,negated_conjecture,(pv40=esk24_0),inference(cn,[status(thm)],[131862,theory(equality)])).
% cnf(132380,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[393,131863,theory(equality)]),477,theory(equality)])).
% cnf(132381,negated_conjecture,($false),inference(cn,[status(thm)],[132380,theory(equality)])).
% cnf(132382,negated_conjecture,($false),132381,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3682
% # ...of these trivial : 105
% # ...subsumed : 1955
% # ...remaining for further processing: 1622
% # Other redundant clauses eliminated : 22
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 17
% # Backward-rewritten : 209
% # Generated clauses : 71667
% # ...of the previous two non-trivial : 64277
% # Contextual simplify-reflections : 413
% # Paramodulations : 71628
% # Factorizations : 12
% # Equation resolutions : 27
% # Current number of processed clauses: 1182
% # Positive orientable unit clauses: 233
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 139
% # Non-unit-clauses : 805
% # Current number of unprocessed clauses: 50104
% # ...number of literals in the above : 332798
% # Clause-clause subsumption calls (NU) : 34085
% # Rec. Clause-clause subsumption calls : 11098
% # Unit Clause-clause subsumption calls : 1067
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 67
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 878 leaves, 1.28+/-1.463 terms/leaf
% # Paramod-from index: 425 leaves, 1.11+/-0.638 terms/leaf
% # Paramod-into index: 699 leaves, 1.18+/-0.884 terms/leaf
% # -------------------------------------------------
% # User time : 3.562 s
% # System time : 0.128 s
% # Total time : 3.690 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.03 CPU 6.14 WC
% FINAL PrfWatch: 6.03 CPU 6.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP22228/SWV167+1.tptp
%
%------------------------------------------------------------------------------