TSTP Solution File: GEO199+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO199+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:45 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/SystemOnTPTP4243/GEO199+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4243/GEO199+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4243/GEO199+3.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 4339
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 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', ax6)).
% fof(5, axiom,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(8, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(14, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(25, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(30, axiom,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),file('/tmp/SRASS.s.p', cp2)).
% fof(36, conjecture,![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&incident_point_and_line(intersection_point(X1,X2),X3))=>incident_point_and_line(intersection_point(X2,X1),X3)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&incident_point_and_line(intersection_point(X1,X2),X3))=>incident_point_and_line(intersection_point(X2,X1),X3))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(45, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(52, plain,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(fof_simplification,[status(thm)],[30,theory(equality)])).
% fof(57, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[38])).
% cnf(58,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(60, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(68, plain,![X1]:![X2]:((~(incident_point_and_line(X1,X2))|~(apart_point_and_line(X1,X2)))&(apart_point_and_line(X1,X2)|incident_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(69, plain,![X3]:![X4]:((~(incident_point_and_line(X3,X4))|~(apart_point_and_line(X3,X4)))&(apart_point_and_line(X3,X4)|incident_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(incident_point_and_line(X1,X2)|apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[69])).
% fof(78, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(79, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(103, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[45])).
% cnf(104,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[103])).
% fof(134, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),inference(fof_nnf,[status(thm)],[25])).
% fof(135, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_lines(X5,X6)|apart_point_and_line(X4,X6))),inference(variable_rename,[status(thm)],[134])).
% cnf(136,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[135])).
% fof(150, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(variable_rename,[status(thm)],[52])).
% cnf(151,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[150])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:((((convergent_lines(X1,X2)&convergent_lines(X3,X2))&convergent_lines(X1,X3))&incident_point_and_line(intersection_point(X1,X2),X3))&~(incident_point_and_line(intersection_point(X2,X1),X3))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:((((convergent_lines(X4,X5)&convergent_lines(X6,X5))&convergent_lines(X4,X6))&incident_point_and_line(intersection_point(X4,X5),X6))&~(incident_point_and_line(intersection_point(X5,X4),X6))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk3_0,esk2_0))&convergent_lines(esk1_0,esk3_0))&incident_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0))&~(incident_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~incident_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(176,negated_conjecture,(apart_point_and_line(intersection_point(esk2_0,esk1_0),esk3_0)),inference(spm,[status(thm)],[170,70,theory(equality)])).
% cnf(203,negated_conjecture,(distinct_lines(esk3_0,X1)|apart_point_and_line(intersection_point(esk2_0,esk1_0),X1)),inference(spm,[status(thm)],[136,176,theory(equality)])).
% cnf(289,negated_conjecture,(distinct_lines(esk3_0,parallel_through_point(X1,intersection_point(esk2_0,esk1_0)))),inference(spm,[status(thm)],[151,203,theory(equality)])).
% cnf(321,negated_conjecture,(convergent_lines(esk3_0,parallel_through_point(X1,intersection_point(esk2_0,esk1_0)))),inference(spm,[status(thm)],[80,289,theory(equality)])).
% cnf(340,negated_conjecture,(convergent_lines(parallel_through_point(X1,intersection_point(esk2_0,esk1_0)),X2)|convergent_lines(esk3_0,X2)),inference(spm,[status(thm)],[61,321,theory(equality)])).
% cnf(409,negated_conjecture,(convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[104,340,theory(equality)])).
% cnf(411,negated_conjecture,($false),inference(spm,[status(thm)],[58,409,theory(equality)])).
% cnf(423,negated_conjecture,($false),411,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 112
% # ...of these trivial : 0
% # ...subsumed : 21
% # ...remaining for further processing: 91
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 8
% # Generated clauses : 215
% # ...of the previous two non-trivial : 183
% # Contextual simplify-reflections : 4
% # Paramodulations : 213
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 102
% # ...number of literals in the above : 351
% # Clause-clause subsumption calls (NU) : 99
% # Rec. Clause-clause subsumption calls : 99
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 72 leaves, 1.49+/-1.394 terms/leaf
% # Paramod-from index: 41 leaves, 1.07+/-0.341 terms/leaf
% # Paramod-into index: 66 leaves, 1.32+/-0.873 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.005 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.23 WC
% FINAL PrfWatch: 0.14 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP4243/GEO199+3.tptp
%
%------------------------------------------------------------------------------