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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL460+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:30:27 EST 2010

% Result   : Theorem 1.18s
% Output   : Solution 1.18s
% 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/SystemOnTPTP14953/LCL460+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP14953/LCL460+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14953/LCL460+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 15085
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(kn2<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1))),file('/tmp/SRASS.s.p', kn2)).
% fof(9, axiom,and_1,file('/tmp/SRASS.s.p', hilbert_and_1)).
% fof(20, axiom,(and_1<=>![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3))),file('/tmp/SRASS.s.p', and_1)).
% fof(53, conjecture,kn2,file('/tmp/SRASS.s.p', rosser_kn2)).
% fof(54, negated_conjecture,~(kn2),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(kn2),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(kn2)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X1)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X1)))|kn2)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X5)))|kn2)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(kn2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)))|kn2)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X3))|~(kn2))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0)))|kn2)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(kn2|~is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0))),inference(split_conjunct,[status(thm)],[59])).
% cnf(69,plain,(and_1),inference(split_conjunct,[status(thm)],[9])).
% fof(80, plain,((~(and_1)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X3)))&(?[X3]:?[X4]:~(is_a_theorem(implies(and(X3,X4),X3)))|and_1)),inference(fof_nnf,[status(thm)],[20])).
% fof(81, plain,((~(and_1)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(?[X7]:?[X8]:~(is_a_theorem(implies(and(X7,X8),X7)))|and_1)),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,((~(and_1)|![X5]:![X6]:is_a_theorem(implies(and(X5,X6),X5)))&(~(is_a_theorem(implies(and(esk3_0,esk4_0),esk3_0)))|and_1)),inference(skolemize,[status(esa)],[81])).
% fof(83, plain,![X5]:![X6]:((is_a_theorem(implies(and(X5,X6),X5))|~(and_1))&(~(is_a_theorem(implies(and(esk3_0,esk4_0),esk3_0)))|and_1)),inference(shift_quantors,[status(thm)],[82])).
% cnf(85,plain,(is_a_theorem(implies(and(X1,X2),X1))|~and_1),inference(split_conjunct,[status(thm)],[83])).
% cnf(258,negated_conjecture,(~kn2),inference(split_conjunct,[status(thm)],[55])).
% cnf(265,plain,(~is_a_theorem(implies(and(esk1_0,esk2_0),esk1_0))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(289,plain,(is_a_theorem(implies(and(X1,X2),X1))|$false),inference(rw,[status(thm)],[85,69,theory(equality)])).
% cnf(290,plain,(is_a_theorem(implies(and(X1,X2),X1))),inference(cn,[status(thm)],[289,theory(equality)])).
% cnf(291,plain,($false),inference(rw,[status(thm)],[265,290,theory(equality)])).
% cnf(292,plain,($false),inference(cn,[status(thm)],[291,theory(equality)])).
% cnf(293,plain,($false),292,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 52
% # ...of these trivial                : 17
% # ...subsumed                        : 1
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 2
% # Generated clauses                  : 0
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 32
% #    Positive orientable unit clauses: 23
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 8
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 63
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 8
% # Indexed BW rewrite successes       : 2
% # Backwards rewriting index:    66 leaves,   1.11+/-0.308 terms/leaf
% # Paramod-from index:           21 leaves,   1.10+/-0.294 terms/leaf
% # Paramod-into index:           57 leaves,   1.09+/-0.283 terms/leaf
% # -------------------------------------------------
% # User time              : 0.016 s
% # System time            : 0.004 s
% # Total time             : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP14953/LCL460+1.tptp
% 
%------------------------------------------------------------------------------