TSTP Solution File: SWV077+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV077+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 : art09.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:21:53 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP9238/SWV077+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9238/SWV077+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9238/SWV077+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 9334
% 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(85, conjecture,((leq(n0,pv31)&leq(pv31,minus(n5,n1)))=>(((leq(n0,pv31)&leq(pv31,minus(n5,n1)))&(~(n0=pv40)=>(leq(n0,pv31)&leq(pv31,minus(n5,n1)))))&(n0=pv40=>true))),file('/tmp/SRASS.s.p', cl5_nebula_array_0018)).
% fof(86, negated_conjecture,~(((leq(n0,pv31)&leq(pv31,minus(n5,n1)))=>(((leq(n0,pv31)&leq(pv31,minus(n5,n1)))&(~(n0=pv40)=>(leq(n0,pv31)&leq(pv31,minus(n5,n1)))))&(n0=pv40=>true)))),inference(assume_negation,[status(cth)],[85])).
% cnf(98,plain,(true),inference(split_conjunct,[status(thm)],[4])).
% fof(374, negated_conjecture,((leq(n0,pv31)&leq(pv31,minus(n5,n1)))&(((~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))|(~(n0=pv40)&(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))))|(n0=pv40&~(true)))),inference(fof_nnf,[status(thm)],[86])).
% fof(375, negated_conjecture,((leq(n0,pv31)&leq(pv31,minus(n5,n1)))&(((n0=pv40|(~(n0=pv40)|(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))))&(~(true)|(~(n0=pv40)|(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1)))))))&((n0=pv40|((~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))|(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))))&(~(true)|((~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))|(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1))))))))),inference(distribute,[status(thm)],[374])).
% cnf(376,negated_conjecture,(~leq(pv31,minus(n5,n1))|~leq(n0,pv31)|~leq(pv31,minus(n5,n1))|~leq(n0,pv31)|~true),inference(split_conjunct,[status(thm)],[375])).
% cnf(380,negated_conjecture,(leq(pv31,minus(n5,n1))),inference(split_conjunct,[status(thm)],[375])).
% cnf(381,negated_conjecture,(leq(n0,pv31)),inference(split_conjunct,[status(thm)],[375])).
% cnf(446,negated_conjecture,($false|~leq(n0,pv31)|~leq(pv31,minus(n5,n1))),inference(rw,[status(thm)],[376,98,theory(equality)])).
% cnf(447,negated_conjecture,($false|$false|~leq(pv31,minus(n5,n1))),inference(rw,[status(thm)],[446,381,theory(equality)])).
% cnf(448,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[447,380,theory(equality)])).
% cnf(449,negated_conjecture,($false),inference(cn,[status(thm)],[448,theory(equality)])).
% cnf(450,negated_conjecture,($false),449,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 46
% # 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: 43
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 151
% # ...number of literals in the above : 753
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 54 leaves, 1.09+/-0.398 terms/leaf
% # Paramod-from index: 36 leaves, 1.03+/-0.164 terms/leaf
% # Paramod-into index: 52 leaves, 1.06+/-0.305 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.007 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP9238/SWV077+1.tptp
%
%------------------------------------------------------------------------------