TSTP Solution File: GEO210+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO210+1 : TPTP v5.0.0. Released v3.3.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:11:13 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP12721/GEO210+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12721/GEO210+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12721/GEO210+1.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 12817
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X4]:![X5]:~(unorthogonal_lines(orthogonal_through_point(X5,X4),X5)),file('/tmp/SRASS.s.p', ooc1)).
% fof(5, axiom,![X4]:![X5]:~(apart_point_and_line(X4,orthogonal_through_point(X5,X4))),file('/tmp/SRASS.s.p', ooc2)).
% fof(6, axiom,![X4]:![X5]:![X6]:![X7]:(distinct_lines(X5,X6)=>(((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|unorthogonal_lines(X5,X7))|unorthogonal_lines(X6,X7))),file('/tmp/SRASS.s.p', ouo1)).
% fof(23, conjecture,![X4]:![X5]:![X6]:((~(apart_point_and_line(X4,X5))&~(unorthogonal_lines(X5,X6)))=>~(distinct_lines(X5,orthogonal_through_point(X6,X4)))),file('/tmp/SRASS.s.p', con)).
% fof(24, negated_conjecture,~(![X4]:![X5]:![X6]:((~(apart_point_and_line(X4,X5))&~(unorthogonal_lines(X5,X6)))=>~(distinct_lines(X5,orthogonal_through_point(X6,X4))))),inference(assume_negation,[status(cth)],[23])).
% fof(26, plain,![X4]:![X5]:~(unorthogonal_lines(orthogonal_through_point(X5,X4),X5)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(27, plain,![X4]:![X5]:~(apart_point_and_line(X4,orthogonal_through_point(X5,X4))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(36, negated_conjecture,~(![X4]:![X5]:![X6]:((~(apart_point_and_line(X4,X5))&~(unorthogonal_lines(X5,X6)))=>~(distinct_lines(X5,orthogonal_through_point(X6,X4))))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(45, plain,![X6]:![X7]:~(unorthogonal_lines(orthogonal_through_point(X7,X6),X7)),inference(variable_rename,[status(thm)],[26])).
% cnf(46,plain,(~unorthogonal_lines(orthogonal_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X6]:![X7]:~(apart_point_and_line(X6,orthogonal_through_point(X7,X6))),inference(variable_rename,[status(thm)],[27])).
% cnf(48,plain,(~apart_point_and_line(X1,orthogonal_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X4]:![X5]:![X6]:![X7]:(~(distinct_lines(X5,X6))|(((apart_point_and_line(X4,X5)|apart_point_and_line(X4,X6))|unorthogonal_lines(X5,X7))|unorthogonal_lines(X6,X7))),inference(fof_nnf,[status(thm)],[6])).
% fof(50, plain,![X8]:![X9]:![X10]:![X11]:(~(distinct_lines(X9,X10))|(((apart_point_and_line(X8,X9)|apart_point_and_line(X8,X10))|unorthogonal_lines(X9,X11))|unorthogonal_lines(X10,X11))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(unorthogonal_lines(X1,X2)|unorthogonal_lines(X3,X2)|apart_point_and_line(X4,X1)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(99, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(apart_point_and_line(X4,X5))&~(unorthogonal_lines(X5,X6)))&distinct_lines(X5,orthogonal_through_point(X6,X4))),inference(fof_nnf,[status(thm)],[36])).
% fof(100, negated_conjecture,?[X7]:?[X8]:?[X9]:((~(apart_point_and_line(X7,X8))&~(unorthogonal_lines(X8,X9)))&distinct_lines(X8,orthogonal_through_point(X9,X7))),inference(variable_rename,[status(thm)],[99])).
% fof(101, negated_conjecture,((~(apart_point_and_line(esk1_0,esk2_0))&~(unorthogonal_lines(esk2_0,esk3_0)))&distinct_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0))),inference(skolemize,[status(esa)],[100])).
% cnf(102,negated_conjecture,(distinct_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0))),inference(split_conjunct,[status(thm)],[101])).
% cnf(103,negated_conjecture,(~unorthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[101])).
% cnf(104,negated_conjecture,(~apart_point_and_line(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[101])).
% cnf(113,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)|unorthogonal_lines(esk2_0,X1)|apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk1_0))|apart_point_and_line(X2,esk2_0)),inference(spm,[status(thm)],[51,102,theory(equality)])).
% cnf(182,negated_conjecture,(unorthogonal_lines(esk2_0,esk3_0)|apart_point_and_line(X1,orthogonal_through_point(esk3_0,esk1_0))|apart_point_and_line(X1,esk2_0)),inference(spm,[status(thm)],[46,113,theory(equality)])).
% cnf(183,negated_conjecture,(apart_point_and_line(X1,orthogonal_through_point(esk3_0,esk1_0))|apart_point_and_line(X1,esk2_0)),inference(sr,[status(thm)],[182,103,theory(equality)])).
% cnf(237,negated_conjecture,(apart_point_and_line(esk1_0,esk2_0)),inference(spm,[status(thm)],[48,183,theory(equality)])).
% cnf(238,negated_conjecture,($false),inference(sr,[status(thm)],[237,104,theory(equality)])).
% cnf(239,negated_conjecture,($false),238,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 57
% # ...of these trivial : 0
% # ...subsumed : 6
% # ...remaining for further processing: 51
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 110
% # ...of the previous two non-trivial : 89
% # Contextual simplify-reflections : 3
% # Paramodulations : 106
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 49
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 49
% # ...number of literals in the above : 183
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 58
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 43 leaves, 1.77+/-1.476 terms/leaf
% # Paramod-from index: 21 leaves, 1.19+/-0.393 terms/leaf
% # Paramod-into index: 40 leaves, 1.48+/-0.774 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.004 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP12721/GEO210+1.tptp
%
%------------------------------------------------------------------------------