TSTP Solution File: GEO189+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO189+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 : 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:04:46 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP31300/GEO189+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31300/GEO189+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31300/GEO189+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 31396
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(9, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(10, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(12, 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(21, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(22, axiom,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),file('/tmp/SRASS.s.p', cp2)).
% fof(26, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(36, conjecture,![X1]:![X2]:![X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&incident_point_and_line(X3,line_connecting(X1,X2)))=>incident_point_and_line(X2,line_connecting(X1,X3))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&incident_point_and_line(X3,line_connecting(X1,X2)))=>incident_point_and_line(X2,line_connecting(X1,X3)))),inference(assume_negation,[status(cth)],[36])).
% 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(43, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(47, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(48, plain,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% 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(82, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[43])).
% cnf(83,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(84, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(85, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[84])).
% cnf(86,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(90, 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)],[12])).
% fof(91, 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)],[90])).
% cnf(92,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[91])).
% fof(116, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[47])).
% cnf(117,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(variable_rename,[status(thm)],[48])).
% cnf(119,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[118])).
% fof(128, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[26])).
% fof(129, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[128])).
% cnf(130,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[129])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&incident_point_and_line(X3,line_connecting(X1,X2)))&~(incident_point_and_line(X2,line_connecting(X1,X3)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:((((distinct_points(X4,X5)&distinct_points(X4,X6))&distinct_points(X5,X6))&incident_point_and_line(X6,line_connecting(X4,X5)))&~(incident_point_and_line(X5,line_connecting(X4,X6)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((((distinct_points(esk1_0,esk2_0)&distinct_points(esk1_0,esk3_0))&distinct_points(esk2_0,esk3_0))&incident_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)))&~(incident_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~incident_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(176,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[170,70,theory(equality)])).
% cnf(197,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk3_0),X1)|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[92,176,theory(equality)])).
% cnf(228,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(line_connecting(esk1_0,esk3_0),X2)|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[86,197,theory(equality)])).
% cnf(294,negated_conjecture,(distinct_lines(X1,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[83,228,theory(equality)])).
% cnf(302,negated_conjecture,(convergent_lines(X1,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk2_0,X1)),inference(spm,[status(thm)],[130,294,theory(equality)])).
% cnf(308,negated_conjecture,(apart_point_and_line(esk2_0,parallel_through_point(line_connecting(esk1_0,esk3_0),X1))),inference(spm,[status(thm)],[117,302,theory(equality)])).
% cnf(316,negated_conjecture,($false),inference(spm,[status(thm)],[119,308,theory(equality)])).
% cnf(317,negated_conjecture,($false),316,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 83
% # ...of these trivial : 0
% # ...subsumed : 11
% # ...remaining for further processing: 72
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 118
% # ...of the previous two non-trivial : 90
% # Contextual simplify-reflections : 4
% # Paramodulations : 114
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 72
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 58
% # ...number of literals in the above : 219
% # Clause-clause subsumption calls (NU) : 79
% # Rec. Clause-clause subsumption calls : 77
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 61 leaves, 1.62+/-1.416 terms/leaf
% # Paramod-from index: 35 leaves, 1.09+/-0.280 terms/leaf
% # Paramod-into index: 57 leaves, 1.42+/-0.954 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.001 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP31300/GEO189+3.tptp
%
%------------------------------------------------------------------------------