%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL455+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 : art09.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 13:24:59 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP31912/LCL455+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31912/LCL455+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31912/LCL455+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 32008
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(r2<=>![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2)))),file('/tmp/SRASS.s.p', r2)).
% fof(11, axiom,or_2,file('/tmp/SRASS.s.p', hilbert_or_2)).
% fof(18, axiom,(or_2<=>![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4)))),file('/tmp/SRASS.s.p', or_2)).
% fof(53, conjecture,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(54, negated_conjecture,~(r2),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(r2),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(r2)|![X1]:![X2]:is_a_theorem(implies(X2,or(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X2,or(X1,X2))))|r2)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X6,or(X5,X6))))|r2)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(~(is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0))))|r2)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X3]:![X4]:((is_a_theorem(implies(X4,or(X3,X4)))|~(r2))&(~(is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0))))|r2)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(r2|~is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[59])).
% cnf(71,plain,(or_2),inference(split_conjunct,[status(thm)],[11])).
% fof(83, plain,((~(or_2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(X4,or(X3,X4))))|or_2)),inference(fof_nnf,[status(thm)],[18])).
% fof(84, plain,((~(or_2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(X8,or(X7,X8))))|or_2)),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,((~(or_2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(~(is_a_theorem(implies(esk6_0,or(esk5_0,esk6_0))))|or_2)),inference(skolemize,[status(esa)],[84])).
% fof(86, plain,![X5]:![X6]:((is_a_theorem(implies(X6,or(X5,X6)))|~(or_2))&(~(is_a_theorem(implies(esk6_0,or(esk5_0,esk6_0))))|or_2)),inference(shift_quantors,[status(thm)],[85])).
% cnf(88,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~or_2),inference(split_conjunct,[status(thm)],[86])).
% cnf(258,negated_conjecture,(~r2),inference(split_conjunct,[status(thm)],[55])).
% cnf(263,plain,(~is_a_theorem(implies(esk2_0,or(esk1_0,esk2_0)))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(278,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[88,71,theory(equality)])).
% cnf(279,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[278,theory(equality)])).
% cnf(281,plain,($false),inference(rw,[status(thm)],[263,279,theory(equality)])).
% cnf(282,plain,($false),inference(cn,[status(thm)],[281,theory(equality)])).
% cnf(283,plain,($false),282,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 46
% # ...of these trivial : 14
% # ...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 : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 74
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 5
% # 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: 66 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 22 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 58 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.002 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31912/LCL455+1.tptp
%
%------------------------------------------------------------------------------