TSTP Solution File: SWV161+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV161+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 : art06.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:15 EST 2010
% Result : Theorem 1.47s
% Output : Solution 1.47s
% 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/SystemOnTPTP15914/SWV161+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15914/SWV161+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15914/SWV161+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 16010
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(22, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(24, axiom,![X1]:![X2]:((leq(X1,X2)&~(X1=X2))=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt2)).
% fof(92, conjecture,((((sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1&leq(n0,pv10))&leq(pv10,n135299))&![X4]:((leq(n0,X4)&leq(X4,pred(pv10)))=>sum(n0,n4,a_select3(q,X4,tptp_sum_index))=n1))=>![X10]:((leq(n0,X10)&leq(X10,pv10))=>sum(n0,n4,a_select3(q,X10,tptp_sum_index))=n1)),file('/tmp/SRASS.s.p', cl5_nebula_norm_0011)).
% fof(93, negated_conjecture,~(((((sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1&leq(n0,pv10))&leq(pv10,n135299))&![X4]:((leq(n0,X4)&leq(X4,pred(pv10)))=>sum(n0,n4,a_select3(q,X4,tptp_sum_index))=n1))=>![X10]:((leq(n0,X10)&leq(X10,pv10))=>sum(n0,n4,a_select3(q,X10,tptp_sum_index))=n1))),inference(assume_negation,[status(cth)],[92])).
% fof(114, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(115, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[114])).
% cnf(116,plain,(leq(X1,pred(X2))|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[115])).
% fof(224, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[22])).
% cnf(225,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[224])).
% fof(229, plain,![X1]:![X2]:((~(leq(X1,X2))|X1=X2)|gt(X2,X1)),inference(fof_nnf,[status(thm)],[24])).
% fof(230, plain,![X3]:![X4]:((~(leq(X3,X4))|X3=X4)|gt(X4,X3)),inference(variable_rename,[status(thm)],[229])).
% cnf(231,plain,(gt(X1,X2)|X2=X1|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[230])).
% fof(388, negated_conjecture,((((sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1&leq(n0,pv10))&leq(pv10,n135299))&![X4]:((~(leq(n0,X4))|~(leq(X4,pred(pv10))))|sum(n0,n4,a_select3(q,X4,tptp_sum_index))=n1))&?[X10]:((leq(n0,X10)&leq(X10,pv10))&~(sum(n0,n4,a_select3(q,X10,tptp_sum_index))=n1))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,((((sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1&leq(n0,pv10))&leq(pv10,n135299))&![X11]:((~(leq(n0,X11))|~(leq(X11,pred(pv10))))|sum(n0,n4,a_select3(q,X11,tptp_sum_index))=n1))&?[X12]:((leq(n0,X12)&leq(X12,pv10))&~(sum(n0,n4,a_select3(q,X12,tptp_sum_index))=n1))),inference(variable_rename,[status(thm)],[388])).
% fof(390, negated_conjecture,((((sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1&leq(n0,pv10))&leq(pv10,n135299))&![X11]:((~(leq(n0,X11))|~(leq(X11,pred(pv10))))|sum(n0,n4,a_select3(q,X11,tptp_sum_index))=n1))&((leq(n0,esk24_0)&leq(esk24_0,pv10))&~(sum(n0,n4,a_select3(q,esk24_0,tptp_sum_index))=n1))),inference(skolemize,[status(esa)],[389])).
% fof(391, negated_conjecture,![X11]:((((~(leq(n0,X11))|~(leq(X11,pred(pv10))))|sum(n0,n4,a_select3(q,X11,tptp_sum_index))=n1)&((sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1&leq(n0,pv10))&leq(pv10,n135299)))&((leq(n0,esk24_0)&leq(esk24_0,pv10))&~(sum(n0,n4,a_select3(q,esk24_0,tptp_sum_index))=n1))),inference(shift_quantors,[status(thm)],[390])).
% cnf(392,negated_conjecture,(sum(n0,n4,a_select3(q,esk24_0,tptp_sum_index))!=n1),inference(split_conjunct,[status(thm)],[391])).
% cnf(393,negated_conjecture,(leq(esk24_0,pv10)),inference(split_conjunct,[status(thm)],[391])).
% cnf(394,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[391])).
% cnf(397,negated_conjecture,(sum(n0,n4,a_select3(q,pv10,tptp_sum_index))=n1),inference(split_conjunct,[status(thm)],[391])).
% cnf(398,negated_conjecture,(sum(n0,n4,a_select3(q,X1,tptp_sum_index))=n1|~leq(X1,pred(pv10))|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[391])).
% cnf(431,plain,(leq(X1,minus(X2,n1))|~gt(X2,X1)),inference(rw,[status(thm)],[116,225,theory(equality)]),['unfolding']).
% cnf(432,negated_conjecture,(sum(n0,n4,a_select3(q,X1,tptp_sum_index))=n1|~leq(n0,X1)|~leq(X1,minus(pv10,n1))),inference(rw,[status(thm)],[398,225,theory(equality)]),['unfolding']).
% cnf(634,negated_conjecture,(~leq(esk24_0,minus(pv10,n1))|~leq(n0,esk24_0)),inference(spm,[status(thm)],[392,432,theory(equality)])).
% cnf(635,negated_conjecture,(~leq(esk24_0,minus(pv10,n1))|$false),inference(rw,[status(thm)],[634,394,theory(equality)])).
% cnf(636,negated_conjecture,(~leq(esk24_0,minus(pv10,n1))),inference(cn,[status(thm)],[635,theory(equality)])).
% cnf(5557,negated_conjecture,(~gt(pv10,esk24_0)),inference(spm,[status(thm)],[636,431,theory(equality)])).
% cnf(5558,negated_conjecture,(pv10=esk24_0|~leq(esk24_0,pv10)),inference(spm,[status(thm)],[5557,231,theory(equality)])).
% cnf(5559,negated_conjecture,(pv10=esk24_0|$false),inference(rw,[status(thm)],[5558,393,theory(equality)])).
% cnf(5560,negated_conjecture,(pv10=esk24_0),inference(cn,[status(thm)],[5559,theory(equality)])).
% cnf(5563,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[392,5560,theory(equality)]),397,theory(equality)])).
% cnf(5564,negated_conjecture,($false),inference(cn,[status(thm)],[5563,theory(equality)])).
% cnf(5565,negated_conjecture,($false),5564,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 417
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 417
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 3264
% # ...of the previous two non-trivial : 3235
% # Contextual simplify-reflections : 0
% # Paramodulations : 3251
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 205
% # Positive orientable unit clauses: 54
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 2
% # Non-unit-clauses : 144
% # Current number of unprocessed clauses: 3063
% # ...number of literals in the above : 21555
% # Clause-clause subsumption calls (NU) : 3492
% # Rec. Clause-clause subsumption calls : 1298
% # Unit Clause-clause subsumption calls : 57
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 235 leaves, 1.26+/-1.520 terms/leaf
% # Paramod-from index: 85 leaves, 1.05+/-0.212 terms/leaf
% # Paramod-into index: 129 leaves, 1.14+/-0.581 terms/leaf
% # -------------------------------------------------
% # User time : 0.239 s
% # System time : 0.010 s
% # Total time : 0.249 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.43 CPU 0.52 WC
% FINAL PrfWatch: 0.43 CPU 0.52 WC
% SZS output end Solution for /tmp/SystemOnTPTP15914/SWV161+1.tptp
%
%------------------------------------------------------------------------------