TSTP Solution File: GEO265+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : GEO265+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:26:08 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/SystemOnTPTP25613/GEO265+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP25613/GEO265+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25613/GEO265+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 25709
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X2]:![X3]:(equally_directed_lines(X2,X3)<=>~(unequally_directed_lines(X2,X3))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(3, axiom,![X2]:![X3]:(equally_directed_opposite_lines(X2,X3)<=>~(unequally_directed_opposite_lines(X2,X3))),file('/tmp/SRASS.s.p', a5_defns)).
% fof(21, axiom,![X2]:![X3]:(unequally_directed_opposite_lines(X2,X3)<=>unequally_directed_lines(X2,reverse_line(X3))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(37, conjecture,![X1]:![X7]:(equally_directed_lines(X1,reverse_line(X7))=>equally_directed_opposite_lines(X1,X7)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X7]:(equally_directed_lines(X1,reverse_line(X7))=>equally_directed_opposite_lines(X1,X7))),inference(assume_negation,[status(cth)],[37])).
% fof(39, plain,![X2]:![X3]:(equally_directed_lines(X2,X3)<=>~(unequally_directed_lines(X2,X3))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(40, plain,![X2]:![X3]:(equally_directed_opposite_lines(X2,X3)<=>~(unequally_directed_opposite_lines(X2,X3))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(49, plain,![X2]:![X3]:((~(equally_directed_lines(X2,X3))|~(unequally_directed_lines(X2,X3)))&(unequally_directed_lines(X2,X3)|equally_directed_lines(X2,X3))),inference(fof_nnf,[status(thm)],[39])).
% fof(50, plain,![X4]:![X5]:((~(equally_directed_lines(X4,X5))|~(unequally_directed_lines(X4,X5)))&(unequally_directed_lines(X4,X5)|equally_directed_lines(X4,X5))),inference(variable_rename,[status(thm)],[49])).
% cnf(52,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(53, plain,![X2]:![X3]:((~(equally_directed_opposite_lines(X2,X3))|~(unequally_directed_opposite_lines(X2,X3)))&(unequally_directed_opposite_lines(X2,X3)|equally_directed_opposite_lines(X2,X3))),inference(fof_nnf,[status(thm)],[40])).
% fof(54, plain,![X4]:![X5]:((~(equally_directed_opposite_lines(X4,X5))|~(unequally_directed_opposite_lines(X4,X5)))&(unequally_directed_opposite_lines(X4,X5)|equally_directed_opposite_lines(X4,X5))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(equally_directed_opposite_lines(X1,X2)|unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(113, plain,![X2]:![X3]:((~(unequally_directed_opposite_lines(X2,X3))|unequally_directed_lines(X2,reverse_line(X3)))&(~(unequally_directed_lines(X2,reverse_line(X3)))|unequally_directed_opposite_lines(X2,X3))),inference(fof_nnf,[status(thm)],[21])).
% fof(114, plain,![X4]:![X5]:((~(unequally_directed_opposite_lines(X4,X5))|unequally_directed_lines(X4,reverse_line(X5)))&(~(unequally_directed_lines(X4,reverse_line(X5)))|unequally_directed_opposite_lines(X4,X5))),inference(variable_rename,[status(thm)],[113])).
% cnf(116,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[114])).
% fof(186, negated_conjecture,?[X1]:?[X7]:(equally_directed_lines(X1,reverse_line(X7))&~(equally_directed_opposite_lines(X1,X7))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X8]:?[X9]:(equally_directed_lines(X8,reverse_line(X9))&~(equally_directed_opposite_lines(X8,X9))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(equally_directed_lines(esk1_0,reverse_line(esk2_0))&~(equally_directed_opposite_lines(esk1_0,esk2_0))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~equally_directed_opposite_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(equally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(split_conjunct,[status(thm)],[188])).
% cnf(230,negated_conjecture,(unequally_directed_opposite_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[189,55,theory(equality)])).
% cnf(231,negated_conjecture,(~unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[52,190,theory(equality)])).
% cnf(256,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[116,230,theory(equality)])).
% cnf(266,negated_conjecture,($false),inference(rw,[status(thm)],[231,256,theory(equality)])).
% cnf(267,negated_conjecture,($false),inference(cn,[status(thm)],[266,theory(equality)])).
% cnf(268,negated_conjecture,($false),267,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 126
% # ...of these trivial                : 0
% # ...subsumed                        : 23
% # ...remaining for further processing: 103
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 0
% # Generated clauses                  : 37
% # ...of the previous two non-trivial : 21
% # Contextual simplify-reflections    : 5
% # Paramodulations                    : 34
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 50
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 11
% #    Non-unit-clauses                : 34
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 30
% # Clause-clause subsumption calls (NU) : 150
% # Rec. Clause-clause subsumption calls : 128
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    43 leaves,   1.63+/-1.415 terms/leaf
% # Paramod-from index:           16 leaves,   1.06+/-0.242 terms/leaf
% # Paramod-into index:           36 leaves,   1.39+/-0.792 terms/leaf
% # -------------------------------------------------
% # User time              : 0.020 s
% # System time            : 0.005 s
% # Total time             : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP25613/GEO265+3.tptp
% 
%------------------------------------------------------------------------------