TSTP Solution File: GEO269+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO269+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 : art02.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:26:31 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/SystemOnTPTP13388/GEO269+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13388/GEO269+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13388/GEO269+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 13484
% 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(1, axiom,![X1]:![X2]:(equally_directed_opposite_lines(X1,X2)<=>~(unequally_directed_opposite_lines(X1,X2))),file('/tmp/SRASS.s.p', a5_defns)).
% fof(6, axiom,![X3]:![X4]:(unequally_directed_lines(X3,X4)|unequally_directed_lines(X3,reverse_line(X4))),file('/tmp/SRASS.s.p', ax8_basics)).
% fof(8, axiom,![X3]:![X4]:~((left_convergent_lines(X3,X4)|left_convergent_lines(X3,reverse_line(X4)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(13, axiom,![X3]:equally_directed_lines(X3,X3),file('/tmp/SRASS.s.p', ax5_basics)).
% fof(16, axiom,![X3]:![X4]:((unequally_directed_lines(X3,X4)&unequally_directed_lines(X3,reverse_line(X4)))=>(left_convergent_lines(X3,X4)|left_convergent_lines(X3,reverse_line(X4)))),file('/tmp/SRASS.s.p', ax9_basics)).
% fof(17, axiom,![X1]:![X2]:(unequally_directed_opposite_lines(X1,X2)<=>unequally_directed_lines(X1,reverse_line(X2))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(20, axiom,![X1]:![X2]:(equally_directed_lines(X1,X2)<=>~(unequally_directed_lines(X1,X2))),file('/tmp/SRASS.s.p', a4_defns)).
% fof(37, conjecture,![X3]:equally_directed_opposite_lines(X3,reverse_line(X3)),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X3]:equally_directed_opposite_lines(X3,reverse_line(X3))),inference(assume_negation,[status(cth)],[37])).
% fof(39, plain,![X1]:![X2]:(equally_directed_opposite_lines(X1,X2)<=>~(unequally_directed_opposite_lines(X1,X2))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(43, plain,![X1]:![X2]:(equally_directed_lines(X1,X2)<=>~(unequally_directed_lines(X1,X2))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(47, plain,![X1]:![X2]:((~(equally_directed_opposite_lines(X1,X2))|~(unequally_directed_opposite_lines(X1,X2)))&(unequally_directed_opposite_lines(X1,X2)|equally_directed_opposite_lines(X1,X2))),inference(fof_nnf,[status(thm)],[39])).
% fof(48, plain,![X3]:![X4]:((~(equally_directed_opposite_lines(X3,X4))|~(unequally_directed_opposite_lines(X3,X4)))&(unequally_directed_opposite_lines(X3,X4)|equally_directed_opposite_lines(X3,X4))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(equally_directed_opposite_lines(X1,X2)|unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(66, plain,![X5]:![X6]:(unequally_directed_lines(X5,X6)|unequally_directed_lines(X5,reverse_line(X6))),inference(variable_rename,[status(thm)],[6])).
% cnf(67,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(72, plain,![X3]:![X4]:(~(left_convergent_lines(X3,X4))&~(left_convergent_lines(X3,reverse_line(X4)))),inference(fof_nnf,[status(thm)],[8])).
% fof(73, plain,![X5]:![X6]:(~(left_convergent_lines(X5,X6))&~(left_convergent_lines(X5,reverse_line(X6)))),inference(variable_rename,[status(thm)],[72])).
% cnf(75,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[73])).
% fof(86, plain,![X4]:equally_directed_lines(X4,X4),inference(variable_rename,[status(thm)],[13])).
% cnf(87,plain,(equally_directed_lines(X1,X1)),inference(split_conjunct,[status(thm)],[86])).
% fof(96, plain,![X3]:![X4]:((~(unequally_directed_lines(X3,X4))|~(unequally_directed_lines(X3,reverse_line(X4))))|(left_convergent_lines(X3,X4)|left_convergent_lines(X3,reverse_line(X4)))),inference(fof_nnf,[status(thm)],[16])).
% fof(97, plain,![X5]:![X6]:((~(unequally_directed_lines(X5,X6))|~(unequally_directed_lines(X5,reverse_line(X6))))|(left_convergent_lines(X5,X6)|left_convergent_lines(X5,reverse_line(X6)))),inference(variable_rename,[status(thm)],[96])).
% cnf(98,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)],[97])).
% fof(99, plain,![X1]:![X2]:((~(unequally_directed_opposite_lines(X1,X2))|unequally_directed_lines(X1,reverse_line(X2)))&(~(unequally_directed_lines(X1,reverse_line(X2)))|unequally_directed_opposite_lines(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(100, plain,![X3]:![X4]:((~(unequally_directed_opposite_lines(X3,X4))|unequally_directed_lines(X3,reverse_line(X4)))&(~(unequally_directed_lines(X3,reverse_line(X4)))|unequally_directed_opposite_lines(X3,X4))),inference(variable_rename,[status(thm)],[99])).
% cnf(102,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[100])).
% fof(109, plain,![X1]:![X2]:((~(equally_directed_lines(X1,X2))|~(unequally_directed_lines(X1,X2)))&(unequally_directed_lines(X1,X2)|equally_directed_lines(X1,X2))),inference(fof_nnf,[status(thm)],[43])).
% fof(110, plain,![X3]:![X4]:((~(equally_directed_lines(X3,X4))|~(unequally_directed_lines(X3,X4)))&(unequally_directed_lines(X3,X4)|equally_directed_lines(X3,X4))),inference(variable_rename,[status(thm)],[109])).
% cnf(112,plain,(~unequally_directed_lines(X1,X2)|~equally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[110])).
% fof(186, negated_conjecture,?[X3]:~(equally_directed_opposite_lines(X3,reverse_line(X3))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X4]:~(equally_directed_opposite_lines(X4,reverse_line(X4))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,~(equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(~equally_directed_opposite_lines(esk1_0,reverse_line(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)],[98,75,theory(equality)])).
% cnf(209,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[208,75,theory(equality)])).
% cnf(229,negated_conjecture,(unequally_directed_opposite_lines(esk1_0,reverse_line(esk1_0))),inference(spm,[status(thm)],[189,49,theory(equality)])).
% cnf(233,plain,(~unequally_directed_lines(X1,X1)),inference(spm,[status(thm)],[112,87,theory(equality)])).
% cnf(254,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0)))),inference(spm,[status(thm)],[102,229,theory(equality)])).
% cnf(256,negated_conjecture,(~unequally_directed_lines(esk1_0,reverse_line(esk1_0))),inference(spm,[status(thm)],[209,254,theory(equality)])).
% cnf(267,negated_conjecture,(unequally_directed_lines(esk1_0,esk1_0)),inference(spm,[status(thm)],[256,67,theory(equality)])).
% cnf(268,negated_conjecture,($false),inference(sr,[status(thm)],[267,233,theory(equality)])).
% cnf(269,negated_conjecture,($false),268,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 125
% # ...of these trivial : 0
% # ...subsumed : 23
% # ...remaining for further processing: 102
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 40
% # ...of the previous two non-trivial : 23
% # Contextual simplify-reflections : 5
% # Paramodulations : 37
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 51
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 33
% # Clause-clause subsumption calls (NU) : 148
% # Rec. Clause-clause subsumption calls : 127
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 1.65+/-1.412 terms/leaf
% # Paramod-from index: 16 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 37 leaves, 1.41+/-0.787 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.003 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/SystemOnTPTP13388/GEO269+3.tptp
%
%------------------------------------------------------------------------------