TSTP Solution File: SEU166+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU166+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:23:33 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP21967/SEU166+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21967/SEU166+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21967/SEU166+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 22063
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(6, 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(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(14, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2)))),file('/tmp/SRASS.s.p', t118_zfmisc_1)).
% fof(15, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3))&subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))))),inference(assume_negation,[status(cth)],[14])).
% fof(21, 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)],[2])).
% fof(22, 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)],[21])).
% fof(23, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(38, 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)],[6])).
% fof(39, 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)],[38])).
% fof(40, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|((in(esk4_4(X7,X8,X9,X10),X7)&in(esk5_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk4_4(X7,X8,X9,X10),esk5_4(X7,X8,X9,X10))))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(((~(in(esk6_3(X7,X8,X9),X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(esk6_3(X7,X8,X9)=ordered_pair(X16,X17))))&(in(esk6_3(X7,X8,X9),X9)|((in(esk7_3(X7,X8,X9),X7)&in(esk8_3(X7,X8,X9),X8))&esk6_3(X7,X8,X9)=ordered_pair(esk7_3(X7,X8,X9),esk8_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))),inference(skolemize,[status(esa)],[39])).
% fof(41, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk6_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk6_3(X7,X8,X9),X9)))&(in(esk6_3(X7,X8,X9),X9)|((in(esk7_3(X7,X8,X9),X7)&in(esk8_3(X7,X8,X9),X8))&esk6_3(X7,X8,X9)=ordered_pair(esk7_3(X7,X8,X9),esk8_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(esk4_4(X7,X8,X9,X10),X7)&in(esk5_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk4_4(X7,X8,X9,X10),esk5_4(X7,X8,X9,X10)))))|~(X9=cartesian_product2(X7,X8)))),inference(shift_quantors,[status(thm)],[40])).
% fof(42, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk6_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk6_3(X7,X8,X9),X9)))|X9=cartesian_product2(X7,X8))&((((in(esk7_3(X7,X8,X9),X7)|in(esk6_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))&((in(esk8_3(X7,X8,X9),X8)|in(esk6_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8)))&((esk6_3(X7,X8,X9)=ordered_pair(esk7_3(X7,X8,X9),esk8_3(X7,X8,X9))|in(esk6_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(esk4_4(X7,X8,X9,X10),X7)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))&((in(esk5_4(X7,X8,X9,X10),X8)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8))))&((X10=ordered_pair(esk4_4(X7,X8,X9,X10),esk5_4(X7,X8,X9,X10))|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))))),inference(distribute,[status(thm)],[41])).
% cnf(43,plain,(X4=ordered_pair(esk4_4(X2,X3,X1,X4),esk5_4(X2,X3,X1,X4))|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(in(esk5_4(X2,X3,X1,X4),X3)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,plain,(in(esk4_4(X2,X3,X1,X4),X2)|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(46,plain,(in(X4,X1)|X1!=cartesian_product2(X2,X3)|X4!=ordered_pair(X5,X6)|~in(X6,X3)|~in(X5,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(53, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(54,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(56,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(61, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&(~(subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3)))|~(subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(62, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&(~(subset(cartesian_product2(X4,X6),cartesian_product2(X5,X6)))|~(subset(cartesian_product2(X6,X4),cartesian_product2(X6,X5))))),inference(variable_rename,[status(thm)],[61])).
% fof(63, negated_conjecture,(subset(esk9_0,esk10_0)&(~(subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0)))|~(subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0))))),inference(skolemize,[status(esa)],[62])).
% cnf(64,negated_conjecture,(~subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0))|~subset(cartesian_product2(esk9_0,esk11_0),cartesian_product2(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[63])).
% cnf(65,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[63])).
% cnf(67,plain,(unordered_pair(unordered_pair(esk4_4(X2,X3,X1,X4),esk5_4(X2,X3,X1,X4)),singleton(esk4_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[43,56,theory(equality)]),['unfolding']).
% cnf(68,plain,(in(X4,X1)|cartesian_product2(X2,X3)!=X1|unordered_pair(unordered_pair(X5,X6),singleton(X5))!=X4|~in(X6,X3)|~in(X5,X2)),inference(rw,[status(thm)],[46,56,theory(equality)]),['unfolding']).
% cnf(78,negated_conjecture,(in(X1,esk10_0)|~in(X1,esk9_0)),inference(spm,[status(thm)],[28,65,theory(equality)])).
% cnf(85,plain,(in(X1,X2)|unordered_pair(singleton(X3),unordered_pair(X3,X4))!=X1|cartesian_product2(X5,X6)!=X2|~in(X4,X6)|~in(X3,X5)),inference(spm,[status(thm)],[68,54,theory(equality)])).
% cnf(93,plain,(unordered_pair(singleton(esk4_4(X2,X3,X1,X4)),unordered_pair(esk4_4(X2,X3,X1,X4),esk5_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[67,54,theory(equality)])).
% cnf(141,plain,(in(X1,X2)|X6!=X1|cartesian_product2(X7,X8)!=X2|~in(esk5_4(X3,X4,X5,X6),X8)|~in(esk4_4(X3,X4,X5,X6),X7)|cartesian_product2(X3,X4)!=X5|~in(X6,X5)),inference(spm,[status(thm)],[85,93,theory(equality)])).
% cnf(142,plain,(in(X1,X2)|cartesian_product2(X3,X4)!=X2|~in(esk5_4(X5,X6,X7,X1),X4)|~in(esk4_4(X5,X6,X7,X1),X3)|cartesian_product2(X5,X6)!=X7|~in(X1,X7)),inference(er,[status(thm)],[141,theory(equality)])).
% cnf(201,negated_conjecture,(in(X1,X2)|cartesian_product2(X3,esk10_0)!=X2|cartesian_product2(X4,X5)!=X6|~in(esk4_4(X4,X5,X6,X1),X3)|~in(X1,X6)|~in(esk5_4(X4,X5,X6,X1),esk9_0)),inference(spm,[status(thm)],[142,78,theory(equality)])).
% cnf(202,plain,(in(X1,X2)|cartesian_product2(X3,X4)!=X2|cartesian_product2(X5,X4)!=X6|~in(esk4_4(X5,X4,X6,X1),X3)|~in(X1,X6)),inference(spm,[status(thm)],[142,44,theory(equality)])).
% cnf(203,negated_conjecture,(in(X1,X2)|cartesian_product2(esk10_0,X3)!=X2|cartesian_product2(X4,X3)!=X5|~in(X1,X5)|~in(esk4_4(X4,X3,X5,X1),esk9_0)),inference(spm,[status(thm)],[202,78,theory(equality)])).
% cnf(219,negated_conjecture,(in(X1,X2)|cartesian_product2(esk10_0,X3)!=X2|cartesian_product2(esk9_0,X3)!=X4|~in(X1,X4)),inference(spm,[status(thm)],[203,45,theory(equality)])).
% cnf(220,negated_conjecture,(in(X1,cartesian_product2(esk10_0,X2))|cartesian_product2(esk9_0,X2)!=X3|~in(X1,X3)),inference(er,[status(thm)],[219,theory(equality)])).
% cnf(221,negated_conjecture,(in(X1,cartesian_product2(esk10_0,X2))|~in(X1,cartesian_product2(esk9_0,X2))),inference(er,[status(thm)],[220,theory(equality)])).
% cnf(226,negated_conjecture,(subset(X1,cartesian_product2(esk10_0,X2))|~in(esk1_2(X1,cartesian_product2(esk10_0,X2)),cartesian_product2(esk9_0,X2))),inference(spm,[status(thm)],[26,221,theory(equality)])).
% cnf(229,negated_conjecture,(subset(cartesian_product2(esk9_0,X1),cartesian_product2(esk10_0,X1))),inference(spm,[status(thm)],[226,27,theory(equality)])).
% cnf(231,negated_conjecture,($false|~subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0))),inference(rw,[status(thm)],[64,229,theory(equality)])).
% cnf(232,negated_conjecture,(~subset(cartesian_product2(esk11_0,esk9_0),cartesian_product2(esk11_0,esk10_0))),inference(cn,[status(thm)],[231,theory(equality)])).
% cnf(233,negated_conjecture,(in(X1,X2)|cartesian_product2(X3,esk10_0)!=X2|cartesian_product2(X4,esk9_0)!=X5|~in(esk4_4(X4,esk9_0,X5,X1),X3)|~in(X1,X5)),inference(spm,[status(thm)],[201,44,theory(equality)])).
% cnf(236,negated_conjecture,(in(X1,X2)|cartesian_product2(X3,esk10_0)!=X2|cartesian_product2(X3,esk9_0)!=X4|~in(X1,X4)),inference(spm,[status(thm)],[233,45,theory(equality)])).
% cnf(237,negated_conjecture,(in(X1,cartesian_product2(X2,esk10_0))|cartesian_product2(X2,esk9_0)!=X3|~in(X1,X3)),inference(er,[status(thm)],[236,theory(equality)])).
% cnf(249,negated_conjecture,(in(X1,cartesian_product2(X2,esk10_0))|~in(X1,cartesian_product2(X2,esk9_0))),inference(er,[status(thm)],[237,theory(equality)])).
% cnf(257,negated_conjecture,(subset(X1,cartesian_product2(X2,esk10_0))|~in(esk1_2(X1,cartesian_product2(X2,esk10_0)),cartesian_product2(X2,esk9_0))),inference(spm,[status(thm)],[26,249,theory(equality)])).
% cnf(265,negated_conjecture,(subset(cartesian_product2(X1,esk9_0),cartesian_product2(X1,esk10_0))),inference(spm,[status(thm)],[257,27,theory(equality)])).
% cnf(267,negated_conjecture,($false),inference(rw,[status(thm)],[232,265,theory(equality)])).
% cnf(268,negated_conjecture,($false),inference(cn,[status(thm)],[267,theory(equality)])).
% cnf(269,negated_conjecture,($false),268,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 124
% # ...of these trivial : 1
% # ...subsumed : 46
% # ...remaining for further processing: 77
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 189
% # ...of the previous two non-trivial : 185
% # Contextual simplify-reflections : 0
% # Paramodulations : 175
% # Factorizations : 0
% # Equation resolutions : 14
% # Current number of processed clauses: 75
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 63
% # Current number of unprocessed clauses: 80
% # ...number of literals in the above : 358
% # Clause-clause subsumption calls (NU) : 658
% # Rec. Clause-clause subsumption calls : 382
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 93 leaves, 1.85+/-2.400 terms/leaf
% # Paramod-from index: 18 leaves, 1.11+/-0.314 terms/leaf
% # Paramod-into index: 79 leaves, 1.48+/-0.966 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.004 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP21967/SEU166+1.tptp
%
%------------------------------------------------------------------------------