TSTP Solution File: GEO172+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO172+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 : art07.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 04:59:34 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/SystemOnTPTP31315/GEO172+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31315/GEO172+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31315/GEO172+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 31411
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% 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(5, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(6, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(8, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(13, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(15, conjecture,![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', con)).
% fof(16, negated_conjecture,~(![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(assume_negation,[status(cth)],[15])).
% fof(18, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(19, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(20, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(24, negated_conjecture,~(![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_simplification,[status(thm)],[16,theory(equality)])).
% fof(27, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[18])).
% cnf(28,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(33, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(36, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(39, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(44, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[8])).
% fof(45, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(58, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[13])).
% fof(59, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[59])).
% fof(64, negated_conjecture,?[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)],[24])).
% fof(65, negated_conjecture,?[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)],[64])).
% fof(66, negated_conjecture,(((convergent_lines(esk1_0,esk2_0)&~(apart_point_and_line(esk3_0,esk1_0)))&~(apart_point_and_line(esk3_0,esk2_0)))&distinct_points(esk3_0,intersection_point(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(distinct_points(esk3_0,intersection_point(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(~apart_point_and_line(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,negated_conjecture,(~apart_point_and_line(esk3_0,esk1_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(72,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[34,70,theory(equality)])).
% cnf(74,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[28,72,theory(equality)])).
% cnf(77,negated_conjecture,(distinct_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[60,74,theory(equality)])).
% cnf(81,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,X2)|apart_point_and_line(X3,esk1_0)|apart_point_and_line(X3,X2)|convergent_lines(esk2_0,X2)|~distinct_points(X1,X3)),inference(spm,[status(thm)],[46,77,theory(equality)])).
% cnf(206,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(esk3_0,esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[81,67,theory(equality)])).
% cnf(208,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(sr,[status(thm)],[206,69,theory(equality)])).
% cnf(252,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)|convergent_lines(esk2_0,X1)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[37,208,theory(equality)])).
% cnf(255,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)|convergent_lines(esk2_0,X1)|$false),inference(rw,[status(thm)],[252,70,theory(equality)])).
% cnf(256,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(cn,[status(thm)],[255,theory(equality)])).
% cnf(261,negated_conjecture,(apart_point_and_line(esk3_0,esk2_0)|convergent_lines(esk2_0,esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[40,256,theory(equality)])).
% cnf(263,negated_conjecture,(apart_point_and_line(esk3_0,esk2_0)|convergent_lines(esk2_0,esk2_0)|$false),inference(rw,[status(thm)],[261,70,theory(equality)])).
% cnf(264,negated_conjecture,(apart_point_and_line(esk3_0,esk2_0)|convergent_lines(esk2_0,esk2_0)),inference(cn,[status(thm)],[263,theory(equality)])).
% cnf(265,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(sr,[status(thm)],[264,68,theory(equality)])).
% cnf(266,negated_conjecture,($false),inference(sr,[status(thm)],[265,28,theory(equality)])).
% cnf(267,negated_conjecture,($false),266,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 78
% # ...of these trivial : 0
% # ...subsumed : 17
% # ...remaining for further processing: 61
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 152
% # ...of the previous two non-trivial : 114
% # Contextual simplify-reflections : 0
% # Paramodulations : 124
% # Factorizations : 28
% # Equation resolutions : 0
% # Current number of processed clauses: 42
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 66
% # ...number of literals in the above : 293
% # Clause-clause subsumption calls (NU) : 229
% # Rec. Clause-clause subsumption calls : 161
% # 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: 33 leaves, 1.94+/-1.774 terms/leaf
% # Paramod-from index: 19 leaves, 1.26+/-0.440 terms/leaf
% # Paramod-into index: 30 leaves, 1.57+/-1.055 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.001 s
% # Total time : 0.018 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/SystemOnTPTP31315/GEO172+1.tptp
%
%------------------------------------------------------------------------------