TSTP Solution File: GEO226+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO226+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 : art06.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:49 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/SystemOnTPTP23023/GEO226+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP23023/GEO226+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23023/GEO226+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 23119
% 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(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', apart6)).
% fof(8, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(14, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>((apart_point_and_line(X3,X1)|apart_point_and_line(X3,X2))=>distinct_points(X3,intersection_point(X1,X2)))),file('/tmp/SRASS.s.p', con2)).
% fof(17, 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(18, 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)],[17])).
% fof(19, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(20, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(22, 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)],[18,theory(equality)])).
% fof(23, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[19])).
% cnf(24,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(43, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[20])).
% cnf(44,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(59, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|((~(apart_point_and_line(X3,X1))&~(apart_point_and_line(X3,X2)))|distinct_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(60, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|((~(apart_point_and_line(X6,X4))&~(apart_point_and_line(X6,X5)))|distinct_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[59])).
% fof(61, plain,![X4]:![X5]:![X6]:(((~(apart_point_and_line(X6,X4))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))&((~(apart_point_and_line(X6,X5))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))),inference(distribute,[status(thm)],[60])).
% cnf(62,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(72, 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)],[22])).
% fof(73, 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)],[72])).
% fof(74, 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)],[73])).
% fof(75, 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)],[74])).
% cnf(76,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[75])).
% cnf(79,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(split_conjunct,[status(thm)],[75])).
% cnf(86,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[27,76,theory(equality)])).
% cnf(89,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[44,62,theory(equality)])).
% cnf(90,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[44,63,theory(equality)])).
% cnf(95,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[24,86,theory(equality)])).
% cnf(100,negated_conjecture,(apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)|~convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[89,79,theory(equality)])).
% cnf(223,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[90,100,theory(equality)])).
% cnf(224,negated_conjecture,($false),inference(rw,[status(thm)],[223,95,theory(equality)])).
% cnf(225,negated_conjecture,($false),inference(cn,[status(thm)],[224,theory(equality)])).
% cnf(226,negated_conjecture,($false),225,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 1
% # ...subsumed : 13
% # ...remaining for further processing: 63
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 113
% # ...of the previous two non-trivial : 90
% # Contextual simplify-reflections : 0
% # Paramodulations : 93
% # Factorizations : 20
% # Equation resolutions : 0
% # Current number of processed clauses: 40
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 42
% # ...number of literals in the above : 171
% # Clause-clause subsumption calls (NU) : 144
% # Rec. Clause-clause subsumption calls : 102
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 35 leaves, 1.89+/-1.817 terms/leaf
% # Paramod-from index: 22 leaves, 1.09+/-0.287 terms/leaf
% # Paramod-into index: 31 leaves, 1.58+/-1.009 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.003 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP23023/GEO226+2.tptp
%
%------------------------------------------------------------------------------