TSTP Solution File: GEO188+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO188+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:04:17 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP3680/GEO188+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3680/GEO188+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3680/GEO188+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 3805
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(2, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(3, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(4, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(6, 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(9, 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]:![X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&~(apart_point_and_line(X3,line_connecting(X1,X2))))=>~(apart_point_and_line(X1,line_connecting(X3,X2)))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&~(apart_point_and_line(X3,line_connecting(X1,X2))))=>~(apart_point_and_line(X1,line_connecting(X3,X2))))),inference(assume_negation,[status(cth)],[15])).
% fof(17, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(18, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(19, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(24, negated_conjecture,~(![X1]:![X2]:![X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&~(apart_point_and_line(X3,line_connecting(X1,X2))))=>~(apart_point_and_line(X1,line_connecting(X3,X2))))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(25, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(26,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(28, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[18])).
% fof(31, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[19])).
% fof(34, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(39, 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)],[6])).
% fof(40, 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)],[39])).
% cnf(41,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)],[40])).
% fof(47, 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)],[9])).
% fof(48, 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)],[47])).
% cnf(49,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[48])).
% fof(64, negated_conjecture,?[X1]:?[X2]:?[X3]:((((distinct_points(X1,X2)&distinct_points(X1,X3))&distinct_points(X2,X3))&~(apart_point_and_line(X3,line_connecting(X1,X2))))&apart_point_and_line(X1,line_connecting(X3,X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X4]:?[X5]:?[X6]:((((distinct_points(X4,X5)&distinct_points(X4,X6))&distinct_points(X5,X6))&~(apart_point_and_line(X6,line_connecting(X4,X5))))&apart_point_and_line(X4,line_connecting(X6,X5))),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,((((distinct_points(esk1_0,esk2_0)&distinct_points(esk1_0,esk3_0))&distinct_points(esk2_0,esk3_0))&~(apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))))&apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0))),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(~apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,negated_conjecture,(distinct_points(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(71,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(72,negated_conjecture,(distinct_points(esk2_0,X1)|distinct_points(esk3_0,X1)),inference(spm,[status(thm)],[29,69,theory(equality)])).
% cnf(76,negated_conjecture,(distinct_lines(line_connecting(esk3_0,esk2_0),X1)|apart_point_and_line(esk1_0,X1)),inference(spm,[status(thm)],[49,67,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_points(esk3_0,X1)|distinct_points(X2,X1)|distinct_points(esk2_0,X2)),inference(spm,[status(thm)],[29,72,theory(equality)])).
% cnf(96,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk3_0,esk2_0))|apart_point_and_line(X1,X2)|apart_point_and_line(X3,line_connecting(esk3_0,esk2_0))|apart_point_and_line(X3,X2)|apart_point_and_line(esk1_0,X2)|~distinct_points(X1,X3)),inference(spm,[status(thm)],[41,76,theory(equality)])).
% cnf(106,negated_conjecture,(distinct_points(esk2_0,X1)|distinct_points(X1,esk3_0)),inference(spm,[status(thm)],[26,78,theory(equality)])).
% cnf(111,negated_conjecture,(distinct_points(esk2_0,X1)|distinct_points(X2,X1)|distinct_points(X2,esk3_0)),inference(spm,[status(thm)],[29,106,theory(equality)])).
% cnf(149,negated_conjecture,(distinct_points(X1,esk3_0)|distinct_points(X1,esk2_0)),inference(spm,[status(thm)],[26,111,theory(equality)])).
% cnf(159,negated_conjecture,(distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[26,149,theory(equality)])).
% cnf(283,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))|apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))|apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk3_0,X1)),inference(spm,[status(thm)],[96,159,theory(equality)])).
% cnf(1194,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))|apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)|~distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[32,283,theory(equality)])).
% cnf(1197,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))|apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)|$false),inference(rw,[status(thm)],[1194,159,theory(equality)])).
% cnf(1198,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))|apart_point_and_line(esk3_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk1_0,X1)),inference(cn,[status(thm)],[1197,theory(equality)])).
% cnf(1206,negated_conjecture,(apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk3_0,X1)|~distinct_points(esk3_0,esk2_0)),inference(spm,[status(thm)],[35,1198,theory(equality)])).
% cnf(1207,negated_conjecture,(apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk3_0,X1)|$false),inference(rw,[status(thm)],[1206,159,theory(equality)])).
% cnf(1208,negated_conjecture,(apart_point_and_line(esk1_0,X1)|apart_point_and_line(esk2_0,X1)|apart_point_and_line(esk3_0,X1)),inference(cn,[status(thm)],[1207,theory(equality)])).
% cnf(1213,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[68,1208,theory(equality)])).
% cnf(1216,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[32,1213,theory(equality)])).
% cnf(1217,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[1216,71,theory(equality)])).
% cnf(1218,negated_conjecture,(apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[1217,theory(equality)])).
% cnf(1240,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[35,1218,theory(equality)])).
% cnf(1242,negated_conjecture,($false),inference(rw,[status(thm)],[1240,71,theory(equality)])).
% cnf(1243,negated_conjecture,($false),inference(cn,[status(thm)],[1242,theory(equality)])).
% cnf(1244,negated_conjecture,($false),1243,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 343
% # ...of these trivial : 0
% # ...subsumed : 224
% # ...remaining for further processing: 119
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 845
% # ...of the previous two non-trivial : 655
% # Contextual simplify-reflections : 65
% # Paramodulations : 593
% # Factorizations : 252
% # Equation resolutions : 0
% # Current number of processed clauses: 97
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 85
% # Current number of unprocessed clauses: 335
% # ...number of literals in the above : 1882
% # Clause-clause subsumption calls (NU) : 3316
% # Rec. Clause-clause subsumption calls : 2002
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 47 leaves, 1.89+/-1.627 terms/leaf
% # Paramod-from index: 28 leaves, 1.50+/-1.018 terms/leaf
% # Paramod-into index: 42 leaves, 1.64+/-1.211 terms/leaf
% # -------------------------------------------------
% # User time : 0.082 s
% # System time : 0.003 s
% # Total time : 0.085 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.43 WC
% FINAL PrfWatch: 0.20 CPU 0.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP3680/GEO188+1.tptp
%
%------------------------------------------------------------------------------