TSTP Solution File: GEO268+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO268+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 : art03.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:25 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/SystemOnTPTP2770/GEO268+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2770/GEO268+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2770/GEO268+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 2866
% 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]:(unequally_directed_opposite_lines(X1,X2)<=>unequally_directed_lines(X1,reverse_line(X2))),file('/tmp/SRASS.s.p', a1_defns)).
% fof(4, axiom,![X3]:![X4]:(unequally_directed_lines(X3,X4)|unequally_directed_lines(X3,reverse_line(X4))),file('/tmp/SRASS.s.p', ax8_basics)).
% fof(6, 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(16, axiom,![X3]:![X4]:~((left_convergent_lines(X3,X4)|left_convergent_lines(X3,reverse_line(X4)))),file('/tmp/SRASS.s.p', ax11_basics)).
% fof(37, conjecture,![X3]:![X4]:(unequally_directed_lines(X3,X4)<=>unequally_directed_opposite_lines(X3,reverse_line(X4))),file('/tmp/SRASS.s.p', con)).
% fof(38, negated_conjecture,~(![X3]:![X4]:(unequally_directed_lines(X3,X4)<=>unequally_directed_opposite_lines(X3,reverse_line(X4)))),inference(assume_negation,[status(cth)],[37])).
% fof(47, 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)],[1])).
% fof(48, 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)],[47])).
% cnf(49,plain,(unequally_directed_opposite_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(61, plain,![X5]:![X6]:(unequally_directed_lines(X5,X6)|unequally_directed_lines(X5,reverse_line(X6))),inference(variable_rename,[status(thm)],[4])).
% cnf(62,plain,(unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)),inference(split_conjunct,[status(thm)],[61])).
% fof(69, 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)],[6])).
% fof(70, 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)],[69])).
% cnf(71,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)],[70])).
% fof(102, plain,![X3]:![X4]:(~(left_convergent_lines(X3,X4))&~(left_convergent_lines(X3,reverse_line(X4)))),inference(fof_nnf,[status(thm)],[16])).
% fof(103, plain,![X5]:![X6]:(~(left_convergent_lines(X5,X6))&~(left_convergent_lines(X5,reverse_line(X6)))),inference(variable_rename,[status(thm)],[102])).
% cnf(105,plain,(~left_convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[103])).
% fof(186, negated_conjecture,?[X3]:?[X4]:((~(unequally_directed_lines(X3,X4))|~(unequally_directed_opposite_lines(X3,reverse_line(X4))))&(unequally_directed_lines(X3,X4)|unequally_directed_opposite_lines(X3,reverse_line(X4)))),inference(fof_nnf,[status(thm)],[38])).
% fof(187, negated_conjecture,?[X5]:?[X6]:((~(unequally_directed_lines(X5,X6))|~(unequally_directed_opposite_lines(X5,reverse_line(X6))))&(unequally_directed_lines(X5,X6)|unequally_directed_opposite_lines(X5,reverse_line(X6)))),inference(variable_rename,[status(thm)],[186])).
% fof(188, negated_conjecture,((~(unequally_directed_lines(esk1_0,esk2_0))|~(unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))))&(unequally_directed_lines(esk1_0,esk2_0)|unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0)))),inference(skolemize,[status(esa)],[187])).
% cnf(189,negated_conjecture,(unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))|unequally_directed_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(190,negated_conjecture,(~unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))|~unequally_directed_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[188])).
% cnf(209,plain,(left_convergent_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[71,105,theory(equality)])).
% cnf(210,plain,(~unequally_directed_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2))),inference(sr,[status(thm)],[209,105,theory(equality)])).
% cnf(230,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk2_0)))|unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[50,189,theory(equality)])).
% cnf(261,negated_conjecture,(unequally_directed_lines(esk1_0,esk2_0)|~unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[210,230,theory(equality)])).
% cnf(262,negated_conjecture,(unequally_directed_lines(esk1_0,esk2_0)),inference(csr,[status(thm)],[261,62])).
% cnf(265,negated_conjecture,($false|~unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))),inference(rw,[status(thm)],[190,262,theory(equality)])).
% cnf(266,negated_conjecture,(~unequally_directed_opposite_lines(esk1_0,reverse_line(esk2_0))),inference(cn,[status(thm)],[265,theory(equality)])).
% cnf(268,negated_conjecture,(~unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk2_0)))),inference(spm,[status(thm)],[266,49,theory(equality)])).
% cnf(294,negated_conjecture,(unequally_directed_lines(esk1_0,reverse_line(esk2_0))),inference(spm,[status(thm)],[268,62,theory(equality)])).
% cnf(296,negated_conjecture,(~unequally_directed_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[210,294,theory(equality)])).
% cnf(297,negated_conjecture,($false),inference(rw,[status(thm)],[296,262,theory(equality)])).
% cnf(298,negated_conjecture,($false),inference(cn,[status(thm)],[297,theory(equality)])).
% cnf(299,negated_conjecture,($false),298,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 129
% # ...of these trivial : 0
% # ...subsumed : 23
% # ...remaining for further processing: 106
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 57
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 6
% # Paramodulations : 48
% # Factorizations : 6
% # 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: 20
% # ...number of literals in the above : 55
% # Clause-clause subsumption calls (NU) : 152
% # Rec. Clause-clause subsumption calls : 130
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 44 leaves, 1.66+/-1.445 terms/leaf
% # Paramod-from index: 17 leaves, 1.18+/-0.381 terms/leaf
% # Paramod-into index: 38 leaves, 1.45+/-0.880 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.006 s
% # Total time : 0.025 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/SystemOnTPTP2770/GEO268+3.tptp
%
%------------------------------------------------------------------------------