TSTP Solution File: GEO199+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO199+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 : art06.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:07:39 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP11426/GEO199+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11426/GEO199+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11426/GEO199+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 11522
% 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(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', apart6)).
% fof(3, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>((apart_point_and_line(X3,X1)|apart_point_and_line(X3,X2))=>distinct_points(X3,intersection_point(X1,X2)))),file('/tmp/SRASS.s.p', con2)).
% fof(4, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(5, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% 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(11, 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(13, conjecture,![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X2,X1),X3))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X2,X1),X3)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))=>~(apart_point_and_line(intersection_point(X2,X1),X3)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(19, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(20,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(22, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|((~(apart_point_and_line(X3,X1))&~(apart_point_and_line(X3,X2)))|distinct_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(25, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|((~(apart_point_and_line(X6,X4))&~(apart_point_and_line(X6,X5)))|distinct_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((~(apart_point_and_line(X6,X4))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))&((~(apart_point_and_line(X6,X5))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(29, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(30, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(33,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(42, 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(43, 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)],[42])).
% cnf(44,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(48, 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)],[11])).
% fof(49, 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)],[48])).
% cnf(50,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)],[49])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&~(apart_point_and_line(intersection_point(X1,X2),X3)))&apart_point_and_line(intersection_point(X2,X1),X3)),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X4]:?[X5]:?[X6]:((((convergent_lines(X4,X5)&convergent_lines(X6,X5))&convergent_lines(X4,X6))&~(apart_point_and_line(intersection_point(X4,X5),X6)))&apart_point_and_line(intersection_point(X5,X4),X6)),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,((((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk3_0,esk2_0))&convergent_lines(esk1_0,esk3_0))&~(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)))&apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0)),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(63,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(66,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[23,63,theory(equality)])).
% cnf(68,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[33,27,theory(equality)])).
% cnf(69,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[33,28,theory(equality)])).
% cnf(70,negated_conjecture,(distinct_points(intersection_point(esk2_0,esk1_0),X1)|apart_point_and_line(X1,esk3_0)),inference(spm,[status(thm)],[44,59,theory(equality)])).
% cnf(75,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_points(X1,X4)|~convergent_lines(X2,X3)),inference(spm,[status(thm)],[50,31,theory(equality)])).
% cnf(82,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[20,66,theory(equality)])).
% cnf(185,negated_conjecture,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(intersection_point(esk2_0,esk1_0),X2)|apart_point_and_line(intersection_point(esk2_0,esk1_0),X3)|apart_point_and_line(X1,esk3_0)|~convergent_lines(X3,X2)),inference(spm,[status(thm)],[75,70,theory(equality)])).
% cnf(1844,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(spm,[status(thm)],[185,82,theory(equality)])).
% cnf(3979,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[68,1844,theory(equality)])).
% cnf(3980,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|$false),inference(rw,[status(thm)],[3979,82,theory(equality)])).
% cnf(3981,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)),inference(cn,[status(thm)],[3980,theory(equality)])).
% cnf(3993,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[69,3981,theory(equality)])).
% cnf(3994,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|$false),inference(rw,[status(thm)],[3993,82,theory(equality)])).
% cnf(3995,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(cn,[status(thm)],[3994,theory(equality)])).
% cnf(4084,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(spm,[status(thm)],[60,3995,theory(equality)])).
% cnf(4093,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[69,4084,theory(equality)])).
% cnf(4094,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[4093,63,theory(equality)])).
% cnf(4095,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[4094,theory(equality)])).
% cnf(4100,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[68,4095,theory(equality)])).
% cnf(4102,negated_conjecture,($false),inference(rw,[status(thm)],[4100,63,theory(equality)])).
% cnf(4103,negated_conjecture,($false),inference(cn,[status(thm)],[4102,theory(equality)])).
% cnf(4104,negated_conjecture,($false),4103,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 597
% # ...of these trivial : 0
% # ...subsumed : 345
% # ...remaining for further processing: 252
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 1
% # Generated clauses : 3290
% # ...of the previous two non-trivial : 2757
% # Contextual simplify-reflections : 82
% # Paramodulations : 2878
% # Factorizations : 412
% # Equation resolutions : 0
% # Current number of processed clauses: 228
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 206
% # Current number of unprocessed clauses: 2164
% # ...number of literals in the above : 13866
% # Clause-clause subsumption calls (NU) : 6664
% # Rec. Clause-clause subsumption calls : 3491
% # Unit Clause-clause subsumption calls : 59
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 77 leaves, 1.96+/-2.247 terms/leaf
% # Paramod-from index: 53 leaves, 1.58+/-1.352 terms/leaf
% # Paramod-into index: 69 leaves, 1.71+/-1.598 terms/leaf
% # -------------------------------------------------
% # User time : 0.195 s
% # System time : 0.006 s
% # Total time : 0.201 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.41 WC
% FINAL PrfWatch: 0.32 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP11426/GEO199+2.tptp
%
%------------------------------------------------------------------------------