%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO261+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 : 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 05:30:04 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP21959/GEO261+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21959/GEO261+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21959/GEO261+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 22091
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X5]:(convergent_lines(X1,X5)<=>(unequally_directed_lines(X1,X5)&unequally_directed_opposite_lines(X1,X5))),file('/tmp/SRASS.s.p', a7_defns)).
% fof(5, axiom,![X7]:![X8]:(unequally_directed_opposite_lines(X7,X8)<=>unequally_directed_lines(X7,reverse_line(X8))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(23, axiom,![X1]:![X5]:((unequally_directed_lines(X1,X5)&unequally_directed_lines(X1,reverse_line(X5)))=>(left_convergent_lines(X1,X5)|left_convergent_lines(X1,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax9_basics)).
% fof(30, axiom,![X1]:![X5]:~((left_convergent_lines(X1,X5)|left_convergent_lines(X1,reverse_line(X5)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(37, conjecture,![X1]:![X5]:![X2]:![X3]:![X4]:(((between_on_line(X1,X2,X3,X4)&convergent_lines(X1,X5))&incident_point_and_line(X3,X5))=>divides_points(X5,X2,X4)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X5]:![X2]:![X3]:![X4]:(((between_on_line(X1,X2,X3,X4)&convergent_lines(X1,X5))&incident_point_and_line(X3,X5))=>divides_points(X5,X2,X4))),inference(assume_negation,[status(cth)],[37])).
% fof(62, plain,![X1]:![X5]:((~(convergent_lines(X1,X5))|(unequally_directed_lines(X1,X5)&unequally_directed_opposite_lines(X1,X5)))&((~(unequally_directed_lines(X1,X5))|~(unequally_directed_opposite_lines(X1,X5)))|convergent_lines(X1,X5))),inference(fof_nnf,[status(thm)],[4])).
% 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,![X7]:![X8]:((~(unequally_directed_opposite_lines(X7,X8))|unequally_directed_lines(X7,reverse_line(X8)))&(~(unequally_directed_lines(X7,reverse_line(X8)))|unequally_directed_opposite_lines(X7,X8))),inference(fof_nnf,[status(thm)],[5])).
% fof(69, plain,![X9]:![X10]:((~(unequally_directed_opposite_lines(X9,X10))|unequally_directed_lines(X9,reverse_line(X10)))&(~(unequally_directed_lines(X9,reverse_line(X10)))|unequally_directed_opposite_lines(X9,X10))),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(141, plain,![X1]:![X5]:((~(unequally_directed_lines(X1,X5))|~(unequally_directed_lines(X1,reverse_line(X5))))|(left_convergent_lines(X1,X5)|left_convergent_lines(X1,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[23])).
% fof(142, 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)],[141])).
% cnf(143,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)],[142])).
% fof(162, plain,![X1]:![X5]:(~(left_convergent_lines(X1,X5))&~(left_convergent_lines(X1,reverse_line(X5)))),inference(fof_nnf,[status(thm)],[30])).
% fof(163, plain,![X6]:![X7]:(~(left_convergent_lines(X6,X7))&~(left_convergent_lines(X6,reverse_line(X7)))),inference(variable_rename,[status(thm)],[162])).
% cnf(165,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[163])).
% fof(186, negated_conjecture,?[X1]:?[X5]:?[X2]:?[X3]:?[X4]:(((between_on_line(X1,X2,X3,X4)&convergent_lines(X1,X5))&incident_point_and_line(X3,X5))&~(divides_points(X5,X2,X4))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:?[X10]:(((between_on_line(X6,X8,X9,X10)&convergent_lines(X6,X7))&incident_point_and_line(X9,X7))&~(divides_points(X7,X8,X10))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(((between_on_line(esk1_0,esk3_0,esk4_0,esk5_0)&convergent_lines(esk1_0,esk2_0))&incident_point_and_line(esk4_0,esk2_0))&~(divides_points(esk2_0,esk3_0,esk5_0))),inference(skolemize,[status(esa)],[187])).
% cnf(191,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(213,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[143,165,theory(equality)])).
% cnf(214,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[213,165,theory(equality)])).
% cnf(232,negated_conjecture,(unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,191,theory(equality)])).
% cnf(233,negated_conjecture,(unequally_directed_opposite_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[66,191,theory(equality)])).
% cnf(263,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[71,233,theory(equality)])).
% cnf(273,negated_conjecture,(~unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[214,263,theory(equality)])).
% cnf(274,negated_conjecture,($false),inference(rw,[status(thm)],[273,232,theory(equality)])).
% cnf(275,negated_conjecture,($false),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(276,negated_conjecture,($false),275,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 131
% # ...of these trivial : 0
% # ...subsumed : 23
% # ...remaining for further processing: 108
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 44
% # ...of the previous two non-trivial : 28
% # Contextual simplify-reflections : 5
% # Paramodulations : 41
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 54
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 42
% # Clause-clause subsumption calls (NU) : 154
% # Rec. Clause-clause subsumption calls : 133
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 47 leaves, 1.62+/-1.361 terms/leaf
% # Paramod-from index: 19 leaves, 1.16+/-0.365 terms/leaf
% # Paramod-into index: 42 leaves, 1.38+/-0.754 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.003 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP21959/GEO261+3.tptp
%
%------------------------------------------------------------------------------