TSTP Solution File: SWV048+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV048+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 : art05.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:17:05 EST 2010
% Result : Theorem 1.73s
% Output : Solution 1.73s
% 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/SystemOnTPTP12827/SWV048+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12827/SWV048+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12827/SWV048+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 12923
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,true,file('/tmp/SRASS.s.p', ttrue)).
% fof(22, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(24, axiom,![X15]:sum(n0,tptp_minus_1,X15)=n0,file('/tmp/SRASS.s.p', sum_plus_base)).
% fof(52, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(57, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(58, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(63, axiom,![X1]:pred(succ(X1))=X1,file('/tmp/SRASS.s.p', pred_succ)).
% fof(92, conjecture,(((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))=>((~(n0=pv78)=>(((n0=sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))&pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)))&leq(n0,pv35))&leq(pv35,minus(n5,n1))))&(n0=pv78=>true))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0016)).
% fof(93, negated_conjecture,~((((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))=>((~(n0=pv78)=>(((n0=sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))&pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)))&leq(n0,pv35))&leq(pv35,minus(n5,n1))))&(n0=pv78=>true)))),inference(assume_negation,[status(cth)],[92])).
% cnf(105,plain,(true),inference(split_conjunct,[status(thm)],[4])).
% fof(228, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[22])).
% cnf(229,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[228])).
% fof(231, plain,![X16]:sum(n0,tptp_minus_1,X16)=n0,inference(variable_rename,[status(thm)],[24])).
% cnf(232,plain,(sum(n0,tptp_minus_1,X1)=n0),inference(split_conjunct,[status(thm)],[231])).
% cnf(324,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[52])).
% fof(329, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[57])).
% cnf(330,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[329])).
% fof(331, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[58])).
% cnf(332,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[331])).
% fof(339, plain,![X2]:pred(succ(X2))=X2,inference(variable_rename,[status(thm)],[63])).
% cnf(340,plain,(pred(succ(X1))=X1),inference(split_conjunct,[status(thm)],[339])).
% fof(388, negated_conjecture,(((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))&((~(n0=pv78)&(((~(n0=sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))|~(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))))|~(leq(n0,pv35)))|~(leq(pv35,minus(n5,n1)))))|(n0=pv78&~(true)))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,(((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))&(((n0=pv78|~(n0=pv78))&(~(true)|~(n0=pv78)))&((n0=pv78|(((~(n0=sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))|~(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))))|~(leq(n0,pv35)))|~(leq(pv35,minus(n5,n1)))))&(~(true)|(((~(n0=sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))|~(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))))|~(leq(n0,pv35)))|~(leq(pv35,minus(n5,n1)))))))),inference(distribute,[status(thm)],[388])).
% cnf(391,negated_conjecture,(n0=pv78|~leq(pv35,minus(n5,n1))|~leq(n0,pv35)|pv78!=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))|n0!=sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))),inference(split_conjunct,[status(thm)],[389])).
% cnf(392,negated_conjecture,(n0!=pv78|~true),inference(split_conjunct,[status(thm)],[389])).
% cnf(394,negated_conjecture,(leq(pv35,minus(n5,n1))),inference(split_conjunct,[status(thm)],[389])).
% cnf(395,negated_conjecture,(leq(n0,pv35)),inference(split_conjunct,[status(thm)],[389])).
% cnf(396,negated_conjecture,(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))),inference(split_conjunct,[status(thm)],[389])).
% cnf(427,plain,(minus(succ(X1),n1)=X1),inference(rw,[status(thm)],[340,229,theory(equality)]),['unfolding']).
% cnf(431,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[324,330,theory(equality)]),['unfolding']).
% cnf(433,plain,(minus(plus(X1,n1),n1)=X1),inference(rw,[status(thm)],[427,330,theory(equality)]),['unfolding']).
% cnf(434,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[332,330,theory(equality)]),['unfolding']).
% cnf(454,negated_conjecture,(pv78!=n0|$false),inference(rw,[status(thm)],[392,105,theory(equality)])).
% cnf(455,negated_conjecture,(pv78!=n0),inference(cn,[status(thm)],[454,theory(equality)])).
% cnf(458,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[431,434,theory(equality)])).
% cnf(470,negated_conjecture,(pv78=n0|$false|sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))!=n0|~leq(n0,pv35)|~leq(pv35,minus(n5,n1))),inference(rw,[status(thm)],[391,396,theory(equality)])).
% cnf(471,negated_conjecture,(pv78=n0|$false|sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))!=n0|$false|~leq(pv35,minus(n5,n1))),inference(rw,[status(thm)],[470,395,theory(equality)])).
% cnf(472,negated_conjecture,(pv78=n0|$false|sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))!=n0|$false|$false),inference(rw,[status(thm)],[471,394,theory(equality)])).
% cnf(473,negated_conjecture,(pv78=n0|sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))!=n0),inference(cn,[status(thm)],[472,theory(equality)])).
% cnf(474,negated_conjecture,(sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))!=n0),inference(sr,[status(thm)],[473,455,theory(equality)])).
% cnf(521,plain,(minus(plus(n1,X1),n1)=X1),inference(spm,[status(thm)],[433,434,theory(equality)])).
% cnf(12008,plain,(minus(n0,n1)=tptp_minus_1),inference(spm,[status(thm)],[521,458,theory(equality)])).
% cnf(12024,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[474,12008,theory(equality)]),232,theory(equality)])).
% cnf(12025,negated_conjecture,($false),inference(cn,[status(thm)],[12024,theory(equality)])).
% cnf(12026,negated_conjecture,($false),12025,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 500
% # ...of these trivial : 2
% # ...subsumed : 28
% # ...remaining for further processing: 470
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 6472
% # ...of the previous two non-trivial : 6415
% # Contextual simplify-reflections : 0
% # Paramodulations : 6461
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 263
% # Positive orientable unit clauses: 87
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 21
% # Non-unit-clauses : 150
% # Current number of unprocessed clauses: 6239
% # ...number of literals in the above : 39465
% # Clause-clause subsumption calls (NU) : 4909
% # Rec. Clause-clause subsumption calls : 1425
% # Unit Clause-clause subsumption calls : 111
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 286 leaves, 1.22+/-1.386 terms/leaf
% # Paramod-from index: 123 leaves, 1.02+/-0.154 terms/leaf
% # Paramod-into index: 183 leaves, 1.10+/-0.507 terms/leaf
% # -------------------------------------------------
% # User time : 0.373 s
% # System time : 0.015 s
% # Total time : 0.388 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.68 CPU 0.76 WC
% FINAL PrfWatch: 0.68 CPU 0.76 WC
% SZS output end Solution for /tmp/SystemOnTPTP12827/SWV048+1.tptp
%
%------------------------------------------------------------------------------