%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU179+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:29:59 EST 2010
% Result : Theorem 118.84s
% Output : Solution 119.54s
% 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/SystemOnTPTP27693/SEU179+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t25_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 ... t1_xboole_1:
% CSA axiom t1_xboole_1 found
% Looking for CSA axiom ... t21_relat_1:
% CSA axiom t21_relat_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ... yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... t20_relat_1:
% CSA axiom t20_relat_1 found
% Looking for CSA axiom ... d10_xboole_0:
% CSA axiom d10_xboole_0 found
% Looking for CSA axiom ... d3_tarski:
% CSA axiom d3_tarski found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_relat_1:
% CSA axiom rc1_relat_1 found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... antisymmetry_r2_xboole_0:
% CSA axiom antisymmetry_r2_xboole_0 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... irreflexivity_r2_xboole_0:
% rc1_xboole_0:
% rc2_xboole_0:
% CSA axiom rc2_xboole_0 found
% Looking for CSA axiom ... symmetry_r1_xboole_0:
% CSA axiom symmetry_r1_xboole_0 found
% Looking for CSA axiom ... t118_zfmisc_1:
% CSA axiom t118_zfmisc_1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... irreflexivity_r2_xboole_0:
% rc1_xboole_0:
% t119_zfmisc_1:
% d4_relat_1:
% CSA axiom d4_relat_1 found
% Looking for CSA axiom ... d5_relat_1:
% CSA axiom d5_relat_1 found
% Looking for CSA axiom ... t2_xboole_1:
% CSA axiom t2_xboole_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :t2_xboole_1:d5_relat_1:d4_relat_1:t118_zfmisc_1:symmetry_r1_xboole_0:rc2_xboole_0:antisymmetry_r2_xboole_0:antisymmetry_r2_hidden:rc1_relat_1:d3_tarski:d10_xboole_0:t20_relat_1:t21_relat_1:t1_xboole_1:reflexivity_r1_tarski (15)
% Unselected axioms are ... :irreflexivity_r2_xboole_0:rc1_xboole_0:t119_zfmisc_1:t33_xboole_1:t36_xboole_1:t7_xboole_1:t8_xboole_1:t17_xboole_1:t19_xboole_1:t26_xboole_1:t63_xboole_1:t60_xboole_1:d1_relat_1:existence_m1_subset_1:l55_zfmisc_1:t106_zfmisc_1:t3_subset:commutativity_k2_xboole_0:commutativity_k3_xboole_0:dt_k2_subset_1:dt_k3_subset_1:dt_k5_setfam_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:idempotence_k2_xboole_0:idempotence_k3_xboole_0:l2_zfmisc_1:t33_zfmisc_1:t37_zfmisc_1:t8_boole:d1_xboole_0:l50_zfmisc_1:t38_zfmisc_1:t3_xboole_1:t6_zfmisc_1:t92_zfmisc_1:t9_tarski:d1_tarski:d2_xboole_0:d3_xboole_0:d4_xboole_0:d8_xboole_0:t12_xboole_1:t28_xboole_1:t3_xboole_0:d2_tarski:d4_tarski:t2_tarski:t7_boole:d1_zfmisc_1:d2_zfmisc_1:fc1_subset_1:fc1_zfmisc_1:fc4_subset_1:l32_xboole_1:l3_zfmisc_1:l4_zfmisc_1:t37_xboole_1:t39_zfmisc_1:t45_xboole_1:fc1_xboole_0:fc2_subset_1:fc2_xboole_0:fc3_xboole_0:fc3_subset_1:d5_tarski:rc1_subset_1:rc2_subset_1:t1_subset:d2_subset_1:l3_subset_1:l71_subset_1:t136_zfmisc_1:t2_subset:t4_subset:commutativity_k2_tarski:l1_zfmisc_1:l23_zfmisc_1:l25_zfmisc_1:l28_zfmisc_1:t10_zfmisc_1:t39_xboole_1:t40_xboole_1:t46_zfmisc_1:t48_xboole_1:t65_zfmisc_1:t6_boole:d1_setfam_1:d5_subset_1:redefinition_k6_subset_1:t1_boole:t2_boole:t3_boole:t43_subset_1:t46_setfam_1:t4_boole:t69_enumset1:t83_xboole_1:t8_zfmisc_1:t9_zfmisc_1:redefinition_k5_setfam_1:redefinition_k6_setfam_1:t99_zfmisc_1:d4_subset_1:d7_xboole_0:t4_xboole_0:t5_subset:t1_zfmisc_1:t50_subset_1:t54_subset_1:d8_setfam_1:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:t47_setfam_1:t48_setfam_1:dt_k1_relat_1:dt_k1_setfam_1:dt_k1_tarski:dt_k1_xboole_0:dt_k1_zfmisc_1:dt_k2_relat_1:dt_k2_tarski:dt_k2_xboole_0:dt_k2_zfmisc_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0:dt_m1_subset_1 (130)
% SZS status THM for /tmp/SystemOnTPTP27693/SEU179+2.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP27693/SEU179+2.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 31134
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, 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(3, 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(10, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(12, axiom,![X1]:![X2]:![X3]:(relation(X3)=>(in(ordered_pair(X1,X2),X3)=>(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),file('/tmp/SRASS.s.p', t20_relat_1)).
% fof(16, conjecture,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2)))))),file('/tmp/SRASS.s.p', t25_relat_1)).
% fof(17, negated_conjecture,~(![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(X1,X2)=>(subset(relation_dom(X1),relation_dom(X2))&subset(relation_rng(X1),relation_rng(X2))))))),inference(assume_negation,[status(cth)],[16])).
% fof(23, 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)],[2])).
% fof(24, 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)],[23])).
% fof(25, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(esk1_3(X5,X6,X7),X7),X5))&(![X9]:~(in(ordered_pair(X9,X7),X5))|in(X7,X6))))&(((~(in(esk2_2(X5,X6),X6))|![X11]:~(in(ordered_pair(X11,esk2_2(X5,X6)),X5)))&(in(esk2_2(X5,X6),X6)|in(ordered_pair(esk3_2(X5,X6),esk2_2(X5,X6)),X5)))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk2_2(X5,X6)),X5))|~(in(esk2_2(X5,X6),X6)))&(in(esk2_2(X5,X6),X6)|in(ordered_pair(esk3_2(X5,X6),esk2_2(X5,X6)),X5)))|X6=relation_rng(X5))&(((~(in(ordered_pair(X9,X7),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(esk1_3(X5,X6,X7),X7),X5)))|~(X6=relation_rng(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(X11,esk2_2(X5,X6)),X5))|~(in(esk2_2(X5,X6),X6)))|X6=relation_rng(X5))|~(relation(X5)))&(((in(esk2_2(X5,X6),X6)|in(ordered_pair(esk3_2(X5,X6),esk2_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(esk1_3(X5,X6,X7),X7),X5))|~(X6=relation_rng(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(in(ordered_pair(esk1_3(X1,X2,X3),X3),X1)|~relation(X1)|X2!=relation_rng(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, 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)],[3])).
% fof(33, 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)],[32])).
% fof(34, plain,![X5]:(~(relation(X5))|![X6]:((~(X6=relation_dom(X5))|![X7]:((~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5))&(![X9]:~(in(ordered_pair(X7,X9),X5))|in(X7,X6))))&(((~(in(esk5_2(X5,X6),X6))|![X11]:~(in(ordered_pair(esk5_2(X5,X6),X11),X5)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)))|X6=relation_dom(X5)))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk5_2(X5,X6),X11),X5))|~(in(esk5_2(X5,X6),X6)))&(in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)))|X6=relation_dom(X5))&(((~(in(ordered_pair(X7,X9),X5))|in(X7,X6))&(~(in(X7,X6))|in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5)))|~(X6=relation_dom(X5))))|~(relation(X5))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(ordered_pair(esk5_2(X5,X6),X11),X5))|~(in(esk5_2(X5,X6),X6)))|X6=relation_dom(X5))|~(relation(X5)))&(((in(esk5_2(X5,X6),X6)|in(ordered_pair(esk5_2(X5,X6),esk6_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,esk4_3(X5,X6,X7)),X5))|~(X6=relation_dom(X5)))|~(relation(X5))))),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(in(ordered_pair(X3,esk4_3(X1,X2,X3)),X1)|~relation(X1)|X2!=relation_dom(X1)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(62, 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)],[10])).
% fof(63, 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)],[62])).
% fof(64, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk9_2(X4,X5),X4)&~(in(esk9_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk9_2(X4,X5),X4)&~(in(esk9_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk9_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk9_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(subset(X1,X2)|~in(esk9_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(subset(X1,X2)|in(esk9_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(76, plain,![X1]:![X2]:![X3]:(~(relation(X3))|(~(in(ordered_pair(X1,X2),X3))|(in(X1,relation_dom(X3))&in(X2,relation_rng(X3))))),inference(fof_nnf,[status(thm)],[12])).
% fof(77, plain,![X4]:![X5]:![X6]:(~(relation(X6))|(~(in(ordered_pair(X4,X5),X6))|(in(X4,relation_dom(X6))&in(X5,relation_rng(X6))))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X4]:![X5]:![X6]:(((in(X4,relation_dom(X6))|~(in(ordered_pair(X4,X5),X6)))|~(relation(X6)))&((in(X5,relation_rng(X6))|~(in(ordered_pair(X4,X5),X6)))|~(relation(X6)))),inference(distribute,[status(thm)],[77])).
% cnf(79,plain,(in(X3,relation_rng(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[78])).
% cnf(80,plain,(in(X2,relation_dom(X1))|~relation(X1)|~in(ordered_pair(X2,X3),X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(89, negated_conjecture,?[X1]:(relation(X1)&?[X2]:(relation(X2)&(subset(X1,X2)&(~(subset(relation_dom(X1),relation_dom(X2)))|~(subset(relation_rng(X1),relation_rng(X2))))))),inference(fof_nnf,[status(thm)],[17])).
% fof(90, negated_conjecture,?[X3]:(relation(X3)&?[X4]:(relation(X4)&(subset(X3,X4)&(~(subset(relation_dom(X3),relation_dom(X4)))|~(subset(relation_rng(X3),relation_rng(X4))))))),inference(variable_rename,[status(thm)],[89])).
% fof(91, negated_conjecture,(relation(esk10_0)&(relation(esk11_0)&(subset(esk10_0,esk11_0)&(~(subset(relation_dom(esk10_0),relation_dom(esk11_0)))|~(subset(relation_rng(esk10_0),relation_rng(esk11_0))))))),inference(skolemize,[status(esa)],[90])).
% cnf(92,negated_conjecture,(~subset(relation_rng(esk10_0),relation_rng(esk11_0))|~subset(relation_dom(esk10_0),relation_dom(esk11_0))),inference(split_conjunct,[status(thm)],[91])).
% cnf(93,negated_conjecture,(subset(esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(94,negated_conjecture,(relation(esk11_0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(95,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(114,negated_conjecture,(in(X1,esk11_0)|~in(X1,esk10_0)),inference(spm,[status(thm)],[69,93,theory(equality)])).
% cnf(154,negated_conjecture,(in(X1,relation_rng(esk11_0))|~relation(esk11_0)|~in(ordered_pair(X2,X1),esk10_0)),inference(spm,[status(thm)],[79,114,theory(equality)])).
% cnf(155,negated_conjecture,(in(X1,relation_dom(esk11_0))|~relation(esk11_0)|~in(ordered_pair(X1,X2),esk10_0)),inference(spm,[status(thm)],[80,114,theory(equality)])).
% cnf(163,negated_conjecture,(in(X1,relation_rng(esk11_0))|$false|~in(ordered_pair(X2,X1),esk10_0)),inference(rw,[status(thm)],[154,94,theory(equality)])).
% cnf(164,negated_conjecture,(in(X1,relation_rng(esk11_0))|~in(ordered_pair(X2,X1),esk10_0)),inference(cn,[status(thm)],[163,theory(equality)])).
% cnf(165,negated_conjecture,(in(X1,relation_dom(esk11_0))|$false|~in(ordered_pair(X1,X2),esk10_0)),inference(rw,[status(thm)],[155,94,theory(equality)])).
% cnf(166,negated_conjecture,(in(X1,relation_dom(esk11_0))|~in(ordered_pair(X1,X2),esk10_0)),inference(cn,[status(thm)],[165,theory(equality)])).
% cnf(195,negated_conjecture,(in(X1,relation_rng(esk11_0))|relation_rng(esk10_0)!=X2|~in(X1,X2)|~relation(esk10_0)),inference(spm,[status(thm)],[164,28,theory(equality)])).
% cnf(201,negated_conjecture,(in(X1,relation_rng(esk11_0))|relation_rng(esk10_0)!=X2|~in(X1,X2)|$false),inference(rw,[status(thm)],[195,95,theory(equality)])).
% cnf(202,negated_conjecture,(in(X1,relation_rng(esk11_0))|relation_rng(esk10_0)!=X2|~in(X1,X2)),inference(cn,[status(thm)],[201,theory(equality)])).
% cnf(208,negated_conjecture,(in(X1,relation_dom(esk11_0))|relation_dom(esk10_0)!=X2|~in(X1,X2)|~relation(esk10_0)),inference(spm,[status(thm)],[166,37,theory(equality)])).
% cnf(215,negated_conjecture,(in(X1,relation_dom(esk11_0))|relation_dom(esk10_0)!=X2|~in(X1,X2)|$false),inference(rw,[status(thm)],[208,95,theory(equality)])).
% cnf(216,negated_conjecture,(in(X1,relation_dom(esk11_0))|relation_dom(esk10_0)!=X2|~in(X1,X2)),inference(cn,[status(thm)],[215,theory(equality)])).
% cnf(228,negated_conjecture,(in(X1,relation_rng(esk11_0))|~in(X1,relation_rng(esk10_0))),inference(er,[status(thm)],[202,theory(equality)])).
% cnf(237,negated_conjecture,(subset(X1,relation_rng(esk11_0))|~in(esk9_2(X1,relation_rng(esk11_0)),relation_rng(esk10_0))),inference(spm,[status(thm)],[67,228,theory(equality)])).
% cnf(252,negated_conjecture,(subset(relation_rng(esk10_0),relation_rng(esk11_0))),inference(spm,[status(thm)],[237,68,theory(equality)])).
% cnf(256,negated_conjecture,($false|~subset(relation_dom(esk10_0),relation_dom(esk11_0))),inference(rw,[status(thm)],[92,252,theory(equality)])).
% cnf(257,negated_conjecture,(~subset(relation_dom(esk10_0),relation_dom(esk11_0))),inference(cn,[status(thm)],[256,theory(equality)])).
% cnf(305,negated_conjecture,(in(X1,relation_dom(esk11_0))|~in(X1,relation_dom(esk10_0))),inference(er,[status(thm)],[216,theory(equality)])).
% cnf(315,negated_conjecture,(subset(X1,relation_dom(esk11_0))|~in(esk9_2(X1,relation_dom(esk11_0)),relation_dom(esk10_0))),inference(spm,[status(thm)],[67,305,theory(equality)])).
% cnf(327,negated_conjecture,(subset(relation_dom(esk10_0),relation_dom(esk11_0))),inference(spm,[status(thm)],[315,68,theory(equality)])).
% cnf(328,negated_conjecture,($false),inference(sr,[status(thm)],[327,257,theory(equality)])).
% cnf(329,negated_conjecture,($false),328,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 140
% # ...of these trivial : 0
% # ...subsumed : 14
% # ...remaining for further processing: 126
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 185
% # ...of the previous two non-trivial : 172
% # Contextual simplify-reflections : 0
% # Paramodulations : 177
% # Factorizations : 4
% # Equation resolutions : 4
% # Current number of processed clauses: 93
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 81
% # Current number of unprocessed clauses: 94
% # ...number of literals in the above : 364
% # Clause-clause subsumption calls (NU) : 382
% # Rec. Clause-clause subsumption calls : 359
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 133 leaves, 1.34+/-1.054 terms/leaf
% # Paramod-from index: 29 leaves, 1.07+/-0.253 terms/leaf
% # Paramod-into index: 116 leaves, 1.22+/-0.717 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.003 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP27693/SEU179+2.tptp
%
%------------------------------------------------------------------------------