%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO210+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:16:08 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP12920/GEO210+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12920/GEO210+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12920/GEO210+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 13052
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),file('/tmp/SRASS.s.p', a4)).
% fof(2, axiom,![X3]:![X4]:~(apart_point_and_line(X3,orthogonal_through_point(X4,X3))),file('/tmp/SRASS.s.p', ooc2)).
% fof(3, axiom,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(4, axiom,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),file('/tmp/SRASS.s.p', a5)).
% fof(5, axiom,![X3]:![X4]:~(unorthogonal_lines(orthogonal_through_point(X4,X3),X4)),file('/tmp/SRASS.s.p', ooc1)).
% fof(29, axiom,![X3]:![X4]:![X6]:![X7]:(distinct_lines(X4,X6)=>(((apart_point_and_line(X3,X4)|apart_point_and_line(X3,X6))|unorthogonal_lines(X4,X7))|unorthogonal_lines(X6,X7))),file('/tmp/SRASS.s.p', ouo1)).
% fof(36, conjecture,![X3]:![X4]:![X6]:((incident_point_and_line(X3,X4)&orthogonal_lines(X4,X6))=>equal_lines(X4,orthogonal_through_point(X6,X3))),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X3]:![X4]:![X6]:((incident_point_and_line(X3,X4)&orthogonal_lines(X4,X6))=>equal_lines(X4,orthogonal_through_point(X6,X3)))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:![X2]:(incident_point_and_line(X1,X2)<=>~(apart_point_and_line(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(39, plain,![X3]:![X4]:~(apart_point_and_line(X3,orthogonal_through_point(X4,X3))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(40, plain,![X1]:![X2]:(equal_lines(X1,X2)<=>~(distinct_lines(X1,X2))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(41, plain,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(42, plain,![X3]:![X4]:~(unorthogonal_lines(orthogonal_through_point(X4,X3),X4)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(57, plain,![X1]:![X2]:((~(incident_point_and_line(X1,X2))|~(apart_point_and_line(X1,X2)))&(apart_point_and_line(X1,X2)|incident_point_and_line(X1,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(58, plain,![X3]:![X4]:((~(incident_point_and_line(X3,X4))|~(apart_point_and_line(X3,X4)))&(apart_point_and_line(X3,X4)|incident_point_and_line(X3,X4))),inference(variable_rename,[status(thm)],[57])).
% cnf(60,plain,(~apart_point_and_line(X1,X2)|~incident_point_and_line(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(61, plain,![X5]:![X6]:~(apart_point_and_line(X5,orthogonal_through_point(X6,X5))),inference(variable_rename,[status(thm)],[39])).
% cnf(62,plain,(~apart_point_and_line(X1,orthogonal_through_point(X2,X1))),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:![X2]:((~(equal_lines(X1,X2))|~(distinct_lines(X1,X2)))&(distinct_lines(X1,X2)|equal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[40])).
% fof(64, plain,![X3]:![X4]:((~(equal_lines(X3,X4))|~(distinct_lines(X3,X4)))&(distinct_lines(X3,X4)|equal_lines(X3,X4))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(equal_lines(X1,X2)|distinct_lines(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(67, plain,![X1]:![X2]:((~(orthogonal_lines(X1,X2))|~(unorthogonal_lines(X1,X2)))&(unorthogonal_lines(X1,X2)|orthogonal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[41])).
% fof(68, plain,![X3]:![X4]:((~(orthogonal_lines(X3,X4))|~(unorthogonal_lines(X3,X4)))&(unorthogonal_lines(X3,X4)|orthogonal_lines(X3,X4))),inference(variable_rename,[status(thm)],[67])).
% cnf(70,plain,(~unorthogonal_lines(X1,X2)|~orthogonal_lines(X1,X2)),inference(split_conjunct,[status(thm)],[68])).
% fof(71, plain,![X5]:![X6]:~(unorthogonal_lines(orthogonal_through_point(X6,X5),X6)),inference(variable_rename,[status(thm)],[42])).
% cnf(72,plain,(~unorthogonal_lines(orthogonal_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(144, plain,![X3]:![X4]:![X6]:![X7]:(~(distinct_lines(X4,X6))|(((apart_point_and_line(X3,X4)|apart_point_and_line(X3,X6))|unorthogonal_lines(X4,X7))|unorthogonal_lines(X6,X7))),inference(fof_nnf,[status(thm)],[29])).
% fof(145, 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)],[144])).
% cnf(146,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)],[145])).
% fof(167, negated_conjecture,?[X3]:?[X4]:?[X6]:((incident_point_and_line(X3,X4)&orthogonal_lines(X4,X6))&~(equal_lines(X4,orthogonal_through_point(X6,X3)))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X7]:?[X8]:?[X9]:((incident_point_and_line(X7,X8)&orthogonal_lines(X8,X9))&~(equal_lines(X8,orthogonal_through_point(X9,X7)))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((incident_point_and_line(esk1_0,esk2_0)&orthogonal_lines(esk2_0,esk3_0))&~(equal_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0)))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~equal_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0))),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(orthogonal_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(incident_point_and_line(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(distinct_lines(esk2_0,orthogonal_through_point(esk3_0,esk1_0))),inference(spm,[status(thm)],[170,65,theory(equality)])).
% cnf(175,negated_conjecture,(~apart_point_and_line(esk1_0,esk2_0)),inference(spm,[status(thm)],[60,172,theory(equality)])).
% cnf(178,negated_conjecture,(~unorthogonal_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[70,171,theory(equality)])).
% cnf(194,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)],[146,174,theory(equality)])).
% cnf(279,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)|unorthogonal_lines(esk2_0,X1)|apart_point_and_line(esk1_0,esk2_0)),inference(spm,[status(thm)],[62,194,theory(equality)])).
% cnf(286,negated_conjecture,(unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)|unorthogonal_lines(esk2_0,X1)),inference(sr,[status(thm)],[279,175,theory(equality)])).
% cnf(353,negated_conjecture,(unorthogonal_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[72,286,theory(equality)])).
% cnf(354,negated_conjecture,($false),inference(sr,[status(thm)],[353,178,theory(equality)])).
% cnf(355,negated_conjecture,($false),354,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 89
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 76
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 163
% # ...of the previous two non-trivial : 138
% # Contextual simplify-reflections : 4
% # Paramodulations : 161
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 75
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 88
% # ...number of literals in the above : 306
% # Clause-clause subsumption calls (NU) : 107
% # Rec. Clause-clause subsumption calls : 99
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 66 leaves, 1.53+/-1.351 terms/leaf
% # Paramod-from index: 36 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index: 60 leaves, 1.35+/-0.833 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 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/SystemOnTPTP12920/GEO210+3.tptp
%
%------------------------------------------------------------------------------