TSTP Solution File: SEU221+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU221+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 : 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 02:00:26 EST 2010
% Result : Theorem 146.31s
% Output : Solution 146.95s
% 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/SystemOnTPTP4987/SEU221+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~t62_funct_1:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... dt_k2_funct_1:
% CSA axiom dt_k2_funct_1 found
% Looking for CSA axiom ... rc1_funct_1:
% rc3_funct_1:
% cc2_funct_1:
% CSA axiom cc2_funct_1 found
% Looking for CSA axiom ... fc3_funct_1:
% CSA axiom fc3_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:
% rc3_funct_1:
% d9_funct_1: CSA axiom d9_funct_1 found
% Looking for CSA axiom ... rc2_funct_1:
% CSA axiom rc2_funct_1 found
% Looking for CSA axiom ... fc1_funct_1:
% CSA axiom fc1_funct_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:
% rc3_funct_1:
% fc2_funct_1:
% CSA axiom fc2_funct_1 found
% Looking for CSA axiom ... t55_funct_1:
% CSA axiom t55_funct_1 found
% Looking for CSA axiom ... cc1_funct_1:
% CSA axiom cc1_funct_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:
% rc3_funct_1:
% antisymmetry_r2_hidden:
% CSA axiom antisymmetry_r2_hidden found
% Looking for CSA axiom ... cc1_relat_1:
% CSA axiom cc1_relat_1 found
% Looking for CSA axiom ... dt_k4_relat_1:
% CSA axiom dt_k4_relat_1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% rc3_funct_1:
% dt_k5_relat_1:
% CSA axiom dt_k5_relat_1 found
% Looking for CSA axiom ... dt_k6_relat_1:
% rc1_relat_1:
% rc1_xboole_0:
% rc2_relat_1:
% rc2_xboole_0:
% t2_tarski:
% CSA axiom t2_tarski found
% Looking for CSA axiom ... t54_funct_1:
% CSA axiom t54_funct_1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rc1_funct_1:
% rc3_funct_1:
% dt_k6_relat_1:
% rc1_relat_1:
% rc1_xboole_0:
% rc2_relat_1:
% rc2_xboole_0:
% t57_funct_1:
% CSA axiom t57_funct_1 found
% Looking for CSA axiom ... d8_funct_1:
% CSA axiom d8_funct_1 found
% Looking for CSA axiom ... dt_k7_relat_1:
% CSA axiom dt_k7_relat_1 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :dt_k7_relat_1:d8_funct_1:t57_funct_1:t54_funct_1:t2_tarski:dt_k5_relat_1:dt_k4_relat_1:cc1_relat_1:antisymmetry_r2_hidden:cc1_funct_1:t55_funct_1:fc2_funct_1:fc1_funct_1:rc2_funct_1:d9_funct_1:fc3_funct_1:cc2_funct_1:dt_k2_funct_1 (18)
% Unselected axioms are ... :rc1_funct_1:rc3_funct_1:dt_k6_relat_1:rc1_relat_1:rc1_xboole_0:rc2_relat_1:rc2_xboole_0:dt_k8_relat_1:fc1_relat_1:fc2_relat_1:rc3_relat_1:t64_relat_1:t65_relat_1:t146_relat_1:t25_relat_1:t37_relat_1:involutiveness_k4_relat_1:d4_funct_1:t60_relat_1:t35_funct_1:t71_relat_1:d1_relat_1:d2_relat_1:commutativity_k2_xboole_0:d10_xboole_0:existence_m1_subset_1:fc11_relat_1:idempotence_k2_xboole_0:reflexivity_r1_tarski:symmetry_r1_xboole_0:t118_zfmisc_1:t119_zfmisc_1:t1_xboole_1:fc10_relat_1:fc5_relat_1:fc7_relat_1:fc9_relat_1:t46_relat_1:t47_relat_1:commutativity_k3_xboole_0:fc4_relat_1:fc6_relat_1:fc8_relat_1:idempotence_k3_xboole_0:d6_relat_1:t20_relat_1:t8_boole:d1_tarski:d1_xboole_0:d2_xboole_0:d3_xboole_0:d4_xboole_0:d7_relat_1:t21_relat_1:d2_tarski:d4_relat_1:d4_tarski:d5_relat_1:t7_boole:t143_relat_1:t166_relat_1:t17_xboole_1:t19_xboole_1:t22_funct_1:t23_funct_1:t26_xboole_1:t34_funct_1:t74_relat_1:t8_funct_1:t119_relat_1:t140_relat_1:t145_relat_1:t160_relat_1:t56_relat_1:t90_relat_1:t94_relat_1:antisymmetry_r2_xboole_0:d10_relat_1:d11_relat_1:d12_relat_1:d13_relat_1:d14_relat_1:d3_relat_1:d8_relat_1:fc1_subset_1:fc1_xboole_0:fc1_zfmisc_1:irreflexivity_r2_xboole_0:t21_funct_1:t60_xboole_1:t6_boole:d3_tarski:fc2_subset_1:fc2_xboole_0:fc3_subset_1:fc3_xboole_0:t115_relat_1:t44_relat_1:t45_relat_1:t86_relat_1:d2_zfmisc_1:fc12_relat_1:fc4_subset_1:t116_relat_1:t118_relat_1:t144_relat_1:t167_relat_1:t30_relat_1:t99_relat_1:d1_zfmisc_1:rc1_subset_1:rc2_subset_1:t12_xboole_1:t1_subset:t3_subset:t3_xboole_1:d2_subset_1:l25_zfmisc_1:l28_zfmisc_1:l3_subset_1:l55_zfmisc_1:l71_subset_1:t106_zfmisc_1:t174_relat_1:t1_boole:t2_subset:t39_xboole_1:t3_xboole_0:t40_xboole_1:t48_xboole_1:t4_subset:t99_zfmisc_1:d1_setfam_1:l1_zfmisc_1:l23_zfmisc_1:t117_relat_1:t178_relat_1:t28_xboole_1:t2_boole:t33_zfmisc_1:t3_boole:t46_zfmisc_1:t4_boole:t65_zfmisc_1:t6_zfmisc_1:t88_relat_1:d8_xboole_0:l32_xboole_1:t37_xboole_1:commutativity_k2_tarski:d4_subset_1:d7_xboole_0:l4_zfmisc_1:t10_zfmisc_1:t1_zfmisc_1:t2_xboole_1:t33_xboole_1:t36_xboole_1:t39_zfmisc_1:t45_xboole_1:t4_xboole_0:t7_xboole_1:t8_xboole_1:t5_subset:dt_k2_subset_1:dt_k3_subset_1:dt_k5_setfam_1:dt_k6_setfam_1:dt_k6_subset_1:dt_k7_setfam_1:l3_zfmisc_1:d5_tarski:involutiveness_k3_subset_1:involutiveness_k7_setfam_1:l2_zfmisc_1:l50_zfmisc_1:t136_zfmisc_1:t37_zfmisc_1:t38_zfmisc_1:t50_subset_1:t54_subset_1:t63_xboole_1:t69_enumset1:t83_xboole_1:t8_zfmisc_1:t92_zfmisc_1:t9_tarski:t9_zfmisc_1:d8_setfam_1:redefinition_k5_setfam_1:d5_subset_1:redefinition_k6_setfam_1:redefinition_k6_subset_1:t43_subset_1:t46_setfam_1:t47_setfam_1:t48_setfam_1:dt_k10_relat_1:dt_k1_funct_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_relat_1:dt_k3_tarski:dt_k3_xboole_0:dt_k4_tarski:dt_k4_xboole_0:dt_k9_relat_1:dt_m1_subset_1 (215)
% SZS status THM for /tmp/SystemOnTPTP4987/SEU221+2.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP4987/SEU221+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 11596
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)<=>![X2]:![X3]:(((in(X2,relation_dom(X1))&in(X3,relation_dom(X1)))&apply(X1,X2)=apply(X1,X3))=>X2=X3))),file('/tmp/SRASS.s.p', d8_funct_1)).
% fof(3, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>((one_to_one(X2)&in(X1,relation_rng(X2)))=>(X1=apply(X2,apply(function_inverse(X2),X1))&X1=apply(relation_composition(function_inverse(X2),X2),X1)))),file('/tmp/SRASS.s.p', t57_funct_1)).
% fof(11, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_rng(X1)=relation_dom(function_inverse(X1))&relation_dom(X1)=relation_rng(function_inverse(X1))))),file('/tmp/SRASS.s.p', t55_funct_1)).
% fof(18, axiom,![X1]:((relation(X1)&function(X1))=>(relation(function_inverse(X1))&function(function_inverse(X1)))),file('/tmp/SRASS.s.p', dt_k2_funct_1)).
% fof(19, conjecture,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>one_to_one(function_inverse(X1)))),file('/tmp/SRASS.s.p', t62_funct_1)).
% fof(20, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>one_to_one(function_inverse(X1))))),inference(assume_negation,[status(cth)],[19])).
% fof(25, plain,![X1]:((~(relation(X1))|~(function(X1)))|((~(one_to_one(X1))|![X2]:![X3]:(((~(in(X2,relation_dom(X1)))|~(in(X3,relation_dom(X1))))|~(apply(X1,X2)=apply(X1,X3)))|X2=X3))&(?[X2]:?[X3]:(((in(X2,relation_dom(X1))&in(X3,relation_dom(X1)))&apply(X1,X2)=apply(X1,X3))&~(X2=X3))|one_to_one(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X4]:((~(relation(X4))|~(function(X4)))|((~(one_to_one(X4))|![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6))&(?[X7]:?[X8]:(((in(X7,relation_dom(X4))&in(X8,relation_dom(X4)))&apply(X4,X7)=apply(X4,X8))&~(X7=X8))|one_to_one(X4)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X4]:((~(relation(X4))|~(function(X4)))|((~(one_to_one(X4))|![X5]:![X6]:(((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6))&((((in(esk1_1(X4),relation_dom(X4))&in(esk2_1(X4),relation_dom(X4)))&apply(X4,esk1_1(X4))=apply(X4,esk2_1(X4)))&~(esk1_1(X4)=esk2_1(X4)))|one_to_one(X4)))),inference(skolemize,[status(esa)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:((((((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6)|~(one_to_one(X4)))&((((in(esk1_1(X4),relation_dom(X4))&in(esk2_1(X4),relation_dom(X4)))&apply(X4,esk1_1(X4))=apply(X4,esk2_1(X4)))&~(esk1_1(X4)=esk2_1(X4)))|one_to_one(X4)))|(~(relation(X4))|~(function(X4)))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:((((((~(in(X5,relation_dom(X4)))|~(in(X6,relation_dom(X4))))|~(apply(X4,X5)=apply(X4,X6)))|X5=X6)|~(one_to_one(X4)))|(~(relation(X4))|~(function(X4))))&(((((in(esk1_1(X4),relation_dom(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4))))&((in(esk2_1(X4),relation_dom(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4)))))&((apply(X4,esk1_1(X4))=apply(X4,esk2_1(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4)))))&((~(esk1_1(X4)=esk2_1(X4))|one_to_one(X4))|(~(relation(X4))|~(function(X4)))))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(one_to_one(X1)|~function(X1)|~relation(X1)|esk1_1(X1)!=esk2_1(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,plain,(one_to_one(X1)|apply(X1,esk1_1(X1))=apply(X1,esk2_1(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,plain,(one_to_one(X1)|in(esk2_1(X1),relation_dom(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(33,plain,(one_to_one(X1)|in(esk1_1(X1),relation_dom(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(35, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|((~(one_to_one(X2))|~(in(X1,relation_rng(X2))))|(X1=apply(X2,apply(function_inverse(X2),X1))&X1=apply(relation_composition(function_inverse(X2),X2),X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(36, plain,![X3]:![X4]:((~(relation(X4))|~(function(X4)))|((~(one_to_one(X4))|~(in(X3,relation_rng(X4))))|(X3=apply(X4,apply(function_inverse(X4),X3))&X3=apply(relation_composition(function_inverse(X4),X4),X3)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:(((X3=apply(X4,apply(function_inverse(X4),X3))|(~(one_to_one(X4))|~(in(X3,relation_rng(X4)))))|(~(relation(X4))|~(function(X4))))&((X3=apply(relation_composition(function_inverse(X4),X4),X3)|(~(one_to_one(X4))|~(in(X3,relation_rng(X4)))))|(~(relation(X4))|~(function(X4))))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(X2=apply(X1,apply(function_inverse(X1),X2))|~function(X1)|~relation(X1)|~in(X2,relation_rng(X1))|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(80, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|(relation_rng(X1)=relation_dom(function_inverse(X1))&relation_dom(X1)=relation_rng(function_inverse(X1))))),inference(fof_nnf,[status(thm)],[11])).
% fof(81, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|(relation_rng(X2)=relation_dom(function_inverse(X2))&relation_dom(X2)=relation_rng(function_inverse(X2))))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X2]:(((relation_rng(X2)=relation_dom(function_inverse(X2))|~(one_to_one(X2)))|(~(relation(X2))|~(function(X2))))&((relation_dom(X2)=relation_rng(function_inverse(X2))|~(one_to_one(X2)))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[81])).
% cnf(84,plain,(relation_rng(X1)=relation_dom(function_inverse(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(112, plain,![X1]:((~(relation(X1))|~(function(X1)))|(relation(function_inverse(X1))&function(function_inverse(X1)))),inference(fof_nnf,[status(thm)],[18])).
% fof(113, plain,![X2]:((~(relation(X2))|~(function(X2)))|(relation(function_inverse(X2))&function(function_inverse(X2)))),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,![X2]:((relation(function_inverse(X2))|(~(relation(X2))|~(function(X2))))&(function(function_inverse(X2))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[113])).
% cnf(115,plain,(function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[114])).
% cnf(116,plain,(relation(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[114])).
% fof(117, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(one_to_one(X1)&~(one_to_one(function_inverse(X1))))),inference(fof_nnf,[status(thm)],[20])).
% fof(118, negated_conjecture,?[X2]:((relation(X2)&function(X2))&(one_to_one(X2)&~(one_to_one(function_inverse(X2))))),inference(variable_rename,[status(thm)],[117])).
% fof(119, negated_conjecture,((relation(esk7_0)&function(esk7_0))&(one_to_one(esk7_0)&~(one_to_one(function_inverse(esk7_0))))),inference(skolemize,[status(esa)],[118])).
% cnf(120,negated_conjecture,(~one_to_one(function_inverse(esk7_0))),inference(split_conjunct,[status(thm)],[119])).
% cnf(121,negated_conjecture,(one_to_one(esk7_0)),inference(split_conjunct,[status(thm)],[119])).
% cnf(122,negated_conjecture,(function(esk7_0)),inference(split_conjunct,[status(thm)],[119])).
% cnf(123,negated_conjecture,(relation(esk7_0)),inference(split_conjunct,[status(thm)],[119])).
% cnf(138,plain,(in(esk1_1(function_inverse(X1)),relation_rng(X1))|one_to_one(function_inverse(X1))|~function(function_inverse(X1))|~relation(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[33,84,theory(equality)])).
% cnf(140,plain,(in(esk2_1(function_inverse(X1)),relation_rng(X1))|one_to_one(function_inverse(X1))|~function(function_inverse(X1))|~relation(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[32,84,theory(equality)])).
% cnf(182,plain,(in(esk1_1(function_inverse(X1)),relation_rng(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[138,116])).
% cnf(183,plain,(in(esk1_1(function_inverse(X1)),relation_rng(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[182,115])).
% cnf(185,plain,(apply(X1,apply(function_inverse(X1),esk1_1(function_inverse(X1))))=esk1_1(function_inverse(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[39,183,theory(equality)])).
% cnf(188,plain,(in(esk2_1(function_inverse(X1)),relation_rng(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[140,116])).
% cnf(189,plain,(in(esk2_1(function_inverse(X1)),relation_rng(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[188,115])).
% cnf(191,plain,(apply(X1,apply(function_inverse(X1),esk2_1(function_inverse(X1))))=esk2_1(function_inverse(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[39,189,theory(equality)])).
% cnf(204,plain,(apply(X1,apply(function_inverse(X1),esk1_1(function_inverse(X1))))=esk2_1(function_inverse(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)|~function(function_inverse(X1))|~relation(function_inverse(X1))),inference(spm,[status(thm)],[191,31,theory(equality)])).
% cnf(226,plain,(apply(X1,apply(function_inverse(X1),esk1_1(function_inverse(X1))))=esk2_1(function_inverse(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[204,116])).
% cnf(227,plain,(apply(X1,apply(function_inverse(X1),esk1_1(function_inverse(X1))))=esk2_1(function_inverse(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[226,115])).
% cnf(231,plain,(esk2_1(function_inverse(X1))=esk1_1(function_inverse(X1))|one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[185,227,theory(equality)])).
% cnf(232,plain,(one_to_one(function_inverse(X1))|~function(function_inverse(X1))|~relation(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[30,231,theory(equality)])).
% cnf(239,plain,(one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[232,116])).
% cnf(240,plain,(one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(csr,[status(thm)],[239,115])).
% cnf(241,negated_conjecture,(~one_to_one(esk7_0)|~function(esk7_0)|~relation(esk7_0)),inference(spm,[status(thm)],[120,240,theory(equality)])).
% cnf(247,negated_conjecture,($false|~function(esk7_0)|~relation(esk7_0)),inference(rw,[status(thm)],[241,121,theory(equality)])).
% cnf(248,negated_conjecture,($false|$false|~relation(esk7_0)),inference(rw,[status(thm)],[247,122,theory(equality)])).
% cnf(249,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[248,123,theory(equality)])).
% cnf(250,negated_conjecture,($false),inference(cn,[status(thm)],[249,theory(equality)])).
% cnf(251,negated_conjecture,($false),250,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 114
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 107
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 0
% # Generated clauses : 87
% # ...of the previous two non-trivial : 70
% # Contextual simplify-reflections : 34
% # Paramodulations : 78
% # Factorizations : 2
% # Equation resolutions : 7
% # Current number of processed clauses: 54
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 44
% # Current number of unprocessed clauses: 21
% # ...number of literals in the above : 200
% # Clause-clause subsumption calls (NU) : 276
% # Rec. Clause-clause subsumption calls : 109
% # 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: 71 leaves, 1.51+/-1.124 terms/leaf
% # Paramod-from index: 24 leaves, 1.04+/-0.200 terms/leaf
% # Paramod-into index: 45 leaves, 1.18+/-0.485 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.004 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP4987/SEU221+2.tptp
%
%------------------------------------------------------------------------------