TSTP Solution File: SWV069+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV069+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:20:34 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP13604/SWV069+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13604/SWV069+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13604/SWV069+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 13700
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:leq(X1,X1),file('/tmp/SRASS.s.p', reflexivity_leq)).
% fof(9, axiom,gt(n5,n0),file('/tmp/SRASS.s.p', gt_5_0)).
% fof(15, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(70, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(92, conjecture,((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))=>(((leq(n0,n0)&leq(n0,pv10))&leq(n0,minus(n5,n1)))&leq(pv10,minus(n135300,n1)))),file('/tmp/SRASS.s.p', cl5_nebula_array_0010)).
% fof(93, negated_conjecture,~(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))=>(((leq(n0,n0)&leq(n0,pv10))&leq(n0,minus(n5,n1)))&leq(pv10,minus(n135300,n1))))),inference(assume_negation,[status(cth)],[92])).
% fof(97, plain,![X2]:leq(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(98,plain,(leq(X1,X1)),inference(split_conjunct,[status(thm)],[97])).
% cnf(112,plain,(gt(n5,n0)),inference(split_conjunct,[status(thm)],[9])).
% fof(126, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[15])).
% cnf(127,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[126])).
% fof(319, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[70])).
% fof(320, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[319])).
% cnf(321,plain,(leq(X1,pred(X2))|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[320])).
% fof(388, negated_conjecture,((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))&(((~(leq(n0,n0))|~(leq(n0,pv10)))|~(leq(n0,minus(n5,n1))))|~(leq(pv10,minus(n135300,n1))))),inference(fof_nnf,[status(thm)],[93])).
% cnf(389,negated_conjecture,(~leq(pv10,minus(n135300,n1))|~leq(n0,minus(n5,n1))|~leq(n0,pv10)|~leq(n0,n0)),inference(split_conjunct,[status(thm)],[388])).
% cnf(390,negated_conjecture,(leq(pv10,minus(n135300,n1))),inference(split_conjunct,[status(thm)],[388])).
% cnf(391,negated_conjecture,(leq(n0,pv10)),inference(split_conjunct,[status(thm)],[388])).
% cnf(424,plain,(leq(X1,minus(X2,n1))|~gt(X2,X1)),inference(rw,[status(thm)],[321,127,theory(equality)]),['unfolding']).
% cnf(459,negated_conjecture,($false|~leq(n0,pv10)|~leq(n0,minus(n5,n1))|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[389,98,theory(equality)])).
% cnf(460,negated_conjecture,($false|$false|~leq(n0,minus(n5,n1))|~leq(pv10,minus(n135300,n1))),inference(rw,[status(thm)],[459,391,theory(equality)])).
% cnf(461,negated_conjecture,($false|$false|~leq(n0,minus(n5,n1))|$false),inference(rw,[status(thm)],[460,390,theory(equality)])).
% cnf(462,negated_conjecture,(~leq(n0,minus(n5,n1))),inference(cn,[status(thm)],[461,theory(equality)])).
% cnf(516,negated_conjecture,(~gt(n5,n0)),inference(spm,[status(thm)],[462,424,theory(equality)])).
% cnf(519,negated_conjecture,($false),inference(rw,[status(thm)],[516,112,theory(equality)])).
% cnf(520,negated_conjecture,($false),inference(cn,[status(thm)],[519,theory(equality)])).
% cnf(521,negated_conjecture,($false),520,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 255
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 255
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 45
% # ...of the previous two non-trivial : 38
% # Contextual simplify-reflections : 0
% # Paramodulations : 44
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 52
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 183
% # ...number of literals in the above : 787
% # Clause-clause subsumption calls (NU) : 1740
% # Rec. Clause-clause subsumption calls : 648
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 67 leaves, 1.06+/-0.293 terms/leaf
% # Paramod-from index: 46 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 64 leaves, 1.03+/-0.174 terms/leaf
% # -------------------------------------------------
% # User time : 0.055 s
% # System time : 0.005 s
% # Total time : 0.060 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP13604/SWV069+1.tptp
%
%------------------------------------------------------------------------------