%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO263+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 05:25:47 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP2243/GEO263+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2243/GEO263+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2243/GEO263+3.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 2348
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X2]:![X5]:(convergent_lines(X2,X5)<=>(unequally_directed_lines(X2,X5)&unequally_directed_opposite_lines(X2,X5))),file('/tmp/SRASS.s.p', a7_defns)).
% fof(6, axiom,![X6]:![X7]:(unequally_directed_opposite_lines(X6,X7)<=>unequally_directed_lines(X6,reverse_line(X7))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(25, axiom,![X2]:![X5]:~((left_convergent_lines(X2,X5)|left_convergent_lines(X2,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(32, axiom,![X2]:![X5]:((unequally_directed_lines(X2,X5)&unequally_directed_lines(X2,reverse_line(X5)))=>(left_convergent_lines(X2,X5)|left_convergent_lines(X2,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax9_basics)).
% fof(37, conjecture,![X2]:![X5]:![X8]:![X1]:![X3]:![X4]:((((between_on_line(X2,X1,X3,X4)&convergent_lines(X2,X5))&convergent_lines(X2,X8))&convergent_lines(X5,X8))=>between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X1)),intersection_point(X5,parallel_through_point(X8,X3)),intersection_point(X5,parallel_through_point(X8,X4)))),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X2]:![X5]:![X8]:![X1]:![X3]:![X4]:((((between_on_line(X2,X1,X3,X4)&convergent_lines(X2,X5))&convergent_lines(X2,X8))&convergent_lines(X5,X8))=>between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X1)),intersection_point(X5,parallel_through_point(X8,X3)),intersection_point(X5,parallel_through_point(X8,X4))))),inference(assume_negation,[status(cth)],[37])).
% fof(62, plain,![X2]:![X5]:((~(convergent_lines(X2,X5))|(unequally_directed_lines(X2,X5)&unequally_directed_opposite_lines(X2,X5)))&((~(unequally_directed_lines(X2,X5))|~(unequally_directed_opposite_lines(X2,X5)))|convergent_lines(X2,X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(63, plain,![X6]:![X7]:((~(convergent_lines(X6,X7))|(unequally_directed_lines(X6,X7)&unequally_directed_opposite_lines(X6,X7)))&((~(unequally_directed_lines(X6,X7))|~(unequally_directed_opposite_lines(X6,X7)))|convergent_lines(X6,X7))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X6]:![X7]:(((unequally_directed_lines(X6,X7)|~(convergent_lines(X6,X7)))&(unequally_directed_opposite_lines(X6,X7)|~(convergent_lines(X6,X7))))&((~(unequally_directed_lines(X6,X7))|~(unequally_directed_opposite_lines(X6,X7)))|convergent_lines(X6,X7))),inference(distribute,[status(thm)],[63])).
% cnf(66,plain,(unequally_directed_opposite_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,plain,(unequally_directed_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(68, plain,![X6]:![X7]:((~(unequally_directed_opposite_lines(X6,X7))|unequally_directed_lines(X6,reverse_line(X7)))&(~(unequally_directed_lines(X6,reverse_line(X7)))|unequally_directed_opposite_lines(X6,X7))),inference(fof_nnf,[status(thm)],[6])).
% fof(69, plain,![X8]:![X9]:((~(unequally_directed_opposite_lines(X8,X9))|unequally_directed_lines(X8,reverse_line(X9)))&(~(unequally_directed_lines(X8,reverse_line(X9)))|unequally_directed_opposite_lines(X8,X9))),inference(variable_rename,[status(thm)],[68])).
% cnf(71,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(136, plain,![X2]:![X5]:(~(left_convergent_lines(X2,X5))&~(left_convergent_lines(X2,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[25])).
% fof(137, plain,![X6]:![X7]:(~(left_convergent_lines(X6,X7))&~(left_convergent_lines(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[136])).
% cnf(139,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[137])).
% fof(165, plain,![X2]:![X5]:((~(unequally_directed_lines(X2,X5))|~(unequally_directed_lines(X2,reverse_line(X5))))|(left_convergent_lines(X2,X5)|left_convergent_lines(X2,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[32])).
% fof(166, plain,![X6]:![X7]:((~(unequally_directed_lines(X6,X7))|~(unequally_directed_lines(X6,reverse_line(X7))))|(left_convergent_lines(X6,X7)|left_convergent_lines(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(left_convergent_lines(X1,reverse_line(X2))|left_convergent_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[166])).
% fof(186, negated_conjecture,?[X2]:?[X5]:?[X8]:?[X1]:?[X3]:?[X4]:((((between_on_line(X2,X1,X3,X4)&convergent_lines(X2,X5))&convergent_lines(X2,X8))&convergent_lines(X5,X8))&~(between_on_line(X5,intersection_point(X5,parallel_through_point(X8,X1)),intersection_point(X5,parallel_through_point(X8,X3)),intersection_point(X5,parallel_through_point(X8,X4))))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:?[X14]:((((between_on_line(X9,X12,X13,X14)&convergent_lines(X9,X10))&convergent_lines(X9,X11))&convergent_lines(X10,X11))&~(between_on_line(X10,intersection_point(X10,parallel_through_point(X11,X12)),intersection_point(X10,parallel_through_point(X11,X13)),intersection_point(X10,parallel_through_point(X11,X14))))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,((((between_on_line(esk1_0,esk4_0,esk5_0,esk6_0)&convergent_lines(esk1_0,esk2_0))&convergent_lines(esk1_0,esk3_0))&convergent_lines(esk2_0,esk3_0))&~(between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),intersection_point(esk2_0,parallel_through_point(esk3_0,esk5_0)),intersection_point(esk2_0,parallel_through_point(esk3_0,esk6_0))))),inference(skolemize,[status(esa)],[187])).
% cnf(190,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(215,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[167,139,theory(equality)])).
% cnf(216,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[215,139,theory(equality)])).
% cnf(230,negated_conjecture,(unequally_directed_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[67,190,theory(equality)])).
% cnf(233,negated_conjecture,(unequally_directed_opposite_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[66,190,theory(equality)])).
% cnf(275,negated_conjecture,(unequally_directed_lines(esk2_0,reverse_line(esk3_0))),inference(spm,[status(thm)],[71,233,theory(equality)])).
% cnf(284,negated_conjecture,(~unequally_directed_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[216,275,theory(equality)])).
% cnf(285,negated_conjecture,($false),inference(rw,[status(thm)],[284,230,theory(equality)])).
% cnf(286,negated_conjecture,($false),inference(cn,[status(thm)],[285,theory(equality)])).
% cnf(287,negated_conjecture,($false),286,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 141
% # ...of these trivial : 0
% # ...subsumed : 24
% # ...remaining for further processing: 117
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 57
% # ...of the previous two non-trivial : 41
% # Contextual simplify-reflections : 2
% # Paramodulations : 54
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 23
% # ...number of literals in the above : 51
% # Clause-clause subsumption calls (NU) : 149
% # Rec. Clause-clause subsumption calls : 128
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 62 leaves, 1.47+/-1.214 terms/leaf
% # Paramod-from index: 25 leaves, 1.12+/-0.325 terms/leaf
% # Paramod-into index: 57 leaves, 1.28+/-0.669 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.006 s
% # Total time : 0.025 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/SystemOnTPTP2243/GEO263+3.tptp
%
%------------------------------------------------------------------------------