TSTP Solution File: SEU178+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU178+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 : art05.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:28:02 EST 2010

% Result   : Theorem 115.24s
% Output   : Solution 208.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/SystemOnTPTP22138/SEU178+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t21_relat_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... reflexivity_r1_tarski:
%  CSA axiom reflexivity_r1_tarski found
% Looking for CSA axiom ... fc4_subset_1:
%  CSA axiom fc4_subset_1 found
% Looking for CSA axiom ... rc1_relat_1:
%  CSA axiom rc1_relat_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... d3_tarski:
%  CSA axiom d3_tarski found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... d1_relat_1:
%  CSA axiom d1_relat_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... existence_m1_subset_1:
%  CSA axiom existence_m1_subset_1 found
% Looking for CSA axiom ... rc1_xboole_0:
% rc2_xboole_0:
%  CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... d4_relat_1:
%  CSA axiom d4_relat_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc1_xboole_0:
% d5_relat_1:
%  CSA axiom d5_relat_1 found
% Looking for CSA axiom ... t106_zfmisc_1: CSA axiom t106_zfmisc_1 found
% Looking for CSA axiom ... rc1_subset_1:
%  CSA axiom rc1_subset_1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :rc1_subset_1:t106_zfmisc_1:d5_relat_1:d4_relat_1:rc2_xboole_0:existence_m1_subset_1:d1_relat_1:antisymmetry_r2_hidden:d3_tarski:rc1_relat_1:fc4_subset_1:reflexivity_r1_tarski (12)
% Unselected axioms are ... :rc1_xboole_0:rc2_subset_1:t3_subset:t4_subset:fc1_zfmisc_1:t8_boole:t5_subset:t7_boole:d5_tarski:t1_subset:commutativity_k2_tarski:t2_subset:fc1_subset_1:fc1_xboole_0:fc2_subset_1:fc3_subset_1:t6_boole:dt_k1_relat_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_relat_1:dt_k2_tarski:dt_k2_zfmisc_1:dt_k4_tarski:dt_m1_subset_1 (26)
% SZS status THM for /tmp/SystemOnTPTP22138/SEU178+1.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP22138/SEU178+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 24634
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.88 CPU 10.03 WC
% PrfWatch: 11.88 CPU 12.03 WC
% PrfWatch: 13.87 CPU 14.04 WC
% PrfWatch: 15.86 CPU 16.04 WC
% PrfWatch: 17.85 CPU 18.05 WC
% PrfWatch: 19.85 CPU 20.05 WC
% PrfWatch: 21.84 CPU 22.06 WC
% PrfWatch: 23.83 CPU 24.06 WC
% PrfWatch: 25.82 CPU 26.07 WC
% PrfWatch: 27.82 CPU 28.07 WC
% PrfWatch: 29.81 CPU 30.08 WC
% PrfWatch: 31.79 CPU 32.08 WC
% PrfWatch: 33.78 CPU 34.09 WC
% PrfWatch: 35.77 CPU 36.09 WC
% PrfWatch: 37.76 CPU 38.10 WC
% PrfWatch: 39.76 CPU 40.10 WC
% PrfWatch: 41.75 CPU 42.10 WC
% PrfWatch: 43.74 CPU 44.11 WC
% PrfWatch: 45.73 CPU 46.11 WC
% PrfWatch: 47.73 CPU 48.12 WC
% PrfWatch: 49.72 CPU 50.12 WC
% PrfWatch: 51.71 CPU 52.13 WC
% PrfWatch: 53.71 CPU 54.13 WC
% PrfWatch: 55.69 CPU 56.14 WC
% PrfWatch: 57.69 CPU 58.14 WC
% PrfWatch: 59.68 CPU 60.15 WC
% PrfWatch: 61.37 CPU 62.15 WC
% PrfWatch: 62.95 CPU 64.16 WC
% PrfWatch: 64.94 CPU 66.16 WC
% PrfWatch: 66.93 CPU 68.17 WC
% PrfWatch: 68.92 CPU 70.17 WC
% PrfWatch: 70.90 CPU 72.18 WC
% PrfWatch: 72.54 CPU 74.18 WC
% PrfWatch: 74.16 CPU 76.19 WC
% PrfWatch: 76.15 CPU 78.19 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 78.13 CPU 80.20 WC
% PrfWatch: 80.12 CPU 82.20 WC
% PrfWatch: 82.12 CPU 84.21 WC
% PrfWatch: 84.11 CPU 86.21 WC
% PrfWatch: 86.11 CPU 88.22 WC
% PrfWatch: 88.10 CPU 90.22 WC
% PrfWatch: 90.09 CPU 92.22 WC
% PrfWatch: 92.09 CPU 94.23 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(3, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X4,X3),X1)))),file('/tmp/SRASS.s.p', d5_relat_1)).
% fof(4, axiom,![X1]:(relation(X1)=>![X2]:(X2=relation_dom(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:in(ordered_pair(X3,X4),X1)))),file('/tmp/SRASS.s.p', d4_relat_1)).
% fof(7, axiom,![X1]:(relation(X1)<=>![X2]:~((in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4))))),file('/tmp/SRASS.s.p', d1_relat_1)).
% fof(9, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(13, conjecture,![X1]:(relation(X1)=>subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))),file('/tmp/SRASS.s.p', t21_relat_1)).
% fof(14, negated_conjecture,~(![X1]:(relation(X1)=>subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1))))),inference(assume_negation,[status(cth)],[13])).
% fof(25, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(31, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X4,X3),X1))&(![X4]:~(in(ordered_pair(X4,X3),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X4,X3),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X4,X3),X1)))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(32, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X8,X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X11,X10),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X12,X10),X5)))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk2_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk3_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk3_2(X5,X6)),X5)))&(in(esk3_2(X5,X6),X6)|in(ordered_pair(esk4_2(X5,X6),esk3_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk3_2(X5,X6)),X5))|~(in(esk3_2(X5,X6),X6)))&(in(esk3_2(X5,X6),X6)|in(ordered_pair(esk4_2(X5,X6),esk3_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk2_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk3_2(X5,X6)),X5))|~(in(esk3_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk3_2(X5,X6),X6)|in(ordered_pair(esk4_2(X5,X6),esk3_2(X5,X6)),X5))|X6=relation_rng(X5))|~(relation(X5))))&((((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))|~(X6=relation_rng(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(esk2_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[34])).
% cnf(37,plain,(in(X3,X2)|~relation(X1)|X2!=relation_rng(X1)|~in(ordered_pair(X4,X3),X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(40, plain,![X1]:(~(relation(X1))|![X2]:((~(X2=relation_dom(X1))|![X3]:((~(in(X3,X2))|?[X4]:in(ordered_pair(X3,X4),X1))&(![X4]:~(in(ordered_pair(X3,X4),X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:~(in(ordered_pair(X3,X4),X1)))&(in(X3,X2)|?[X4]:in(ordered_pair(X3,X4),X1)))|X2=relation_dom(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(41, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|?[X8]:in(ordered_pair(X7,X8),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:~(in(ordered_pair(X10,X11),X5)))&(in(X10,X6)|?[X12]:in(ordered_pair(X10,X12),X5)))|X6=relation_dom(X5)))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk5_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk6_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk6_2(X5,X6),X11),X5)))&(in(esk6_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[41])).
% fof(43, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk6_2(X5,X6),X11),X5))|~(in(esk6_2(X5,X6),X6)))&(in(esk6_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk5_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[42])).
% fof(44, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk6_2(X5,X6),X11),X5))|~(in(esk6_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk6_2(X5,X6),X6)|in(ordered_pair(esk6_2(X5,X6),esk7_2(X5,X6)),X5))|X6=relation_dom(X5))|~(relation(X5))))&((((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))|~(X6=relation_dom(X5)))|~(relation(X5)))&(((~(in(X7,X6))|in(ordered_pair(X7,esk5_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[43])).
% cnf(46,plain,(in(X3,X2)|~relation(X1)|X2!=relation_dom(X1)|~in(ordered_pair(X3,X4),X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(55, plain,![X1]:((~(relation(X1))|![X2]:(~(in(X2,X1))|?[X3]:?[X4]:X2=ordered_pair(X3,X4)))&(?[X2]:(in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4)))|relation(X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(56, plain,![X5]:((~(relation(X5))|![X6]:(~(in(X6,X5))|?[X7]:?[X8]:X6=ordered_pair(X7,X8)))&(?[X9]:(in(X9,X5)&![X10]:![X11]:~(X9=ordered_pair(X10,X11)))|relation(X5))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X5]:((~(relation(X5))|![X6]:(~(in(X6,X5))|X6=ordered_pair(esk10_2(X5,X6),esk11_2(X5,X6))))&((in(esk12_1(X5),X5)&![X10]:![X11]:~(esk12_1(X5)=ordered_pair(X10,X11)))|relation(X5))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X5]:![X6]:![X10]:![X11]:(((~(esk12_1(X5)=ordered_pair(X10,X11))&in(esk12_1(X5),X5))|relation(X5))&((~(in(X6,X5))|X6=ordered_pair(esk10_2(X5,X6),esk11_2(X5,X6)))|~(relation(X5)))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,![X5]:![X6]:![X10]:![X11]:(((~(esk12_1(X5)=ordered_pair(X10,X11))|relation(X5))&(in(esk12_1(X5),X5)|relation(X5)))&((~(in(X6,X5))|X6=ordered_pair(esk10_2(X5,X6),esk11_2(X5,X6)))|~(relation(X5)))),inference(distribute,[status(thm)],[58])).
% cnf(60,plain,(X2=ordered_pair(esk10_2(X1,X2),esk11_2(X1,X2))|~relation(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(66, 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)],[9])).
% fof(67, 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)],[66])).
% fof(68, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk13_2(X4,X5),X4)&~(in(esk13_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk13_2(X4,X5),X4)&~(in(esk13_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk13_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk13_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[69])).
% cnf(71,plain,(subset(X1,X2)|~in(esk13_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,plain,(subset(X1,X2)|in(esk13_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(83, negated_conjecture,?[X1]:(relation(X1)&~(subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1))))),inference(fof_nnf,[status(thm)],[14])).
% fof(84, negated_conjecture,?[X2]:(relation(X2)&~(subset(X2,cartesian_product2(relation_dom(X2),relation_rng(X2))))),inference(variable_rename,[status(thm)],[83])).
% fof(85, negated_conjecture,(relation(esk15_0)&~(subset(esk15_0,cartesian_product2(relation_dom(esk15_0),relation_rng(esk15_0))))),inference(skolemize,[status(esa)],[84])).
% cnf(86,negated_conjecture,(~subset(esk15_0,cartesian_product2(relation_dom(esk15_0),relation_rng(esk15_0)))),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,negated_conjecture,(relation(esk15_0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(99,plain,(in(X2,cartesian_product2(X3,X4))|~in(esk11_2(X1,X2),X4)|~in(esk10_2(X1,X2),X3)|~relation(X1)|~in(X2,X1)),inference(spm,[status(thm)],[28,60,theory(equality)])).
% cnf(100,plain,(in(esk11_2(X1,X2),X3)|relation_rng(X4)!=X3|~relation(X4)|~in(X2,X4)|~relation(X1)|~in(X2,X1)),inference(spm,[status(thm)],[37,60,theory(equality)])).
% cnf(102,plain,(in(esk10_2(X1,X2),X3)|relation_dom(X4)!=X3|~relation(X4)|~in(X2,X4)|~relation(X1)|~in(X2,X1)),inference(spm,[status(thm)],[46,60,theory(equality)])).
% cnf(181,plain,(in(esk11_2(X1,esk13_2(X2,X3)),X4)|subset(X2,X3)|relation_rng(X2)!=X4|~relation(X2)|~relation(X1)|~in(esk13_2(X2,X3),X1)),inference(spm,[status(thm)],[100,72,theory(equality)])).
% cnf(237,plain,(in(esk10_2(X1,esk13_2(X2,X3)),X4)|subset(X2,X3)|relation_dom(X2)!=X4|~relation(X2)|~relation(X1)|~in(esk13_2(X2,X3),X1)),inference(spm,[status(thm)],[102,72,theory(equality)])).
% cnf(2660,plain,(in(esk13_2(X1,X2),cartesian_product2(X3,X4))|subset(X1,X2)|~relation(X5)|~in(esk10_2(X5,esk13_2(X1,X2)),X3)|~in(esk13_2(X1,X2),X5)|relation_rng(X1)!=X4|~relation(X1)),inference(spm,[status(thm)],[99,181,theory(equality)])).
% cnf(665680,plain,(subset(X1,X2)|in(esk13_2(X1,X2),cartesian_product2(X3,X4))|relation_rng(X1)!=X4|~relation(X5)|~relation(X1)|~in(esk13_2(X1,X2),X5)|relation_dom(X1)!=X3),inference(spm,[status(thm)],[2660,237,theory(equality)])).
% cnf(665995,plain,(subset(X1,X2)|in(esk13_2(X1,X2),cartesian_product2(X3,X4))|relation_rng(X1)!=X4|relation_dom(X1)!=X3|~relation(X1)),inference(spm,[status(thm)],[665680,72,theory(equality)])).
% cnf(666705,plain,(subset(X1,cartesian_product2(X2,X3))|relation_rng(X1)!=X3|relation_dom(X1)!=X2|~relation(X1)),inference(spm,[status(thm)],[71,665995,theory(equality)])).
% cnf(666706,negated_conjecture,(~relation(esk15_0)),inference(spm,[status(thm)],[86,666705,theory(equality)])).
% cnf(666708,negated_conjecture,($false),inference(rw,[status(thm)],[666706,87,theory(equality)])).
% cnf(666709,negated_conjecture,($false),inference(cn,[status(thm)],[666708,theory(equality)])).
% cnf(666710,negated_conjecture,($false),666709,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 12426
% # ...of these trivial                : 34
% # ...subsumed                        : 4008
% # ...remaining for further processing: 8384
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 36
% # Backward-rewritten                 : 0
% # Generated clauses                  : 661647
% # ...of the previous two non-trivial : 661408
% # Contextual simplify-reflections    : 4536
% # Paramodulations                    : 661211
% # Factorizations                     : 8
% # Equation resolutions               : 428
% # Current number of processed clauses: 8320
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 8313
% # Current number of unprocessed clauses: 644273
% # ...number of literals in the above : 7103035
% # Clause-clause subsumption calls (NU) : 4675795
% # Rec. Clause-clause subsumption calls : 749305
% # 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:  1313 leaves,   4.39+/-9.888 terms/leaf
% # Paramod-from index:          188 leaves,   4.19+/-7.044 terms/leaf
% # Paramod-into index:         1016 leaves,   3.69+/-6.624 terms/leaf
% # -------------------------------------------------
% # User time              : 76.185 s
% # System time            : 1.336 s
% # Total time             : 77.521 s
% # Maximum resident set size: 0 pages
% PrfWatch: 92.31 CPU 94.46 WC
% FINAL PrfWatch: 92.31 CPU 94.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP22138/SEU178+1.tptp
% 
%------------------------------------------------------------------------------