%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO234+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:20:03 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP24318/GEO234+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24318/GEO234+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24318/GEO234+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 24414
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(unequally_directed_lines(X1,X2)=>(unequally_directed_lines(X1,X3)|unequally_directed_lines(X2,X3))),file('/tmp/SRASS.s.p', ax6_basics)).
% fof(2, axiom,![X4]:![X5]:(unequally_directed_opposite_lines(X4,X5)<=>unequally_directed_lines(X4,reverse_line(X5))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(5, axiom,![X1]:![X2]:(unequally_directed_lines(X1,X2)|unequally_directed_lines(X1,reverse_line(X2))),file('/tmp/SRASS.s.p', ax8_basics)).
% fof(6, axiom,![X1]:equally_directed_lines(X1,X1),file('/tmp/SRASS.s.p', ax5_basics)).
% fof(8, axiom,![X4]:![X5]:(equally_directed_lines(X4,X5)<=>~(unequally_directed_lines(X4,X5))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(12, axiom,![X1]:![X2]:~((left_convergent_lines(X1,X2)|left_convergent_lines(X1,reverse_line(X2)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(13, axiom,![X1]:![X2]:((unequally_directed_lines(X1,X2)&unequally_directed_lines(X1,reverse_line(X2)))=>(left_convergent_lines(X1,X2)|left_convergent_lines(X1,reverse_line(X2)))),file('/tmp/SRASS.s.p', ax9_basics)).
% fof(37, conjecture,![X1]:![X2]:![X3]:(unequally_directed_opposite_lines(X1,X2)=>(unequally_directed_lines(X1,X3)|unequally_directed_opposite_lines(X2,X3))),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X2]:![X3]:(unequally_directed_opposite_lines(X1,X2)=>(unequally_directed_lines(X1,X3)|unequally_directed_opposite_lines(X2,X3)))),inference(assume_negation,[status(cth)],[37])).
% fof(40, plain,![X4]:![X5]:(equally_directed_lines(X4,X5)<=>~(unequally_directed_lines(X4,X5))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(47, plain,![X1]:![X2]:![X3]:(~(unequally_directed_lines(X1,X2))|(unequally_directed_lines(X1,X3)|unequally_directed_lines(X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(48, plain,![X4]:![X5]:![X6]:(~(unequally_directed_lines(X4,X5))|(unequally_directed_lines(X4,X6)|unequally_directed_lines(X5,X6))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X3,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, 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(fof_nnf,[status(thm)],[2])).
% fof(51, plain,![X6]:![X7]:((~(unequally_directed_opposite_lines(X6,X7))|unequally_directed_lines(X6,reverse_line(X7)))&(~(unequally_directed_lines(X6,reverse_line(X7)))|unequally_directed_opposite_lines(X6,X7))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(unequally_directed_opposite_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(67, plain,![X3]:![X4]:(unequally_directed_lines(X3,X4)|unequally_directed_lines(X3,reverse_line(X4))),inference(variable_rename,[status(thm)],[5])).
% cnf(68,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[67])).
% fof(69, plain,![X2]:equally_directed_lines(X2,X2),inference(variable_rename,[status(thm)],[6])).
% cnf(70,plain,(equally_directed_lines(X1,X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(75, plain,![X4]:![X5]:((~(equally_directed_lines(X4,X5))|~(unequally_directed_lines(X4,X5)))&(unequally_directed_lines(X4,X5)|equally_directed_lines(X4,X5))),inference(fof_nnf,[status(thm)],[40])).
% fof(76, plain,![X6]:![X7]:((~(equally_directed_lines(X6,X7))|~(unequally_directed_lines(X6,X7)))&(unequally_directed_lines(X6,X7)|equally_directed_lines(X6,X7))),inference(variable_rename,[status(thm)],[75])).
% cnf(78,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[76])).
% fof(87, plain,![X1]:![X2]:(~(left_convergent_lines(X1,X2))&~(left_convergent_lines(X1,reverse_line(X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(88, plain,![X3]:![X4]:(~(left_convergent_lines(X3,X4))&~(left_convergent_lines(X3,reverse_line(X4)))),inference(variable_rename,[status(thm)],[87])).
% cnf(90,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(91, plain,![X1]:![X2]:((~(unequally_directed_lines(X1,X2))|~(unequally_directed_lines(X1,reverse_line(X2))))|(left_convergent_lines(X1,X2)|left_convergent_lines(X1,reverse_line(X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(92, plain,![X3]:![X4]:((~(unequally_directed_lines(X3,X4))|~(unequally_directed_lines(X3,reverse_line(X4))))|(left_convergent_lines(X3,X4)|left_convergent_lines(X3,reverse_line(X4)))),inference(variable_rename,[status(thm)],[91])).
% cnf(93,plain,(left_convergent_lines(X1,reverse_line(X2))|left_convergent_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[92])).
% fof(186, negated_conjecture,?[X1]:?[X2]:?[X3]:(unequally_directed_opposite_lines(X1,X2)&(~(unequally_directed_lines(X1,X3))&~(unequally_directed_opposite_lines(X2,X3)))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X4]:?[X5]:?[X6]:(unequally_directed_opposite_lines(X4,X5)&(~(unequally_directed_lines(X4,X6))&~(unequally_directed_opposite_lines(X5,X6)))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,(unequally_directed_opposite_lines(esk1_0,esk2_0)&(~(unequally_directed_lines(esk1_0,esk3_0))&~(unequally_directed_opposite_lines(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~unequally_directed_opposite_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(~unequally_directed_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(191,negated_conjecture,(unequally_directed_opposite_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(211,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[93,90,theory(equality)])).
% cnf(212,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[211,90,theory(equality)])).
% cnf(233,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[53,191,theory(equality)])).
% cnf(234,negated_conjecture,(~unequally_directed_lines(esk2_0,reverse_line(esk3_0))),inference(spm,[status(thm)],[189,52,theory(equality)])).
% cnf(239,plain,(~unequally_directed_lines(X1,X1)),inference(spm,[status(thm)],[78,70,theory(equality)])).
% cnf(261,negated_conjecture,(~unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[212,233,theory(equality)])).
% cnf(268,negated_conjecture,(unequally_directed_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[234,68,theory(equality)])).
% cnf(269,negated_conjecture,(unequally_directed_lines(esk2_0,X1)|unequally_directed_lines(esk3_0,X1)),inference(spm,[status(thm)],[49,268,theory(equality)])).
% cnf(271,negated_conjecture,(unequally_directed_lines(esk3_0,X1)|unequally_directed_lines(X2,X1)|unequally_directed_lines(esk2_0,X2)),inference(spm,[status(thm)],[49,269,theory(equality)])).
% cnf(286,negated_conjecture,(unequally_directed_lines(esk2_0,X1)|unequally_directed_lines(X1,esk3_0)),inference(spm,[status(thm)],[239,271,theory(equality)])).
% cnf(290,negated_conjecture,(unequally_directed_lines(esk2_0,X1)|unequally_directed_lines(X2,X1)|unequally_directed_lines(X2,esk3_0)),inference(spm,[status(thm)],[49,286,theory(equality)])).
% cnf(338,negated_conjecture,(unequally_directed_lines(X1,esk3_0)|unequally_directed_lines(X1,esk2_0)),inference(spm,[status(thm)],[239,290,theory(equality)])).
% cnf(352,negated_conjecture,(unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[190,338,theory(equality)])).
% cnf(357,negated_conjecture,($false),inference(sr,[status(thm)],[352,261,theory(equality)])).
% cnf(358,negated_conjecture,($false),357,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 142
% # ...of these trivial : 0
% # ...subsumed : 28
% # ...remaining for further processing: 114
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 102
% # ...of the previous two non-trivial : 64
% # Contextual simplify-reflections : 5
% # Paramodulations : 85
% # Factorizations : 14
% # Equation resolutions : 0
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 39
% # ...number of literals in the above : 111
% # Clause-clause subsumption calls (NU) : 220
% # Rec. Clause-clause subsumption calls : 184
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 53 leaves, 1.60+/-1.337 terms/leaf
% # Paramod-from index: 22 leaves, 1.32+/-0.555 terms/leaf
% # Paramod-into index: 46 leaves, 1.46+/-0.902 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.006 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP24318/GEO234+3.tptp
%
%------------------------------------------------------------------------------