TSTP Solution File: GEO209+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO209+2 : TPTP v5.0.0. Released v3.3.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:10:58 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP6543/GEO209+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6543/GEO209+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6543/GEO209+2.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 6639
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(3, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(4, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(7, axiom,![X1]:![X2]:![X3]:(distinct_lines(X2,X3)=>((apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3))|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', cup1)).
% fof(16, conjecture,![X6]:![X7]:![X8]:![X9]:(((((apart_point_and_line(X6,X7)&~(apart_point_and_line(X6,X8)))&~(apart_point_and_line(X6,X9)))&~(convergent_lines(X8,X7)))&~(convergent_lines(X9,X7)))=>~(distinct_lines(X8,X9))),file('/tmp/SRASS.s.p', con)).
% fof(17, negated_conjecture,~(![X6]:![X7]:![X8]:![X9]:(((((apart_point_and_line(X6,X7)&~(apart_point_and_line(X6,X8)))&~(apart_point_and_line(X6,X9)))&~(convergent_lines(X8,X7)))&~(convergent_lines(X9,X7)))=>~(distinct_lines(X8,X9)))),inference(assume_negation,[status(cth)],[16])).
% fof(18, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(23, negated_conjecture,~(![X6]:![X7]:![X8]:![X9]:(((((apart_point_and_line(X6,X7)&~(apart_point_and_line(X6,X8)))&~(apart_point_and_line(X6,X9)))&~(convergent_lines(X8,X7)))&~(convergent_lines(X9,X7)))=>~(distinct_lines(X8,X9)))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(24, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[18])).
% cnf(25,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(40, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X2,X3))|((apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3))|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(41, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X5,X6))|((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[40])).
% cnf(42,plain,(convergent_lines(X1,X2)|apart_point_and_line(X3,X2)|apart_point_and_line(X3,X1)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[41])).
% fof(68, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((((apart_point_and_line(X6,X7)&~(apart_point_and_line(X6,X8)))&~(apart_point_and_line(X6,X9)))&~(convergent_lines(X8,X7)))&~(convergent_lines(X9,X7)))&distinct_lines(X8,X9)),inference(fof_nnf,[status(thm)],[23])).
% fof(69, negated_conjecture,?[X10]:?[X11]:?[X12]:?[X13]:(((((apart_point_and_line(X10,X11)&~(apart_point_and_line(X10,X12)))&~(apart_point_and_line(X10,X13)))&~(convergent_lines(X12,X11)))&~(convergent_lines(X13,X11)))&distinct_lines(X12,X13)),inference(variable_rename,[status(thm)],[68])).
% fof(70, negated_conjecture,(((((apart_point_and_line(esk1_0,esk2_0)&~(apart_point_and_line(esk1_0,esk3_0)))&~(apart_point_and_line(esk1_0,esk4_0)))&~(convergent_lines(esk3_0,esk2_0)))&~(convergent_lines(esk4_0,esk2_0)))&distinct_lines(esk3_0,esk4_0)),inference(skolemize,[status(esa)],[69])).
% cnf(71,negated_conjecture,(distinct_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,negated_conjecture,(~convergent_lines(esk4_0,esk2_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(73,negated_conjecture,(~convergent_lines(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(74,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(75,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(78,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk4_0,X1)),inference(spm,[status(thm)],[30,71,theory(equality)])).
% cnf(90,negated_conjecture,(distinct_lines(esk4_0,esk3_0)),inference(spm,[status(thm)],[25,78,theory(equality)])).
% cnf(93,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk4_0)|convergent_lines(esk4_0,esk3_0)),inference(spm,[status(thm)],[42,90,theory(equality)])).
% cnf(104,negated_conjecture,(convergent_lines(esk4_0,X1)|convergent_lines(esk3_0,X1)|apart_point_and_line(X2,esk4_0)|apart_point_and_line(X2,esk3_0)),inference(spm,[status(thm)],[33,93,theory(equality)])).
% cnf(584,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk4_0)|convergent_lines(esk4_0,esk2_0)),inference(spm,[status(thm)],[73,104,theory(equality)])).
% cnf(593,negated_conjecture,(apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk4_0)),inference(sr,[status(thm)],[584,72,theory(equality)])).
% cnf(596,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)),inference(spm,[status(thm)],[75,593,theory(equality)])).
% cnf(603,negated_conjecture,($false),inference(sr,[status(thm)],[596,74,theory(equality)])).
% cnf(604,negated_conjecture,($false),603,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 119
% # ...of these trivial : 0
% # ...subsumed : 27
% # ...remaining for further processing: 92
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 439
% # ...of the previous two non-trivial : 380
% # Contextual simplify-reflections : 6
% # Paramodulations : 403
% # Factorizations : 36
% # Equation resolutions : 0
% # Current number of processed clauses: 66
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 284
% # ...number of literals in the above : 1493
% # Clause-clause subsumption calls (NU) : 256
% # Rec. Clause-clause subsumption calls : 182
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 53 leaves, 1.79+/-1.887 terms/leaf
% # Paramod-from index: 25 leaves, 1.24+/-0.427 terms/leaf
% # Paramod-into index: 47 leaves, 1.49+/-0.965 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.005 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP6543/GEO209+2.tptp
%
%------------------------------------------------------------------------------