TSTP Solution File: GRA010+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA010+1 : TPTP v5.0.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:41:16 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP31895/GRA010+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31895/GRA010+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31895/GRA010+1.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 31991
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:![X2]:![X3]:((path(X2,X3,X1)&![X4]:![X5]:(((on_path(X4,X1)&on_path(X5,X1))&sequential(X4,X5))=>?[X6]:triangle(X4,X5,X6)))=>number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)),file('/tmp/SRASS.s.p', sequential_pairs_and_triangles)).
% fof(18, conjecture,(complete=>![X1]:![X2]:![X3]:((path(X2,X3,X1)&![X4]:![X5]:(((on_path(X4,X1)&on_path(X5,X1))&sequential(X4,X5))=>?[X6]:triangle(X4,X5,X6)))=>number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1))),file('/tmp/SRASS.s.p', complete_means_sequential_pairs_and_triangles)).
% fof(19, negated_conjecture,~((complete=>![X1]:![X2]:![X3]:((path(X2,X3,X1)&![X4]:![X5]:(((on_path(X4,X1)&on_path(X5,X1))&sequential(X4,X5))=>?[X6]:triangle(X4,X5,X6)))=>number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)))),inference(assume_negation,[status(cth)],[18])).
% fof(26, plain,![X1]:![X2]:![X3]:((~(path(X2,X3,X1))|?[X4]:?[X5]:(((on_path(X4,X1)&on_path(X5,X1))&sequential(X4,X5))&![X6]:~(triangle(X4,X5,X6))))|number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(27, plain,![X7]:![X8]:![X9]:((~(path(X8,X9,X7))|?[X10]:?[X11]:(((on_path(X10,X7)&on_path(X11,X7))&sequential(X10,X11))&![X12]:~(triangle(X10,X11,X12))))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7)),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X7]:![X8]:![X9]:((~(path(X8,X9,X7))|(((on_path(esk1_3(X7,X8,X9),X7)&on_path(esk2_3(X7,X8,X9),X7))&sequential(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9)))&![X12]:~(triangle(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9),X12))))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7)),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X7]:![X8]:![X9]:![X12]:(((~(triangle(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9),X12))&((on_path(esk1_3(X7,X8,X9),X7)&on_path(esk2_3(X7,X8,X9),X7))&sequential(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9))))|~(path(X8,X9,X7)))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7)),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X7]:![X8]:![X9]:![X12]:(((~(triangle(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9),X12))|~(path(X8,X9,X7)))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7))&((((on_path(esk1_3(X7,X8,X9),X7)|~(path(X8,X9,X7)))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7))&((on_path(esk2_3(X7,X8,X9),X7)|~(path(X8,X9,X7)))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7)))&((sequential(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9))|~(path(X8,X9,X7)))|number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7)))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|sequential(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|on_path(esk2_3(X1,X2,X3),X1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|on_path(esk1_3(X1,X2,X3),X1)|~path(X2,X3,X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(34,plain,(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)|~path(X2,X3,X1)|~triangle(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3),X4)),inference(split_conjunct,[status(thm)],[30])).
% fof(145, negated_conjecture,(complete&?[X1]:?[X2]:?[X3]:((path(X2,X3,X1)&![X4]:![X5]:(((~(on_path(X4,X1))|~(on_path(X5,X1)))|~(sequential(X4,X5)))|?[X6]:triangle(X4,X5,X6)))&~(number_of_in(sequential_pairs,X1)=number_of_in(triangles,X1)))),inference(fof_nnf,[status(thm)],[19])).
% fof(146, negated_conjecture,(complete&?[X7]:?[X8]:?[X9]:((path(X8,X9,X7)&![X10]:![X11]:(((~(on_path(X10,X7))|~(on_path(X11,X7)))|~(sequential(X10,X11)))|?[X12]:triangle(X10,X11,X12)))&~(number_of_in(sequential_pairs,X7)=number_of_in(triangles,X7)))),inference(variable_rename,[status(thm)],[145])).
% fof(147, negated_conjecture,(complete&((path(esk10_0,esk11_0,esk9_0)&![X10]:![X11]:(((~(on_path(X10,esk9_0))|~(on_path(X11,esk9_0)))|~(sequential(X10,X11)))|triangle(X10,X11,esk12_2(X10,X11))))&~(number_of_in(sequential_pairs,esk9_0)=number_of_in(triangles,esk9_0)))),inference(skolemize,[status(esa)],[146])).
% fof(148, negated_conjecture,![X10]:![X11]:((((((~(on_path(X10,esk9_0))|~(on_path(X11,esk9_0)))|~(sequential(X10,X11)))|triangle(X10,X11,esk12_2(X10,X11)))&path(esk10_0,esk11_0,esk9_0))&~(number_of_in(sequential_pairs,esk9_0)=number_of_in(triangles,esk9_0)))&complete),inference(shift_quantors,[status(thm)],[147])).
% cnf(150,negated_conjecture,(number_of_in(sequential_pairs,esk9_0)!=number_of_in(triangles,esk9_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(151,negated_conjecture,(path(esk10_0,esk11_0,esk9_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(152,negated_conjecture,(triangle(X1,X2,esk12_2(X1,X2))|~sequential(X1,X2)|~on_path(X2,esk9_0)|~on_path(X1,esk9_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(213,negated_conjecture,(number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~path(X2,X3,X1)|~sequential(esk1_3(X1,X2,X3),esk2_3(X1,X2,X3))|~on_path(esk2_3(X1,X2,X3),esk9_0)|~on_path(esk1_3(X1,X2,X3),esk9_0)),inference(spm,[status(thm)],[34,152,theory(equality)])).
% cnf(816,negated_conjecture,(number_of_in(triangles,X1)=number_of_in(sequential_pairs,X1)|~on_path(esk2_3(X1,X2,X3),esk9_0)|~on_path(esk1_3(X1,X2,X3),esk9_0)|~path(X2,X3,X1)),inference(csr,[status(thm)],[213,31])).
% cnf(817,negated_conjecture,(number_of_in(triangles,esk9_0)=number_of_in(sequential_pairs,esk9_0)|~on_path(esk1_3(esk9_0,X1,X2),esk9_0)|~path(X1,X2,esk9_0)),inference(spm,[status(thm)],[816,32,theory(equality)])).
% cnf(818,negated_conjecture,(~on_path(esk1_3(esk9_0,X1,X2),esk9_0)|~path(X1,X2,esk9_0)),inference(sr,[status(thm)],[817,150,theory(equality)])).
% cnf(819,negated_conjecture,(number_of_in(triangles,esk9_0)=number_of_in(sequential_pairs,esk9_0)|~path(X1,X2,esk9_0)),inference(spm,[status(thm)],[818,33,theory(equality)])).
% cnf(820,negated_conjecture,(~path(X1,X2,esk9_0)),inference(sr,[status(thm)],[819,150,theory(equality)])).
% cnf(821,negated_conjecture,($false),inference(sr,[status(thm)],[151,820,theory(equality)])).
% cnf(822,negated_conjecture,($false),821,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 308
% # ...of these trivial : 2
% # ...subsumed : 39
% # ...remaining for further processing: 267
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 2
% # Generated clauses : 490
% # ...of the previous two non-trivial : 419
% # Contextual simplify-reflections : 94
% # Paramodulations : 468
% # Factorizations : 14
% # Equation resolutions : 4
% # Current number of processed clauses: 194
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 182
% # Current number of unprocessed clauses: 233
% # ...number of literals in the above : 1535
% # Clause-clause subsumption calls (NU) : 1379
% # Rec. Clause-clause subsumption calls : 648
% # Unit Clause-clause subsumption calls : 219
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 188 leaves, 1.63+/-1.865 terms/leaf
% # Paramod-from index: 64 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 151 leaves, 1.36+/-1.044 terms/leaf
% # -------------------------------------------------
% # User time : 0.062 s
% # System time : 0.005 s
% # Total time : 0.067 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.28 WC
% FINAL PrfWatch: 0.19 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP31895/GRA010+1.tptp
%
%------------------------------------------------------------------------------