TSTP Solution File: SET724+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET724+4 : TPTP v5.0.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Wed Dec 29 23:42:23 EST 2010
% Result : Theorem 91.93s
% Output : Solution 92.45s
% 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/SystemOnTPTP8922/SET724+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thII15:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... compose_function:
% CSA axiom compose_function found
% Looking for CSA axiom ... surjective:
% CSA axiom surjective found
% Looking for CSA axiom ... equal_maps:
% CSA axiom equal_maps found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :equal_maps:surjective:compose_function (3)
% Unselected axioms are ... :maps:one_to_one:injective:isomorphism:singleton:unordered_pair:power_set:compose_predicate:identity:inverse_predicate:inverse_function:image2:image3:inverse_image2:inverse_image3:increasing_function:decreasing_function:equal_set:subset:intersection:union:empty_set:difference:sum:product (25)
% SZS status THM for /tmp/SystemOnTPTP8922/SET724+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP8922/SET724+4.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 9898
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:(equal_maps(X1,X2,X3,X4)<=>![X5]:![X6]:![X7]:(((member(X5,X3)&member(X6,X4))&member(X7,X4))=>((apply(X1,X5,X6)&apply(X2,X5,X7))=>X6=X7))),file('/tmp/SRASS.s.p', equal_maps)).
% fof(2, axiom,![X1]:![X3]:![X4]:(surjective(X1,X3,X4)<=>![X8]:(member(X8,X4)=>?[X9]:(member(X9,X3)&apply(X1,X9,X8)))),file('/tmp/SRASS.s.p', surjective)).
% fof(3, axiom,![X2]:![X1]:![X3]:![X4]:![X10]:![X5]:![X11]:((member(X5,X3)&member(X11,X10))=>(apply(compose_function(X2,X1,X3,X4,X10),X5,X11)<=>?[X8]:((member(X8,X4)&apply(X1,X5,X8))&apply(X2,X8,X11)))),file('/tmp/SRASS.s.p', compose_function)).
% fof(4, conjecture,![X1]:![X2]:![X12]:![X3]:![X4]:![X10]:(((((maps(X1,X3,X4)&maps(X2,X4,X10))&maps(X12,X4,X10))&surjective(X1,X3,X4))&equal_maps(compose_function(X2,X1,X3,X4,X10),compose_function(X12,X1,X3,X4,X10),X3,X10))=>equal_maps(X2,X12,X4,X10)),file('/tmp/SRASS.s.p', thII15)).
% fof(5, negated_conjecture,~(![X1]:![X2]:![X12]:![X3]:![X4]:![X10]:(((((maps(X1,X3,X4)&maps(X2,X4,X10))&maps(X12,X4,X10))&surjective(X1,X3,X4))&equal_maps(compose_function(X2,X1,X3,X4,X10),compose_function(X12,X1,X3,X4,X10),X3,X10))=>equal_maps(X2,X12,X4,X10))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X3]:![X4]:((~(equal_maps(X1,X2,X3,X4))|![X5]:![X6]:![X7]:(((~(member(X5,X3))|~(member(X6,X4)))|~(member(X7,X4)))|((~(apply(X1,X5,X6))|~(apply(X2,X5,X7)))|X6=X7)))&(?[X5]:?[X6]:?[X7]:(((member(X5,X3)&member(X6,X4))&member(X7,X4))&((apply(X1,X5,X6)&apply(X2,X5,X7))&~(X6=X7)))|equal_maps(X1,X2,X3,X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,![X8]:![X9]:![X10]:![X11]:((~(equal_maps(X8,X9,X10,X11))|![X12]:![X13]:![X14]:(((~(member(X12,X10))|~(member(X13,X11)))|~(member(X14,X11)))|((~(apply(X8,X12,X13))|~(apply(X9,X12,X14)))|X13=X14)))&(?[X15]:?[X16]:?[X17]:(((member(X15,X10)&member(X16,X11))&member(X17,X11))&((apply(X8,X15,X16)&apply(X9,X15,X17))&~(X16=X17)))|equal_maps(X8,X9,X10,X11))),inference(variable_rename,[status(thm)],[6])).
% fof(8, plain,![X8]:![X9]:![X10]:![X11]:((~(equal_maps(X8,X9,X10,X11))|![X12]:![X13]:![X14]:(((~(member(X12,X10))|~(member(X13,X11)))|~(member(X14,X11)))|((~(apply(X8,X12,X13))|~(apply(X9,X12,X14)))|X13=X14)))&((((member(esk1_4(X8,X9,X10,X11),X10)&member(esk2_4(X8,X9,X10,X11),X11))&member(esk3_4(X8,X9,X10,X11),X11))&((apply(X8,esk1_4(X8,X9,X10,X11),esk2_4(X8,X9,X10,X11))&apply(X9,esk1_4(X8,X9,X10,X11),esk3_4(X8,X9,X10,X11)))&~(esk2_4(X8,X9,X10,X11)=esk3_4(X8,X9,X10,X11))))|equal_maps(X8,X9,X10,X11))),inference(skolemize,[status(esa)],[7])).
% fof(9, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:(((((~(member(X12,X10))|~(member(X13,X11)))|~(member(X14,X11)))|((~(apply(X8,X12,X13))|~(apply(X9,X12,X14)))|X13=X14))|~(equal_maps(X8,X9,X10,X11)))&((((member(esk1_4(X8,X9,X10,X11),X10)&member(esk2_4(X8,X9,X10,X11),X11))&member(esk3_4(X8,X9,X10,X11),X11))&((apply(X8,esk1_4(X8,X9,X10,X11),esk2_4(X8,X9,X10,X11))&apply(X9,esk1_4(X8,X9,X10,X11),esk3_4(X8,X9,X10,X11)))&~(esk2_4(X8,X9,X10,X11)=esk3_4(X8,X9,X10,X11))))|equal_maps(X8,X9,X10,X11))),inference(shift_quantors,[status(thm)],[8])).
% fof(10, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:(((((~(member(X12,X10))|~(member(X13,X11)))|~(member(X14,X11)))|((~(apply(X8,X12,X13))|~(apply(X9,X12,X14)))|X13=X14))|~(equal_maps(X8,X9,X10,X11)))&((((member(esk1_4(X8,X9,X10,X11),X10)|equal_maps(X8,X9,X10,X11))&(member(esk2_4(X8,X9,X10,X11),X11)|equal_maps(X8,X9,X10,X11)))&(member(esk3_4(X8,X9,X10,X11),X11)|equal_maps(X8,X9,X10,X11)))&(((apply(X8,esk1_4(X8,X9,X10,X11),esk2_4(X8,X9,X10,X11))|equal_maps(X8,X9,X10,X11))&(apply(X9,esk1_4(X8,X9,X10,X11),esk3_4(X8,X9,X10,X11))|equal_maps(X8,X9,X10,X11)))&(~(esk2_4(X8,X9,X10,X11)=esk3_4(X8,X9,X10,X11))|equal_maps(X8,X9,X10,X11))))),inference(distribute,[status(thm)],[9])).
% cnf(11,plain,(equal_maps(X1,X2,X3,X4)|esk2_4(X1,X2,X3,X4)!=esk3_4(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(equal_maps(X1,X2,X3,X4)|apply(X2,esk1_4(X1,X2,X3,X4),esk3_4(X1,X2,X3,X4))),inference(split_conjunct,[status(thm)],[10])).
% cnf(13,plain,(equal_maps(X1,X2,X3,X4)|apply(X1,esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4))),inference(split_conjunct,[status(thm)],[10])).
% cnf(14,plain,(equal_maps(X1,X2,X3,X4)|member(esk3_4(X1,X2,X3,X4),X4)),inference(split_conjunct,[status(thm)],[10])).
% cnf(15,plain,(equal_maps(X1,X2,X3,X4)|member(esk2_4(X1,X2,X3,X4),X4)),inference(split_conjunct,[status(thm)],[10])).
% cnf(16,plain,(equal_maps(X1,X2,X3,X4)|member(esk1_4(X1,X2,X3,X4),X3)),inference(split_conjunct,[status(thm)],[10])).
% cnf(17,plain,(X5=X6|~equal_maps(X1,X2,X3,X4)|~apply(X2,X7,X6)|~apply(X1,X7,X5)|~member(X6,X4)|~member(X5,X4)|~member(X7,X3)),inference(split_conjunct,[status(thm)],[10])).
% fof(18, plain,![X1]:![X3]:![X4]:((~(surjective(X1,X3,X4))|![X8]:(~(member(X8,X4))|?[X9]:(member(X9,X3)&apply(X1,X9,X8))))&(?[X8]:(member(X8,X4)&![X9]:(~(member(X9,X3))|~(apply(X1,X9,X8))))|surjective(X1,X3,X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,![X10]:![X11]:![X12]:((~(surjective(X10,X11,X12))|![X13]:(~(member(X13,X12))|?[X14]:(member(X14,X11)&apply(X10,X14,X13))))&(?[X15]:(member(X15,X12)&![X16]:(~(member(X16,X11))|~(apply(X10,X16,X15))))|surjective(X10,X11,X12))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X10]:![X11]:![X12]:((~(surjective(X10,X11,X12))|![X13]:(~(member(X13,X12))|(member(esk4_4(X10,X11,X12,X13),X11)&apply(X10,esk4_4(X10,X11,X12,X13),X13))))&((member(esk5_3(X10,X11,X12),X12)&![X16]:(~(member(X16,X11))|~(apply(X10,X16,esk5_3(X10,X11,X12)))))|surjective(X10,X11,X12))),inference(skolemize,[status(esa)],[19])).
% fof(21, plain,![X10]:![X11]:![X12]:![X13]:![X16]:((((~(member(X16,X11))|~(apply(X10,X16,esk5_3(X10,X11,X12))))&member(esk5_3(X10,X11,X12),X12))|surjective(X10,X11,X12))&((~(member(X13,X12))|(member(esk4_4(X10,X11,X12,X13),X11)&apply(X10,esk4_4(X10,X11,X12,X13),X13)))|~(surjective(X10,X11,X12)))),inference(shift_quantors,[status(thm)],[20])).
% fof(22, plain,![X10]:![X11]:![X12]:![X13]:![X16]:((((~(member(X16,X11))|~(apply(X10,X16,esk5_3(X10,X11,X12))))|surjective(X10,X11,X12))&(member(esk5_3(X10,X11,X12),X12)|surjective(X10,X11,X12)))&(((member(esk4_4(X10,X11,X12,X13),X11)|~(member(X13,X12)))|~(surjective(X10,X11,X12)))&((apply(X10,esk4_4(X10,X11,X12,X13),X13)|~(member(X13,X12)))|~(surjective(X10,X11,X12))))),inference(distribute,[status(thm)],[21])).
% cnf(23,plain,(apply(X1,esk4_4(X1,X2,X3,X4),X4)|~surjective(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(member(esk4_4(X1,X2,X3,X4),X2)|~surjective(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(27, plain,![X2]:![X1]:![X3]:![X4]:![X10]:![X5]:![X11]:((~(member(X5,X3))|~(member(X11,X10)))|((~(apply(compose_function(X2,X1,X3,X4,X10),X5,X11))|?[X8]:((member(X8,X4)&apply(X1,X5,X8))&apply(X2,X8,X11)))&(![X8]:((~(member(X8,X4))|~(apply(X1,X5,X8)))|~(apply(X2,X8,X11)))|apply(compose_function(X2,X1,X3,X4,X10),X5,X11)))),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:((~(member(X17,X14))|~(member(X18,X16)))|((~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|?[X19]:((member(X19,X15)&apply(X13,X17,X19))&apply(X12,X19,X18)))&(![X20]:((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:((~(member(X17,X14))|~(member(X18,X16)))|((~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|((member(esk6_7(X12,X13,X14,X15,X16,X17,X18),X15)&apply(X13,X17,esk6_7(X12,X13,X14,X15,X16,X17,X18)))&apply(X12,esk6_7(X12,X13,X14,X15,X16,X17,X18),X18)))&(![X20]:((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X20]:(((((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18))&(~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|((member(esk6_7(X12,X13,X14,X15,X16,X17,X18),X15)&apply(X13,X17,esk6_7(X12,X13,X14,X15,X16,X17,X18)))&apply(X12,esk6_7(X12,X13,X14,X15,X16,X17,X18),X18))))|(~(member(X17,X14))|~(member(X18,X16)))),inference(shift_quantors,[status(thm)],[29])).
% fof(31, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X20]:(((((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|(~(member(X17,X14))|~(member(X18,X16))))&((((member(esk6_7(X12,X13,X14,X15,X16,X17,X18),X15)|~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))|(~(member(X17,X14))|~(member(X18,X16))))&((apply(X13,X17,esk6_7(X12,X13,X14,X15,X16,X17,X18))|~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))|(~(member(X17,X14))|~(member(X18,X16)))))&((apply(X12,esk6_7(X12,X13,X14,X15,X16,X17,X18),X18)|~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))|(~(member(X17,X14))|~(member(X18,X16)))))),inference(distribute,[status(thm)],[30])).
% cnf(35,plain,(apply(compose_function(X5,X6,X4,X7,X2),X3,X1)|~member(X1,X2)|~member(X3,X4)|~apply(X5,X8,X1)|~apply(X6,X3,X8)|~member(X8,X7)),inference(split_conjunct,[status(thm)],[31])).
% fof(36, negated_conjecture,?[X1]:?[X2]:?[X12]:?[X3]:?[X4]:?[X10]:(((((maps(X1,X3,X4)&maps(X2,X4,X10))&maps(X12,X4,X10))&surjective(X1,X3,X4))&equal_maps(compose_function(X2,X1,X3,X4,X10),compose_function(X12,X1,X3,X4,X10),X3,X10))&~(equal_maps(X2,X12,X4,X10))),inference(fof_nnf,[status(thm)],[5])).
% fof(37, negated_conjecture,?[X13]:?[X14]:?[X15]:?[X16]:?[X17]:?[X18]:(((((maps(X13,X16,X17)&maps(X14,X17,X18))&maps(X15,X17,X18))&surjective(X13,X16,X17))&equal_maps(compose_function(X14,X13,X16,X17,X18),compose_function(X15,X13,X16,X17,X18),X16,X18))&~(equal_maps(X14,X15,X17,X18))),inference(variable_rename,[status(thm)],[36])).
% fof(38, negated_conjecture,(((((maps(esk7_0,esk10_0,esk11_0)&maps(esk8_0,esk11_0,esk12_0))&maps(esk9_0,esk11_0,esk12_0))&surjective(esk7_0,esk10_0,esk11_0))&equal_maps(compose_function(esk8_0,esk7_0,esk10_0,esk11_0,esk12_0),compose_function(esk9_0,esk7_0,esk10_0,esk11_0,esk12_0),esk10_0,esk12_0))&~(equal_maps(esk8_0,esk9_0,esk11_0,esk12_0))),inference(skolemize,[status(esa)],[37])).
% cnf(39,negated_conjecture,(~equal_maps(esk8_0,esk9_0,esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,negated_conjecture,(equal_maps(compose_function(esk8_0,esk7_0,esk10_0,esk11_0,esk12_0),compose_function(esk9_0,esk7_0,esk10_0,esk11_0,esk12_0),esk10_0,esk12_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(41,negated_conjecture,(surjective(esk7_0,esk10_0,esk11_0)),inference(split_conjunct,[status(thm)],[38])).
% cnf(47,negated_conjecture,(X1=X2|~apply(compose_function(esk9_0,esk7_0,esk10_0,esk11_0,esk12_0),X3,X2)|~apply(compose_function(esk8_0,esk7_0,esk10_0,esk11_0,esk12_0),X3,X1)|~member(X3,esk10_0)|~member(X2,esk12_0)|~member(X1,esk12_0)),inference(spm,[status(thm)],[17,40,theory(equality)])).
% cnf(49,plain,(apply(compose_function(X1,X2,X3,X4,X5),esk4_4(X2,X6,X7,X8),X9)|~apply(X1,X8,X9)|~member(X8,X4)|~member(esk4_4(X2,X6,X7,X8),X3)|~member(X9,X5)|~surjective(X2,X6,X7)|~member(X8,X7)),inference(spm,[status(thm)],[35,23,theory(equality)])).
% cnf(65,negated_conjecture,(X1=X2|~apply(compose_function(esk8_0,esk7_0,esk10_0,esk11_0,esk12_0),esk4_4(esk7_0,X3,X4,X5),X1)|~member(esk4_4(esk7_0,X3,X4,X5),esk10_0)|~member(X2,esk12_0)|~member(X1,esk12_0)|~surjective(esk7_0,X3,X4)|~apply(esk9_0,X5,X2)|~member(X5,esk11_0)|~member(X5,X4)),inference(spm,[status(thm)],[47,49,theory(equality)])).
% cnf(70,negated_conjecture,(X1=X2|~surjective(esk7_0,X3,X4)|~apply(esk9_0,X5,X2)|~member(esk4_4(esk7_0,X3,X4,X5),esk10_0)|~member(X2,esk12_0)|~member(X1,esk12_0)|~member(X5,esk11_0)|~member(X5,X4)|~apply(esk8_0,X5,X1)),inference(spm,[status(thm)],[65,49,theory(equality)])).
% cnf(79,negated_conjecture,(X1=X2|~surjective(esk7_0,esk10_0,X3)|~apply(esk9_0,X4,X2)|~apply(esk8_0,X4,X1)|~member(X2,esk12_0)|~member(X1,esk12_0)|~member(X4,esk11_0)|~member(X4,X3)),inference(spm,[status(thm)],[70,24,theory(equality)])).
% cnf(80,negated_conjecture,(X1=X2|~apply(esk9_0,X3,X2)|~apply(esk8_0,X3,X1)|~member(X2,esk12_0)|~member(X1,esk12_0)|~member(X3,esk11_0)),inference(spm,[status(thm)],[79,41,theory(equality)])).
% cnf(84,negated_conjecture,(X1=esk3_4(X2,esk9_0,X3,X4)|equal_maps(X2,esk9_0,X3,X4)|~apply(esk8_0,esk1_4(X2,esk9_0,X3,X4),X1)|~member(esk3_4(X2,esk9_0,X3,X4),esk12_0)|~member(X1,esk12_0)|~member(esk1_4(X2,esk9_0,X3,X4),esk11_0)),inference(spm,[status(thm)],[80,12,theory(equality)])).
% cnf(99,negated_conjecture,(esk2_4(esk8_0,esk9_0,X1,X2)=esk3_4(esk8_0,esk9_0,X1,X2)|equal_maps(esk8_0,esk9_0,X1,X2)|~member(esk3_4(esk8_0,esk9_0,X1,X2),esk12_0)|~member(esk1_4(esk8_0,esk9_0,X1,X2),esk11_0)|~member(esk2_4(esk8_0,esk9_0,X1,X2),esk12_0)),inference(spm,[status(thm)],[84,13,theory(equality)])).
% cnf(100,negated_conjecture,(equal_maps(esk8_0,esk9_0,X1,X2)|~member(esk3_4(esk8_0,esk9_0,X1,X2),esk12_0)|~member(esk1_4(esk8_0,esk9_0,X1,X2),esk11_0)|~member(esk2_4(esk8_0,esk9_0,X1,X2),esk12_0)),inference(csr,[status(thm)],[99,11])).
% cnf(101,negated_conjecture,(equal_maps(esk8_0,esk9_0,X1,esk12_0)|~member(esk1_4(esk8_0,esk9_0,X1,esk12_0),esk11_0)|~member(esk2_4(esk8_0,esk9_0,X1,esk12_0),esk12_0)),inference(spm,[status(thm)],[100,14,theory(equality)])).
% cnf(102,negated_conjecture,(equal_maps(esk8_0,esk9_0,X1,esk12_0)|~member(esk1_4(esk8_0,esk9_0,X1,esk12_0),esk11_0)),inference(csr,[status(thm)],[101,15])).
% cnf(103,negated_conjecture,(equal_maps(esk8_0,esk9_0,esk11_0,esk12_0)),inference(spm,[status(thm)],[102,16,theory(equality)])).
% cnf(104,negated_conjecture,($false),inference(sr,[status(thm)],[103,39,theory(equality)])).
% cnf(105,negated_conjecture,($false),104,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 67
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 65
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 51
% # ...of the previous two non-trivial : 49
% # Contextual simplify-reflections : 8
% # Paramodulations : 51
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 42
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 24
% # ...number of literals in the above : 198
% # Clause-clause subsumption calls (NU) : 147
% # Rec. Clause-clause subsumption calls : 43
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 87 leaves, 1.82+/-2.147 terms/leaf
% # Paramod-from index: 19 leaves, 1.05+/-0.223 terms/leaf
% # Paramod-into index: 60 leaves, 1.25+/-0.622 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.005 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.18 WC
% FINAL PrfWatch: 0.13 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP8922/SET724+4.tptp
%
%------------------------------------------------------------------------------