TSTP Solution File: GEO203+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO203+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:08:55 EST 2010
% Result : Theorem 2.59s
% Output : Solution 2.59s
% 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/SystemOnTPTP23892/GEO203+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23892/GEO203+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23892/GEO203+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 23988
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(10, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(11, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci2)).
% fof(12, 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(15, conjecture,![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>~(distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1))),file('/tmp/SRASS.s.p', con)).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>~(distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1)))),inference(assume_negation,[status(cth)],[15])).
% fof(20, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(22, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(23, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(24, negated_conjecture,~(![X1]:![X2]:![X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))=>~(distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(43, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[20])).
% 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(49, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[22])).
% fof(50, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X2,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(53, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X4,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, 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)],[12])).
% fof(56, 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)],[55])).
% cnf(57,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)],[56])).
% fof(64, negated_conjecture,?[X1]:?[X2]:?[X3]:(((convergent_lines(X1,X2)&convergent_lines(X1,X3))&distinct_points(intersection_point(X1,X2),intersection_point(X1,X3)))&distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1)),inference(fof_nnf,[status(thm)],[24])).
% fof(65, negated_conjecture,?[X4]:?[X5]:?[X6]:(((convergent_lines(X4,X5)&convergent_lines(X4,X6))&distinct_points(intersection_point(X4,X5),intersection_point(X4,X6)))&distinct_lines(line_connecting(intersection_point(X4,X5),intersection_point(X4,X6)),X4)),inference(variable_rename,[status(thm)],[64])).
% fof(66, negated_conjecture,(((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk1_0,esk3_0))&distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))&distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)),inference(skolemize,[status(esa)],[65])).
% cnf(67,negated_conjecture,(distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,negated_conjecture,(convergent_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(77,negated_conjecture,(apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(X2,esk1_0)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[57,67,theory(equality)])).
% cnf(135,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(spm,[status(thm)],[77,68,theory(equality)])).
% cnf(896,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|~distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(spm,[status(thm)],[54,135,theory(equality)])).
% cnf(897,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|$false),inference(rw,[status(thm)],[896,68,theory(equality)])).
% cnf(898,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)),inference(cn,[status(thm)],[897,theory(equality)])).
% cnf(14661,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),inference(spm,[status(thm)],[51,898,theory(equality)])).
% cnf(14662,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[14661,68,theory(equality)])).
% cnf(14663,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[14662,theory(equality)])).
% cnf(14666,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[45,14663,theory(equality)])).
% cnf(14667,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|$false),inference(rw,[status(thm)],[14666,69,theory(equality)])).
% cnf(14668,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)),inference(cn,[status(thm)],[14667,theory(equality)])).
% cnf(14671,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[45,14668,theory(equality)])).
% cnf(14677,negated_conjecture,($false),inference(rw,[status(thm)],[14671,70,theory(equality)])).
% cnf(14678,negated_conjecture,($false),inference(cn,[status(thm)],[14677,theory(equality)])).
% cnf(14679,negated_conjecture,($false),14678,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2090
% # ...of these trivial : 2
% # ...subsumed : 1508
% # ...remaining for further processing: 580
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 30
% # Backward-rewritten : 6
% # Generated clauses : 13026
% # ...of the previous two non-trivial : 12319
% # Contextual simplify-reflections : 472
% # Paramodulations : 11272
% # Factorizations : 1754
% # Equation resolutions : 0
% # Current number of processed clauses: 526
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 508
% # Current number of unprocessed clauses: 9648
% # ...number of literals in the above : 90349
% # Clause-clause subsumption calls (NU) : 62979
% # Rec. Clause-clause subsumption calls : 17950
% # Unit Clause-clause subsumption calls : 249
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 79 leaves, 2.39+/-2.612 terms/leaf
% # Paramod-from index: 53 leaves, 2.21+/-2.192 terms/leaf
% # Paramod-into index: 67 leaves, 2.09+/-2.218 terms/leaf
% # -------------------------------------------------
% # User time : 1.497 s
% # System time : 0.021 s
% # Total time : 1.518 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.79 CPU 1.88 WC
% FINAL PrfWatch: 1.79 CPU 1.88 WC
% SZS output end Solution for /tmp/SystemOnTPTP23892/GEO203+1.tptp
%
%------------------------------------------------------------------------------