TSTP Solution File: SEU090+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU090+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 : art09.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:28 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP26087/SEU090+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26087/SEU090+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26087/SEU090+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 26183
% 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(8, axiom,![X1]:![X2]:![X3]:(((finite(X1)&finite(X2))&finite(X3))=>finite(cartesian_product3(X1,X2,X3))),file('/tmp/SRASS.s.p', fc15_finset_1)).
% fof(31, axiom,![X1]:![X2]:![X3]:![X4]:cartesian_product4(X1,X2,X3,X4)=cartesian_product2(cartesian_product3(X1,X2,X3),X4),file('/tmp/SRASS.s.p', d4_zfmisc_1)).
% fof(63, conjecture,![X1]:![X2]:![X3]:![X4]:((((finite(X1)&finite(X2))&finite(X3))&finite(X4))=>finite(cartesian_product4(X1,X2,X3,X4))),file('/tmp/SRASS.s.p', t21_finset_1)).
% fof(64, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((((finite(X1)&finite(X2))&finite(X3))&finite(X4))=>finite(cartesian_product4(X1,X2,X3,X4)))),inference(assume_negation,[status(cth)],[63])).
% fof(98, plain,![X1]:![X2]:((~(finite(X1))|~(finite(X2)))|finite(cartesian_product2(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(99, plain,![X3]:![X4]:((~(finite(X3))|~(finite(X4)))|finite(cartesian_product2(X3,X4))),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(finite(cartesian_product2(X1,X2))|~finite(X2)|~finite(X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(101, plain,![X1]:![X2]:![X3]:(((~(finite(X1))|~(finite(X2)))|~(finite(X3)))|finite(cartesian_product3(X1,X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(102, plain,![X4]:![X5]:![X6]:(((~(finite(X4))|~(finite(X5)))|~(finite(X6)))|finite(cartesian_product3(X4,X5,X6))),inference(variable_rename,[status(thm)],[101])).
% cnf(103,plain,(finite(cartesian_product3(X1,X2,X3))|~finite(X3)|~finite(X2)|~finite(X1)),inference(split_conjunct,[status(thm)],[102])).
% fof(201, plain,![X5]:![X6]:![X7]:![X8]:cartesian_product4(X5,X6,X7,X8)=cartesian_product2(cartesian_product3(X5,X6,X7),X8),inference(variable_rename,[status(thm)],[31])).
% cnf(202,plain,(cartesian_product4(X1,X2,X3,X4)=cartesian_product2(cartesian_product3(X1,X2,X3),X4)),inference(split_conjunct,[status(thm)],[201])).
% fof(348, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((((finite(X1)&finite(X2))&finite(X3))&finite(X4))&~(finite(cartesian_product4(X1,X2,X3,X4)))),inference(fof_nnf,[status(thm)],[64])).
% fof(349, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((((finite(X5)&finite(X6))&finite(X7))&finite(X8))&~(finite(cartesian_product4(X5,X6,X7,X8)))),inference(variable_rename,[status(thm)],[348])).
% fof(350, negated_conjecture,((((finite(esk27_0)&finite(esk28_0))&finite(esk29_0))&finite(esk30_0))&~(finite(cartesian_product4(esk27_0,esk28_0,esk29_0,esk30_0)))),inference(skolemize,[status(esa)],[349])).
% cnf(351,negated_conjecture,(~finite(cartesian_product4(esk27_0,esk28_0,esk29_0,esk30_0))),inference(split_conjunct,[status(thm)],[350])).
% cnf(352,negated_conjecture,(finite(esk30_0)),inference(split_conjunct,[status(thm)],[350])).
% cnf(353,negated_conjecture,(finite(esk29_0)),inference(split_conjunct,[status(thm)],[350])).
% cnf(354,negated_conjecture,(finite(esk28_0)),inference(split_conjunct,[status(thm)],[350])).
% cnf(355,negated_conjecture,(finite(esk27_0)),inference(split_conjunct,[status(thm)],[350])).
% cnf(357,negated_conjecture,(~finite(cartesian_product2(cartesian_product3(esk27_0,esk28_0,esk29_0),esk30_0))),inference(rw,[status(thm)],[351,202,theory(equality)]),['unfolding']).
% cnf(379,negated_conjecture,(~finite(esk30_0)|~finite(cartesian_product3(esk27_0,esk28_0,esk29_0))),inference(spm,[status(thm)],[357,100,theory(equality)])).
% cnf(380,negated_conjecture,($false|~finite(cartesian_product3(esk27_0,esk28_0,esk29_0))),inference(rw,[status(thm)],[379,352,theory(equality)])).
% cnf(381,negated_conjecture,(~finite(cartesian_product3(esk27_0,esk28_0,esk29_0))),inference(cn,[status(thm)],[380,theory(equality)])).
% cnf(486,negated_conjecture,(~finite(esk29_0)|~finite(esk28_0)|~finite(esk27_0)),inference(spm,[status(thm)],[381,103,theory(equality)])).
% cnf(487,negated_conjecture,($false|~finite(esk28_0)|~finite(esk27_0)),inference(rw,[status(thm)],[486,353,theory(equality)])).
% cnf(488,negated_conjecture,($false|$false|~finite(esk27_0)),inference(rw,[status(thm)],[487,354,theory(equality)])).
% cnf(489,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[488,355,theory(equality)])).
% cnf(490,negated_conjecture,($false),inference(cn,[status(thm)],[489,theory(equality)])).
% cnf(491,negated_conjecture,($false),490,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 281
% # ...of these trivial : 6
% # ...subsumed : 6
% # ...remaining for further processing: 269
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 76
% # ...of the previous two non-trivial : 49
% # Contextual simplify-reflections : 7
% # Paramodulations : 76
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 135
% # Positive orientable unit clauses: 88
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 37
% # Current number of unprocessed clauses: 48
% # ...number of literals in the above : 96
% # Clause-clause subsumption calls (NU) : 73
% # Rec. Clause-clause subsumption calls : 55
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 162 leaves, 1.10+/-0.453 terms/leaf
% # Paramod-from index: 102 leaves, 1.01+/-0.099 terms/leaf
% # Paramod-into index: 160 leaves, 1.06+/-0.330 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.003 s
% # Total time : 0.029 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/SystemOnTPTP26087/SEU090+1.tptp
%
%------------------------------------------------------------------------------