TSTP Solution File: SWV065+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV065+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:19:50 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP13345/SWV065+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13345/SWV065+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13345/SWV065+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 13441
% 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(1, axiom,![X1]:leq(X1,X1),file('/tmp/SRASS.s.p', reflexivity_leq)).
% fof(92, conjecture,((((leq(n0,pv10)&leq(n0,pv53))&leq(pv10,minus(n135300,n1)))&leq(pv53,minus(n5,n1)))=>((((leq(n0,n0)&leq(n0,pv10))&leq(n0,pv53))&leq(pv10,minus(n135300,n1)))&leq(pv53,minus(n5,n1)))),file('/tmp/SRASS.s.p', cl5_nebula_array_0006)).
% fof(93, negated_conjecture,~(((((leq(n0,pv10)&leq(n0,pv53))&leq(pv10,minus(n135300,n1)))&leq(pv53,minus(n5,n1)))=>((((leq(n0,n0)&leq(n0,pv10))&leq(n0,pv53))&leq(pv10,minus(n135300,n1)))&leq(pv53,minus(n5,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])).
% fof(388, negated_conjecture,((((leq(n0,pv10)&leq(n0,pv53))&leq(pv10,minus(n135300,n1)))&leq(pv53,minus(n5,n1)))&((((~(leq(n0,n0))|~(leq(n0,pv10)))|~(leq(n0,pv53)))|~(leq(pv10,minus(n135300,n1))))|~(leq(pv53,minus(n5,n1))))),inference(fof_nnf,[status(thm)],[93])).
% cnf(389,negated_conjecture,(~leq(pv53,minus(n5,n1))|~leq(pv10,minus(n135300,n1))|~leq(n0,pv53)|~leq(n0,pv10)|~leq(n0,n0)),inference(split_conjunct,[status(thm)],[388])).
% cnf(390,negated_conjecture,(leq(pv53,minus(n5,n1))),inference(split_conjunct,[status(thm)],[388])).
% cnf(391,negated_conjecture,(leq(pv10,minus(n135300,n1))),inference(split_conjunct,[status(thm)],[388])).
% cnf(392,negated_conjecture,(leq(n0,pv53)),inference(split_conjunct,[status(thm)],[388])).
% cnf(393,negated_conjecture,(leq(n0,pv10)),inference(split_conjunct,[status(thm)],[388])).
% cnf(464,negated_conjecture,($false|~leq(n0,pv10)|~leq(n0,pv53)|~leq(pv10,minus(n135300,n1))|~leq(pv53,minus(n5,n1))),inference(rw,[status(thm)],[389,98,theory(equality)])).
% cnf(465,negated_conjecture,($false|$false|~leq(n0,pv53)|~leq(pv10,minus(n135300,n1))|~leq(pv53,minus(n5,n1))),inference(rw,[status(thm)],[464,393,theory(equality)])).
% cnf(466,negated_conjecture,($false|$false|$false|~leq(pv10,minus(n135300,n1))|~leq(pv53,minus(n5,n1))),inference(rw,[status(thm)],[465,392,theory(equality)])).
% cnf(467,negated_conjecture,($false|$false|$false|$false|~leq(pv53,minus(n5,n1))),inference(rw,[status(thm)],[466,391,theory(equality)])).
% cnf(468,negated_conjecture,($false|$false|$false|$false|$false),inference(rw,[status(thm)],[467,390,theory(equality)])).
% cnf(469,negated_conjecture,($false),inference(cn,[status(thm)],[468,theory(equality)])).
% cnf(470,negated_conjecture,($false),469,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 85
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 0
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 82
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 2
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 119
% # ...number of literals in the above : 675
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 97 leaves, 1.20+/-0.782 terms/leaf
% # Paramod-from index: 66 leaves, 1.06+/-0.239 terms/leaf
% # Paramod-into index: 95 leaves, 1.16+/-0.586 terms/leaf
% # -------------------------------------------------
% # User time : 0.032 s
% # System time : 0.004 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP13345/SWV065+1.tptp
%
%------------------------------------------------------------------------------