TSTP Solution File: GEO232+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO232+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:19:34 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/SystemOnTPTP23800/GEO232+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23800/GEO232+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23800/GEO232+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 23896
% 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(3, axiom,![X1]:![X2]:(unequally_directed_lines(X1,X2)|unequally_directed_lines(X1,reverse_line(X2))),file('/tmp/SRASS.s.p', ax8_basics)).
% fof(5, axiom,![X4]:![X5]:(unequally_directed_opposite_lines(X4,X5)<=>unequally_directed_lines(X4,reverse_line(X5))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(9, axiom,![X1]:equally_directed_lines(X1,X1),file('/tmp/SRASS.s.p', ax5_basics)).
% fof(13, axiom,![X4]:![X5]:(equally_directed_lines(X4,X5)<=>~(unequally_directed_lines(X4,X5))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(37, conjecture,![X1]:unequally_directed_opposite_lines(X1,X1),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:unequally_directed_opposite_lines(X1,X1)),inference(assume_negation,[status(cth)],[37])).
% fof(42, plain,![X4]:![X5]:(equally_directed_lines(X4,X5)<=>~(unequally_directed_lines(X4,X5))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(57, plain,![X3]:![X4]:(unequally_directed_lines(X3,X4)|unequally_directed_lines(X3,reverse_line(X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(58,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[57])).
% fof(63, 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)],[5])).
% fof(64, 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)],[63])).
% cnf(65,plain,(unequally_directed_opposite_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(split_conjunct,[status(thm)],[64])).
% fof(78, plain,![X2]:equally_directed_lines(X2,X2),inference(variable_rename,[status(thm)],[9])).
% cnf(79,plain,(equally_directed_lines(X1,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(88, 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)],[42])).
% fof(89, 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)],[88])).
% cnf(91,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[89])).
% fof(186, negated_conjecture,?[X1]:~(unequally_directed_opposite_lines(X1,X1)),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X2]:~(unequally_directed_opposite_lines(X2,X2)),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,~(unequally_directed_opposite_lines(esk1_0,esk1_0)),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~unequally_directed_opposite_lines(esk1_0,esk1_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(229,negated_conjecture,(~unequally_directed_lines(esk1_0,reverse_line(esk1_0))),inference(spm,[status(thm)],[189,65,theory(equality)])).
% cnf(233,plain,(~unequally_directed_lines(X1,X1)),inference(spm,[status(thm)],[91,79,theory(equality)])).
% cnf(257,negated_conjecture,(unequally_directed_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[229,58,theory(equality)])).
% cnf(258,negated_conjecture,($false),inference(sr,[status(thm)],[257,233,theory(equality)])).
% cnf(259,negated_conjecture,($false),258,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 121
% # ...of these trivial : 0
% # ...subsumed : 23
% # ...remaining for further processing: 98
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 31
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections : 5
% # Paramodulations : 28
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 47
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 24
% # Clause-clause subsumption calls (NU) : 142
% # Rec. Clause-clause subsumption calls : 121
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 38 leaves, 1.71+/-1.485 terms/leaf
% # Paramod-from index: 13 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-into index: 33 leaves, 1.42+/-0.818 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.001 s
% # Total time : 0.023 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/SystemOnTPTP23800/GEO232+3.tptp
%
%------------------------------------------------------------------------------