TSTP Solution File: SEU435+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU435+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 06:08:07 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP30052/SEU435+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30052/SEU435+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30052/SEU435+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 30148
% 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(2, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))&m1_subset_1(X6,k1_zfmisc_1(X4)))=>m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))),file('/tmp/SRASS.s.p', s8_domain_1__e1_46__relset_2)).
% fof(51, conjecture,![X1]:![X2]:![X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))=>![X4]:![X5]:![X6]:(m1_subset_1(X6,k1_zfmisc_1(X4))=>m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))))),file('/tmp/SRASS.s.p', t36_relset_2)).
% fof(52, negated_conjecture,~(![X1]:![X2]:![X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))=>![X4]:![X5]:![X6]:(m1_subset_1(X6,k1_zfmisc_1(X4))=>m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))))),inference(assume_negation,[status(cth)],[51])).
% fof(61, plain,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((~(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2)))))|~(m1_subset_1(X6,k1_zfmisc_1(X4))))|m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))),inference(fof_nnf,[status(thm)],[2])).
% fof(62, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((~(m1_subset_1(X9,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X7,X8)))))|~(m1_subset_1(X12,k1_zfmisc_1(X10))))|m1_subset_1(a_6_0_relset_2(X7,X8,X9,X10,X11,X12),k1_zfmisc_1(k1_zfmisc_1(X11)))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))|~m1_subset_1(X6,k1_zfmisc_1(X4))|~m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))),inference(split_conjunct,[status(thm)],[62])).
% fof(215, negated_conjecture,?[X1]:?[X2]:?[X3]:(m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))&?[X4]:?[X5]:?[X6]:(m1_subset_1(X6,k1_zfmisc_1(X4))&~(m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5)))))),inference(fof_nnf,[status(thm)],[52])).
% fof(216, negated_conjecture,?[X7]:?[X8]:?[X9]:(m1_subset_1(X9,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X7,X8))))&?[X10]:?[X11]:?[X12]:(m1_subset_1(X12,k1_zfmisc_1(X10))&~(m1_subset_1(a_6_0_relset_2(X7,X8,X9,X10,X11,X12),k1_zfmisc_1(k1_zfmisc_1(X11)))))),inference(variable_rename,[status(thm)],[215])).
% fof(217, negated_conjecture,(m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk13_0,esk14_0))))&(m1_subset_1(esk18_0,k1_zfmisc_1(esk16_0))&~(m1_subset_1(a_6_0_relset_2(esk13_0,esk14_0,esk15_0,esk16_0,esk17_0,esk18_0),k1_zfmisc_1(k1_zfmisc_1(esk17_0)))))),inference(skolemize,[status(esa)],[216])).
% cnf(218,negated_conjecture,(~m1_subset_1(a_6_0_relset_2(esk13_0,esk14_0,esk15_0,esk16_0,esk17_0,esk18_0),k1_zfmisc_1(k1_zfmisc_1(esk17_0)))),inference(split_conjunct,[status(thm)],[217])).
% cnf(219,negated_conjecture,(m1_subset_1(esk18_0,k1_zfmisc_1(esk16_0))),inference(split_conjunct,[status(thm)],[217])).
% cnf(220,negated_conjecture,(m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk13_0,esk14_0))))),inference(split_conjunct,[status(thm)],[217])).
% cnf(281,negated_conjecture,(~m1_subset_1(esk15_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk13_0,esk14_0))))|~m1_subset_1(esk18_0,k1_zfmisc_1(esk16_0))),inference(spm,[status(thm)],[218,63,theory(equality)])).
% cnf(282,negated_conjecture,($false|~m1_subset_1(esk18_0,k1_zfmisc_1(esk16_0))),inference(rw,[status(thm)],[281,220,theory(equality)])).
% cnf(283,negated_conjecture,($false|$false),inference(rw,[status(thm)],[282,219,theory(equality)])).
% cnf(284,negated_conjecture,($false),inference(cn,[status(thm)],[283,theory(equality)])).
% cnf(285,negated_conjecture,($false),284,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 59
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 59
% # ...of the previous two non-trivial : 50
% # Contextual simplify-reflections : 0
% # Paramodulations : 57
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 56
% # ...number of literals in the above : 141
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 88 leaves, 1.32+/-0.833 terms/leaf
% # Paramod-from index: 40 leaves, 1.05+/-0.218 terms/leaf
% # Paramod-into index: 83 leaves, 1.12+/-0.422 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.001 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP30052/SEU435+1.tptp
%
%------------------------------------------------------------------------------