TSTP Solution File: NUM343+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM343+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 : 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 : Wed Dec 29 18:10:37 EST 2010
% Result : Theorem 8.09s
% Output : Solution 8.09s
% 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/SystemOnTPTP31583/NUM343+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31583/NUM343+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31583/NUM343+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 31680
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.034 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(less(X1,X2)<=>(~(less(X2,X1))&~(X2=X1))),file('/tmp/SRASS.s.p', less_property)).
% fof(402, conjecture,?[X1]:((less(nn1,X1)&less(X1,n1))=>sum(n21,X1,n21)),file('/tmp/SRASS.s.p', sum_something_n0_samething)).
% fof(403, negated_conjecture,~(?[X1]:((less(nn1,X1)&less(X1,n1))=>sum(n21,X1,n21))),inference(assume_negation,[status(cth)],[402])).
% fof(404, plain,![X1]:![X2]:(less(X1,X2)<=>(~(less(X2,X1))&~(X2=X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(409, 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(410, plain,![X3]:![X4]:((~(less(X3,X4))|(~(less(X4,X3))&~(X4=X3)))&((less(X4,X3)|X4=X3)|less(X3,X4))),inference(variable_rename,[status(thm)],[409])).
% fof(411, 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)],[410])).
% cnf(413,plain,(~less(X1,X2)|X2!=X1),inference(split_conjunct,[status(thm)],[411])).
% fof(867, negated_conjecture,![X1]:((less(nn1,X1)&less(X1,n1))&~(sum(n21,X1,n21))),inference(fof_nnf,[status(thm)],[403])).
% fof(868, negated_conjecture,![X2]:((less(nn1,X2)&less(X2,n1))&~(sum(n21,X2,n21))),inference(variable_rename,[status(thm)],[867])).
% cnf(871,negated_conjecture,(less(nn1,X1)),inference(split_conjunct,[status(thm)],[868])).
% cnf(872,plain,(~less(X1,X1)),inference(er,[status(thm)],[413,theory(equality)])).
% cnf(874,negated_conjecture,($false),inference(spm,[status(thm)],[872,871,theory(equality)])).
% cnf(876,negated_conjecture,($false),874,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 415
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 415
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 405
% # ...number of literals in the above : 479
% # Clause-clause subsumption calls (NU) : 39
% # Rec. Clause-clause subsumption calls : 16
% # 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: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 7 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.061 s
% # System time : 0.006 s
% # Total time : 0.067 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP31583/NUM343+1.tptp
%
%------------------------------------------------------------------------------