TSTP Solution File: NUM304+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM304+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 : art04.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:35:09 EST 2010
% Result : Theorem 7.86s
% Output : Solution 7.86s
% 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/SystemOnTPTP21134/NUM304+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21134/NUM304+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21134/NUM304+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 21230
% 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(1, axiom,![X1]:![X2]:(less(X1,X2)<=>(~(less(X2,X1))&~(X2=X1))),file('/tmp/SRASS.s.p', less_property)).
% fof(122, axiom,![X1]:![X2]:![X10]:![X11]:((rdn_translate(X1,rdn_neg(X10))&rdn_translate(X2,rdn_pos(X11)))=>less(X1,X2)),file('/tmp/SRASS.s.p', less_entry_point_neg_pos)).
% fof(247, axiom,rdn_translate(nn1,rdn_neg(rdnn(n1))),file('/tmp/SRASS.s.p', rdnn1)).
% fof(402, conjecture,?[X1]:~(X1=n12),file('/tmp/SRASS.s.p', something_not_n12)).
% fof(403, negated_conjecture,~(?[X1]:~(X1=n12)),inference(assume_negation,[status(cth)],[402])).
% fof(404, plain,![X1]:![X2]:(less(X1,X2)<=>(~(less(X2,X1))&~(X2=X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(405, 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(406, plain,![X3]:![X4]:((~(less(X3,X4))|(~(less(X4,X3))&~(X4=X3)))&((less(X4,X3)|X4=X3)|less(X3,X4))),inference(variable_rename,[status(thm)],[405])).
% fof(407, 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)],[406])).
% cnf(409,plain,(~less(X1,X2)|X2!=X1),inference(split_conjunct,[status(thm)],[407])).
% fof(547, plain,![X1]:![X2]:![X10]:![X11]:((~(rdn_translate(X1,rdn_neg(X10)))|~(rdn_translate(X2,rdn_pos(X11))))|less(X1,X2)),inference(fof_nnf,[status(thm)],[122])).
% fof(548, plain,![X12]:![X13]:![X14]:![X15]:((~(rdn_translate(X12,rdn_neg(X14)))|~(rdn_translate(X13,rdn_pos(X15))))|less(X12,X13)),inference(variable_rename,[status(thm)],[547])).
% cnf(549,plain,(less(X1,X2)|~rdn_translate(X2,rdn_pos(X3))|~rdn_translate(X1,rdn_neg(X4))),inference(split_conjunct,[status(thm)],[548])).
% cnf(706,plain,(rdn_translate(nn1,rdn_neg(rdnn(n1)))),inference(split_conjunct,[status(thm)],[247])).
% fof(867, negated_conjecture,![X1]:X1=n12,inference(fof_nnf,[status(thm)],[403])).
% fof(868, negated_conjecture,![X2]:X2=n12,inference(variable_rename,[status(thm)],[867])).
% cnf(869,negated_conjecture,(X1=n12),inference(split_conjunct,[status(thm)],[868])).
% cnf(885,plain,(~less(X1,X1)),inference(er,[status(thm)],[409,theory(equality)])).
% cnf(941,plain,(rdn_translate(n12,n12)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[706,869,theory(equality)]),869,theory(equality)]),869,theory(equality)])).
% cnf(983,plain,(less(X1,X2)|~rdn_translate(X2,n12)|~rdn_translate(X1,rdn_neg(X4))),inference(rw,[status(thm)],[549,869,theory(equality)])).
% cnf(984,plain,(less(X1,X2)|~rdn_translate(X2,n12)|~rdn_translate(X1,n12)),inference(rw,[status(thm)],[983,869,theory(equality)])).
% cnf(987,plain,(less(X1,n12)|~rdn_translate(X1,n12)),inference(spm,[status(thm)],[984,941,theory(equality)])).
% cnf(1505,plain,(less(n12,n12)),inference(spm,[status(thm)],[987,941,theory(equality)])).
% cnf(1516,plain,($false),inference(sr,[status(thm)],[1505,885,theory(equality)])).
% cnf(1517,plain,($false),1516,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 418
% # ...of these trivial : 369
% # ...subsumed : 4
% # ...remaining for further processing: 45
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 2
% # Generated clauses : 178
% # ...of the previous two non-trivial : 139
% # Contextual simplify-reflections : 2
% # Paramodulations : 166
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 94
% # ...number of literals in the above : 165
% # Clause-clause subsumption calls (NU) : 70
% # Rec. Clause-clause subsumption calls : 44
% # Unit Clause-clause subsumption calls : 37
% # Rewrite failures with RHS unbound : 25
% # Indexed BW rewrite attempts : 105
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 39 leaves, 1.23+/-0.697 terms/leaf
% # Paramod-from index: 18 leaves, 1.06+/-0.229 terms/leaf
% # Paramod-into index: 36 leaves, 1.06+/-0.229 terms/leaf
% # -------------------------------------------------
% # User time : 0.034 s
% # System time : 0.004 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP21134/NUM304+1.tptp
%
%------------------------------------------------------------------------------