%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO202+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 : art02.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:08:31 EST 2010
% Result : Theorem 222.89s
% Output : Solution 222.89s
% 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/SystemOnTPTP386/GEO202+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~con:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... apart1:
% CSA axiom apart1 found
% Looking for CSA axiom ... apart3:
% CSA axiom apart3 found
% Looking for CSA axiom ... apart4: CSA axiom apart4 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax6:
% CSA axiom ax6 found
% Looking for CSA axiom ... ci3:
% CSA axiom ci3 found
% Looking for CSA axiom ... ci4:
% CSA axiom ci4 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ci1:
% CSA axiom ci1 found
% Looking for CSA axiom ... ci2:
% CSA axiom ci2 found
% Looking for CSA axiom ... ceq1:
% CSA axiom ceq1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... apart2:
% CSA axiom apart2 found
% Looking for CSA axiom ... apart5:
% CSA axiom apart5 found
% Looking for CSA axiom ... ceq3:
% CSA axiom ceq3 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... cu1:
% CSA axiom cu1 found
% Looking for CSA axiom ... ceq2:
% CSA axiom ceq2 found
% ---- Selection completed
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% no
% Selected axioms are ... :ceq2:cu1:ceq3:apart5:apart2:ceq1:ci2:ci1:ci4:ci3:ax6:apart4:apart3:apart1 (14)
% Unselected axioms are ... (0)
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP386/GEO202+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP386/GEO202+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 3068
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.55 CPU 2.02 WC
% PrfWatch: 3.21 CPU 4.03 WC
% PrfWatch: 5.20 CPU 6.03 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(3, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(4, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(5, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(8, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(9, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(10, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(11, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(13, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(15, conjecture,![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))=>~(distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))=>~(distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1)))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[5,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)],[8,theory(equality)])).
% fof(20, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(21, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(22, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(24, negated_conjecture,~(![X1]:![X2]:![X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))=>~(distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(28, 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)],[2])).
% fof(29, 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)],[28])).
% cnf(30,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)],[29])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(35, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(38,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(45, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(46, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(49, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[21])).
% fof(52, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(55, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(60, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[22])).
% cnf(61,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(64, negated_conjecture,?[X1]:?[X2]:?[X3]:(((distinct_points(X1,X2)&distinct_points(X1,X3))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3)))&distinct_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1)),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X4]:?[X5]:?[X6]:(((distinct_points(X4,X5)&distinct_points(X4,X6))&convergent_lines(line_connecting(X4,X5),line_connecting(X4,X6)))&distinct_points(intersection_point(line_connecting(X4,X5),line_connecting(X4,X6)),X4)),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&distinct_points(esk1_0,esk3_0))&convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)))&distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,negated_conjecture,(distinct_points(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(74,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),X1)|convergent_lines(line_connecting(esk1_0,esk3_0),X1)),inference(spm,[status(thm)],[56,68,theory(equality)])).
% cnf(78,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),X1)|apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),X2)|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk1_0,X2)|~distinct_lines(X1,X2)),inference(spm,[status(thm)],[30,67,theory(equality)])).
% cnf(89,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk3_0),X1)|convergent_lines(X2,X1)|convergent_lines(line_connecting(esk1_0,esk2_0),X2)),inference(spm,[status(thm)],[56,74,theory(equality)])).
% cnf(304,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),X1)|convergent_lines(X1,line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[61,89,theory(equality)])).
% cnf(313,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),X1)|convergent_lines(X2,X1)|convergent_lines(X2,line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[56,304,theory(equality)])).
% cnf(329,negated_conjecture,(convergent_lines(X1,line_connecting(esk1_0,esk3_0))|convergent_lines(X1,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[61,313,theory(equality)])).
% cnf(341,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk3_0),line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[61,329,theory(equality)])).
% cnf(344,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk3_0),X1)|distinct_lines(line_connecting(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[33,341,theory(equality)])).
% cnf(351,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),X1)|distinct_lines(X2,X1)|convergent_lines(line_connecting(esk1_0,esk3_0),X2)),inference(spm,[status(thm)],[36,344,theory(equality)])).
% cnf(471,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),X1)|distinct_lines(line_connecting(esk1_0,esk3_0),X1)),inference(spm,[status(thm)],[61,351,theory(equality)])).
% cnf(976,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[38,471,theory(equality)])).
% cnf(1000,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk3_0))|apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,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)],[78,976,theory(equality)])).
% cnf(33122,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|~convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[50,1000,theory(equality)])).
% cnf(33123,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|$false),inference(rw,[status(thm)],[33122,68,theory(equality)])).
% cnf(33124,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))),inference(cn,[status(thm)],[33123,theory(equality)])).
% cnf(48617,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|~convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[53,33124,theory(equality)])).
% cnf(48618,negated_conjecture,(apart_point_and_line(
% PrfWatch: 7.19 CPU 8.04 WC
% esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[48617,68,theory(equality)])).
% cnf(48619,negated_conjecture,(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(cn,[status(thm)],[48618,theory(equality)])).
% cnf(48622,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk3_0)),inference(spm,[status(thm)],[47,48619,theory(equality)])).
% cnf(48623,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[48622,69,theory(equality)])).
% cnf(48624,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[48623,theory(equality)])).
% cnf(48627,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[47,48624,theory(equality)])).
% cnf(48643,negated_conjecture,($false),inference(rw,[status(thm)],[48627,70,theory(equality)])).
% cnf(48644,negated_conjecture,($false),inference(cn,[status(thm)],[48643,theory(equality)])).
% cnf(48645,negated_conjecture,($false),48644,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4334
% # ...of these trivial : 0
% # ...subsumed : 3474
% # ...remaining for further processing: 860
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 27
% # Backward-rewritten : 16
% # Generated clauses : 44083
% # ...of the previous two non-trivial : 42506
% # Contextual simplify-reflections : 1309
% # Paramodulations : 40355
% # Factorizations : 3728
% # Equation resolutions : 0
% # Current number of processed clauses: 799
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 781
% # Current number of unprocessed clauses: 36629
% # ...number of literals in the above : 332200
% # Clause-clause subsumption calls (NU) : 163300
% # Rec. Clause-clause subsumption calls : 50311
% # Unit Clause-clause subsumption calls : 553
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 75 leaves, 2.59+/-2.445 terms/leaf
% # Paramod-from index: 54 leaves, 2.63+/-2.102 terms/leaf
% # Paramod-into index: 69 leaves, 2.46+/-2.157 terms/leaf
% # -------------------------------------------------
% # User time : 6.395 s
% # System time : 0.073 s
% # Total time : 6.468 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.21 CPU 8.05 WC
% FINAL PrfWatch: 7.21 CPU 8.05 WC
% SZS output end Solution for /tmp/SystemOnTPTP386/GEO202+1.tptp
%
%------------------------------------------------------------------------------