%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL465+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:32:29 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/SystemOnTPTP15721/LCL465+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15721/LCL465+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15721/LCL465+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 15853
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 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,(implies_3<=>![X1]:![X2]:![X3]:is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),file('/tmp/SRASS.s.p', implies_3)).
% fof(3, axiom,cn1,file('/tmp/SRASS.s.p', luka_cn1)).
% fof(13, axiom,(cn1<=>![X4]:![X5]:![X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))),file('/tmp/SRASS.s.p', cn1)).
% fof(43, conjecture,implies_3,file('/tmp/SRASS.s.p', hilbert_implies_3)).
% fof(44, negated_conjecture,~(implies_3),inference(assume_negation,[status(cth)],[43])).
% fof(45, negated_conjecture,~(implies_3),inference(fof_simplification,[status(thm)],[44,theory(equality)])).
% fof(46, plain,((~(implies_3)|![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)))))|implies_3)),inference(fof_nnf,[status(thm)],[1])).
% fof(47, plain,((~(implies_3)|![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)))))|implies_3)),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,((~(implies_3)|![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)))))|implies_3)),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:((is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))|~(implies_3))&(~(is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))|implies_3)),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(implies_3|~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)],[49])).
% cnf(53,plain,(cn1),inference(split_conjunct,[status(thm)],[3])).
% fof(81, plain,((~(cn1)|![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)))))|cn1)),inference(fof_nnf,[status(thm)],[13])).
% fof(82, plain,((~(cn1)|![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)))))|cn1)),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,((~(cn1)|![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)))))|cn1)),inference(skolemize,[status(esa)],[82])).
% fof(84, plain,![X7]:![X8]:![X9]:((is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))|~(cn1))&(~(is_a_theorem(implies(implies(esk10_0,esk11_0),implies(implies(esk11_0,esk12_0),implies(esk10_0,esk12_0)))))|cn1)),inference(shift_quantors,[status(thm)],[83])).
% cnf(86,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1),inference(split_conjunct,[status(thm)],[84])).
% cnf(238,negated_conjecture,(~implies_3),inference(split_conjunct,[status(thm)],[45])).
% cnf(263,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)],[50,238,theory(equality)])).
% cnf(279,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|$false),inference(rw,[status(thm)],[86,53,theory(equality)])).
% cnf(280,plain,(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))),inference(cn,[status(thm)],[279,theory(equality)])).
% cnf(285,plain,($false),inference(rw,[status(thm)],[263,280,theory(equality)])).
% cnf(286,plain,($false),inference(cn,[status(thm)],[285,theory(equality)])).
% cnf(287,plain,($false),286,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 67
% # ...of these trivial : 10
% # ...subsumed : 1
% # ...remaining for further processing: 56
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 13
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 0
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 52
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 75
% # Rec. Clause-clause subsumption calls : 75
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 181 leaves, 1.14+/-0.567 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 152 leaves, 1.07+/-0.424 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP15721/LCL465+1.tptp
%
%------------------------------------------------------------------------------