TSTP Solution File: GEO217+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO217+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 : 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:14:05 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP25964/GEO217+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25964/GEO217+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25964/GEO217+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 26060
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),file('/tmp/SRASS.s.p', a3)).
% fof(2, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(3, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6)).
% fof(4, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(5, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(6, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X3)|convergent_lines(X1,X3))),file('/tmp/SRASS.s.p', ceq3)).
% fof(7, axiom,![X1]:![X2]:(distinct_lines(X1,X2)=>convergent_lines(X1,X2)),file('/tmp/SRASS.s.p', p1)).
% fof(36, conjecture,![X4]:![X5]:![X6]:((parallel_lines(X4,X5)¶llel_lines(X4,X6))=>parallel_lines(X5,X6)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:![X5]:![X6]:((parallel_lines(X4,X5)¶llel_lines(X4,X6))=>parallel_lines(X5,X6))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(39, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(40, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(57, plain,![X1]:![X2]:((~(parallel_lines(X1,X2))|~(convergent_lines(X1,X2)))&(convergent_lines(X1,X2)|parallel_lines(X1,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(58, plain,![X3]:![X4]:((~(parallel_lines(X3,X4))|~(convergent_lines(X3,X4)))&(convergent_lines(X3,X4)|parallel_lines(X3,X4))),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(parallel_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,plain,(~convergent_lines(X1,X2)|~parallel_lines(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(61, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[39])).
% cnf(62,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(64, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(66, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[40])).
% cnf(67,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(69, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X3)|convergent_lines(X1,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(72, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(distinct_lines(X5,X6)|convergent_lines(X4,X6))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[72])).
% fof(74, plain,![X1]:![X2]:(~(distinct_lines(X1,X2))|convergent_lines(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(75, plain,![X3]:![X4]:(~(distinct_lines(X3,X4))|convergent_lines(X3,X4)),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(convergent_lines(X1,X2)|~distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[75])).
% fof(167, negated_conjecture,?[X4]:?[X5]:?[X6]:((parallel_lines(X4,X5)¶llel_lines(X4,X6))&~(parallel_lines(X5,X6))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X7]:?[X8]:?[X9]:((parallel_lines(X7,X8)¶llel_lines(X7,X9))&~(parallel_lines(X8,X9))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((parallel_lines(esk1_0,esk2_0)¶llel_lines(esk1_0,esk3_0))&~(parallel_lines(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~parallel_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(parallel_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(parallel_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[170,59,theory(equality)])).
% cnf(175,negated_conjecture,(~convergent_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[60,171,theory(equality)])).
% cnf(176,negated_conjecture,(~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[60,172,theory(equality)])).
% cnf(193,negated_conjecture,(distinct_lines(esk3_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[73,174,theory(equality)])).
% cnf(205,negated_conjecture,(distinct_lines(X1,X2)|distinct_lines(esk3_0,X2)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[70,193,theory(equality)])).
% cnf(303,negated_conjecture,(distinct_lines(X1,esk3_0)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[67,205,theory(equality)])).
% cnf(310,negated_conjecture,(convergent_lines(X1,esk3_0)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[76,303,theory(equality)])).
% cnf(314,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[175,310,theory(equality)])).
% cnf(324,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[65,314,theory(equality)])).
% cnf(368,negated_conjecture,(convergent_lines(esk2_0,esk2_0)),inference(spm,[status(thm)],[176,324,theory(equality)])).
% cnf(371,negated_conjecture,($false),inference(sr,[status(thm)],[368,62,theory(equality)])).
% cnf(372,negated_conjecture,($false),371,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 0
% # ...subsumed : 11
% # ...remaining for further processing: 71
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 175
% # ...of the previous two non-trivial : 144
% # Contextual simplify-reflections : 4
% # Paramodulations : 165
% # Factorizations : 10
% # Equation resolutions : 0
% # Current number of processed clauses: 71
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 51
% # Current number of unprocessed clauses: 111
% # ...number of literals in the above : 462
% # Clause-clause subsumption calls (NU) : 106
% # Rec. Clause-clause subsumption calls : 94
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 58 leaves, 1.64+/-1.459 terms/leaf
% # Paramod-from index: 34 leaves, 1.15+/-0.429 terms/leaf
% # Paramod-into index: 54 leaves, 1.43+/-1.011 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP25964/GEO217+3.tptp
%
%------------------------------------------------------------------------------