%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO215+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 : 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:13:00 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP24669/GEO215+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24669/GEO215+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24669/GEO215+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 24765
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(8, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(9, axiom,![X7]:![X4]:![X5]:![X6]:(distinct_lines(X4,X5)=>(((apart_point_and_line(X7,X4)|apart_point_and_line(X7,X5))|unorthogonal_lines(X4,X6))|unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', ouo1)).
% fof(17, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(18, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(23, conjecture,![X4]:![X5]:![X6]:(convergent_lines(X4,X5)=>(unorthogonal_lines(X4,X6)|unorthogonal_lines(X5,X6))),file('/tmp/SRASS.s.p', con)).
% fof(24, negated_conjecture,~(![X4]:![X5]:![X6]:(convergent_lines(X4,X5)=>(unorthogonal_lines(X4,X6)|unorthogonal_lines(X5,X6)))),inference(assume_negation,[status(cth)],[23])).
% fof(25, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(32, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(33, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(36, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[25])).
% cnf(37,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(39, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(57, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(58, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X7]:![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(((apart_point_and_line(X7,X4)|apart_point_and_line(X7,X5))|unorthogonal_lines(X4,X6))|unorthogonal_lines(X5,X6))),inference(fof_nnf,[status(thm)],[9])).
% fof(61, plain,![X8]:![X9]:![X10]:![X11]:(~(distinct_lines(X9,X10))|(((apart_point_and_line(X8,X9)|apart_point_and_line(X8,X10))|unorthogonal_lines(X9,X11))|unorthogonal_lines(X10,X11))),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(unorthogonal_lines(X1,X2)|unorthogonal_lines(X3,X2)|apart_point_and_line(X4,X1)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(80, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[32])).
% fof(81, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[80])).
% cnf(82,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[81])).
% fof(83, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[33])).
% fof(84, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[83])).
% cnf(85,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[84])).
% fof(98, negated_conjecture,?[X4]:?[X5]:?[X6]:(convergent_lines(X4,X5)&(~(unorthogonal_lines(X4,X6))&~(unorthogonal_lines(X5,X6)))),inference(fof_nnf,[status(thm)],[24])).
% fof(99, negated_conjecture,?[X7]:?[X8]:?[X9]:(convergent_lines(X7,X8)&(~(unorthogonal_lines(X7,X9))&~(unorthogonal_lines(X8,X9)))),inference(variable_rename,[status(thm)],[98])).
% fof(100, negated_conjecture,(convergent_lines(esk1_0,esk2_0)&(~(unorthogonal_lines(esk1_0,esk3_0))&~(unorthogonal_lines(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[99])).
% cnf(101,negated_conjecture,(~unorthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(102,negated_conjecture,(~unorthogonal_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(103,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[100])).
% cnf(107,negated_conjecture,(distinct_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[59,103,theory(equality)])).
% cnf(108,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[40,103,theory(equality)])).
% cnf(120,negated_conjecture,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,esk2_0)|unorthogonal_lines(X2,X3)|unorthogonal_lines(esk2_0,X3)|convergent_lines(esk1_0,X2)),inference(spm,[status(thm)],[62,107,theory(equality)])).
% cnf(134,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[37,108,theory(equality)])).
% cnf(170,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|unorthogonal_lines(esk2_0,esk3_0)|convergent_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[102,120,theory(equality)])).
% cnf(195,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|convergent_lines(esk1_0,esk1_0)),inference(sr,[status(thm)],[170,101,theory(equality)])).
% cnf(196,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(sr,[status(thm)],[195,37,theory(equality)])).
% cnf(225,negated_conjecture,(apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)|~convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[85,196,theory(equality)])).
% cnf(1196,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[82,225,theory(equality)])).
% cnf(1197,negated_conjecture,($false),inference(rw,[status(thm)],[1196,134,theory(equality)])).
% cnf(1198,negated_conjecture,($false),inference(cn,[status(thm)],[1197,theory(equality)])).
% cnf(1199,negated_conjecture,($false),1198,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 224
% # ...of these trivial : 3
% # ...subsumed : 61
% # ...remaining for further processing: 160
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 1
% # Generated clauses : 902
% # ...of the previous two non-trivial : 727
% # Contextual simplify-reflections : 11
% # Paramodulations : 794
% # Factorizations : 108
% # Equation resolutions : 0
% # Current number of processed clauses: 156
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 120
% # Current number of unprocessed clauses: 508
% # ...number of literals in the above : 2257
% # Clause-clause subsumption calls (NU) : 2302
% # Rec. Clause-clause subsumption calls : 1347
% # Unit Clause-clause subsumption calls : 415
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 84 leaves, 1.75+/-1.668 terms/leaf
% # Paramod-from index: 66 leaves, 1.45+/-1.003 terms/leaf
% # Paramod-into index: 83 leaves, 1.61+/-1.288 terms/leaf
% # -------------------------------------------------
% # User time : 0.052 s
% # System time : 0.005 s
% # Total time : 0.057 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.22 WC
% FINAL PrfWatch: 0.15 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP24669/GEO215+1.tptp
%
%------------------------------------------------------------------------------