TSTP Solution File: GEO185+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO185+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:03:29 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP9872/GEO185+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9872/GEO185+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9872/GEO185+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 9968
% 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(5, 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(13, conjecture,![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_points(X1,intersection_point(X4,X5))))=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5)))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_points(X1,intersection_point(X4,X5))))=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5))))),inference(assume_negation,[status(cth)],[13])).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_points(X1,intersection_point(X4,X5))))=>(~(apart_point_and_line(X1,X4))&~(apart_point_and_line(X1,X5))))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(29, 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)],[5])).
% fof(30, 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)],[29])).
% fof(31, 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)],[30])).
% cnf(32,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(56, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(distinct_points(X1,intersection_point(X4,X5))))&(apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))),inference(fof_nnf,[status(thm)],[18])).
% fof(57, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((distinct_points(X6,X7)&convergent_lines(X8,X9))&~(distinct_points(X6,intersection_point(X8,X9))))&(apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&~(distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))))&(apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(esk1_0,esk4_0))),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)|apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(~distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(65,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[60,32,theory(equality)])).
% cnf(68,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)|$false),inference(rw,[status(thm)],[65,61,theory(equality)])).
% cnf(69,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(70,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[60,33,theory(equality)])).
% cnf(73,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[70,61,theory(equality)])).
% cnf(74,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(cn,[status(thm)],[73,theory(equality)])).
% cnf(80,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)),inference(sr,[status(thm)],[59,69,theory(equality)])).
% cnf(83,negated_conjecture,($false),inference(rw,[status(thm)],[74,80,theory(equality)])).
% cnf(84,negated_conjecture,($false),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(85,negated_conjecture,($false),84,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 39
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 39
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 16
% # ...of the previous two non-trivial : 16
% # Contextual simplify-reflections : 0
% # Paramodulations : 15
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 19
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 30
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 19 leaves, 2.11+/-1.944 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 18 leaves, 1.44+/-0.762 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP9872/GEO185+2.tptp
%
%------------------------------------------------------------------------------