%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL451+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 : art02.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:16 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/SystemOnTPTP32259/LCL451+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32259/LCL451+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32259/LCL451+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 32355
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(cn1<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),file('/tmp/SRASS.s.p', cn1)).
% fof(6, axiom,implies_3,file('/tmp/SRASS.s.p', hilbert_implies_3)).
% fof(19, axiom,(implies_3<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))),file('/tmp/SRASS.s.p', implies_3)).
% fof(53, conjecture,cn1,file('/tmp/SRASS.s.p', luka_cn1)).
% fof(54, negated_conjecture,~(cn1),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(cn1),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(cn1)|![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))&(?[X1]:?[X2]:?[X3]:~(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))|cn1)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(cn1)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(?[X7]:?[X8]:?[X9]:~(is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))|cn1)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(cn1)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|cn1)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))|~(cn1))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|cn1)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(cn1|~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))),inference(split_conjunct,[status(thm)],[59])).
% cnf(66,plain,(implies_3),inference(split_conjunct,[status(thm)],[6])).
% fof(97, plain,((~(implies_3)|![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))&(?[X4]:?[X5]:?[X6]:~(is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))))|implies_3)),inference(fof_nnf,[status(thm)],[19])).
% fof(98, plain,((~(implies_3)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))&(?[X10]:?[X11]:?[X12]:~(is_a_theorem(implies(implies(X10,X11),implies(implies(X11,X12),implies(X10,X12)))))|implies_3)),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,((~(implies_3)|![X7]:![X8]:![X9]:is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))))&(~(is_a_theorem(implies(implies(esk10_0,esk11_0),implies(implies(esk11_0,esk12_0),implies(esk10_0,esk12_0)))))|implies_3)),inference(skolemize,[status(esa)],[98])).
% fof(100, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))|~(implies_3))&(~(is_a_theorem(implies(implies(esk10_0,esk11_0),implies(implies(esk11_0,esk12_0),implies(esk10_0,esk12_0)))))|implies_3)),inference(shift_quantors,[status(thm)],[99])).
% cnf(102,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3),inference(split_conjunct,[status(thm)],[100])).
% cnf(258,negated_conjecture,(~cn1),inference(split_conjunct,[status(thm)],[55])).
% cnf(304,plain,(~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0))))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(361,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|$false),inference(rw,[status(thm)],[102,66,theory(equality)])).
% cnf(362,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(cn,[status(thm)],[361,theory(equality)])).
% cnf(367,plain,($false),inference(rw,[status(thm)],[304,362,theory(equality)])).
% cnf(368,plain,($false),inference(cn,[status(thm)],[367,theory(equality)])).
% cnf(369,plain,($false),368,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 22
% # ...subsumed : 1
% # ...remaining for further processing: 54
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 35
% # ...of the previous two non-trivial : 33
% # Contextual simplify-reflections : 0
% # Paramodulations : 35
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 47
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 38
% # ...number of literals in the above : 57
% # Clause-clause subsumption calls (NU) : 17
% # Rec. Clause-clause subsumption calls : 17
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 105 leaves, 1.20+/-0.524 terms/leaf
% # Paramod-from index: 28 leaves, 1.18+/-0.383 terms/leaf
% # Paramod-into index: 93 leaves, 1.17+/-0.478 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.004 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP32259/LCL451+1.tptp
%
%------------------------------------------------------------------------------