TSTP Solution File: SEU215+3 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU215+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art09.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:55:31 EST 2010

% Result   : Theorem 106.67s
% Output   : Solution 106.94s
% 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/SystemOnTPTP952/SEU215+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~t23_funct_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... antisymmetry_r2_hidden:
%  CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... dt_k5_relat_1:
%  CSA axiom dt_k5_relat_1 found
% Looking for CSA axiom ... fc1_funct_1:
%  CSA axiom fc1_funct_1 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc1_funct_1:
% t21_funct_1:
%  CSA axiom t21_funct_1 found
% Looking for CSA axiom ... t22_funct_1:
%  CSA axiom t22_funct_1 found
% Looking for CSA axiom ... fc10_relat_1:
%  CSA axiom fc10_relat_1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... rc1_funct_1:
% fc5_relat_1:
%  CSA axiom fc5_relat_1 found
% Looking for CSA axiom ... fc7_relat_1:
%  CSA axiom fc7_relat_1 found
% Looking for CSA axiom ... fc9_relat_1:
%  CSA axiom fc9_relat_1 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... rc1_funct_1:
% d4_funct_1:
%  CSA axiom d4_funct_1 found
% Looking for CSA axiom ... cc1_funct_1:
%  CSA axiom cc1_funct_1 found
% Looking for CSA axiom ... t8_boole:
%  CSA axiom t8_boole found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :t8_boole:cc1_funct_1:d4_funct_1:fc9_relat_1:fc7_relat_1:fc5_relat_1:fc10_relat_1:t22_funct_1:t21_funct_1:fc1_funct_1:dt_k5_relat_1:antisymmetry_r2_hidden (12)
% Unselected axioms are ... :rc1_funct_1:t7_boole:cc1_relat_1:rc1_relat_1:rc2_relat_1:existence_m1_subset_1:rc1_xboole_0:rc2_xboole_0:t1_subset:commutativity_k2_tarski:t6_boole:fc4_relat_1:rc3_relat_1:fc1_xboole_0:fc1_zfmisc_1:fc3_subset_1:fc1_subset_1:t4_subset:t2_subset:t5_subset:fc12_relat_1:reflexivity_r1_tarski:d5_tarski:fc2_subset_1:t3_subset:rc1_subset_1:rc2_subset_1 (27)
% SZS status THM for /tmp/SystemOnTPTP952/SEU215+3.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP952/SEU215+3.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 3788
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:![X3]:((in(X2,relation_dom(X1))=>(X3=apply(X1,X2)<=>in(ordered_pair(X2,X3),X1)))&(~(in(X2,relation_dom(X1)))=>(X3=apply(X1,X2)<=>X3=empty_set)))),file('/tmp/SRASS.s.p', d4_funct_1)).
% fof(8, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(in(X1,relation_dom(relation_composition(X3,X2)))=>apply(relation_composition(X3,X2),X1)=apply(X2,apply(X3,X1))))),file('/tmp/SRASS.s.p', t22_funct_1)).
% fof(9, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(in(X1,relation_dom(relation_composition(X3,X2)))<=>(in(X1,relation_dom(X3))&in(apply(X3,X1),relation_dom(X2)))))),file('/tmp/SRASS.s.p', t21_funct_1)).
% fof(10, axiom,![X1]:![X2]:((((relation(X1)&function(X1))&relation(X2))&function(X2))=>(relation(relation_composition(X1,X2))&function(relation_composition(X1,X2)))),file('/tmp/SRASS.s.p', fc1_funct_1)).
% fof(11, axiom,![X1]:![X2]:((relation(X1)&relation(X2))=>relation(relation_composition(X1,X2))),file('/tmp/SRASS.s.p', dt_k5_relat_1)).
% fof(13, conjecture,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(in(X1,relation_dom(X2))=>apply(relation_composition(X2,X3),X1)=apply(X3,apply(X2,X1))))),file('/tmp/SRASS.s.p', t23_funct_1)).
% fof(14, negated_conjecture,~(![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>(in(X1,relation_dom(X2))=>apply(relation_composition(X2,X3),X1)=apply(X3,apply(X2,X1)))))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:((relation(X1)&function(X1))=>![X2]:![X3]:((in(X2,relation_dom(X1))=>(X3=apply(X1,X2)<=>in(ordered_pair(X2,X3),X1)))&(~(in(X2,relation_dom(X1)))=>(X3=apply(X1,X2)<=>X3=empty_set)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(24, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:![X3]:((~(in(X2,relation_dom(X1)))|((~(X3=apply(X1,X2))|in(ordered_pair(X2,X3),X1))&(~(in(ordered_pair(X2,X3),X1))|X3=apply(X1,X2))))&(in(X2,relation_dom(X1))|((~(X3=apply(X1,X2))|X3=empty_set)&(~(X3=empty_set)|X3=apply(X1,X2)))))),inference(fof_nnf,[status(thm)],[15])).
% fof(25, plain,![X4]:((~(relation(X4))|~(function(X4)))|![X5]:![X6]:((~(in(X5,relation_dom(X4)))|((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))&(~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))))&(in(X5,relation_dom(X4))|((~(X6=apply(X4,X5))|X6=empty_set)&(~(X6=empty_set)|X6=apply(X4,X5)))))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))&(~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))))&(in(X5,relation_dom(X4))|((~(X6=apply(X4,X5))|X6=empty_set)&(~(X6=empty_set)|X6=apply(X4,X5)))))|(~(relation(X4))|~(function(X4)))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:(((((~(X6=apply(X4,X5))|in(ordered_pair(X5,X6),X4))|~(in(X5,relation_dom(X4))))|(~(relation(X4))|~(function(X4))))&(((~(in(ordered_pair(X5,X6),X4))|X6=apply(X4,X5))|~(in(X5,relation_dom(X4))))|(~(relation(X4))|~(function(X4)))))&((((~(X6=apply(X4,X5))|X6=empty_set)|in(X5,relation_dom(X4)))|(~(relation(X4))|~(function(X4))))&(((~(X6=empty_set)|X6=apply(X4,X5))|in(X5,relation_dom(X4)))|(~(relation(X4))|~(function(X4)))))),inference(distribute,[status(thm)],[26])).
% cnf(29,plain,(in(X2,relation_dom(X1))|X3=empty_set|~function(X1)|~relation(X1)|X3!=apply(X1,X2)),inference(split_conjunct,[status(thm)],[27])).
% fof(50, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|(~(in(X1,relation_dom(relation_composition(X3,X2))))|apply(relation_composition(X3,X2),X1)=apply(X2,apply(X3,X1))))),inference(fof_nnf,[status(thm)],[8])).
% fof(51, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(relation(X6))|~(function(X6)))|(~(in(X4,relation_dom(relation_composition(X6,X5))))|apply(relation_composition(X6,X5),X4)=apply(X5,apply(X6,X4))))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:(((~(relation(X6))|~(function(X6)))|(~(in(X4,relation_dom(relation_composition(X6,X5))))|apply(relation_composition(X6,X5),X4)=apply(X5,apply(X6,X4))))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[51])).
% cnf(53,plain,(apply(relation_composition(X2,X1),X3)=apply(X1,apply(X2,X3))|~function(X1)|~relation(X1)|~in(X3,relation_dom(relation_composition(X2,X1)))|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|((~(in(X1,relation_dom(relation_composition(X3,X2))))|(in(X1,relation_dom(X3))&in(apply(X3,X1),relation_dom(X2))))&((~(in(X1,relation_dom(X3)))|~(in(apply(X3,X1),relation_dom(X2))))|in(X1,relation_dom(relation_composition(X3,X2))))))),inference(fof_nnf,[status(thm)],[9])).
% fof(55, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(relation(X6))|~(function(X6)))|((~(in(X4,relation_dom(relation_composition(X6,X5))))|(in(X4,relation_dom(X6))&in(apply(X6,X4),relation_dom(X5))))&((~(in(X4,relation_dom(X6)))|~(in(apply(X6,X4),relation_dom(X5))))|in(X4,relation_dom(relation_composition(X6,X5))))))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X4]:![X5]:![X6]:(((~(relation(X6))|~(function(X6)))|((~(in(X4,relation_dom(relation_composition(X6,X5))))|(in(X4,relation_dom(X6))&in(apply(X6,X4),relation_dom(X5))))&((~(in(X4,relation_dom(X6)))|~(in(apply(X6,X4),relation_dom(X5))))|in(X4,relation_dom(relation_composition(X6,X5))))))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X4]:![X5]:![X6]:(((((in(X4,relation_dom(X6))|~(in(X4,relation_dom(relation_composition(X6,X5)))))|(~(relation(X6))|~(function(X6))))|(~(relation(X5))|~(function(X5))))&(((in(apply(X6,X4),relation_dom(X5))|~(in(X4,relation_dom(relation_composition(X6,X5)))))|(~(relation(X6))|~(function(X6))))|(~(relation(X5))|~(function(X5)))))&((((~(in(X4,relation_dom(X6)))|~(in(apply(X6,X4),relation_dom(X5))))|in(X4,relation_dom(relation_composition(X6,X5))))|(~(relation(X6))|~(function(X6))))|(~(relation(X5))|~(function(X5))))),inference(distribute,[status(thm)],[56])).
% cnf(58,plain,(in(X3,relation_dom(relation_composition(X2,X1)))|~function(X1)|~relation(X1)|~function(X2)|~relation(X2)|~in(apply(X2,X3),relation_dom(X1))|~in(X3,relation_dom(X2))),inference(split_conjunct,[status(thm)],[57])).
% fof(61, plain,![X1]:![X2]:((((~(relation(X1))|~(function(X1)))|~(relation(X2)))|~(function(X2)))|(relation(relation_composition(X1,X2))&function(relation_composition(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(62, plain,![X3]:![X4]:((((~(relation(X3))|~(function(X3)))|~(relation(X4)))|~(function(X4)))|(relation(relation_composition(X3,X4))&function(relation_composition(X3,X4)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X3]:![X4]:((relation(relation_composition(X3,X4))|(((~(relation(X3))|~(function(X3)))|~(relation(X4)))|~(function(X4))))&(function(relation_composition(X3,X4))|(((~(relation(X3))|~(function(X3)))|~(relation(X4)))|~(function(X4))))),inference(distribute,[status(thm)],[62])).
% cnf(64,plain,(function(relation_composition(X2,X1))|~function(X1)|~relation(X1)|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[63])).
% fof(66, plain,![X1]:![X2]:((~(relation(X1))|~(relation(X2)))|relation(relation_composition(X1,X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(67, plain,![X3]:![X4]:((~(relation(X3))|~(relation(X4)))|relation(relation_composition(X3,X4))),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(72, negated_conjecture,?[X1]:?[X2]:((relation(X2)&function(X2))&?[X3]:((relation(X3)&function(X3))&(in(X1,relation_dom(X2))&~(apply(relation_composition(X2,X3),X1)=apply(X3,apply(X2,X1)))))),inference(fof_nnf,[status(thm)],[14])).
% fof(73, negated_conjecture,?[X4]:?[X5]:((relation(X5)&function(X5))&?[X6]:((relation(X6)&function(X6))&(in(X4,relation_dom(X5))&~(apply(relation_composition(X5,X6),X4)=apply(X6,apply(X5,X4)))))),inference(variable_rename,[status(thm)],[72])).
% fof(74, negated_conjecture,((relation(esk2_0)&function(esk2_0))&((relation(esk3_0)&function(esk3_0))&(in(esk1_0,relation_dom(esk2_0))&~(apply(relation_composition(esk2_0,esk3_0),esk1_0)=apply(esk3_0,apply(esk2_0,esk1_0)))))),inference(skolemize,[status(esa)],[73])).
% cnf(75,negated_conjecture,(apply(relation_composition(esk2_0,esk3_0),esk1_0)!=apply(esk3_0,apply(esk2_0,esk1_0))),inference(split_conjunct,[status(thm)],[74])).
% cnf(76,negated_conjecture,(in(esk1_0,relation_dom(esk2_0))),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,negated_conjecture,(function(esk3_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(78,negated_conjecture,(relation(esk3_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(79,negated_conjecture,(function(esk2_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(80,negated_conjecture,(relation(esk2_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(94,plain,(empty_set=apply(X1,X2)|in(X2,relation_dom(X1))|~relation(X1)|~function(X1)),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(101,negated_conjecture,(~in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|~relation(esk2_0)|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)),inference(spm,[status(thm)],[75,53,theory(equality)])).
% cnf(105,negated_conjecture,(~in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)),inference(rw,[status(thm)],[101,80,theory(equality)])).
% cnf(106,negated_conjecture,(~in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|~function(esk2_0)|~function(esk3_0)),inference(rw,[status(thm)],[105,78,theory(equality)])).
% cnf(107,negated_conjecture,(~in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|$false|~function(esk3_0)),inference(rw,[status(thm)],[106,79,theory(equality)])).
% cnf(108,negated_conjecture,(~in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|$false|$false),inference(rw,[status(thm)],[107,77,theory(equality)])).
% cnf(109,negated_conjecture,(~in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))),inference(cn,[status(thm)],[108,theory(equality)])).
% cnf(136,negated_conjecture,(in(apply(esk2_0,esk1_0),relation_dom(esk3_0))|empty_set!=apply(relation_composition(esk2_0,esk3_0),esk1_0)|~relation(esk3_0)|~function(esk3_0)),inference(spm,[status(thm)],[75,94,theory(equality)])).
% cnf(155,negated_conjecture,(in(apply(esk2_0,esk1_0),relation_dom(esk3_0))|empty_set!=apply(relation_composition(esk2_0,esk3_0),esk1_0)|$false|~function(esk3_0)),inference(rw,[status(thm)],[136,78,theory(equality)])).
% cnf(156,negated_conjecture,(in(apply(esk2_0,esk1_0),relation_dom(esk3_0))|empty_set!=apply(relation_composition(esk2_0,esk3_0),esk1_0)|$false|$false),inference(rw,[status(thm)],[155,77,theory(equality)])).
% cnf(157,negated_conjecture,(in(apply(esk2_0,esk1_0),relation_dom(esk3_0))|empty_set!=apply(relation_composition(esk2_0,esk3_0),esk1_0)),inference(cn,[status(thm)],[156,theory(equality)])).
% cnf(169,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|~in(esk1_0,relation_dom(esk2_0))|~relation(esk2_0)|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(spm,[status(thm)],[58,157,theory(equality)])).
% cnf(171,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|~relation(esk2_0)|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(rw,[status(thm)],[169,76,theory(equality)])).
% cnf(172,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(rw,[status(thm)],[171,80,theory(equality)])).
% cnf(173,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|$false|~function(esk2_0)|~function(esk3_0)|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(rw,[status(thm)],[172,78,theory(equality)])).
% cnf(174,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|$false|$false|~function(esk3_0)|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(rw,[status(thm)],[173,79,theory(equality)])).
% cnf(175,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|$false|$false|$false|$false|$false|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(rw,[status(thm)],[174,77,theory(equality)])).
% cnf(176,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(cn,[status(thm)],[175,theory(equality)])).
% cnf(177,negated_conjecture,(apply(relation_composition(esk2_0,esk3_0),esk1_0)!=empty_set),inference(sr,[status(thm)],[176,109,theory(equality)])).
% cnf(182,negated_conjecture,(in(esk1_0,relation_dom(relation_composition(esk2_0,esk3_0)))|~relation(relation_composition(esk2_0,esk3_0))|~function(relation_composition(esk2_0,esk3_0))),inference(spm,[status(thm)],[177,94,theory(equality)])).
% cnf(183,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))|~function(relation_composition(esk2_0,esk3_0))),inference(sr,[status(thm)],[182,109,theory(equality)])).
% cnf(184,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))|~relation(esk2_0)|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)),inference(spm,[status(thm)],[183,64,theory(equality)])).
% cnf(187,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))|$false|~relation(esk3_0)|~function(esk2_0)|~function(esk3_0)),inference(rw,[status(thm)],[184,80,theory(equality)])).
% cnf(188,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))|$false|$false|~function(esk2_0)|~function(esk3_0)),inference(rw,[status(thm)],[187,78,theory(equality)])).
% cnf(189,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))|$false|$false|$false|~function(esk3_0)),inference(rw,[status(thm)],[188,79,theory(equality)])).
% cnf(190,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))|$false|$false|$false|$false),inference(rw,[status(thm)],[189,77,theory(equality)])).
% cnf(191,negated_conjecture,(~relation(relation_composition(esk2_0,esk3_0))),inference(cn,[status(thm)],[190,theory(equality)])).
% cnf(198,negated_conjecture,(~relation(esk3_0)|~relation(esk2_0)),inference(spm,[status(thm)],[191,68,theory(equality)])).
% cnf(203,negated_conjecture,($false|~relation(esk2_0)),inference(rw,[status(thm)],[198,78,theory(equality)])).
% cnf(204,negated_conjecture,($false|$false),inference(rw,[status(thm)],[203,80,theory(equality)])).
% cnf(205,negated_conjecture,($false),inference(cn,[status(thm)],[204,theory(equality)])).
% cnf(206,negated_conjecture,($false),205,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 79
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 78
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 78
% # ...of the previous two non-trivial : 62
% # Contextual simplify-reflections    : 7
% # Paramodulations                    : 74
% # Factorizations                     : 0
% # Equation resolutions               : 4
% # Current number of processed clauses: 52
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 5
% #    Non-unit-clauses                : 42
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 289
% # Clause-clause subsumption calls (NU) : 476
% # Rec. Clause-clause subsumption calls : 387
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    76 leaves,   1.95+/-1.820 terms/leaf
% # Paramod-from index:           17 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           54 leaves,   1.33+/-0.861 terms/leaf
% # -------------------------------------------------
% # User time              : 0.023 s
% # System time            : 0.002 s
% # Total time             : 0.025 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/SystemOnTPTP952/SEU215+3.tptp
% 
%------------------------------------------------------------------------------