TSTP Solution File: NUM318+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM318+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Wed Dec 29 17:50:55 EST 2010
% Result : Theorem 8.30s
% Output : Solution 8.30s
% 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/SystemOnTPTP5461/NUM318+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5461/NUM318+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5461/NUM318+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 5586
% 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(3, axiom,rdn_translate(nn5,rdn_neg(rdnn(n5))),file('/tmp/SRASS.s.p', rdnn5)).
% fof(5, axiom,![X1]:![X2]:![X3]:((rdn_translate(X1,rdn_pos(X3))&rdn_translate(X2,rdn_neg(X3)))=>sum(X1,X2,n0)),file('/tmp/SRASS.s.p', sum_entry_point_posx_negx)).
% fof(14, axiom,rdn_translate(n5,rdn_pos(rdnn(n5))),file('/tmp/SRASS.s.p', rdn5)).
% fof(402, conjecture,sum(n5,nn5,n0),file('/tmp/SRASS.s.p', sum_n5_nn5_n0)).
% fof(403, negated_conjecture,~(sum(n5,nn5,n0)),inference(assume_negation,[status(cth)],[402])).
% fof(405, negated_conjecture,~(sum(n5,nn5,n0)),inference(fof_simplification,[status(thm)],[403,theory(equality)])).
% cnf(408,plain,(rdn_translate(nn5,rdn_neg(rdnn(n5)))),inference(split_conjunct,[status(thm)],[3])).
% fof(410, plain,![X1]:![X2]:![X3]:((~(rdn_translate(X1,rdn_pos(X3)))|~(rdn_translate(X2,rdn_neg(X3))))|sum(X1,X2,n0)),inference(fof_nnf,[status(thm)],[5])).
% fof(411, plain,![X4]:![X5]:![X6]:((~(rdn_translate(X4,rdn_pos(X6)))|~(rdn_translate(X5,rdn_neg(X6))))|sum(X4,X5,n0)),inference(variable_rename,[status(thm)],[410])).
% cnf(412,plain,(sum(X1,X2,n0)|~rdn_translate(X2,rdn_neg(X3))|~rdn_translate(X1,rdn_pos(X3))),inference(split_conjunct,[status(thm)],[411])).
% cnf(434,plain,(rdn_translate(n5,rdn_pos(rdnn(n5)))),inference(split_conjunct,[status(thm)],[14])).
% cnf(868,negated_conjecture,(~sum(n5,nn5,n0)),inference(split_conjunct,[status(thm)],[405])).
% cnf(962,plain,(sum(X1,nn5,n0)|~rdn_translate(X1,rdn_pos(rdnn(n5)))),inference(spm,[status(thm)],[412,408,theory(equality)])).
% cnf(2123,plain,(sum(n5,nn5,n0)),inference(spm,[status(thm)],[962,434,theory(equality)])).
% cnf(2124,plain,($false),inference(sr,[status(thm)],[2123,868,theory(equality)])).
% cnf(2125,plain,($false),2124,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 419
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 419
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1255
% # ...of the previous two non-trivial : 1250
% # Contextual simplify-reflections : 0
% # Paramodulations : 1251
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 417
% # Positive orientable unit clauses: 384
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 1238
% # ...number of literals in the above : 4135
% # Clause-clause subsumption calls (NU) : 24
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 802 leaves, 1.40+/-4.700 terms/leaf
% # Paramod-from index: 387 leaves, 1.00+/-0.051 terms/leaf
% # Paramod-into index: 794 leaves, 1.35+/-4.678 terms/leaf
% # -------------------------------------------------
% # User time : 0.077 s
% # System time : 0.008 s
% # Total time : 0.085 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.62 WC
% FINAL PrfWatch: 0.24 CPU 0.62 WC
% SZS output end Solution for /tmp/SystemOnTPTP5461/NUM318+1.tptp
%
%------------------------------------------------------------------------------