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

View Problem - Process Solution

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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 13:48:04 EST 2010

% Result   : Theorem 1.17s
% Output   : Solution 1.17s
% 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/SystemOnTPTP7918/LCL506+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP7918/LCL506+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7918/LCL506+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 8050
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(and_1<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', and_1)).
% fof(5, axiom,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(11, axiom,(kn2<=>![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3))),file('/tmp/SRASS.s.p', kn2)).
% fof(43, conjecture,and_1,file('/tmp/SRASS.s.p', hilbert_and_1)).
% fof(44, negated_conjecture,~(and_1),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(and_1),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(and_1)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X1)))|and_1)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(and_1)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X5)))|and_1)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(and_1)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)))|and_1)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X3))|~(and_1))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)))|and_1)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(and_1|~is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(55,plain,(kn2),inference(split_conjunct,[status(thm)],[5])).
% fof(76, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X3]:?[X4]:~(is_a_theorem(implies(and(X3,X4),X3)))|kn2)),inference(fof_nnf,[status(thm)],[11])).
% fof(77, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(?[X7]:?[X8]:~(is_a_theorem(implies(and(X7,X8),X7)))|kn2)),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,((~(kn2)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(~(is_a_theorem(implies(and(esk8_0,esk9_0),esk8_0)))|kn2)),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X5]:![X6]:((is_a_theorem(implies(and(X5,X6),X5))|~(kn2))&(~(is_a_theorem(implies(and(esk8_0,esk9_0),esk8_0)))|kn2)),inference(shift_quantors,[status(thm)],[78])).
% cnf(81,plain,(is_a_theorem(implies(and(X1,X2),X1))|~kn2),inference(split_conjunct,[status(thm)],[79])).
% cnf(238,negated_conjecture,(~and_1),inference(split_conjunct,[status(thm)],[45])).
% cnf(245,plain,(~is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0))),inference(sr,[status(thm)],[50,238,theory(equality)])).
% cnf(254,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[81,55,theory(equality)])).
% cnf(255,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(256,plain,($false),inference(rw,[status(thm)],[245,255,theory(equality)])).
% cnf(257,plain,($false),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(258,plain,($false),257,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 42
% # ...of these trivial                : 10
% # ...subsumed                        : 1
% # ...remaining for further processing: 31
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 30
% #    Positive orientable unit clauses: 10
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 19
% # Current number of unprocessed clauses: 30
% # ...number of literals in the above : 62
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:   101 leaves,   1.08+/-0.270 terms/leaf
% # Paramod-from index:           10 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           85 leaves,   1.02+/-0.152 terms/leaf
% # -------------------------------------------------
% # User time              : 0.015 s
% # System time            : 0.003 s
% # Total time             : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP7918/LCL506+1.tptp
% 
%------------------------------------------------------------------------------