TSTP Solution File: GEO231+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO231+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 : art07.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:09 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/SystemOnTPTP16963/GEO231+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16963/GEO231+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16963/GEO231+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 17059
% 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(2, axiom,![X2]:![X3]:(equally_directed_lines(X2,X3)<=>~(unequally_directed_lines(X2,X3))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(3, axiom,![X2]:![X3]:(equally_directed_opposite_lines(X2,X3)<=>~(unequally_directed_opposite_lines(X2,X3))),file('/tmp/SRASS.s.p', a5_defns)).
% fof(6, 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(21, axiom,![X2]:![X3]:(unequally_directed_opposite_lines(X2,X3)<=>unequally_directed_lines(X2,reverse_line(X3))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(23, 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(24, axiom,![X1]:![X7]:~((left_convergent_lines(X1,X7)|left_convergent_lines(X1,reverse_line(X7)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(37, conjecture,![X1]:![X7]:![X8]:((equally_directed_opposite_lines(X1,X7)&equally_directed_lines(X1,X8))=>equally_directed_opposite_lines(X7,X8)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X1]:![X7]:![X8]:((equally_directed_opposite_lines(X1,X7)&equally_directed_lines(X1,X8))=>equally_directed_opposite_lines(X7,X8))),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(40, plain,![X2]:![X3]:(equally_directed_opposite_lines(X2,X3)<=>~(unequally_directed_opposite_lines(X2,X3))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% 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(52,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(53, plain,![X2]:![X3]:((~(equally_directed_opposite_lines(X2,X3))|~(unequally_directed_opposite_lines(X2,X3)))&(unequally_directed_opposite_lines(X2,X3)|equally_directed_opposite_lines(X2,X3))),inference(fof_nnf,[status(thm)],[40])).
% fof(54, plain,![X4]:![X5]:((~(equally_directed_opposite_lines(X4,X5))|~(unequally_directed_opposite_lines(X4,X5)))&(unequally_directed_opposite_lines(X4,X5)|equally_directed_opposite_lines(X4,X5))),inference(variable_rename,[status(thm)],[53])).
% cnf(55,plain,(equally_directed_opposite_lines(X1,X2)|unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(~unequally_directed_opposite_lines(X1,X2)|~equally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(62, plain,![X1]:![X7]:![X8]:(~(unequally_directed_lines(X1,X7))|(unequally_directed_lines(X1,X8)|unequally_directed_lines(X7,X8))),inference(fof_nnf,[status(thm)],[6])).
% fof(63, plain,![X9]:![X10]:![X11]:(~(unequally_directed_lines(X9,X10))|(unequally_directed_lines(X9,X11)|unequally_directed_lines(X10,X11))),inference(variable_rename,[status(thm)],[62])).
% cnf(64,plain,(unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X3,X1)),inference(split_conjunct,[status(thm)],[63])).
% fof(82, plain,![X8]:![X9]:(unequally_directed_lines(X8,X9)|unequally_directed_lines(X8,reverse_line(X9))),inference(variable_rename,[status(thm)],[11])).
% cnf(83,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(115, plain,![X2]:![X3]:((~(unequally_directed_opposite_lines(X2,X3))|unequally_directed_lines(X2,reverse_line(X3)))&(~(unequally_directed_lines(X2,reverse_line(X3)))|unequally_directed_opposite_lines(X2,X3))),inference(fof_nnf,[status(thm)],[21])).
% fof(116, 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(variable_rename,[status(thm)],[115])).
% cnf(117,plain,(unequally_directed_opposite_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[116])).
% fof(127, 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)],[23])).
% fof(128, 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)],[127])).
% cnf(129,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)],[128])).
% fof(130, plain,![X1]:![X7]:(~(left_convergent_lines(X1,X7))&~(left_convergent_lines(X1,reverse_line(X7)))),inference(fof_nnf,[status(thm)],[24])).
% fof(131, plain,![X8]:![X9]:(~(left_convergent_lines(X8,X9))&~(left_convergent_lines(X8,reverse_line(X9)))),inference(variable_rename,[status(thm)],[130])).
% cnf(133,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[131])).
% fof(186, negated_conjecture,?[X1]:?[X7]:?[X8]:((equally_directed_opposite_lines(X1,X7)&equally_directed_lines(X1,X8))&~(equally_directed_opposite_lines(X7,X8))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X9]:?[X10]:?[X11]:((equally_directed_opposite_lines(X9,X10)&equally_directed_lines(X9,X11))&~(equally_directed_opposite_lines(X10,X11))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,((equally_directed_opposite_lines(esk1_0,esk2_0)&equally_directed_lines(esk1_0,esk3_0))&~(equally_directed_opposite_lines(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~equally_directed_opposite_lines(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(equally_directed_lines(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(191,negated_conjecture,(equally_directed_opposite_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(213,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[129,133,theory(equality)])).
% cnf(214,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[213,133,theory(equality)])).
% cnf(231,negated_conjecture,(unequally_directed_opposite_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[189,55,theory(equality)])).
% cnf(232,negated_conjecture,(~unequally_directed_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[52,190,theory(equality)])).
% cnf(236,negated_conjecture,(~unequally_directed_opposite_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[56,191,theory(equality)])).
% cnf(258,negated_conjecture,(unequally_directed_lines(esk2_0,reverse_line(esk3_0))),inference(spm,[status(thm)],[118,231,theory(equality)])).
% cnf(260,negated_conjecture,(~unequally_directed_lines(esk2_0,esk3_0)),inference(spm,[status(thm)],[214,258,theory(equality)])).
% cnf(262,negated_conjecture,(~unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[236,117,theory(equality)])).
% cnf(275,negated_conjecture,(unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[262,83,theory(equality)])).
% cnf(280,negated_conjecture,(unequally_directed_lines(esk1_0,X1)|unequally_directed_lines(esk2_0,X1)),inference(spm,[status(thm)],[64,275,theory(equality)])).
% cnf(287,negated_conjecture,(unequally_directed_lines(esk1_0,esk3_0)),inference(spm,[status(thm)],[260,280,theory(equality)])).
% cnf(289,negated_conjecture,($false),inference(sr,[status(thm)],[287,232,theory(equality)])).
% cnf(290,negated_conjecture,($false),289,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 139
% # ...of these trivial : 0
% # ...subsumed : 24
% # ...remaining for further processing: 115
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 58
% # ...of the previous two non-trivial : 40
% # Contextual simplify-reflections : 5
% # Paramodulations : 55
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 16
% # Non-unit-clauses : 36
% # Current number of unprocessed clauses: 20
% # ...number of literals in the above : 47
% # Clause-clause subsumption calls (NU) : 150
% # Rec. Clause-clause subsumption calls : 127
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 56 leaves, 1.52+/-1.268 terms/leaf
% # Paramod-from index: 21 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 50 leaves, 1.32+/-0.705 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.003 s
% # Total time : 0.024 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/SystemOnTPTP16963/GEO231+3.tptp
%
%------------------------------------------------------------------------------