TSTP Solution File: GEO186+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO186+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 : 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:41 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP10131/GEO186+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10131/GEO186+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10131/GEO186+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 10227
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 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(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]:![X4]:![X5]:((((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(apart_point_and_line(X1,X4)))&~(apart_point_and_line(X1,X5)))=>~(distinct_points(X1,intersection_point(X4,X5)))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:((((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(apart_point_and_line(X1,X4)))&~(apart_point_and_line(X1,X5)))=>~(distinct_points(X1,intersection_point(X4,X5))))),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]:![X4]:![X5]:((((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(apart_point_and_line(X1,X4)))&~(apart_point_and_line(X1,X5)))=>~(distinct_points(X1,intersection_point(X4,X5))))),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(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]:?[X4]:?[X5]:((((distinct_points(X1,X2)&convergent_lines(X4,X5))&~(apart_point_and_line(X1,X4)))&~(apart_point_and_line(X1,X5)))&distinct_points(X1,intersection_point(X4,X5))),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:((((distinct_points(X6,X7)&convergent_lines(X8,X9))&~(apart_point_and_line(X6,X8)))&~(apart_point_and_line(X6,X9)))&distinct_points(X6,intersection_point(X8,X9))),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,((((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&~(apart_point_and_line(esk1_0,esk3_0)))&~(apart_point_and_line(esk1_0,esk4_0)))&distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(~apart_point_and_line(esk1_0,esk4_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,negated_conjecture,(~apart_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(75,negated_conjecture,(distinct_lines(esk4_0,X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[60,70,theory(equality)])).
% cnf(88,negated_conjecture,(apart_point_and_line(X1,esk4_0)|apart_point_and_line(X1,X2)|apart_point_and_line(X3,esk4_0)|apart_point_and_line(X3,X2)|convergent_lines(esk3_0,X2)|~distinct_points(X1,X3)),inference(spm,[status(thm)],[46,75,theory(equality)])).
% cnf(279,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)|apart_point_and_line(esk1_0,esk4_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)),inference(spm,[status(thm)],[88,67,theory(equality)])).
% cnf(299,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)),inference(sr,[status(thm)],[279,68,theory(equality)])).
% cnf(648,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[40,299,theory(equality)])).
% cnf(651,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)|$false),inference(rw,[status(thm)],[648,70,theory(equality)])).
% cnf(652,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(esk1_0,X1)|convergent_lines(esk3_0,X1)),inference(cn,[status(thm)],[651,theory(equality)])).
% cnf(658,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|convergent_lines(esk3_0,esk3_0)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[37,652,theory(equality)])).
% cnf(662,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|convergent_lines(esk3_0,esk3_0)|$false),inference(rw,[status(thm)],[658,70,theory(equality)])).
% cnf(663,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|convergent_lines(esk3_0,esk3_0)),inference(cn,[status(thm)],[662,theory(equality)])).
% cnf(664,negated_conjecture,(convergent_lines(esk3_0,esk3_0)),inference(sr,[status(thm)],[663,69,theory(equality)])).
% cnf(665,negated_conjecture,($false),inference(sr,[status(thm)],[664,28,theory(equality)])).
% cnf(666,negated_conjecture,($false),665,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 168
% # ...of these trivial : 0
% # ...subsumed : 71
% # ...remaining for further processing: 97
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 472
% # ...of the previous two non-trivial : 396
% # Contextual simplify-reflections : 15
% # Paramodulations : 374
% # Factorizations : 98
% # Equation resolutions : 0
% # Current number of processed clauses: 75
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 65
% # Current number of unprocessed clauses: 246
% # ...number of literals in the above : 1398
% # Clause-clause subsumption calls (NU) : 1152
% # Rec. Clause-clause subsumption calls : 703
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 42 leaves, 1.83+/-1.785 terms/leaf
% # Paramod-from index: 25 leaves, 1.64+/-1.127 terms/leaf
% # Paramod-into index: 37 leaves, 1.76+/-1.567 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.003 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP10131/GEO186+1.tptp
%
%------------------------------------------------------------------------------