TSTP Solution File: NUM298+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM298+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:34:17 EST 2010
% Result : Theorem 8.25s
% Output : Solution 8.25s
% 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/SystemOnTPTP9670/NUM298+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9670/NUM298+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9670/NUM298+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 9766
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,rdn_translate(nn2,rdn_neg(rdnn(n2))),file('/tmp/SRASS.s.p', rdnn2)).
% fof(2, axiom,![X1]:![X2]:(less(X1,X2)<=>(~(less(X2,X1))&~(X2=X1))),file('/tmp/SRASS.s.p', less_property)).
% fof(5, axiom,rdn_translate(n2,rdn_pos(rdnn(n2))),file('/tmp/SRASS.s.p', rdn2)).
% fof(6, axiom,![X1]:![X2]:![X4]:![X5]:((rdn_translate(X1,rdn_neg(X4))&rdn_translate(X2,rdn_pos(X5)))=>less(X1,X2)),file('/tmp/SRASS.s.p', less_entry_point_neg_pos)).
% fof(402, conjecture,~(less(n2,nn2)),file('/tmp/SRASS.s.p', n2_not_less_nn2)).
% fof(403, negated_conjecture,~(~(less(n2,nn2))),inference(assume_negation,[status(cth)],[402])).
% fof(404, plain,![X1]:![X2]:(less(X1,X2)<=>(~(less(X2,X1))&~(X2=X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(405, negated_conjecture,less(n2,nn2),inference(fof_simplification,[status(thm)],[403,theory(equality)])).
% cnf(406,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),inference(split_conjunct,[status(thm)],[1])).
% fof(407, plain,![X1]:![X2]:((~(less(X1,X2))|(~(less(X2,X1))&~(X2=X1)))&((less(X2,X1)|X2=X1)|less(X1,X2))),inference(fof_nnf,[status(thm)],[404])).
% fof(408, plain,![X3]:![X4]:((~(less(X3,X4))|(~(less(X4,X3))&~(X4=X3)))&((less(X4,X3)|X4=X3)|less(X3,X4))),inference(variable_rename,[status(thm)],[407])).
% fof(409, plain,![X3]:![X4]:(((~(less(X4,X3))|~(less(X3,X4)))&(~(X4=X3)|~(less(X3,X4))))&((less(X4,X3)|X4=X3)|less(X3,X4))),inference(distribute,[status(thm)],[408])).
% cnf(412,plain,(~less(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[409])).
% cnf(417,plain,(rdn_translate(n2,rdn_pos(rdnn(n2)))),inference(split_conjunct,[status(thm)],[5])).
% fof(418, plain,![X1]:![X2]:![X4]:![X5]:((~(rdn_translate(X1,rdn_neg(X4)))|~(rdn_translate(X2,rdn_pos(X5))))|less(X1,X2)),inference(fof_nnf,[status(thm)],[6])).
% fof(419, plain,![X6]:![X7]:![X8]:![X9]:((~(rdn_translate(X6,rdn_neg(X8)))|~(rdn_translate(X7,rdn_pos(X9))))|less(X6,X7)),inference(variable_rename,[status(thm)],[418])).
% cnf(420,plain,(less(X1,X2)|~rdn_translate(X2,rdn_pos(X3))|~rdn_translate(X1,rdn_neg(X4))),inference(split_conjunct,[status(thm)],[419])).
% cnf(868,negated_conjecture,(less(n2,nn2)),inference(split_conjunct,[status(thm)],[405])).
% cnf(870,negated_conjecture,(~less(nn2,n2)),inference(spm,[status(thm)],[412,868,theory(equality)])).
% cnf(910,plain,(less(X1,n2)|~rdn_translate(X1,rdn_neg(X2))),inference(spm,[status(thm)],[420,417,theory(equality)])).
% cnf(2258,plain,(less(nn2,n2)),inference(spm,[status(thm)],[910,406,theory(equality)])).
% cnf(2259,plain,($false),inference(sr,[status(thm)],[2258,870,theory(equality)])).
% cnf(2260,plain,($false),2259,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 421
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 421
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1387
% # ...of the previous two non-trivial : 1379
% # Contextual simplify-reflections : 0
% # Paramodulations : 1383
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 419
% # Positive orientable unit clauses: 386
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 1365
% # ...number of literals in the above : 4262
% # Clause-clause subsumption calls (NU) : 24
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 803 leaves, 1.41+/-4.704 terms/leaf
% # Paramod-from index: 389 leaves, 1.00+/-0.051 terms/leaf
% # Paramod-into index: 795 leaves, 1.35+/-4.678 terms/leaf
% # -------------------------------------------------
% # User time : 0.074 s
% # System time : 0.009 s
% # Total time : 0.083 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.31 WC
% FINAL PrfWatch: 0.22 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP9670/NUM298+1.tptp
%
%------------------------------------------------------------------------------