TSTP Solution File: SWV070+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV070+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:25:33 EST 2010
% Result : Theorem 1.39s
% Output : Solution 1.39s
% 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/SystemOnTPTP31565/SWV070+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31565/SWV070+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31565/SWV070+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 31697
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.028 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(92, conjecture,((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1)))),file('/tmp/SRASS.s.p', cl5_nebula_array_0011)).
% fof(93, negated_conjecture,~(((leq(n0,pv10)&leq(pv10,minus(n135300,n1)))=>(leq(n0,pv10)&leq(pv10,minus(n135300,n1))))),inference(assume_negation,[status(cth)],[92])).
% fof(95, negated_conjecture,~($true),inference(fof_simplification,[status(thm)],[93,theory(equality)])).
% cnf(389,negated_conjecture,($false),inference(split_conjunct,[status(thm)],[95])).
% cnf(447,negated_conjecture,($false),389,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 1
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 0
% # Positive orientable unit clauses: 0
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 197
% # ...number of literals in the above : 808
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 0 leaves, 0.00+/-0.000 terms/leaf
% # Paramod-from index: 0 leaves, 0.00+/-0.000 terms/leaf
% # Paramod-into index: 0 leaves, 0.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.003 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP31565/SWV070+1.tptp
%
%------------------------------------------------------------------------------