TSTP Solution File: GEO226+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO226+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 : 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:18:00 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP23282/GEO226+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23282/GEO226+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23282/GEO226+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 23378
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(6, axiom,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(22, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(23, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(36, conjecture,![X4]:![X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))=>?[X1]:(point(X1)=>(incident_point_and_line(X1,X4)&incident_point_and_line(X1,X5)))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:![X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))=>?[X1]:(point(X1)=>(incident_point_and_line(X1,X4)&incident_point_and_line(X1,X5))))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(39, plain,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(48, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% fof(49, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[23,theory(equality)])).
% fof(57, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[38])).
% cnf(58,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(60, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(71, 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)],[39])).
% fof(72, 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)],[71])).
% cnf(73,plain,(incident_point_and_line(X1,X2)|apart_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(126, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[48])).
% fof(127, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[126])).
% cnf(128,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[127])).
% fof(129, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[49])).
% fof(130, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[129])).
% cnf(131,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[130])).
% fof(167, negated_conjecture,?[X4]:?[X5]:(((line(X4)&line(X5))&convergent_lines(X4,X5))&![X1]:(point(X1)&(~(incident_point_and_line(X1,X4))|~(incident_point_and_line(X1,X5))))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X6]:?[X7]:(((line(X6)&line(X7))&convergent_lines(X6,X7))&![X8]:(point(X8)&(~(incident_point_and_line(X8,X6))|~(incident_point_and_line(X8,X7))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(((line(esk1_0)&line(esk2_0))&convergent_lines(esk1_0,esk2_0))&![X8]:(point(X8)&(~(incident_point_and_line(X8,esk1_0))|~(incident_point_and_line(X8,esk2_0))))),inference(skolemize,[status(esa)],[168])).
% fof(170, negated_conjecture,![X8]:((point(X8)&(~(incident_point_and_line(X8,esk1_0))|~(incident_point_and_line(X8,esk2_0))))&((line(esk1_0)&line(esk2_0))&convergent_lines(esk1_0,esk2_0))),inference(shift_quantors,[status(thm)],[169])).
% cnf(171,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[170])).
% cnf(174,negated_conjecture,(~incident_point_and_line(X1,esk2_0)|~incident_point_and_line(X1,esk1_0)),inference(split_conjunct,[status(thm)],[170])).
% cnf(181,negated_conjecture,(apart_point_and_line(X1,esk1_0)|~incident_point_and_line(X1,esk2_0)),inference(spm,[status(thm)],[174,73,theory(equality)])).
% cnf(187,negated_conjecture,(convergent_lines(esk2_0,X1)|convergent_lines(esk1_0,X1)),inference(spm,[status(thm)],[61,171,theory(equality)])).
% cnf(216,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)),inference(spm,[status(thm)],[181,73,theory(equality)])).
% cnf(217,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[58,187,theory(equality)])).
% cnf(230,negated_conjecture,(apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)|~convergent_lines(X1,esk1_0)),inference(spm,[status(thm)],[131,216,theory(equality)])).
% cnf(967,negated_conjecture,(~convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[128,230,theory(equality)])).
% cnf(968,negated_conjecture,($false),inference(rw,[status(thm)],[967,217,theory(equality)])).
% cnf(969,negated_conjecture,($false),inference(cn,[status(thm)],[968,theory(equality)])).
% cnf(970,negated_conjecture,($false),969,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 161
% # ...of these trivial : 0
% # ...subsumed : 37
% # ...remaining for further processing: 124
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 652
% # ...of the previous two non-trivial : 534
% # Contextual simplify-reflections : 4
% # Paramodulations : 620
% # Factorizations : 32
% # Equation resolutions : 0
% # Current number of processed clauses: 121
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 97
% # Current number of unprocessed clauses: 396
% # ...number of literals in the above : 1658
% # Clause-clause subsumption calls (NU) : 520
% # Rec. Clause-clause subsumption calls : 401
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 86 leaves, 1.64+/-1.413 terms/leaf
% # Paramod-from index: 59 leaves, 1.20+/-0.479 terms/leaf
% # Paramod-into index: 81 leaves, 1.41+/-0.913 terms/leaf
% # -------------------------------------------------
% # User time : 0.035 s
% # System time : 0.004 s
% # Total time : 0.039 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP23282/GEO226+3.tptp
%
%------------------------------------------------------------------------------