TSTP Solution File: SWV172+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV172+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 : 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 : Thu Dec 30 08:40:16 EST 2010
% Result : Theorem 1.40s
% Output : Solution 1.40s
% 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/SystemOnTPTP5288/SWV172+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5288/SWV172+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5288/SWV172+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 5384
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(92, conjecture,((((((((((((leq(n0,pv10)&leq(n0,pv54))&leq(pv10,n135299))&leq(pv54,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,n4))=>a_select2(mu_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,n4))=>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)))=>a_select2(rho_init,pv54)=init),file('/tmp/SRASS.s.p', cl5_nebula_init_0036)).
% fof(93, negated_conjecture,~(((((((((((((leq(n0,pv10)&leq(n0,pv54))&leq(pv10,n135299))&leq(pv54,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,n4))=>a_select2(mu_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,n4))=>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)))=>a_select2(rho_init,pv54)=init)),inference(assume_negation,[status(cth)],[92])).
% fof(96, plain,(epred2_0=>(((((((((((leq(n0,pv10)&leq(n0,pv54))&leq(pv10,n135299))&leq(pv54,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,n4))=>a_select2(mu_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,n4))=>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=>a_select2(rho_init,pv54)=init)),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% fof(390, negated_conjecture,(epred2_0&~(a_select2(rho_init,pv54)=init)),inference(fof_nnf,[status(thm)],[98])).
% cnf(391,negated_conjecture,(a_select2(rho_init,pv54)!=init),inference(split_conjunct,[status(thm)],[390])).
% cnf(392,negated_conjecture,(epred2_0),inference(split_conjunct,[status(thm)],[390])).
% fof(422, plain,(~(epred2_0)|(((((((((((leq(n0,pv10)&leq(n0,pv54))&leq(pv10,n135299))&leq(pv54,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,n4)))|a_select2(mu_init,X24)=init))&![X25]:((~(leq(n0,X25))|~(leq(X25,n4)))|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(423, plain,(~(epred2_0)|(((((((((((leq(n0,pv10)&leq(n0,pv54))&leq(pv10,n135299))&leq(pv54,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,n4)))|a_select2(mu_init,X33)=init))&![X34]:((~(leq(n0,X34))|~(leq(X34,n4)))|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)],[422])).
% fof(424, 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,n4)))|a_select2(sigma_init,X34)=init)&(((~(leq(n0,X33))|~(leq(X33,n4)))|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))))&(((leq(n0,pv10)&leq(n0,pv54))&leq(pv10,n135299))&leq(pv54,n4))))))))))|~(epred2_0)),inference(shift_quantors,[status(thm)],[423])).
% fof(425, 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,n4)))|a_select2(sigma_init,X34)=init)|~(epred2_0))&((((~(leq(n0,X33))|~(leq(X33,n4)))|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))&((((leq(n0,pv10)|~(epred2_0))&(leq(n0,pv54)|~(epred2_0)))&(leq(pv10,n135299)|~(epred2_0)))&(leq(pv54,n4)|~(epred2_0))))))))))),inference(distribute,[status(thm)],[424])).
% cnf(426,plain,(leq(pv54,n4)|~epred2_0),inference(split_conjunct,[status(thm)],[425])).
% cnf(428,plain,(leq(n0,pv54)|~epred2_0),inference(split_conjunct,[status(thm)],[425])).
% cnf(431,plain,(a_select2(rho_init,X1)=init|~epred2_0|~leq(X1,n4)|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[425])).
% cnf(466,plain,(leq(n0,pv54)|$false),inference(rw,[status(thm)],[428,392,theory(equality)])).
% cnf(467,plain,(leq(n0,pv54)),inference(cn,[status(thm)],[466,theory(equality)])).
% cnf(468,plain,(leq(pv54,n4)|$false),inference(rw,[status(thm)],[426,392,theory(equality)])).
% cnf(469,plain,(leq(pv54,n4)),inference(cn,[status(thm)],[468,theory(equality)])).
% cnf(478,plain,(a_select2(rho_init,X1)=init|$false|~leq(X1,n4)|~leq(n0,X1)),inference(rw,[status(thm)],[431,392,theory(equality)])).
% cnf(479,plain,(a_select2(rho_init,X1)=init|~leq(X1,n4)|~leq(n0,X1)),inference(cn,[status(thm)],[478,theory(equality)])).
% cnf(626,plain,(a_select2(rho_init,pv54)=init|~leq(n0,pv54)),inference(spm,[status(thm)],[479,469,theory(equality)])).
% cnf(629,plain,(a_select2(rho_init,pv54)=init|$false),inference(rw,[status(thm)],[626,467,theory(equality)])).
% cnf(630,plain,(a_select2(rho_init,pv54)=init),inference(cn,[status(thm)],[629,theory(equality)])).
% cnf(631,plain,($false),inference(sr,[status(thm)],[630,391,theory(equality)])).
% cnf(632,plain,($false),631,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 286
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 286
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 96
% # ...of the previous two non-trivial : 78
% # Contextual simplify-reflections : 0
% # Paramodulations : 91
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 73
% # Positive orientable unit clauses: 49
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 3
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 214
% # ...number of literals in the above : 854
% # Clause-clause subsumption calls (NU) : 1797
% # Rec. Clause-clause subsumption calls : 688
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 19
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 92 leaves, 1.13+/-0.396 terms/leaf
% # Paramod-from index: 65 leaves, 1.03+/-0.173 terms/leaf
% # Paramod-into index: 87 leaves, 1.09+/-0.326 terms/leaf
% # -------------------------------------------------
% # User time : 0.061 s
% # System time : 0.005 s
% # Total time : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.25 WC
% FINAL PrfWatch: 0.20 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP5288/SWV172+1.tptp
%
%------------------------------------------------------------------------------