TSTP Solution File: GEO185+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO185+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:35 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP30782/GEO185+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30782/GEO185+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30782/GEO185+3.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 30878
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),file('/tmp/SRASS.s.p', ax1)).
% fof(6, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(7, 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]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(9, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(36, conjecture,![X1]:![X2]:![X7]:![X8]:(((distinct_points(X1,X2)&convergent_lines(X7,X8))&equal_points(X1,intersection_point(X7,X8)))=>(incident_point_and_line(X1,X7)&incident_point_and_line(X1,X8))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X7]:![X8]:(((distinct_points(X1,X2)&convergent_lines(X7,X8))&equal_points(X1,intersection_point(X7,X8)))=>(incident_point_and_line(X1,X7)&incident_point_and_line(X1,X8)))),inference(assume_negation,[status(cth)],[36])).
% fof(40, plain,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(42, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(43, plain,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(67, plain,![X1]:![X2]:((~(equal_points(X1,X2))|~(distinct_points(X1,X2)))&(distinct_points(X1,X2)|equal_points(X1,X2))),inference(fof_nnf,[status(thm)],[40])).
% fof(68, plain,![X3]:![X4]:((~(equal_points(X3,X4))|~(distinct_points(X3,X4)))&(distinct_points(X3,X4)|equal_points(X3,X4))),inference(variable_rename,[status(thm)],[67])).
% cnf(70,plain,(~distinct_points(X1,X2)|~equal_points(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(71, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[41])).
% fof(72, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(74, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[42])).
% fof(75, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[75])).
% fof(77, plain,![X1]:![X2]:((~(incident_point_and_line(X1,X2))|~(apart_point_and_line(X1,X2)))&(apart_point_and_line(X1,X2)|incident_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[43])).
% fof(78, plain,![X3]:![X4]:((~(incident_point_and_line(X3,X4))|~(apart_point_and_line(X3,X4)))&(apart_point_and_line(X3,X4)|incident_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(incident_point_and_line(X1,X2)|apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[78])).
% fof(81, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(82, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X7]:?[X8]:(((distinct_points(X1,X2)&convergent_lines(X7,X8))&equal_points(X1,intersection_point(X7,X8)))&(~(incident_point_and_line(X1,X7))|~(incident_point_and_line(X1,X8)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:(((distinct_points(X9,X10)&convergent_lines(X11,X12))&equal_points(X9,intersection_point(X11,X12)))&(~(incident_point_and_line(X9,X11))|~(incident_point_and_line(X9,X12)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&equal_points(esk1_0,intersection_point(esk3_0,esk4_0)))&(~(incident_point_and_line(esk1_0,esk3_0))|~(incident_point_and_line(esk1_0,esk4_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~incident_point_and_line(esk1_0,esk4_0)|~incident_point_and_line(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(equal_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(~distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))),inference(spm,[status(thm)],[70,171,theory(equality)])).
% cnf(176,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)|~incident_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[170,79,theory(equality)])).
% cnf(209,negated_conjecture,(apart_point_and_line(esk1_0,esk4_0)|apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[176,79,theory(equality)])).
% cnf(213,negated_conjecture,(apart_point_and_line(X1,esk4_0)|distinct_points(esk1_0,X1)|apart_point_and_line(esk1_0,esk3_0)),inference(spm,[status(thm)],[83,209,theory(equality)])).
% cnf(284,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)),inference(spm,[status(thm)],[174,213,theory(equality)])).
% cnf(287,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[76,284,theory(equality)])).
% cnf(288,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[287,172,theory(equality)])).
% cnf(289,negated_conjecture,(apart_point_and_line(esk1_0,esk3_0)),inference(cn,[status(thm)],[288,theory(equality)])).
% cnf(290,negated_conjecture,(apart_point_and_line(X1,esk3_0)|distinct_points(esk1_0,X1)),inference(spm,[status(thm)],[83,289,theory(equality)])).
% cnf(311,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0)),inference(spm,[status(thm)],[174,290,theory(equality)])).
% cnf(315,negated_conjecture,(~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[73,311,theory(equality)])).
% cnf(316,negated_conjecture,($false),inference(rw,[status(thm)],[315,172,theory(equality)])).
% cnf(317,negated_conjecture,($false),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(318,negated_conjecture,($false),317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 83
% # ...of these trivial : 0
% # ...subsumed : 11
% # ...remaining for further processing: 72
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 120
% # ...of the previous two non-trivial : 96
% # Contextual simplify-reflections : 4
% # Paramodulations : 120
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 68
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 50
% # Current number of unprocessed clauses: 56
% # ...number of literals in the above : 202
% # Clause-clause subsumption calls (NU) : 110
% # Rec. Clause-clause subsumption calls : 102
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 62 leaves, 1.60+/-1.431 terms/leaf
% # Paramod-from index: 28 leaves, 1.07+/-0.371 terms/leaf
% # Paramod-into index: 53 leaves, 1.38+/-0.874 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 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/SystemOnTPTP30782/GEO185+3.tptp
%
%------------------------------------------------------------------------------