TSTP Solution File: SWV078+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV078+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:22:02 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/SystemOnTPTP13863/SWV078+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13863/SWV078+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13863/SWV078+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 13959
% 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(4, axiom,true,file('/tmp/SRASS.s.p', ttrue)).
% fof(85, conjecture,((leq(n0,pv31)&leq(pv31,minus(n5,n1)))=>((~(n0=pv70)=>(leq(n0,pv31)&leq(pv31,minus(n5,n1))))&(n0=pv70=>true))),file('/tmp/SRASS.s.p', cl5_nebula_array_0019)).
% fof(86, negated_conjecture,~(((leq(n0,pv31)&leq(pv31,minus(n5,n1)))=>((~(n0=pv70)=>(leq(n0,pv31)&leq(pv31,minus(n5,n1))))&(n0=pv70=>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)))&((~(n0=pv70)&(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1)))))|(n0=pv70&~(true)))),inference(fof_nnf,[status(thm)],[86])).
% fof(375, negated_conjecture,((leq(n0,pv31)&leq(pv31,minus(n5,n1)))&(((n0=pv70|~(n0=pv70))&(~(true)|~(n0=pv70)))&((n0=pv70|(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1)))))&(~(true)|(~(leq(n0,pv31))|~(leq(pv31,minus(n5,n1)))))))),inference(distribute,[status(thm)],[374])).
% cnf(377,negated_conjecture,(n0=pv70|~leq(pv31,minus(n5,n1))|~leq(n0,pv31)),inference(split_conjunct,[status(thm)],[375])).
% cnf(378,negated_conjecture,(n0!=pv70|~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(439,negated_conjecture,(pv70!=n0|$false),inference(rw,[status(thm)],[378,98,theory(equality)])).
% cnf(440,negated_conjecture,(pv70!=n0),inference(cn,[status(thm)],[439,theory(equality)])).
% cnf(441,negated_conjecture,(pv70=n0|$false|~leq(pv31,minus(n5,n1))),inference(rw,[status(thm)],[377,381,theory(equality)])).
% cnf(442,negated_conjecture,(pv70=n0|$false|$false),inference(rw,[status(thm)],[441,380,theory(equality)])).
% cnf(443,negated_conjecture,(pv70=n0),inference(cn,[status(thm)],[442,theory(equality)])).
% cnf(444,negated_conjecture,($false),inference(sr,[status(thm)],[443,440,theory(equality)])).
% cnf(445,negated_conjecture,($false),444,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 34
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 34
% # 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: 33
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 161
% # ...number of literals in the above : 774
% # 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 : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 46 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 30 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 44 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.006 s
% # Total time : 0.033 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/SystemOnTPTP13863/SWV078+1.tptp
%
%------------------------------------------------------------------------------