TSTP Solution File: GEO192+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO192+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:05:38 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/SystemOnTPTP21819/GEO192+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21819/GEO192+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21819/GEO192+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 21915
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(3, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% 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(7, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(36, conjecture,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(apart_point_and_line(intersection_point(X1,X2),X3)=>(distinct_lines(X1,X3)&distinct_lines(X2,X3)))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(apart_point_and_line(intersection_point(X1,X2),X3)=>(distinct_lines(X1,X3)&distinct_lines(X2,X3))))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(40, 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(41, 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(57, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[38])).
% cnf(58,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(61, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(62, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[40])).
% fof(68, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(71, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[70])).
% cnf(72,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(74, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_lines(X5,X6)|apart_point_and_line(X4,X6))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[74])).
% fof(167, negated_conjecture,?[X1]:?[X2]:?[X3]:(convergent_lines(X1,X2)&(apart_point_and_line(intersection_point(X1,X2),X3)&(~(distinct_lines(X1,X3))|~(distinct_lines(X2,X3))))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X4]:?[X5]:?[X6]:(convergent_lines(X4,X5)&(apart_point_and_line(intersection_point(X4,X5),X6)&(~(distinct_lines(X4,X6))|~(distinct_lines(X5,X6))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,(convergent_lines(esk1_0,esk2_0)&(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)&(~(distinct_lines(esk1_0,esk3_0))|~(distinct_lines(esk2_0,esk3_0))))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~distinct_lines(esk2_0,esk3_0)|~distinct_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(180,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[75,171,theory(equality)])).
% cnf(221,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[72,180,theory(equality)])).
% cnf(222,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[69,180,theory(equality)])).
% cnf(223,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[221,172,theory(equality)])).
% cnf(224,negated_conjecture,(distinct_lines(esk3_0,esk2_0)),inference(cn,[status(thm)],[223,theory(equality)])).
% cnf(225,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[222,172,theory(equality)])).
% cnf(226,negated_conjecture,(distinct_lines(esk3_0,esk1_0)),inference(cn,[status(thm)],[225,theory(equality)])).
% cnf(228,negated_conjecture,(distinct_lines(esk2_0,X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[63,224,theory(equality)])).
% cnf(231,negated_conjecture,(distinct_lines(esk1_0,X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[63,226,theory(equality)])).
% cnf(269,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[58,228,theory(equality)])).
% cnf(276,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[170,269,theory(equality)])).
% cnf(277,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)),inference(cn,[status(thm)],[276,theory(equality)])).
% cnf(299,negated_conjecture,(distinct_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[58,231,theory(equality)])).
% cnf(303,negated_conjecture,($false),inference(sr,[status(thm)],[299,277,theory(equality)])).
% cnf(304,negated_conjecture,($false),303,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 74
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 117
% # ...of the previous two non-trivial : 100
% # Contextual simplify-reflections : 4
% # Paramodulations : 117
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 68
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 45
% # Current number of unprocessed clauses: 75
% # ...number of literals in the above : 232
% # Clause-clause subsumption calls (NU) : 70
% # Rec. Clause-clause subsumption calls : 69
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 63 leaves, 1.46+/-1.232 terms/leaf
% # Paramod-from index: 32 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 56 leaves, 1.27+/-0.767 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 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/SystemOnTPTP21819/GEO192+3.tptp
%
%------------------------------------------------------------------------------