TSTP Solution File: GEO193+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO193+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:05:47 EST 2010
% Result : Theorem 1.44s
% Output : Solution 1.44s
% 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/SystemOnTPTP22078/GEO193+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22078/GEO193+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22078/GEO193+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 22174
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 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(3, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(4, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(9, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(10, 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(12, 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(15, 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(X3,X2),X1))),file('/tmp/SRASS.s.p', con)).
% fof(16, 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(X3,X2),X1)))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(19, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(24, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(25,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(29, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(30, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(33, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(45, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(46, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, 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)],[10])).
% fof(49, 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)],[48])).
% cnf(50,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(54, 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)],[12])).
% fof(55, 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)],[54])).
% cnf(56,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)],[55])).
% fof(63, 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(X3,X2),X1)))),inference(fof_nnf,[status(thm)],[16])).
% fof(64, 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(X6,X5),X4)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, 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(esk3_0,esk2_0),esk1_0)))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(69,negated_conjecture,(convergent_lines(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(70,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(76,negated_conjecture,(distinct_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[47,70,theory(equality)])).
% cnf(77,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(X1,esk3_0)),inference(spm,[status(thm)],[50,67,theory(equality)])).
% cnf(111,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,X2)|apart_point_and_line(X3,esk2_0)|apart_point_and_line(X3,X2)|convergent_lines(esk1_0,X2)|~distinct_points(X1,X3)),inference(spm,[status(thm)],[56,76,theory(equality)])).
% cnf(560,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(X1,X2)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)|convergent_lines(esk1_0,X2)|apart_point_and_line(X1,esk3_0)),inference(spm,[status(thm)],[111,77,theory(equality)])).
% cnf(4093,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|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,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[31,560,theory(equality)])).
% cnf(4113,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|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,esk1_0)|$false),inference(rw,[status(thm)],[4093,70,theory(equality)])).
% cnf(4114,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|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,esk1_0)),inference(cn,[status(thm)],[4113,theory(equality)])).
% cnf(4115,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(sr,[status(thm)],[4114,25,theory(equality)])).
% cnf(4134,negated_conjecture,(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)],[34,4115,theory(equality)])).
% cnf(4135,negated_conjecture,(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)],[4134,70,theory(equality)])).
% cnf(4136,negated_conjecture,(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)],[4135,theory(equality)])).
% cnf(4158,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,X1),esk2_0)|apart_point_and_line(intersection_point(esk3_0,X1),esk1_0)|~convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[31,4136,theory(equality)])).
% cnf(4398,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[66,4158,theory(equality)])).
% cnf(4401,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[4398,69,theory(equality)])).
% cnf(4402,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[4401,theory(equality)])).
% cnf(4407,negated_conjecture,(~convergent_lines(esk3_0,esk2_0)),inference(spm,[status(thm)],[34,4402,theory(equality)])).
% cnf(4408,negated_conjecture,($false),inference(rw,[status(thm)],[4407,69,theory(equality)])).
% cnf(4409,negated_conjecture,($false),inference(cn,[status(thm)],[4408,theory(equality)])).
% cnf(4410,negated_conjecture,($false),4409,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1339
% # ...of these trivial : 0
% # ...subsumed : 940
% # ...remaining for further processing: 399
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 14
% # Backward-rewritten : 0
% # Generated clauses : 3411
% # ...of the previous two non-trivial : 2924
% # Contextual simplify-reflections : 291
% # Paramodulations : 2601
% # Factorizations : 810
% # Equation resolutions : 0
% # Current number of processed clauses: 366
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 346
% # Current number of unprocessed clauses: 1565
% # ...number of literals in the above : 8787
% # Clause-clause subsumption calls (NU) : 25368
% # Rec. Clause-clause subsumption calls : 10395
% # Unit Clause-clause subsumption calls : 111
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 65 leaves, 1.92+/-1.884 terms/leaf
% # Paramod-from index: 45 leaves, 1.62+/-1.101 terms/leaf
% # Paramod-into index: 61 leaves, 1.67+/-1.457 terms/leaf
% # -------------------------------------------------
% # User time : 0.509 s
% # System time : 0.005 s
% # Total time : 0.514 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.64 CPU 0.72 WC
% FINAL PrfWatch: 0.64 CPU 0.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP22078/GEO193+1.tptp
%
%------------------------------------------------------------------------------