TSTP Solution File: SWV179+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV179+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 : 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 : Thu Dec 30 08:40:50 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP19637/SWV179+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19637/SWV179+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19637/SWV179+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 19733
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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,pv68)&leq(pv68,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_select3(center_init,X17,n0)=init))&![X24]:((leq(n0,X24)&leq(X24,n4))=>a_select2(muold_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,pred(pv68)))=>a_select2(rhoold_init,X25)=init))&![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(mu_init,X26)=init))&![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(rho_init,X28)=init))&![X29]:((leq(n0,X29)&leq(X29,n4))=>a_select2(sigma_init,X29)=init))=>a_select2(rho_init,pv68)=init),file('/tmp/SRASS.s.p', cl5_nebula_init_0071)).
% fof(93, negated_conjecture,~((((((((((leq(n0,pv68)&leq(pv68,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_select3(center_init,X17,n0)=init))&![X24]:((leq(n0,X24)&leq(X24,n4))=>a_select2(muold_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,pred(pv68)))=>a_select2(rhoold_init,X25)=init))&![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(mu_init,X26)=init))&![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(rho_init,X28)=init))&![X29]:((leq(n0,X29)&leq(X29,n4))=>a_select2(sigma_init,X29)=init))=>a_select2(rho_init,pv68)=init)),inference(assume_negation,[status(cth)],[92])).
% fof(96, plain,(epred2_0=>((((((((leq(n0,pv68)&leq(pv68,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_select3(center_init,X17,n0)=init))&![X24]:((leq(n0,X24)&leq(X24,n4))=>a_select2(muold_init,X24)=init))&![X25]:((leq(n0,X25)&leq(X25,pred(pv68)))=>a_select2(rhoold_init,X25)=init))&![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(mu_init,X26)=init))&![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(rho_init,X28)=init))&![X29]:((leq(n0,X29)&leq(X29,n4))=>a_select2(sigma_init,X29)=init))),introduced(definition)).
% fof(98, negated_conjecture,~((epred2_0=>a_select2(rho_init,pv68)=init)),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% fof(390, negated_conjecture,(epred2_0&~(a_select2(rho_init,pv68)=init)),inference(fof_nnf,[status(thm)],[98])).
% cnf(391,negated_conjecture,(a_select2(rho_init,pv68)!=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,pv68)&leq(pv68,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_select3(center_init,X17,n0)=init))&![X24]:((~(leq(n0,X24))|~(leq(X24,n4)))|a_select2(muold_init,X24)=init))&![X25]:((~(leq(n0,X25))|~(leq(X25,pred(pv68))))|a_select2(rhoold_init,X25)=init))&![X26]:((~(leq(n0,X26))|~(leq(X26,n4)))|a_select2(mu_init,X26)=init))&![X28]:((~(leq(n0,X28))|~(leq(X28,n4)))|a_select2(rho_init,X28)=init))&![X29]:((~(leq(n0,X29))|~(leq(X29,n4)))|a_select2(sigma_init,X29)=init))),inference(fof_nnf,[status(thm)],[96])).
% fof(423, plain,(~(epred2_0)|((((((((leq(n0,pv68)&leq(pv68,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_select3(center_init,X32,n0)=init))&![X33]:((~(leq(n0,X33))|~(leq(X33,n4)))|a_select2(muold_init,X33)=init))&![X34]:((~(leq(n0,X34))|~(leq(X34,pred(pv68))))|a_select2(rhoold_init,X34)=init))&![X35]:((~(leq(n0,X35))|~(leq(X35,n4)))|a_select2(mu_init,X35)=init))&![X36]:((~(leq(n0,X36))|~(leq(X36,n4)))|a_select2(rho_init,X36)=init))&![X37]:((~(leq(n0,X37))|~(leq(X37,n4)))|a_select2(sigma_init,X37)=init))),inference(variable_rename,[status(thm)],[422])).
% fof(424, plain,![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:![X36]:![X37]:((((~(leq(n0,X37))|~(leq(X37,n4)))|a_select2(sigma_init,X37)=init)&(((~(leq(n0,X36))|~(leq(X36,n4)))|a_select2(rho_init,X36)=init)&(((~(leq(n0,X35))|~(leq(X35,n4)))|a_select2(mu_init,X35)=init)&(((~(leq(n0,X34))|~(leq(X34,pred(pv68))))|a_select2(rhoold_init,X34)=init)&(((~(leq(n0,X33))|~(leq(X33,n4)))|a_select2(muold_init,X33)=init)&(((~(leq(n0,X32))|~(leq(X32,n4)))|a_select3(center_init,X32,n0)=init)&((((~(leq(n0,X31))|~(leq(X31,n4)))|a_select3(q_init,X30,X31)=init)|(~(leq(n0,X30))|~(leq(X30,n135299))))&(leq(n0,pv68)&leq(pv68,n4)))))))))|~(epred2_0)),inference(shift_quantors,[status(thm)],[423])).
% fof(425, plain,![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:![X36]:![X37]:((((~(leq(n0,X37))|~(leq(X37,n4)))|a_select2(sigma_init,X37)=init)|~(epred2_0))&((((~(leq(n0,X36))|~(leq(X36,n4)))|a_select2(rho_init,X36)=init)|~(epred2_0))&((((~(leq(n0,X35))|~(leq(X35,n4)))|a_select2(mu_init,X35)=init)|~(epred2_0))&((((~(leq(n0,X34))|~(leq(X34,pred(pv68))))|a_select2(rhoold_init,X34)=init)|~(epred2_0))&((((~(leq(n0,X33))|~(leq(X33,n4)))|a_select2(muold_init,X33)=init)|~(epred2_0))&((((~(leq(n0,X32))|~(leq(X32,n4)))|a_select3(center_init,X32,n0)=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,pv68)|~(epred2_0))&(leq(pv68,n4)|~(epred2_0)))))))))),inference(distribute,[status(thm)],[424])).
% cnf(426,plain,(leq(pv68,n4)|~epred2_0),inference(split_conjunct,[status(thm)],[425])).
% cnf(427,plain,(leq(n0,pv68)|~epred2_0),inference(split_conjunct,[status(thm)],[425])).
% cnf(433,plain,(a_select2(rho_init,X1)=init|~epred2_0|~leq(X1,n4)|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[425])).
% cnf(464,plain,(leq(n0,pv68)|$false),inference(rw,[status(thm)],[427,392,theory(equality)])).
% cnf(465,plain,(leq(n0,pv68)),inference(cn,[status(thm)],[464,theory(equality)])).
% cnf(466,plain,(leq(pv68,n4)|$false),inference(rw,[status(thm)],[426,392,theory(equality)])).
% cnf(467,plain,(leq(pv68,n4)),inference(cn,[status(thm)],[466,theory(equality)])).
% cnf(472,plain,(a_select2(rho_init,X1)=init|$false|~leq(X1,n4)|~leq(n0,X1)),inference(rw,[status(thm)],[433,392,theory(equality)])).
% cnf(473,plain,(a_select2(rho_init,X1)=init|~leq(X1,n4)|~leq(n0,X1)),inference(cn,[status(thm)],[472,theory(equality)])).
% cnf(632,plain,(a_select2(rho_init,pv68)=init|~leq(n0,pv68)),inference(spm,[status(thm)],[473,467,theory(equality)])).
% cnf(635,plain,(a_select2(rho_init,pv68)=init|$false),inference(rw,[status(thm)],[632,465,theory(equality)])).
% cnf(636,plain,(a_select2(rho_init,pv68)=init),inference(cn,[status(thm)],[635,theory(equality)])).
% cnf(637,plain,($false),inference(sr,[status(thm)],[636,391,theory(equality)])).
% cnf(638,plain,($false),637,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 284
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 284
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 108
% # ...of the previous two non-trivial : 87
% # Contextual simplify-reflections : 0
% # Paramodulations : 103
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 74
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 3
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 219
% # ...number of literals in the above : 862
% # Clause-clause subsumption calls (NU) : 1766
% # Rec. Clause-clause subsumption calls : 672
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 92 leaves, 1.14+/-0.523 terms/leaf
% # Paramod-from index: 65 leaves, 1.02+/-0.123 terms/leaf
% # Paramod-into index: 87 leaves, 1.09+/-0.326 terms/leaf
% # -------------------------------------------------
% # User time : 0.057 s
% # System time : 0.008 s
% # Total time : 0.065 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP19637/SWV179+1.tptp
%
%------------------------------------------------------------------------------