↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU089+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art04.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 : Thu Dec 30 01:00:22 EST 2010

% Result   : Theorem 1.05s
% Output   : Solution 1.05s
% 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/SystemOnTPTP1422/SEU089+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1422/SEU089+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1422/SEU089+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 1520
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:((finite(X1)&finite(X2))=>finite(cartesian_product2(X1,X2))),file('/tmp/SRASS.s.p', fc14_finset_1)).
% fof(13, axiom,![X1]:![X2]:![X3]:cartesian_product3(X1,X2,X3)=cartesian_product2(cartesian_product2(X1,X2),X3),file('/tmp/SRASS.s.p', d3_zfmisc_1)).
% fof(60, conjecture,![X1]:![X2]:![X3]:(((finite(X1)&finite(X2))&finite(X3))=>finite(cartesian_product3(X1,X2,X3))),file('/tmp/SRASS.s.p', t20_finset_1)).
% fof(61, negated_conjecture,~(![X1]:![X2]:![X3]:(((finite(X1)&finite(X2))&finite(X3))=>finite(cartesian_product3(X1,X2,X3)))),inference(assume_negation,[status(cth)],[60])).
% fof(94, plain,![X1]:![X2]:((~(finite(X1))|~(finite(X2)))|finite(cartesian_product2(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(95, plain,![X3]:![X4]:((~(finite(X3))|~(finite(X4)))|finite(cartesian_product2(X3,X4))),inference(variable_rename,[status(thm)],[94])).
% cnf(96,plain,(finite(cartesian_product2(X1,X2))|~finite(X2)|~finite(X1)),inference(split_conjunct,[status(thm)],[95])).
% fof(117, plain,![X4]:![X5]:![X6]:cartesian_product3(X4,X5,X6)=cartesian_product2(cartesian_product2(X4,X5),X6),inference(variable_rename,[status(thm)],[13])).
% cnf(118,plain,(cartesian_product3(X1,X2,X3)=cartesian_product2(cartesian_product2(X1,X2),X3)),inference(split_conjunct,[status(thm)],[117])).
% fof(335, negated_conjecture,?[X1]:?[X2]:?[X3]:(((finite(X1)&finite(X2))&finite(X3))&~(finite(cartesian_product3(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[61])).
% fof(336, negated_conjecture,?[X4]:?[X5]:?[X6]:(((finite(X4)&finite(X5))&finite(X6))&~(finite(cartesian_product3(X4,X5,X6)))),inference(variable_rename,[status(thm)],[335])).
% fof(337, negated_conjecture,(((finite(esk27_0)&finite(esk28_0))&finite(esk29_0))&~(finite(cartesian_product3(esk27_0,esk28_0,esk29_0)))),inference(skolemize,[status(esa)],[336])).
% cnf(338,negated_conjecture,(~finite(cartesian_product3(esk27_0,esk28_0,esk29_0))),inference(split_conjunct,[status(thm)],[337])).
% cnf(339,negated_conjecture,(finite(esk29_0)),inference(split_conjunct,[status(thm)],[337])).
% cnf(340,negated_conjecture,(finite(esk28_0)),inference(split_conjunct,[status(thm)],[337])).
% cnf(341,negated_conjecture,(finite(esk27_0)),inference(split_conjunct,[status(thm)],[337])).
% cnf(343,negated_conjecture,(~finite(cartesian_product2(cartesian_product2(esk27_0,esk28_0),esk29_0))),inference(rw,[status(thm)],[338,118,theory(equality)]),['unfolding']).
% cnf(634,negated_conjecture,(finite(cartesian_product2(X1,esk29_0))|~finite(X1)),inference(pm,[status(thm)],[96,339,theory(equality)])).
% cnf(635,negated_conjecture,(finite(cartesian_product2(X1,esk28_0))|~finite(X1)),inference(pm,[status(thm)],[96,340,theory(equality)])).
% cnf(944,negated_conjecture,(finite(cartesian_product2(esk27_0,esk28_0))),inference(pm,[status(thm)],[635,341,theory(equality)])).
% cnf(1679,negated_conjecture,(finite(cartesian_product2(cartesian_product2(esk27_0,esk28_0),esk29_0))),inference(pm,[status(thm)],[634,944,theory(equality)])).
% cnf(1698,negated_conjecture,($false),inference(sr,[status(thm)],[1679,343,theory(equality)])).
% cnf(1699,negated_conjecture,($false),1698,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 347
% # ...of these trivial                : 14
% # ...subsumed                        : 27
% # ...remaining for further processing: 306
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 58
% # Generated clauses                  : 1069
% # ...of the previous two non-trivial : 954
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 1060
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 248
% #    Positive orientable unit clauses: 141
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 17
% #    Non-unit-clauses                : 90
% # Current number of unprocessed clauses: 692
% # ...number of literals in the above : 796
% # Clause-clause subsumption calls (NU) : 235
% # Rec. Clause-clause subsumption calls : 210
% # Unit Clause-clause subsumption calls : 158
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 95
% # Indexed BW rewrite successes       : 12
% # Backwards rewriting index:   313 leaves,   1.15+/-0.895 terms/leaf
% # Paramod-from index:          128 leaves,   1.16+/-0.917 terms/leaf
% # Paramod-into index:          255 leaves,   1.13+/-0.719 terms/leaf
% # -------------------------------------------------
% # User time              : 0.043 s
% # System time            : 0.005 s
% # Total time             : 0.048 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP1422/SEU089+1.tptp
% 
%------------------------------------------------------------------------------