TSTP Solution File: GRA002+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA002+4 : TPTP v5.0.0. Bugfixed v3.2.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:40:23 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP30071/GRA002+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30071/GRA002+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30071/GRA002+4.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 30167
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),file('/tmp/SRASS.s.p', graph_has_them_all)).
% fof(2, axiom,![X3]:![X4]:![X5]:(shortest_path(X3,X4,X5)<=>((path(X3,X4,X5)&~(X3=X4))&![X6]:(path(X3,X4,X6)=>less_or_equal(length_of(X5),length_of(X6))))),file('/tmp/SRASS.s.p', shortest_path_defn)).
% fof(3, axiom,(complete=>![X6]:![X3]:![X4]:(shortest_path(X3,X4,X6)=>number_of_in(sequential_pairs,X6)=number_of_in(triangles,X6))),file('/tmp/SRASS.s.p', triangles_and_sequential_pairs)).
% fof(4, axiom,![X3]:![X4]:![X6]:(path(X3,X4,X6)=>number_of_in(sequential_pairs,X6)=minus(length_of(X6),n1)),file('/tmp/SRASS.s.p', path_length_sequential_pairs)).
% fof(5, axiom,![X3]:![X4]:![X6]:(path(X3,X4,X6)=>length_of(X6)=number_of_in(edges,X6)),file('/tmp/SRASS.s.p', length_defn)).
% fof(19, conjecture,(complete=>![X6]:![X3]:![X4]:(shortest_path(X3,X4,X6)=>less_or_equal(minus(length_of(X6),n1),number_of_in(triangles,graph)))),file('/tmp/SRASS.s.p', maximal_path_length)).
% fof(20, negated_conjecture,~((complete=>![X6]:![X3]:![X4]:(shortest_path(X3,X4,X6)=>less_or_equal(minus(length_of(X6),n1),number_of_in(triangles,graph))))),inference(assume_negation,[status(cth)],[19])).
% fof(27, plain,![X3]:![X4]:less_or_equal(number_of_in(X3,X4),number_of_in(X3,graph)),inference(variable_rename,[status(thm)],[1])).
% cnf(28,plain,(less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph))),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:![X5]:((~(shortest_path(X3,X4,X5))|((path(X3,X4,X5)&~(X3=X4))&![X6]:(~(path(X3,X4,X6))|less_or_equal(length_of(X5),length_of(X6)))))&(((~(path(X3,X4,X5))|X3=X4)|?[X6]:(path(X3,X4,X6)&~(less_or_equal(length_of(X5),length_of(X6)))))|shortest_path(X3,X4,X5))),inference(fof_nnf,[status(thm)],[2])).
% fof(30, plain,![X7]:![X8]:![X9]:((~(shortest_path(X7,X8,X9))|((path(X7,X8,X9)&~(X7=X8))&![X10]:(~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))))&(((~(path(X7,X8,X9))|X7=X8)|?[X11]:(path(X7,X8,X11)&~(less_or_equal(length_of(X9),length_of(X11)))))|shortest_path(X7,X8,X9))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X7]:![X8]:![X9]:((~(shortest_path(X7,X8,X9))|((path(X7,X8,X9)&~(X7=X8))&![X10]:(~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))))&(((~(path(X7,X8,X9))|X7=X8)|(path(X7,X8,esk1_3(X7,X8,X9))&~(less_or_equal(length_of(X9),length_of(esk1_3(X7,X8,X9))))))|shortest_path(X7,X8,X9))),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X7]:![X8]:![X9]:![X10]:((((~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))&(path(X7,X8,X9)&~(X7=X8)))|~(shortest_path(X7,X8,X9)))&(((~(path(X7,X8,X9))|X7=X8)|(path(X7,X8,esk1_3(X7,X8,X9))&~(less_or_equal(length_of(X9),length_of(esk1_3(X7,X8,X9))))))|shortest_path(X7,X8,X9))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X7]:![X8]:![X9]:![X10]:((((~(path(X7,X8,X10))|less_or_equal(length_of(X9),length_of(X10)))|~(shortest_path(X7,X8,X9)))&((path(X7,X8,X9)|~(shortest_path(X7,X8,X9)))&(~(X7=X8)|~(shortest_path(X7,X8,X9)))))&(((path(X7,X8,esk1_3(X7,X8,X9))|(~(path(X7,X8,X9))|X7=X8))|shortest_path(X7,X8,X9))&((~(less_or_equal(length_of(X9),length_of(esk1_3(X7,X8,X9))))|(~(path(X7,X8,X9))|X7=X8))|shortest_path(X7,X8,X9)))),inference(distribute,[status(thm)],[32])).
% cnf(37,plain,(path(X1,X2,X3)|~shortest_path(X1,X2,X3)),inference(split_conjunct,[status(thm)],[33])).
% fof(39, plain,(~(complete)|![X6]:![X3]:![X4]:(~(shortest_path(X3,X4,X6))|number_of_in(sequential_pairs,X6)=number_of_in(triangles,X6))),inference(fof_nnf,[status(thm)],[3])).
% fof(40, plain,(~(complete)|![X7]:![X8]:![X9]:(~(shortest_path(X8,X9,X7))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X7]:![X8]:![X9]:((~(shortest_path(X8,X9,X7))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7))|~(complete)),inference(shift_quantors,[status(thm)],[40])).
% cnf(42,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|~complete|~shortest_path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:![X6]:(~(path(X3,X4,X6))|number_of_in(sequential_pairs,X6)=minus(length_of(X6),n1)),inference(fof_nnf,[status(thm)],[4])).
% fof(44, plain,![X7]:![X8]:![X9]:(~(path(X7,X8,X9))|number_of_in(sequential_pairs,X9)=minus(length_of(X9),n1)),inference(variable_rename,[status(thm)],[43])).
% cnf(45,plain,(number_of_in(sequential_pairs,X1)=minus(length_of(X1),n1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X3]:![X4]:![X6]:(~(path(X3,X4,X6))|length_of(X6)=number_of_in(edges,X6)),inference(fof_nnf,[status(thm)],[5])).
% fof(47, plain,![X7]:![X8]:![X9]:(~(path(X7,X8,X9))|length_of(X9)=number_of_in(edges,X9)),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(length_of(X1)=number_of_in(edges,X1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(150, negated_conjecture,(complete&?[X6]:?[X3]:?[X4]:(shortest_path(X3,X4,X6)&~(less_or_equal(minus(length_of(X6),n1),number_of_in(triangles,graph))))),inference(fof_nnf,[status(thm)],[20])).
% fof(151, negated_conjecture,(complete&?[X7]:?[X8]:?[X9]:(shortest_path(X8,X9,X7)&~(less_or_equal(minus(length_of(X7),n1),number_of_in(triangles,graph))))),inference(variable_rename,[status(thm)],[150])).
% fof(152, negated_conjecture,(complete&(shortest_path(esk10_0,esk11_0,esk9_0)&~(less_or_equal(minus(length_of(esk9_0),n1),number_of_in(triangles,graph))))),inference(skolemize,[status(esa)],[151])).
% cnf(153,negated_conjecture,(~less_or_equal(minus(length_of(esk9_0),n1),number_of_in(triangles,graph))),inference(split_conjunct,[status(thm)],[152])).
% cnf(154,negated_conjecture,(shortest_path(esk10_0,esk11_0,esk9_0)),inference(split_conjunct,[status(thm)],[152])).
% cnf(155,negated_conjecture,(complete),inference(split_conjunct,[status(thm)],[152])).
% cnf(158,plain,(number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|$false|~shortest_path(X2,X3,X1)),inference(rw,[status(thm)],[42,155,theory(equality)])).
% cnf(159,plain,(number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~shortest_path(X2,X3,X1)),inference(cn,[status(thm)],[158,theory(equality)])).
% cnf(175,negated_conjecture,(number_of_in(triangles,esk9_0)=number_of_in(sequential_pairs,esk9_0)),inference(spm,[status(thm)],[159,154,theory(equality)])).
% cnf(176,negated_conjecture,(path(esk10_0,esk11_0,esk9_0)),inference(spm,[status(thm)],[37,154,theory(equality)])).
% cnf(256,negated_conjecture,(less_or_equal(number_of_in(sequential_pairs,esk9_0),number_of_in(triangles,graph))),inference(spm,[status(thm)],[28,175,theory(equality)])).
% cnf(258,negated_conjecture,(length_of(esk9_0)=number_of_in(edges,esk9_0)),inference(spm,[status(thm)],[48,176,theory(equality)])).
% cnf(259,negated_conjecture,(minus(length_of(esk9_0),n1)=number_of_in(sequential_pairs,esk9_0)),inference(spm,[status(thm)],[45,176,theory(equality)])).
% cnf(269,negated_conjecture,(~less_or_equal(minus(number_of_in(edges,esk9_0),n1),number_of_in(triangles,graph))),inference(rw,[status(thm)],[153,258,theory(equality)])).
% cnf(278,negated_conjecture,(minus(number_of_in(edges,esk9_0),n1)=number_of_in(sequential_pairs,esk9_0)),inference(rw,[status(thm)],[259,258,theory(equality)])).
% cnf(279,negated_conjecture,(~less_or_equal(number_of_in(sequential_pairs,esk9_0),number_of_in(triangles,graph))),inference(rw,[status(thm)],[269,278,theory(equality)])).
% cnf(284,negated_conjecture,($false),inference(sr,[status(thm)],[256,279,theory(equality)])).
% cnf(285,negated_conjecture,($false),284,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 149
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 147
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 104
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections : 9
% # Paramodulations : 96
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 80
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 69
% # ...number of literals in the above : 303
% # Clause-clause subsumption calls (NU) : 242
% # Rec. Clause-clause subsumption calls : 118
% # Unit Clause-clause subsumption calls : 40
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 89 leaves, 1.96+/-2.731 terms/leaf
% # Paramod-from index: 26 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 72 leaves, 1.43+/-1.245 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.005 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP30071/GRA002+4.tptp
%
%------------------------------------------------------------------------------