TSTP Solution File: SET950+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET950+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 00:27:22 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP1459/SET950+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1459/SET950+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1459/SET950+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 1591
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(X3=cartesian_product2(X1,X2)<=>![X4]:(in(X4,X3)<=>?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))),file('/tmp/SRASS.s.p', d2_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(9, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(10, conjecture,![X1]:![X2]:![X3]:![X4]:~(((subset(X1,cartesian_product2(X2,X3))&in(X4,X1))&![X5]:![X6]:~(((in(X5,X2)&in(X6,X3))&X4=ordered_pair(X5,X6))))),file('/tmp/SRASS.s.p', t103_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:~(((subset(X1,cartesian_product2(X2,X3))&in(X4,X1))&![X5]:![X6]:~(((in(X5,X2)&in(X6,X3))&X4=ordered_pair(X5,X6)))))),inference(assume_negation,[status(cth)],[10])).
% fof(18, plain,![X1]:![X2]:![X3]:((~(X3=cartesian_product2(X1,X2))|![X4]:((~(in(X4,X3))|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))&(![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6))))&(in(X4,X3)|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6))))|X3=cartesian_product2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|?[X11]:?[X12]:((in(X11,X7)&in(X12,X8))&X10=ordered_pair(X11,X12)))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(?[X15]:((~(in(X15,X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(X15=ordered_pair(X16,X17))))&(in(X15,X9)|?[X18]:?[X19]:((in(X18,X7)&in(X19,X8))&X15=ordered_pair(X18,X19))))|X9=cartesian_product2(X7,X8))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(((~(in(esk3_3(X7,X8,X9),X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17))))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))),inference(skolemize,[status(esa)],[19])).
% fof(21, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))&(~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10)))))|~(X9=cartesian_product2(X7,X8)))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))|X9=cartesian_product2(X7,X8))&((((in(esk4_3(X7,X8,X9),X7)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))&((in(esk5_3(X7,X8,X9),X8)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8)))&((esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))|~(X9=cartesian_product2(X7,X8)))&((((in(esk1_4(X7,X8,X9,X10),X7)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))&((in(esk2_4(X7,X8,X9,X10),X8)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8))))&((X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))))),inference(distribute,[status(thm)],[21])).
% cnf(23,plain,(X4=ordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4))|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(in(esk2_4(X2,X3,X1,X4),X3)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(25,plain,(in(esk1_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(31, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk6_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[34])).
% cnf(38,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(49, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(50,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(52,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[51])).
% fof(53, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(X1,cartesian_product2(X2,X3))&in(X4,X1))&![X5]:![X6]:((~(in(X5,X2))|~(in(X6,X3)))|~(X4=ordered_pair(X5,X6)))),inference(fof_nnf,[status(thm)],[11])).
% fof(54, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:((subset(X7,cartesian_product2(X8,X9))&in(X10,X7))&![X11]:![X12]:((~(in(X11,X8))|~(in(X12,X9)))|~(X10=ordered_pair(X11,X12)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, negated_conjecture,((subset(esk9_0,cartesian_product2(esk10_0,esk11_0))&in(esk12_0,esk9_0))&![X11]:![X12]:((~(in(X11,esk10_0))|~(in(X12,esk11_0)))|~(esk12_0=ordered_pair(X11,X12)))),inference(skolemize,[status(esa)],[54])).
% fof(56, negated_conjecture,![X11]:![X12]:(((~(in(X11,esk10_0))|~(in(X12,esk11_0)))|~(esk12_0=ordered_pair(X11,X12)))&(subset(esk9_0,cartesian_product2(esk10_0,esk11_0))&in(esk12_0,esk9_0))),inference(shift_quantors,[status(thm)],[55])).
% cnf(57,negated_conjecture,(in(esk12_0,esk9_0)),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,negated_conjecture,(subset(esk9_0,cartesian_product2(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[56])).
% cnf(59,negated_conjecture,(esk12_0!=ordered_pair(X1,X2)|~in(X2,esk11_0)|~in(X1,esk10_0)),inference(split_conjunct,[status(thm)],[56])).
% cnf(61,plain,(unordered_pair(unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)),singleton(esk1_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[23,52,theory(equality)]),['unfolding']).
% cnf(65,negated_conjecture,(unordered_pair(unordered_pair(X1,X2),singleton(X1))!=esk12_0|~in(X2,esk11_0)|~in(X1,esk10_0)),inference(rw,[status(thm)],[59,52,theory(equality)]),['unfolding']).
% cnf(66,plain,(unordered_pair(singleton(esk1_4(X2,X3,X1,X4)),unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[61,50,theory(equality)])).
% cnf(76,negated_conjecture,(in(X1,cartesian_product2(esk10_0,esk11_0))|~in(X1,esk9_0)),inference(spm,[status(thm)],[38,58,theory(equality)])).
% cnf(84,negated_conjecture,(unordered_pair(singleton(X1),unordered_pair(X1,X2))!=esk12_0|~in(X2,esk11_0)|~in(X1,esk10_0)),inference(spm,[status(thm)],[65,50,theory(equality)])).
% cnf(185,negated_conjecture,(X4!=esk12_0|~in(esk2_4(X1,X2,X3,X4),esk11_0)|~in(esk1_4(X1,X2,X3,X4),esk10_0)|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[84,66,theory(equality)])).
% cnf(261,negated_conjecture,(cartesian_product2(X1,esk11_0)!=X2|X3!=esk12_0|~in(esk1_4(X1,esk11_0,X2,X3),esk10_0)|~in(X3,X2)),inference(spm,[status(thm)],[185,24,theory(equality)])).
% cnf(262,negated_conjecture,(cartesian_product2(esk10_0,esk11_0)!=X1|X2!=esk12_0|~in(X2,X1)),inference(spm,[status(thm)],[261,25,theory(equality)])).
% cnf(263,negated_conjecture,(X1!=esk12_0|~in(X1,cartesian_product2(esk10_0,esk11_0))),inference(er,[status(thm)],[262,theory(equality)])).
% cnf(275,negated_conjecture,(X1!=esk12_0|~in(X1,esk9_0)),inference(spm,[status(thm)],[263,76,theory(equality)])).
% cnf(276,negated_conjecture,($false),inference(spm,[status(thm)],[275,57,theory(equality)])).
% cnf(283,negated_conjecture,($false),276,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 173
% # ...of these trivial : 0
% # ...subsumed : 76
% # ...remaining for further processing: 97
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 212
% # ...of the previous two non-trivial : 201
% # Contextual simplify-reflections : 0
% # Paramodulations : 201
% # Factorizations : 0
% # Equation resolutions : 11
% # Current number of processed clauses: 77
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 8
% # Non-unit-clauses : 64
% # Current number of unprocessed clauses: 68
% # ...number of literals in the above : 330
% # Clause-clause subsumption calls (NU) : 1061
% # Rec. Clause-clause subsumption calls : 541
% # Unit Clause-clause subsumption calls : 37
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 98 leaves, 1.71+/-2.010 terms/leaf
% # Paramod-from index: 16 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 78 leaves, 1.46+/-0.929 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.006 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.19 WC
% FINAL PrfWatch: 0.13 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP1459/SET950+1.tptp
%
%------------------------------------------------------------------------------