%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO220+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 : art05.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:15:21 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP13064/GEO220+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13064/GEO220+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13064/GEO220+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 13160
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),file('/tmp/SRASS.s.p', a3)).
% fof(2, axiom,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),file('/tmp/SRASS.s.p', a5)).
% fof(11, axiom,![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6))),file('/tmp/SRASS.s.p', couo1)).
% fof(36, conjecture,![X4]:![X5]:![X6]:((orthogonal_lines(X4,X5)&orthogonal_lines(X4,X6))=>parallel_lines(X5,X6)),file('/tmp/SRASS.s.p', con)).
% fof(37, negated_conjecture,~(![X4]:![X5]:![X6]:((orthogonal_lines(X4,X5)&orthogonal_lines(X4,X6))=>parallel_lines(X5,X6))),inference(assume_negation,[status(cth)],[36])).
% fof(38, plain,![X1]:![X2]:(parallel_lines(X1,X2)<=>~(convergent_lines(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(39, plain,![X1]:![X2]:(orthogonal_lines(X1,X2)<=>~(unorthogonal_lines(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(44, plain,![X4]:![X5]:![X6]:((~(unorthogonal_lines(X4,X5))&~(unorthogonal_lines(X4,X6)))=>~(convergent_lines(X5,X6))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(57, plain,![X1]:![X2]:((~(parallel_lines(X1,X2))|~(convergent_lines(X1,X2)))&(convergent_lines(X1,X2)|parallel_lines(X1,X2))),inference(fof_nnf,[status(thm)],[38])).
% fof(58, plain,![X3]:![X4]:((~(parallel_lines(X3,X4))|~(convergent_lines(X3,X4)))&(convergent_lines(X3,X4)|parallel_lines(X3,X4))),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(parallel_lines(X1,X2)|convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(61, plain,![X1]:![X2]:((~(orthogonal_lines(X1,X2))|~(unorthogonal_lines(X1,X2)))&(unorthogonal_lines(X1,X2)|orthogonal_lines(X1,X2))),inference(fof_nnf,[status(thm)],[39])).
% fof(62, plain,![X3]:![X4]:((~(orthogonal_lines(X3,X4))|~(unorthogonal_lines(X3,X4)))&(unorthogonal_lines(X3,X4)|orthogonal_lines(X3,X4))),inference(variable_rename,[status(thm)],[61])).
% cnf(64,plain,(~unorthogonal_lines(X1,X2)|~orthogonal_lines(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(94, plain,![X4]:![X5]:![X6]:((unorthogonal_lines(X4,X5)|unorthogonal_lines(X4,X6))|~(convergent_lines(X5,X6))),inference(fof_nnf,[status(thm)],[44])).
% fof(95, plain,![X7]:![X8]:![X9]:((unorthogonal_lines(X7,X8)|unorthogonal_lines(X7,X9))|~(convergent_lines(X8,X9))),inference(variable_rename,[status(thm)],[94])).
% cnf(96,plain,(unorthogonal_lines(X3,X2)|unorthogonal_lines(X3,X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[95])).
% fof(167, negated_conjecture,?[X4]:?[X5]:?[X6]:((orthogonal_lines(X4,X5)&orthogonal_lines(X4,X6))&~(parallel_lines(X5,X6))),inference(fof_nnf,[status(thm)],[37])).
% fof(168, negated_conjecture,?[X7]:?[X8]:?[X9]:((orthogonal_lines(X7,X8)&orthogonal_lines(X7,X9))&~(parallel_lines(X8,X9))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((orthogonal_lines(esk1_0,esk2_0)&orthogonal_lines(esk1_0,esk3_0))&~(parallel_lines(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~parallel_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(orthogonal_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(orthogonal_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(174,negated_conjecture,(convergent_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[170,59,theory(equality)])).
% cnf(176,negated_conjecture,(~unorthogonal_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[64,171,theory(equality)])).
% cnf(177,negated_conjecture,(~unorthogonal_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[64,172,theory(equality)])).
% cnf(194,negated_conjecture,(unorthogonal_lines(X1,esk2_0)|unorthogonal_lines(X1,esk3_0)),inference(spm,[status(thm)],[96,174,theory(equality)])).
% cnf(216,negated_conjecture,(unorthogonal_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[176,194,theory(equality)])).
% cnf(224,negated_conjecture,($false),inference(sr,[status(thm)],[216,177,theory(equality)])).
% cnf(225,negated_conjecture,($false),224,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 58
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 54
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 45
% # ...of the previous two non-trivial : 24
% # Contextual simplify-reflections : 4
% # Paramodulations : 45
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 54
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 15
% # ...number of literals in the above : 37
% # Clause-clause subsumption calls (NU) : 51
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 44 leaves, 1.64+/-1.432 terms/leaf
% # Paramod-from index: 19 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 39 leaves, 1.38+/-0.895 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.005 s
% # Total time : 0.020 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/SystemOnTPTP13064/GEO220+3.tptp
%
%------------------------------------------------------------------------------