TSTP Solution File: SWV188+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV188+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:41:49 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP22487/SWV188+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22487/SWV188+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22487/SWV188+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 22583
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(5, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(27, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(41, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(74, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(92, conjecture,((((((![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init))&![X18]:((leq(n0,X18)&leq(X18,n4))=>a_select2(rho_init,X18)=init))&![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select3(center_init,X25,n0)=init))&(gt(loopcounter,n1)=>![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(muold_init,X26)=init)))&(gt(loopcounter,n1)=>![X27]:((leq(n0,X27)&leq(X27,n4))=>a_select2(rhoold_init,X27)=init)))&(gt(loopcounter,n1)=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(sigmaold_init,X28)=init)))=>![X29]:((leq(n0,X29)&leq(X29,tptp_minus_1))=>a_select2(mu_init,X29)=init)),file('/tmp/SRASS.s.p', cl5_nebula_init_0116)).
% fof(93, negated_conjecture,~(((((((![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init))&![X18]:((leq(n0,X18)&leq(X18,n4))=>a_select2(rho_init,X18)=init))&![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select3(center_init,X25,n0)=init))&(gt(loopcounter,n1)=>![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(muold_init,X26)=init)))&(gt(loopcounter,n1)=>![X27]:((leq(n0,X27)&leq(X27,n4))=>a_select2(rhoold_init,X27)=init)))&(gt(loopcounter,n1)=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(sigmaold_init,X28)=init)))=>![X29]:((leq(n0,X29)&leq(X29,tptp_minus_1))=>a_select2(mu_init,X29)=init))),inference(assume_negation,[status(cth)],[92])).
% fof(94, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(96, plain,(epred2_0=>(((((![X8]:((leq(n0,X8)&leq(X8,n135299))=>![X12]:((leq(n0,X12)&leq(X12,n4))=>a_select3(q_init,X8,X12)=init))&![X18]:((leq(n0,X18)&leq(X18,n4))=>a_select2(rho_init,X18)=init))&![X25]:((leq(n0,X25)&leq(X25,n4))=>a_select3(center_init,X25,n0)=init))&(gt(loopcounter,n1)=>![X26]:((leq(n0,X26)&leq(X26,n4))=>a_select2(muold_init,X26)=init)))&(gt(loopcounter,n1)=>![X27]:((leq(n0,X27)&leq(X27,n4))=>a_select2(rhoold_init,X27)=init)))&(gt(loopcounter,n1)=>![X28]:((leq(n0,X28)&leq(X28,n4))=>a_select2(sigmaold_init,X28)=init)))),introduced(definition)).
% fof(98, negated_conjecture,~((epred2_0=>![X29]:((leq(n0,X29)&leq(X29,tptp_minus_1))=>a_select2(mu_init,X29)=init))),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% fof(104, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[94])).
% cnf(105,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(108, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[5])).
% fof(109, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[109])).
% cnf(233,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[27])).
% fof(258, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(259, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[258])).
% cnf(261,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[259])).
% fof(360, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[74])).
% cnf(361,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[360])).
% fof(390, negated_conjecture,(epred2_0&?[X29]:((leq(n0,X29)&leq(X29,tptp_minus_1))&~(a_select2(mu_init,X29)=init))),inference(fof_nnf,[status(thm)],[98])).
% fof(391, negated_conjecture,(epred2_0&?[X30]:((leq(n0,X30)&leq(X30,tptp_minus_1))&~(a_select2(mu_init,X30)=init))),inference(variable_rename,[status(thm)],[390])).
% fof(392, negated_conjecture,(epred2_0&((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&~(a_select2(mu_init,esk24_0)=init))),inference(skolemize,[status(esa)],[391])).
% cnf(394,negated_conjecture,(leq(esk24_0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[392])).
% cnf(395,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[392])).
% cnf(440,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[233,361,theory(equality)]),['unfolding']).
% cnf(461,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[261,361,theory(equality)]),['unfolding']).
% cnf(536,negated_conjecture,(leq(X1,tptp_minus_1)|~leq(X1,esk24_0)),inference(spm,[status(thm)],[110,394,theory(equality)])).
% cnf(599,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[105,461,theory(equality)])).
% cnf(5277,plain,(~leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[599,440,theory(equality)])).
% cnf(10624,negated_conjecture,(leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[536,395,theory(equality)])).
% cnf(10628,negated_conjecture,($false),inference(sr,[status(thm)],[10624,5277,theory(equality)])).
% cnf(10629,negated_conjecture,($false),10628,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 492
% # ...of these trivial : 6
% # ...subsumed : 25
% # ...remaining for further processing: 461
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5560
% # ...of the previous two non-trivial : 5521
% # Contextual simplify-reflections : 0
% # Paramodulations : 5549
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 253
% # Positive orientable unit clauses: 82
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 15
% # Non-unit-clauses : 151
% # Current number of unprocessed clauses: 5443
% # ...number of literals in the above : 34267
% # Clause-clause subsumption calls (NU) : 4925
% # Rec. Clause-clause subsumption calls : 1487
% # Unit Clause-clause subsumption calls : 115
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 288 leaves, 1.22+/-1.382 terms/leaf
% # Paramod-from index: 117 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-into index: 176 leaves, 1.11+/-0.516 terms/leaf
% # -------------------------------------------------
% # User time : 0.328 s
% # System time : 0.011 s
% # Total time : 0.339 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.60 CPU 0.69 WC
% FINAL PrfWatch: 0.60 CPU 0.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP22487/SWV188+1.tptp
%
%------------------------------------------------------------------------------