TSTP Solution File: GEO183+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO183+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 : 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:02:47 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP3415/GEO183+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3415/GEO183+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3415/GEO183+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 3511
% 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(7, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(8, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(11, 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(15, conjecture,![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_lines(X4,line_connecting(X1,X2))))=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X2,X4)))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_lines(X4,line_connecting(X1,X2))))=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X2,X4))))),inference(assume_negation,[status(cth)],[15])).
% fof(20, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(21, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(24, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_lines(X4,line_connecting(X1,X2))))=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X2,X4))))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[20])).
% fof(41, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[21])).
% fof(44, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[43])).
% cnf(45,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(52, 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)],[11])).
% fof(53, 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)],[52])).
% cnf(54,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[53])).
% fof(64, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_lines(X4,line_connecting(X1,X2))))&(apart_point_and_line(X1,X4)|apart_point_and_line(X2,X4))),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((distinct_points(X6,X7)&convergent_lines(X8,X9))&~(distinct_lines(X8,line_connecting(X6,X7))))&(apart_point_and_line(X6,X8)|apart_point_and_line(X7,X8))),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&~(distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))))&(apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)|apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(~distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(74,negated_conjecture,(apart_point_and_line(esk1_0,X1)|distinct_lines(esk3_0,X1)|apart_point_and_line(esk2_0,esk3_0)),inference(spm,[status(thm)],[54,67,theory(equality)])).
% cnf(92,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[68,74,theory(equality)])).
% cnf(104,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[42,92,theory(equality)])).
% cnf(105,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[104,70,theory(equality)])).
% cnf(106,negated_conjecture,(apart_point_and_line(esk2_0,esk3_0)),inference(cn,[status(thm)],[105,theory(equality)])).
% cnf(108,negated_conjecture,(apart_point_and_line(esk2_0,X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[54,106,theory(equality)])).
% cnf(119,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[68,108,theory(equality)])).
% cnf(123,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[45,119,theory(equality)])).
% cnf(124,negated_conjecture,($false),inference(rw,[status(thm)],[123,70,theory(equality)])).
% cnf(125,negated_conjecture,($false),inference(cn,[status(thm)],[124,theory(equality)])).
% cnf(126,negated_conjecture,($false),125,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 51
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 48
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 41
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 0
% # Paramodulations : 39
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 14
% # ...number of literals in the above : 47
% # Clause-clause subsumption calls (NU) : 22
% # Rec. Clause-clause subsumption calls : 20
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 28 leaves, 1.75+/-1.527 terms/leaf
% # Paramod-from index: 11 leaves, 1.09+/-0.287 terms/leaf
% # Paramod-into index: 24 leaves, 1.42+/-0.640 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.006 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP3415/GEO183+1.tptp
%
%------------------------------------------------------------------------------