TSTP Solution File: GEO226+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO226+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 : art03.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:17:43 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP26782/GEO226+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP26782/GEO226+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26782/GEO226+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 26878
% 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(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(6, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(7, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(19, conjecture,![X4]:![X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))=>?[X1]:(point(X1)=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5))))),file('/tmp/SRASS.s.p', con)).
% fof(20, negated_conjecture,~(![X4]:![X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))=>?[X1]:(point(X1)=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5)))))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(22, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(23, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(28, negated_conjecture,~(![X4]:![X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))=>?[X1]:(point(X1)=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5)))))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(29, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[21])).
% cnf(30,plain,(~convergent_lines(X1,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)],[2])).
% 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(43, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(44, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[43])).
% cnf(45,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[23])).
% fof(47, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[47])).
% fof(80, negated_conjecture,?[X4]:?[X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))&![X1]:(point(X1)&(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5)))),inference(fof_nnf,[status(thm)],[28])).
% fof(81, negated_conjecture,?[X6]:?[X7]:(((line(X6)&line(X7))&convergent_lines(X6,X7))&![X8]:(point(X8)&(apart_point_and_line(X8,X6)|apart_point_and_line(X8,X7)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,(((line(esk1_0)&line(esk2_0))&convergent_lines(esk1_0,esk2_0))&![X8]:(point(X8)&(apart_point_and_line(X8,esk1_0)|apart_point_and_line(X8,esk2_0)))),inference(skolemize,[status(esa)],[81])).
% fof(83, negated_conjecture,![X8]:((point(X8)&(apart_point_and_line(X8,esk1_0)|apart_point_and_line(X8,esk2_0)))&((line(esk1_0)&line(esk2_0))&convergent_lines(esk1_0,esk2_0))),inference(shift_quantors,[status(thm)],[82])).
% cnf(84,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(87,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(split_conjunct,[status(thm)],[83])).
% cnf(93,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[33,84,theory(equality)])).
% cnf(96,negated_conjecture,(apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)|~convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[48,87,theory(equality)])).
% cnf(99,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[30,93,theory(equality)])).
% cnf(114,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[45,96,theory(equality)])).
% cnf(115,negated_conjecture,($false),inference(rw,[status(thm)],[114,99,theory(equality)])).
% cnf(116,negated_conjecture,($false),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(117,negated_conjecture,($false),116,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 48
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 47
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 20
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 0
% # Paramodulations : 20
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 38
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 13
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 30 leaves, 1.67+/-1.556 terms/leaf
% # Paramod-from index: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 25 leaves, 1.32+/-0.614 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.008 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP26782/GEO226+1.tptp
%
%------------------------------------------------------------------------------