TSTP Solution File: GEO233+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO233+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 : art04.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:51 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/SystemOnTPTP16188/GEO233+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16188/GEO233+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16188/GEO233+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 16284
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:equally_directed_lines(X1,X1),file('/tmp/SRASS.s.p', ax5_basics)).
% fof(2, axiom,![X2]:![X3]:(equally_directed_lines(X2,X3)<=>~(unequally_directed_lines(X2,X3))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(7, axiom,![X1]:![X7]:![X8]:(unequally_directed_lines(X1,X7)=>(unequally_directed_lines(X1,X8)|unequally_directed_lines(X7,X8))),file('/tmp/SRASS.s.p', ax6_basics)).
% fof(11, axiom,![X1]:![X7]:(unequally_directed_lines(X1,X7)|unequally_directed_lines(X1,reverse_line(X7))),file('/tmp/SRASS.s.p', ax8_basics)).
% fof(13, axiom,![X1]:![X7]:~((left_convergent_lines(X1,X7)|left_convergent_lines(X1,reverse_line(X7)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(19, axiom,![X1]:![X7]:((unequally_directed_lines(X1,X7)&unequally_directed_lines(X1,reverse_line(X7)))=>(left_convergent_lines(X1,X7)|left_convergent_lines(X1,reverse_line(X7)))),file('/tmp/SRASS.s.p', ax9_basics)).
% fof(37, conjecture,![X1]:equally_directed_lines(reverse_line(reverse_line(X1)),X1),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:equally_directed_lines(reverse_line(reverse_line(X1)),X1)),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(47, plain,![X2]:equally_directed_lines(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(48,plain,(equally_directed_lines(X1,X1)),inference(split_conjunct,[status(thm)],[47])).
% 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(51,plain,(equally_directed_lines(X1,X2)|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(63, plain,![X1]:![X7]:![X8]:(~(unequally_directed_lines(X1,X7))|(unequally_directed_lines(X1,X8)|unequally_directed_lines(X7,X8))),inference(fof_nnf,[status(thm)],[7])).
% fof(64, plain,![X9]:![X10]:![X11]:(~(unequally_directed_lines(X9,X10))|(unequally_directed_lines(X9,X11)|unequally_directed_lines(X10,X11))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X3,X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(78, plain,![X8]:![X9]:(unequally_directed_lines(X8,X9)|unequally_directed_lines(X8,reverse_line(X9))),inference(variable_rename,[status(thm)],[11])).
% cnf(79,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[78])).
% fof(84, plain,![X1]:![X7]:(~(left_convergent_lines(X1,X7))&~(left_convergent_lines(X1,reverse_line(X7)))),inference(fof_nnf,[status(thm)],[13])).
% fof(85, plain,![X8]:![X9]:(~(left_convergent_lines(X8,X9))&~(left_convergent_lines(X8,reverse_line(X9)))),inference(variable_rename,[status(thm)],[84])).
% cnf(87,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[85])).
% fof(106, plain,![X1]:![X7]:((~(unequally_directed_lines(X1,X7))|~(unequally_directed_lines(X1,reverse_line(X7))))|(left_convergent_lines(X1,X7)|left_convergent_lines(X1,reverse_line(X7)))),inference(fof_nnf,[status(thm)],[19])).
% fof(107, plain,![X8]:![X9]:((~(unequally_directed_lines(X8,X9))|~(unequally_directed_lines(X8,reverse_line(X9))))|(left_convergent_lines(X8,X9)|left_convergent_lines(X8,reverse_line(X9)))),inference(variable_rename,[status(thm)],[106])).
% cnf(108,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)],[107])).
% fof(186, negated_conjecture,?[X1]:~(equally_directed_lines(reverse_line(reverse_line(X1)),X1)),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X2]:~(equally_directed_lines(reverse_line(reverse_line(X2)),X2)),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,~(equally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0)),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~equally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(208,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[108,87,theory(equality)])).
% cnf(209,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[208,87,theory(equality)])).
% cnf(229,negated_conjecture,(unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0)),inference(spm,[status(thm)],[189,51,theory(equality)])).
% cnf(231,plain,(~unequally_directed_lines(X1,X1)),inference(spm,[status(thm)],[52,48,theory(equality)])).
% cnf(254,negated_conjecture,(unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1)|unequally_directed_lines(esk1_0,X1)),inference(spm,[status(thm)],[65,229,theory(equality)])).
% cnf(260,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0)))),inference(spm,[status(thm)],[231,254,theory(equality)])).
% cnf(262,negated_conjecture,(~unequally_directed_lines(esk1_0,reverse_line(esk1_0))),inference(spm,[status(thm)],[209,260,theory(equality)])).
% cnf(263,negated_conjecture,(unequally_directed_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[262,79,theory(equality)])).
% cnf(264,negated_conjecture,($false),inference(sr,[status(thm)],[263,231,theory(equality)])).
% cnf(265,negated_conjecture,($false),264,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 125
% # ...of these trivial : 0
% # ...subsumed : 24
% # ...remaining for further processing: 101
% # 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 : 12
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 29
% # Clause-clause subsumption calls (NU) : 147
% # Rec. Clause-clause subsumption calls : 126
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # 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: 37 leaves, 1.38+/-0.783 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP16188/GEO233+3.tptp
%
%------------------------------------------------------------------------------