TSTP Solution File: GEO195+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO195+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:06:31 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP9438/GEO195+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9438/GEO195+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9438/GEO195+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 9534
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(19,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, 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(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(26,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(29, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(32,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(41, 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(42, 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)],[41])).
% cnf(43,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, 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(48, 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)],[47])).
% cnf(49,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)],[48])).
% fof(55, 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)],[14])).
% fof(56, 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)],[55])).
% fof(57, 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)],[56])).
% cnf(58,negated_conjecture,(~apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(62,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(65,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[22,62,theory(equality)])).
% cnf(67,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[32,26,theory(equality)])).
% cnf(68,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[32,27,theory(equality)])).
% cnf(69,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(X1,esk3_0)),inference(spm,[status(thm)],[43,59,theory(equality)])).
% cnf(74,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)],[49,30,theory(equality)])).
% cnf(81,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[19,65,theory(equality)])).
% cnf(184,negated_conjecture,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X3)|apart_point_and_line(X1,esk3_0)|~convergent_lines(X3,X2)),inference(spm,[status(thm)],[74,69,theory(equality)])).
% cnf(1847,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_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)],[184,81,theory(equality)])).
% cnf(4614,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_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(esk1_0,esk2_0)),inference(spm,[status(thm)],[68,1847,theory(equality)])).
% cnf(4615,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_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)],[4614,62,theory(equality)])).
% cnf(4616,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_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)],[4615,theory(equality)])).
% cnf(4627,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(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,4616,theory(equality)])).
% cnf(4628,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)],[4627,62,theory(equality)])).
% cnf(4629,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)],[4628,theory(equality)])).
% cnf(4692,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)|apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)),inference(spm,[status(thm)],[58,4629,theory(equality)])).
% cnf(4701,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[67,4692,theory(equality)])).
% cnf(4702,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)|$false),inference(rw,[status(thm)],[4701,81,theory(equality)])).
% cnf(4703,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)),inference(cn,[status(thm)],[4702,theory(equality)])).
% cnf(4708,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[68,4703,theory(equality)])).
% cnf(4710,negated_conjecture,($false),inference(rw,[status(thm)],[4708,81,theory(equality)])).
% cnf(4711,negated_conjecture,($false),inference(cn,[status(thm)],[4710,theory(equality)])).
% cnf(4712,negated_conjecture,($false),4711,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 670
% # ...of these trivial : 1
% # ...subsumed : 397
% # ...remaining for further processing: 272
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 2
% # Generated clauses : 3796
% # ...of the previous two non-trivial : 3226
% # Contextual simplify-reflections : 102
% # Paramodulations : 3312
% # Factorizations : 484
% # Equation resolutions : 0
% # Current number of processed clauses: 244
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 222
% # Current number of unprocessed clauses: 2540
% # ...number of literals in the above : 16498
% # Clause-clause subsumption calls (NU) : 8367
% # Rec. Clause-clause subsumption calls : 4167
% # Unit Clause-clause subsumption calls : 58
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 78 leaves, 2.03+/-2.342 terms/leaf
% # Paramod-from index: 54 leaves, 1.69+/-1.585 terms/leaf
% # Paramod-into index: 70 leaves, 1.79+/-1.764 terms/leaf
% # -------------------------------------------------
% # User time : 0.243 s
% # System time : 0.007 s
% # Total time : 0.250 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.47 WC
% FINAL PrfWatch: 0.38 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP9438/GEO195+2.tptp
%
%------------------------------------------------------------------------------