TSTP Solution File: SWV174+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV174+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 : art02.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:23 EST 2010
% Result : Theorem 3.00s
% Output : Solution 3.00s
% 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/SystemOnTPTP9119/SWV174+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9119/SWV174+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9119/SWV174+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 9215
% 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(8, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(56, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(92, conjecture,((((leq(n0,pv10)&leq(pv10,n135299))&![X4]:((leq(n0,X4)&leq(X4,pred(pv10)))=>![X10]:((leq(n0,X10)&leq(X10,n4))=>a_select3(q_init,X4,X10)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select3(center_init,X17,n0)=init))=>![X23]:![X24]:((((leq(n0,X23)&leq(n0,X24))&leq(X23,n135299))&leq(X24,n4))=>(gt(pv10,X23)=>a_select3(q_init,X23,X24)=init))),file('/tmp/SRASS.s.p', cl5_nebula_init_0046)).
% fof(93, negated_conjecture,~(((((leq(n0,pv10)&leq(pv10,n135299))&![X4]:((leq(n0,X4)&leq(X4,pred(pv10)))=>![X10]:((leq(n0,X10)&leq(X10,n4))=>a_select3(q_init,X4,X10)=init)))&![X17]:((leq(n0,X17)&leq(X17,n4))=>a_select3(center_init,X17,n0)=init))=>![X23]:![X24]:((((leq(n0,X23)&leq(n0,X24))&leq(X23,n135299))&leq(X24,n4))=>(gt(pv10,X23)=>a_select3(q_init,X23,X24)=init)))),inference(assume_negation,[status(cth)],[92])).
% fof(115, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(116, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[115])).
% cnf(117,plain,(leq(X1,pred(X2))|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(326, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[56])).
% cnf(327,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[326])).
% fof(388, negated_conjecture,((((leq(n0,pv10)&leq(pv10,n135299))&![X4]:((~(leq(n0,X4))|~(leq(X4,pred(pv10))))|![X10]:((~(leq(n0,X10))|~(leq(X10,n4)))|a_select3(q_init,X4,X10)=init)))&![X17]:((~(leq(n0,X17))|~(leq(X17,n4)))|a_select3(center_init,X17,n0)=init))&?[X23]:?[X24]:((((leq(n0,X23)&leq(n0,X24))&leq(X23,n135299))&leq(X24,n4))&(gt(pv10,X23)&~(a_select3(q_init,X23,X24)=init)))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,((((leq(n0,pv10)&leq(pv10,n135299))&![X25]:((~(leq(n0,X25))|~(leq(X25,pred(pv10))))|![X26]:((~(leq(n0,X26))|~(leq(X26,n4)))|a_select3(q_init,X25,X26)=init)))&![X27]:((~(leq(n0,X27))|~(leq(X27,n4)))|a_select3(center_init,X27,n0)=init))&?[X28]:?[X29]:((((leq(n0,X28)&leq(n0,X29))&leq(X28,n135299))&leq(X29,n4))&(gt(pv10,X28)&~(a_select3(q_init,X28,X29)=init)))),inference(variable_rename,[status(thm)],[388])).
% fof(390, negated_conjecture,((((leq(n0,pv10)&leq(pv10,n135299))&![X25]:((~(leq(n0,X25))|~(leq(X25,pred(pv10))))|![X26]:((~(leq(n0,X26))|~(leq(X26,n4)))|a_select3(q_init,X25,X26)=init)))&![X27]:((~(leq(n0,X27))|~(leq(X27,n4)))|a_select3(center_init,X27,n0)=init))&((((leq(n0,esk24_0)&leq(n0,esk25_0))&leq(esk24_0,n135299))&leq(esk25_0,n4))&(gt(pv10,esk24_0)&~(a_select3(q_init,esk24_0,esk25_0)=init)))),inference(skolemize,[status(esa)],[389])).
% fof(391, negated_conjecture,![X25]:![X26]:![X27]:((((~(leq(n0,X27))|~(leq(X27,n4)))|a_select3(center_init,X27,n0)=init)&((((~(leq(n0,X26))|~(leq(X26,n4)))|a_select3(q_init,X25,X26)=init)|(~(leq(n0,X25))|~(leq(X25,pred(pv10)))))&(leq(n0,pv10)&leq(pv10,n135299))))&((((leq(n0,esk24_0)&leq(n0,esk25_0))&leq(esk24_0,n135299))&leq(esk25_0,n4))&(gt(pv10,esk24_0)&~(a_select3(q_init,esk24_0,esk25_0)=init)))),inference(shift_quantors,[status(thm)],[390])).
% cnf(392,negated_conjecture,(a_select3(q_init,esk24_0,esk25_0)!=init),inference(split_conjunct,[status(thm)],[391])).
% cnf(393,negated_conjecture,(gt(pv10,esk24_0)),inference(split_conjunct,[status(thm)],[391])).
% cnf(394,negated_conjecture,(leq(esk25_0,n4)),inference(split_conjunct,[status(thm)],[391])).
% cnf(396,negated_conjecture,(leq(n0,esk25_0)),inference(split_conjunct,[status(thm)],[391])).
% cnf(397,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[391])).
% cnf(400,negated_conjecture,(a_select3(q_init,X1,X2)=init|~leq(X1,pred(pv10))|~leq(n0,X1)|~leq(X2,n4)|~leq(n0,X2)),inference(split_conjunct,[status(thm)],[391])).
% cnf(434,plain,(leq(X1,minus(X2,n1))|~gt(X2,X1)),inference(rw,[status(thm)],[117,327,theory(equality)]),['unfolding']).
% cnf(435,negated_conjecture,(a_select3(q_init,X1,X2)=init|~leq(X2,n4)|~leq(n0,X2)|~leq(n0,X1)|~leq(X1,minus(pv10,n1))),inference(rw,[status(thm)],[400,327,theory(equality)]),['unfolding']).
% cnf(751,negated_conjecture,(a_select3(q_init,X1,X2)=init|~leq(X2,n4)|~leq(n0,X2)|~leq(n0,X1)|~gt(pv10,X1)),inference(spm,[status(thm)],[435,434,theory(equality)])).
% cnf(48029,negated_conjecture,(~leq(esk25_0,n4)|~leq(n0,esk25_0)|~leq(n0,esk24_0)|~gt(pv10,esk24_0)),inference(spm,[status(thm)],[392,751,theory(equality)])).
% cnf(48030,negated_conjecture,($false|~leq(n0,esk25_0)|~leq(n0,esk24_0)|~gt(pv10,esk24_0)),inference(rw,[status(thm)],[48029,394,theory(equality)])).
% cnf(48031,negated_conjecture,($false|$false|~leq(n0,esk24_0)|~gt(pv10,esk24_0)),inference(rw,[status(thm)],[48030,396,theory(equality)])).
% cnf(48032,negated_conjecture,($false|$false|$false|~gt(pv10,esk24_0)),inference(rw,[status(thm)],[48031,397,theory(equality)])).
% cnf(48033,negated_conjecture,($false|$false|$false|$false),inference(rw,[status(thm)],[48032,393,theory(equality)])).
% cnf(48034,negated_conjecture,($false),inference(cn,[status(thm)],[48033,theory(equality)])).
% cnf(48035,negated_conjecture,($false),48034,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1710
% # ...of these trivial : 63
% # ...subsumed : 674
% # ...remaining for further processing: 973
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 33
% # Generated clauses : 25389
% # ...of the previous two non-trivial : 23869
% # Contextual simplify-reflections : 15
% # Paramodulations : 25376
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 727
% # Positive orientable unit clauses: 200
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 110
% # Non-unit-clauses : 412
% # Current number of unprocessed clauses: 21167
% # ...number of literals in the above : 124198
% # Clause-clause subsumption calls (NU) : 5391
% # Rec. Clause-clause subsumption calls : 2569
% # Unit Clause-clause subsumption calls : 995
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 69
% # Indexed BW rewrite successes : 39
% # Backwards rewriting index: 623 leaves, 1.14+/-1.023 terms/leaf
% # Paramod-from index: 308 leaves, 1.03+/-0.187 terms/leaf
% # Paramod-into index: 507 leaves, 1.08+/-0.475 terms/leaf
% # -------------------------------------------------
% # User time : 1.109 s
% # System time : 0.045 s
% # Total time : 1.154 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% FINAL PrfWatch: 1.93 CPU 2.03 WC
% SZS output end Solution for /tmp/SystemOnTPTP9119/SWV174+1.tptp
%
%------------------------------------------------------------------------------