%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO206+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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:10:02 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP10733/GEO206+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10733/GEO206+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10733/GEO206+2.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 10829
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(7, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(8, axiom,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),file('/tmp/SRASS.s.p', cp2)).
% fof(9, axiom,![X1]:![X2]:![X3]:(distinct_lines(X2,X3)=>((apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3))|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', cup1)).
% fof(16, conjecture,![X1]:![X2]:![X3]:((~(apart_point_and_line(X1,X2))&~(convergent_lines(X2,X3)))=>~(distinct_lines(X2,parallel_through_point(X3,X1)))),file('/tmp/SRASS.s.p', con)).
% fof(17, negated_conjecture,~(![X1]:![X2]:![X3]:((~(apart_point_and_line(X1,X2))&~(convergent_lines(X2,X3)))=>~(distinct_lines(X2,parallel_through_point(X3,X1))))),inference(assume_negation,[status(cth)],[16])).
% fof(20, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(21, plain,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(23, negated_conjecture,~(![X1]:![X2]:![X3]:((~(apart_point_and_line(X1,X2))&~(convergent_lines(X2,X3)))=>~(distinct_lines(X2,parallel_through_point(X3,X1))))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(40, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[20])).
% cnf(41,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(variable_rename,[status(thm)],[21])).
% cnf(43,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X2,X3))|((apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3))|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(45, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X5,X6))|((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(convergent_lines(X1,X2)|apart_point_and_line(X3,X2)|apart_point_and_line(X3,X1)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(68, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(apart_point_and_line(X1,X2))&~(convergent_lines(X2,X3)))&distinct_lines(X2,parallel_through_point(X3,X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(69, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(apart_point_and_line(X4,X5))&~(convergent_lines(X5,X6)))&distinct_lines(X5,parallel_through_point(X6,X4))),inference(variable_rename,[status(thm)],[68])).
% fof(70, negated_conjecture,((~(apart_point_and_line(esk1_0,esk2_0))&~(convergent_lines(esk2_0,esk3_0)))&distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0))),inference(skolemize,[status(esa)],[69])).
% cnf(71,negated_conjecture,(distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0))),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,negated_conjecture,(~convergent_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(73,negated_conjecture,(~apart_point_and_line(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(77,negated_conjecture,(apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))|apart_point_and_line(X1,esk2_0)|convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0))),inference(spm,[status(thm)],[46,71,theory(equality)])).
% cnf(89,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(parallel_through_point(esk3_0,esk1_0),X1)|apart_point_and_line(X2,parallel_through_point(esk3_0,esk1_0))|apart_point_and_line(X2,esk2_0)),inference(spm,[status(thm)],[33,77,theory(equality)])).
% cnf(380,negated_conjecture,(apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))|apart_point_and_line(X1,esk2_0)|convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[41,89,theory(equality)])).
% cnf(389,negated_conjecture,(apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))|apart_point_and_line(X1,esk2_0)),inference(sr,[status(thm)],[380,72,theory(equality)])).
% cnf(399,negated_conjecture,(apart_point_and_line(esk1_0,esk2_0)),inference(spm,[status(thm)],[43,389,theory(equality)])).
% cnf(400,negated_conjecture,($false),inference(sr,[status(thm)],[399,73,theory(equality)])).
% cnf(401,negated_conjecture,($false),400,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 92
% # ...of these trivial : 0
% # ...subsumed : 12
% # ...remaining for further processing: 80
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 1
% # Generated clauses : 288
% # ...of the previous two non-trivial : 265
% # Contextual simplify-reflections : 0
% # Paramodulations : 272
% # Factorizations : 16
% # Equation resolutions : 0
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 183
% # ...number of literals in the above : 888
% # Clause-clause subsumption calls (NU) : 151
% # Rec. Clause-clause subsumption calls : 103
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 45 leaves, 1.84+/-2.076 terms/leaf
% # Paramod-from index: 23 leaves, 1.22+/-0.412 terms/leaf
% # Paramod-into index: 42 leaves, 1.52+/-1.160 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.003 s
% # Total time : 0.026 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/SystemOnTPTP10733/GEO206+2.tptp
%
%------------------------------------------------------------------------------