TSTP Solution File: GEO182+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO182+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 : art09.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:02:41 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP5507/GEO182+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5507/GEO182+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5507/GEO182+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 5603
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(8, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(10, 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(12, axiom,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),file('/tmp/SRASS.s.p', cp2)).
% fof(23, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(25, 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)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>apart_point_and_line(X3,line_connecting(X2,X1)))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(apart_point_and_line(X3,line_connecting(X1,X2))=>apart_point_and_line(X3,line_connecting(X2,X1))))),inference(assume_negation,[status(cth)],[36])).
% fof(41, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(43, plain,![X1]:![X2]:~(apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(49, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(74, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[41])).
% cnf(75,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(76, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(77, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(82, 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)],[10])).
% fof(83, 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)],[82])).
% cnf(84,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[83])).
% fof(89, plain,![X3]:![X4]:~(apart_point_and_line(X3,parallel_through_point(X4,X3))),inference(variable_rename,[status(thm)],[43])).
% cnf(90,plain,(~apart_point_and_line(X1,parallel_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[89])).
% fof(120, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[49])).
% cnf(121,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(125, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[25])).
% fof(126, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[125])).
% cnf(127,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:(distinct_points(X1,X2)&(apart_point_and_line(X3,line_connecting(X1,X2))&~(apart_point_and_line(X3,line_connecting(X2,X1))))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:(distinct_points(X4,X5)&(apart_point_and_line(X6,line_connecting(X4,X5))&~(apart_point_and_line(X6,line_connecting(X5,X4))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(distinct_points(esk1_0,esk2_0)&(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))&~(apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0))))),inference(skolemize,[status(esa)],[168])).
% cnf(171,negated_conjecture,(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(181,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)),inference(spm,[status(thm)],[84,171,theory(equality)])).
% cnf(252,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(line_connecting(esk1_0,esk2_0),X2)|apart_point_and_line(esk3_0,X1)),inference(spm,[status(thm)],[78,181,theory(equality)])).
% cnf(2204,negated_conjecture,(distinct_lines(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk3_0,X1)),inference(spm,[status(thm)],[75,252,theory(equality)])).
% cnf(2212,negated_conjecture,(convergent_lines(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk3_0,X1)),inference(spm,[status(thm)],[127,2204,theory(equality)])).
% cnf(2223,negated_conjecture,(apart_point_and_line(esk3_0,parallel_through_point(line_connecting(esk1_0,esk2_0),X1))),inference(spm,[status(thm)],[121,2212,theory(equality)])).
% cnf(2231,negated_conjecture,($false),inference(spm,[status(thm)],[90,2223,theory(equality)])).
% cnf(2232,negated_conjecture,($false),2231,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 312
% # ...of these trivial : 2
% # ...subsumed : 132
% # ...remaining for further processing: 178
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 1821
% # ...of the previous two non-trivial : 1613
% # Contextual simplify-reflections : 22
% # Paramodulations : 1689
% # Factorizations : 132
% # Equation resolutions : 0
% # Current number of processed clauses: 175
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 1319
% # ...number of literals in the above : 6472
% # Clause-clause subsumption calls (NU) : 1864
% # Rec. Clause-clause subsumption calls : 1364
% # Unit Clause-clause subsumption calls : 63
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 88 leaves, 2.38+/-2.599 terms/leaf
% # Paramod-from index: 57 leaves, 1.86+/-1.638 terms/leaf
% # Paramod-into index: 82 leaves, 2.16+/-2.155 terms/leaf
% # -------------------------------------------------
% # User time : 0.089 s
% # System time : 0.005 s
% # Total time : 0.094 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.29 WC
% FINAL PrfWatch: 0.20 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP5507/GEO182+3.tptp
%
%------------------------------------------------------------------------------