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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : LCL491+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:45:18 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/SystemOnTPTP5684/LCL491+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP5684/LCL491+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5684/LCL491+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 5816
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.02 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(or_2<=>![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2)))),file('/tmp/SRASS.s.p', or_2)).
% fof(5, axiom,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(10, axiom,(r2<=>![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4)))),file('/tmp/SRASS.s.p', r2)).
% fof(45, conjecture,or_2,file('/tmp/SRASS.s.p', hilbert_or_2)).
% fof(46, negated_conjecture,~(or_2),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(or_2),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(or_2)|![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X2,or(X1,X2))))|or_2)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(or_2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X6,or(X5,X6))))|or_2)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(or_2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(~(is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0))))|or_2)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(X4,or(X3,X4)))|~(or_2))&(~(is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0))))|or_2)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(or_2|~is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(57,plain,(r2),inference(split_conjunct,[status(thm)],[5])).
% fof(67, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(X4,or(X3,X4))))|r2)),inference(fof_nnf,[status(thm)],[10])).
% fof(68, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(X8,or(X7,X8))))|r2)),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(~(is_a_theorem(implies(esk5_0,or(esk4_0,esk5_0))))|r2)),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X5]:![X6]:((is_a_theorem(implies(X6,or(X5,X6)))|~(r2))&(~(is_a_theorem(implies(esk5_0,or(esk4_0,esk5_0))))|r2)),inference(shift_quantors,[status(thm)],[69])).
% cnf(72,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[70])).
% cnf(242,negated_conjecture,(~or_2),inference(split_conjunct,[status(thm)],[47])).
% cnf(247,plain,(~is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0)))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[72,57,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(260,plain,($false),inference(rw,[status(thm)],[247,258,theory(equality)])).
% cnf(261,plain,($false),inference(cn,[status(thm)],[260,theory(equality)])).
% cnf(262,plain,($false),261,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 38
% # ...of these trivial                : 9
% # ...subsumed                        : 1
% # ...remaining for further processing: 28
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 1
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 27
% #    Positive orientable unit clauses: 14
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 12
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 74
% # Clause-clause subsumption calls (NU) : 27
% # Rec. Clause-clause subsumption calls : 27
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    90 leaves,   1.01+/-0.105 terms/leaf
% # Paramod-from index:           14 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           77 leaves,   1.01+/-0.113 terms/leaf
% # -------------------------------------------------
% # User time              : 0.017 s
% # System time            : 0.001 s
% # Total time             : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.18 WC
% FINAL PrfWatch: 0.13 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP5684/LCL491+1.tptp
% 
%------------------------------------------------------------------------------