TSTP Solution File: GEO209+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO209+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 : art04.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:52 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP13857/GEO209+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13857/GEO209+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13857/GEO209+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 13953
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% 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(18, 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(19, 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)],[18])).
% fof(29, 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)],[19,theory(equality)])).
% fof(37, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(38, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(46, 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(47, 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)],[46])).
% cnf(48,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)],[47])).
% fof(76, 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)],[29])).
% fof(77, 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)],[76])).
% fof(78, 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)],[77])).
% cnf(79,negated_conjecture,(distinct_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[78])).
% cnf(80,negated_conjecture,(~convergent_lines(esk4_0,esk2_0)),inference(split_conjunct,[status(thm)],[78])).
% cnf(81,negated_conjecture,(~convergent_lines(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[78])).
% cnf(82,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)),inference(split_conjunct,[status(thm)],[78])).
% cnf(83,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[78])).
% cnf(87,negated_conjecture,(apart_point_and_line(X1,esk4_0)|apart_point_and_line(X1,esk3_0)|convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[48,79,theory(equality)])).
% cnf(99,negated_conjecture,(convergent_lines(esk3_0,X1)|convergent_lines(esk4_0,X1)|apart_point_and_line(X2,esk3_0)|apart_point_and_line(X2,esk4_0)),inference(spm,[status(thm)],[39,87,theory(equality)])).
% cnf(295,negated_conjecture,(apart_point_and_line(X1,esk4_0)|apart_point_and_line(X1,esk3_0)|convergent_lines(esk4_0,esk2_0)),inference(spm,[status(thm)],[81,99,theory(equality)])).
% cnf(300,negated_conjecture,(apart_point_and_line(X1,esk4_0)|apart_point_and_line(X1,esk3_0)),inference(sr,[status(thm)],[295,80,theory(equality)])).
% cnf(301,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)),inference(spm,[status(thm)],[83,300,theory(equality)])).
% cnf(306,negated_conjecture,($false),inference(sr,[status(thm)],[301,82,theory(equality)])).
% cnf(307,negated_conjecture,($false),306,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 0
% # Generated clauses : 185
% # ...of the previous two non-trivial : 145
% # Contextual simplify-reflections : 0
% # Paramodulations : 157
% # Factorizations : 28
% # Equation resolutions : 0
% # Current number of processed clauses: 41
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 82
% # ...number of literals in the above : 360
% # Clause-clause subsumption calls (NU) : 150
% # Rec. Clause-clause subsumption calls : 99
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 37 leaves, 1.65+/-1.340 terms/leaf
% # Paramod-from index: 17 leaves, 1.24+/-0.424 terms/leaf
% # Paramod-into index: 33 leaves, 1.45+/-0.820 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.005 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/SystemOnTPTP13857/GEO209+1.tptp
%
%------------------------------------------------------------------------------