TSTP Solution File: GEO192+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO192+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:32 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP404/GEO192+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP404/GEO192+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP404/GEO192+2.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 511
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 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]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(7, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>((apart_point_and_line(X3,X1)|apart_point_and_line(X3,X2))=>distinct_points(X3,intersection_point(X1,X2)))),file('/tmp/SRASS.s.p', con2)).
% fof(9, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(13, 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(14, 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)],[13])).
% fof(15, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(17, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(18, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(19,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(23, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(28, 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)],[5])).
% fof(29, 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)],[28])).
% cnf(30,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[29])).
% fof(34, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|((~(apart_point_and_line(X3,X1))&~(apart_point_and_line(X3,X2)))|distinct_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(35, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|((~(apart_point_and_line(X6,X4))&~(apart_point_and_line(X6,X5)))|distinct_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:(((~(apart_point_and_line(X6,X4))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))&((~(apart_point_and_line(X6,X5))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(42, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(43,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(55, 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)],[14])).
% fof(56, 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)],[55])).
% fof(57, 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)],[56])).
% cnf(58,negated_conjecture,(~distinct_lines(esk2_0,esk3_0)|~distinct_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(62,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|distinct_lines(esk3_0,X1)),inference(spm,[status(thm)],[30,59,theory(equality)])).
% cnf(64,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[43,37,theory(equality)])).
% cnf(65,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[43,38,theory(equality)])).
% cnf(76,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,62,theory(equality)])).
% cnf(77,negated_conjecture,(distinct_lines(esk3_0,esk2_0)|$false),inference(rw,[status(thm)],[76,60,theory(equality)])).
% cnf(78,negated_conjecture,(distinct_lines(esk3_0,esk2_0)),inference(cn,[status(thm)],[77,theory(equality)])).
% cnf(79,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[24,78,theory(equality)])).
% cnf(80,negated_conjecture,(distinct_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[19,79,theory(equality)])).
% cnf(83,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[58,80,theory(equality)])).
% cnf(84,negated_conjecture,(~distinct_lines(esk1_0,esk3_0)),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(91,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[65,62,theory(equality)])).
% cnf(92,negated_conjecture,(distinct_lines(esk3_0,esk1_0)|$false),inference(rw,[status(thm)],[91,60,theory(equality)])).
% cnf(93,negated_conjecture,(distinct_lines(esk3_0,esk1_0)),inference(cn,[status(thm)],[92,theory(equality)])).
% cnf(94,negated_conjecture,(distinct_lines(esk3_0,X1)|distinct_lines(esk1_0,X1)),inference(spm,[status(thm)],[24,93,theory(equality)])).
% cnf(104,negated_conjecture,(distinct_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[19,94,theory(equality)])).
% cnf(106,negated_conjecture,($false),inference(sr,[status(thm)],[104,84,theory(equality)])).
% cnf(107,negated_conjecture,($false),106,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 52
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 49
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 36
% # ...of the previous two non-trivial : 32
% # Contextual simplify-reflections : 0
% # Paramodulations : 36
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 14
% # ...number of literals in the above : 50
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 14
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 29 leaves, 1.72+/-1.460 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 27 leaves, 1.33+/-0.609 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.004 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP404/GEO192+2.tptp
%
%------------------------------------------------------------------------------