%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO204+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 05:13:56 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP11175/GEO204+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11175/GEO204+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11175/GEO204+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 11307
% 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]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(5, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(6, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(7, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(9, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(15, conjecture,![X1]:![X2]:![X3]:((distinct_points(X1,X2)&~(distinct_points(X2,X3)))=>(distinct_points(X1,X3)&~(distinct_lines(line_connecting(X1,X2),line_connecting(X1,X3))))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:((distinct_points(X1,X2)&~(distinct_points(X2,X3)))=>(distinct_points(X1,X3)&~(distinct_lines(line_connecting(X1,X2),line_connecting(X1,X3)))))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(19, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(20, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(24, negated_conjecture,~(![X1]:![X2]:![X3]:((distinct_points(X1,X2)&~(distinct_points(X2,X3)))=>(distinct_points(X1,X3)&~(distinct_lines(line_connecting(X1,X2),line_connecting(X1,X3)))))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(25, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(26,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(30, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(35, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(36, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[20])).
% fof(39, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[7])).
% fof(42, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(48, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(64, negated_conjecture,?[X1]:?[X2]:?[X3]:((distinct_points(X1,X2)&~(distinct_points(X2,X3)))&(~(distinct_points(X1,X3))|distinct_lines(line_connecting(X1,X2),line_connecting(X1,X3)))),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X4]:?[X5]:?[X6]:((distinct_points(X4,X5)&~(distinct_points(X5,X6)))&(~(distinct_points(X4,X6))|distinct_lines(line_connecting(X4,X5),line_connecting(X4,X6)))),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,((distinct_points(esk1_0,esk2_0)&~(distinct_points(esk2_0,esk3_0)))&(~(distinct_points(esk1_0,esk3_0))|distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)))),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))|~distinct_points(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(~distinct_points(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[31,69,theory(equality)])).
% cnf(75,negated_conjecture,(distinct_points(esk1_0,esk3_0)),inference(spm,[status(thm)],[68,70,theory(equality)])).
% cnf(83,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))|$false),inference(rw,[status(thm)],[67,75,theory(equality)])).
% cnf(84,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(89,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))|~distinct_points(X1,X2)),inference(spm,[status(thm)],[43,84,theory(equality)])).
% cnf(151,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[89,75,theory(equality)])).
% cnf(825,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk3_0)),inference(spm,[status(thm)],[40,151,theory(equality)])).
% cnf(826,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[825,75,theory(equality)])).
% cnf(827,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[826,theory(equality)])).
% cnf(2308,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|distinct_points(esk3_0,X1)|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[49,827,theory(equality)])).
% cnf(3520,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|distinct_points(esk3_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[40,2308,theory(equality)])).
% cnf(3524,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|distinct_points(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[3520,69,theory(equality)])).
% cnf(3525,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|distinct_points(esk3_0,esk2_0)),inference(cn,[status(thm)],[3524,theory(equality)])).
% cnf(3566,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|distinct_points(esk3_0,esk2_0)|~distinct_points(esk1_0,esk3_0)),inference(spm,[status(thm)],[37,3525,theory(equality)])).
% cnf(3567,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|distinct_points(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[3566,75,theory(equality)])).
% cnf(3568,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|distinct_points(esk3_0,esk2_0)),inference(cn,[status(thm)],[3567,theory(equality)])).
% cnf(3571,negated_conjecture,(distinct_points(esk3_0,esk2_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[37,3568,theory(equality)])).
% cnf(3572,negated_conjecture,(distinct_points(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[3571,69,theory(equality)])).
% cnf(3573,negated_conjecture,(distinct_points(esk3_0,esk2_0)),inference(cn,[status(thm)],[3572,theory(equality)])).
% cnf(3579,negated_conjecture,(distinct_points(esk3_0,X1)|distinct_points(esk2_0,X1)),inference(spm,[status(thm)],[31,3573,theory(equality)])).
% cnf(3581,negated_conjecture,(distinct_points(esk2_0,esk3_0)),inference(spm,[status(thm)],[26,3579,theory(equality)])).
% cnf(3588,negated_conjecture,($false),inference(sr,[status(thm)],[3581,68,theory(equality)])).
% cnf(3589,negated_conjecture,($false),3588,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 715
% # ...of these trivial : 0
% # ...subsumed : 547
% # ...remaining for further processing: 168
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 3
% # Generated clauses : 2814
% # ...of the previous two non-trivial : 2519
% # Contextual simplify-reflections : 171
% # Paramodulations : 2214
% # Factorizations : 600
% # Equation resolutions : 0
% # Current number of processed clauses: 145
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 134
% # Current number of unprocessed clauses: 1821
% # ...number of literals in the above : 13910
% # Clause-clause subsumption calls (NU) : 11954
% # Rec. Clause-clause subsumption calls : 5692
% # Unit Clause-clause subsumption calls : 57
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 43 leaves, 2.28+/-2.255 terms/leaf
% # Paramod-from index: 26 leaves, 2.23+/-2.100 terms/leaf
% # Paramod-into index: 37 leaves, 2.11+/-2.153 terms/leaf
% # -------------------------------------------------
% # User time : 0.207 s
% # System time : 0.007 s
% # Total time : 0.214 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.35 CPU 0.41 WC
% FINAL PrfWatch: 0.35 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP11175/GEO204+1.tptp
%
%------------------------------------------------------------------------------