TSTP Solution File: MSC012+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : MSC012+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.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 16:12:10 EST 2010

% Result   : Theorem 0.87s
% Output   : Solution 0.87s
% 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/SystemOnTPTP5472/MSC012+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP5472/MSC012+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5472/MSC012+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 5568
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(((p(X1)&less(X1,X2))&p(X2))=>goal),file('/tmp/SRASS.s.p', left_to_right)).
% fof(2, axiom,![X1]:(p(X1)|?[X2]:(less(X1,X2)&p(X2))),file('/tmp/SRASS.s.p', right_to_left)).
% fof(3, axiom,![X1]:![X2]:![X3]:((less(X1,X2)&less(X2,X3))=>less(X1,X3)),file('/tmp/SRASS.s.p', transitive_less)).
% fof(4, axiom,![X1]:?[X2]:less(X1,X2),file('/tmp/SRASS.s.p', serial_less)).
% fof(5, conjecture,goal,file('/tmp/SRASS.s.p', goal_to_be_proved)).
% fof(6, negated_conjecture,~(goal),inference(assume_negation,[status(cth)],[5])).
% fof(7, negated_conjecture,~(goal),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(8, plain,![X1]:![X2]:(((~(p(X1))|~(less(X1,X2)))|~(p(X2)))|goal),inference(fof_nnf,[status(thm)],[1])).
% fof(9, plain,![X3]:![X4]:(((~(p(X3))|~(less(X3,X4)))|~(p(X4)))|goal),inference(variable_rename,[status(thm)],[8])).
% cnf(10,plain,(goal|~p(X1)|~less(X2,X1)|~p(X2)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, plain,![X3]:(p(X3)|?[X4]:(less(X3,X4)&p(X4))),inference(variable_rename,[status(thm)],[2])).
% fof(12, plain,![X3]:(p(X3)|(less(X3,esk1_1(X3))&p(esk1_1(X3)))),inference(skolemize,[status(esa)],[11])).
% fof(13, plain,![X3]:((less(X3,esk1_1(X3))|p(X3))&(p(esk1_1(X3))|p(X3))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(p(X1)|p(esk1_1(X1))),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(p(X1)|less(X1,esk1_1(X1))),inference(split_conjunct,[status(thm)],[13])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(less(X1,X2))|~(less(X2,X3)))|less(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(less(X4,X5))|~(less(X5,X6)))|less(X4,X6)),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(less(X1,X2)|~less(X3,X2)|~less(X1,X3)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:?[X4]:less(X3,X4),inference(variable_rename,[status(thm)],[4])).
% fof(20, plain,![X3]:less(X3,esk2_1(X3)),inference(skolemize,[status(esa)],[19])).
% cnf(21,plain,(less(X1,esk2_1(X1))),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,negated_conjecture,(~goal),inference(split_conjunct,[status(thm)],[7])).
% cnf(23,plain,(~p(X2)|~p(X1)|~less(X2,X1)),inference(sr,[status(thm)],[10,22,theory(equality)])).
% cnf(27,plain,(less(X1,esk1_1(X2))|p(X2)|~less(X1,X2)),inference(spm,[status(thm)],[18,15,theory(equality)])).
% cnf(30,plain,(p(X2)|~p(X1)|~p(esk1_1(X2))|~less(X1,X2)),inference(spm,[status(thm)],[23,27,theory(equality)])).
% cnf(36,plain,(p(X2)|~less(X1,X2)|~p(X1)),inference(csr,[status(thm)],[30,14])).
% cnf(37,plain,(~less(X1,X2)|~p(X1)),inference(csr,[status(thm)],[36,23])).
% cnf(38,plain,(~p(X1)),inference(spm,[status(thm)],[37,21,theory(equality)])).
% cnf(42,plain,(p(X1)),inference(sr,[status(thm)],[14,38,theory(equality)])).
% cnf(43,plain,($false),inference(sr,[status(thm)],[42,38,theory(equality)])).
% cnf(44,plain,($false),43,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 19
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 19
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 0
% # Generated clauses                  : 18
% # ...of the previous two non-trivial : 14
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 16
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 9
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 6
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 18
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:     9 leaves,   1.56+/-0.685 terms/leaf
% # Paramod-from index:            2 leaves,   1.50+/-0.500 terms/leaf
% # Paramod-into index:            8 leaves,   1.50+/-0.707 terms/leaf
% # -------------------------------------------------
% # User time              : 0.008 s
% # System time            : 0.005 s
% # Total time             : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5472/MSC012+1.tptp
% 
%------------------------------------------------------------------------------