TSTP Solution File: CSR116+22 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR116+22 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 02:49:32 EDT 2022
% Result : Theorem 7.45s 2.56s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 25
% Syntax : Number of clauses : 70 ( 22 unt; 0 nHn; 70 RR)
% Number of literals : 306 ( 0 equ; 256 neg)
% Maximal clause size : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 14 con; 0-3 aty)
% Number of variables : 217 ( 56 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_629,negated_conjecture,
( ~ in(X1,X2)
| ~ sub(X3,X4)
| ~ obj(X5,X6)
| ~ arg1(X7,X6)
| ~ arg2(X7,X3)
| ~ attr(X6,X8)
| ~ attr(X6,X9)
| ~ attr(X2,X10)
| ~ sub(X10,name_1_1)
| ~ sub(X8,eigenname_1_1)
| ~ sub(X9,familiename_1_1)
| ~ subr(X7,rprs_0)
| ~ val(X10,s__374dafrika_0)
| ~ val(X8,nelson_0)
| ~ val(X9,mandela_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_629) ).
cnf(i_0_606,plain,
( subr(esk55_3(X1,X2,X3),rprs_0)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_606) ).
cnf(i_0_611,plain,
( arg2(esk55_3(X1,X2,X3),esk56_3(X1,X2,X3))
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_611) ).
cnf(i_0_612,plain,
( arg1(esk55_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_612) ).
cnf(i_0_607,plain,
( sub(esk56_3(X1,X2,X3),X3)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_607) ).
cnf(i_0_625,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_625) ).
cnf(i_0_626,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_626) ).
cnf(i_0_627,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_627) ).
cnf(i_0_584,plain,
( val(esk49_3(X1,X2,X3),X3)
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_584) ).
cnf(i_0_585,plain,
( sub(esk49_3(X1,X2,X3),name_1_1)
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_585) ).
cnf(i_0_588,plain,
( attr(esk48_3(X1,X2,X3),esk49_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_588) ).
cnf(i_0_589,plain,
( in(esk50_3(X1,X2,X3),esk48_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_589) ).
cnf(i_0_389,plain,
state_adjective_state_binding(s__374dafrikanisch_1_1,s__374dafrika_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_389) ).
cnf(i_0_133,hypothesis,
val(c135,mandela_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_133) ).
cnf(i_0_134,hypothesis,
sub(c135,familiename_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_134) ).
cnf(i_0_135,hypothesis,
val(c134,nelson_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_135) ).
cnf(i_0_136,hypothesis,
sub(c134,eigenname_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_136) ).
cnf(i_0_139,hypothesis,
attr(c133,c135),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_139) ).
cnf(i_0_140,hypothesis,
attr(c133,c134),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_140) ).
cnf(i_0_455,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_455) ).
cnf(i_0_102,hypothesis,
fact(c133,real),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_102) ).
cnf(i_0_488,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_488) ).
cnf(i_0_587,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_587) ).
cnf(i_0_138,hypothesis,
prop(c133,s__374dafrikanisch_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_138) ).
cnf(i_0_137,hypothesis,
sub(c133,pr__344sident_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-l_ygqifn/input.p',i_0_137) ).
cnf(c_0_655,negated_conjecture,
( ~ in(X1,X2)
| ~ sub(X3,X4)
| ~ obj(X5,X6)
| ~ arg1(X7,X6)
| ~ arg2(X7,X3)
| ~ attr(X6,X8)
| ~ attr(X6,X9)
| ~ attr(X2,X10)
| ~ sub(X10,name_1_1)
| ~ sub(X8,eigenname_1_1)
| ~ sub(X9,familiename_1_1)
| ~ subr(X7,rprs_0)
| ~ val(X10,s__374dafrika_0)
| ~ val(X8,nelson_0)
| ~ val(X9,mandela_0) ),
i_0_629 ).
cnf(c_0_656,plain,
( subr(esk55_3(X1,X2,X3),rprs_0)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_606 ).
cnf(c_0_657,negated_conjecture,
( ~ arg2(esk55_3(X1,X2,X3),X4)
| ~ arg2(X1,X3)
| ~ arg1(esk55_3(X1,X2,X3),X5)
| ~ arg1(X1,X2)
| ~ subr(X1,sub_0)
| ~ obj(X6,X5)
| ~ in(X7,X8)
| ~ val(X9,s__374dafrika_0)
| ~ val(X10,mandela_0)
| ~ val(X11,nelson_0)
| ~ attr(X5,X10)
| ~ attr(X5,X11)
| ~ attr(X8,X9)
| ~ sub(X9,name_1_1)
| ~ sub(X10,familiename_1_1)
| ~ sub(X11,eigenname_1_1)
| ~ sub(X4,X12) ),
inference(spm,[status(thm)],[c_0_655,c_0_656]) ).
cnf(c_0_658,plain,
( arg2(esk55_3(X1,X2,X3),esk56_3(X1,X2,X3))
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_611 ).
cnf(c_0_659,plain,
( ~ arg2(X1,X2)
| ~ arg1(esk55_3(X1,X3,X2),X4)
| ~ arg1(X1,X3)
| ~ subr(X1,sub_0)
| ~ obj(X5,X4)
| ~ in(X6,X7)
| ~ val(X8,s__374dafrika_0)
| ~ val(X9,mandela_0)
| ~ val(X10,nelson_0)
| ~ attr(X4,X9)
| ~ attr(X4,X10)
| ~ attr(X7,X8)
| ~ sub(esk56_3(X1,X3,X2),X11)
| ~ sub(X8,name_1_1)
| ~ sub(X9,familiename_1_1)
| ~ sub(X10,eigenname_1_1) ),
inference(spm,[status(thm)],[c_0_657,c_0_658]) ).
cnf(c_0_660,plain,
( arg1(esk55_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_612 ).
cnf(c_0_661,plain,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ subr(X1,sub_0)
| ~ obj(X4,X3)
| ~ in(X5,X6)
| ~ val(X7,s__374dafrika_0)
| ~ val(X8,mandela_0)
| ~ val(X9,nelson_0)
| ~ attr(X3,X8)
| ~ attr(X3,X9)
| ~ attr(X6,X7)
| ~ sub(esk56_3(X1,X3,X2),X10)
| ~ sub(X7,name_1_1)
| ~ sub(X8,familiename_1_1)
| ~ sub(X9,eigenname_1_1) ),
inference(spm,[status(thm)],[c_0_659,c_0_660]) ).
cnf(c_0_662,plain,
( sub(esk56_3(X1,X2,X3),X3)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_607 ).
cnf(c_0_663,plain,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ subr(X1,sub_0)
| ~ obj(X4,X3)
| ~ in(X5,X6)
| ~ val(X7,s__374dafrika_0)
| ~ val(X8,mandela_0)
| ~ val(X9,nelson_0)
| ~ attr(X3,X8)
| ~ attr(X3,X9)
| ~ attr(X6,X7)
| ~ sub(X7,name_1_1)
| ~ sub(X8,familiename_1_1)
| ~ sub(X9,eigenname_1_1) ),
inference(spm,[status(thm)],[c_0_661,c_0_662]) ).
cnf(c_0_664,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_625 ).
cnf(c_0_665,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),X4)
| ~ obj(X5,X4)
| ~ in(X6,X7)
| ~ val(X8,s__374dafrika_0)
| ~ val(X9,mandela_0)
| ~ val(X10,nelson_0)
| ~ attr(X4,X9)
| ~ attr(X4,X10)
| ~ attr(X7,X8)
| ~ sub(X8,name_1_1)
| ~ sub(X9,familiename_1_1)
| ~ sub(X10,eigenname_1_1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_663,c_0_664]) ).
cnf(c_0_666,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_626 ).
cnf(c_0_667,plain,
( ~ arg1(esk59_2(X1,X2),X3)
| ~ obj(X4,X3)
| ~ in(X5,X6)
| ~ val(X7,s__374dafrika_0)
| ~ val(X8,mandela_0)
| ~ val(X9,nelson_0)
| ~ attr(X3,X8)
| ~ attr(X3,X9)
| ~ attr(X6,X7)
| ~ sub(X7,name_1_1)
| ~ sub(X8,familiename_1_1)
| ~ sub(X9,eigenname_1_1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_665,c_0_666]) ).
cnf(c_0_668,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_627 ).
cnf(c_0_669,plain,
( ~ obj(X1,X2)
| ~ in(X3,X4)
| ~ val(X5,s__374dafrika_0)
| ~ val(X6,mandela_0)
| ~ val(X7,nelson_0)
| ~ attr(X2,X6)
| ~ attr(X2,X7)
| ~ attr(X4,X5)
| ~ sub(X5,name_1_1)
| ~ sub(X6,familiename_1_1)
| ~ sub(X7,eigenname_1_1)
| ~ sub(X2,X8) ),
inference(spm,[status(thm)],[c_0_667,c_0_668]) ).
cnf(c_0_670,plain,
( val(esk49_3(X1,X2,X3),X3)
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_584 ).
cnf(c_0_671,plain,
( sub(esk49_3(X1,X2,X3),name_1_1)
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_585 ).
cnf(c_0_672,plain,
( ~ obj(X1,X2)
| ~ in(X3,X4)
| ~ state_adjective_state_binding(X5,s__374dafrika_0)
| ~ val(X6,mandela_0)
| ~ val(X7,nelson_0)
| ~ attr(X4,esk49_3(X8,X5,s__374dafrika_0))
| ~ attr(X2,X6)
| ~ attr(X2,X7)
| ~ prop(X8,X5)
| ~ sub(X6,familiename_1_1)
| ~ sub(X7,eigenname_1_1)
| ~ sub(X2,X9) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_669,c_0_670]),c_0_671]) ).
cnf(c_0_673,plain,
( attr(esk48_3(X1,X2,X3),esk49_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_588 ).
cnf(c_0_674,plain,
( ~ obj(X1,X2)
| ~ in(X3,esk48_3(X4,X5,s__374dafrika_0))
| ~ state_adjective_state_binding(X5,s__374dafrika_0)
| ~ val(X6,mandela_0)
| ~ val(X7,nelson_0)
| ~ attr(X2,X6)
| ~ attr(X2,X7)
| ~ prop(X4,X5)
| ~ sub(X6,familiename_1_1)
| ~ sub(X7,eigenname_1_1)
| ~ sub(X2,X8) ),
inference(spm,[status(thm)],[c_0_672,c_0_673]) ).
cnf(c_0_675,plain,
( in(esk50_3(X1,X2,X3),esk48_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_589 ).
cnf(c_0_676,plain,
( ~ obj(X1,X2)
| ~ state_adjective_state_binding(X3,s__374dafrika_0)
| ~ val(X4,mandela_0)
| ~ val(X5,nelson_0)
| ~ attr(X2,X4)
| ~ attr(X2,X5)
| ~ prop(X6,X3)
| ~ sub(X4,familiename_1_1)
| ~ sub(X5,eigenname_1_1)
| ~ sub(X2,X7) ),
inference(spm,[status(thm)],[c_0_674,c_0_675]) ).
cnf(c_0_677,plain,
state_adjective_state_binding(s__374dafrikanisch_1_1,s__374dafrika_0),
i_0_389 ).
cnf(c_0_678,plain,
( ~ obj(X1,X2)
| ~ val(X3,mandela_0)
| ~ val(X4,nelson_0)
| ~ attr(X2,X3)
| ~ attr(X2,X4)
| ~ prop(X5,s__374dafrikanisch_1_1)
| ~ sub(X3,familiename_1_1)
| ~ sub(X4,eigenname_1_1)
| ~ sub(X2,X6) ),
inference(spm,[status(thm)],[c_0_676,c_0_677]) ).
cnf(c_0_679,hypothesis,
val(c135,mandela_0),
i_0_133 ).
cnf(c_0_680,hypothesis,
sub(c135,familiename_1_1),
i_0_134 ).
cnf(c_0_681,hypothesis,
( ~ obj(X1,X2)
| ~ val(X3,nelson_0)
| ~ attr(X2,c135)
| ~ attr(X2,X3)
| ~ prop(X4,s__374dafrikanisch_1_1)
| ~ sub(X3,eigenname_1_1)
| ~ sub(X2,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_678,c_0_679]),c_0_680])]) ).
cnf(c_0_682,hypothesis,
val(c134,nelson_0),
i_0_135 ).
cnf(c_0_683,hypothesis,
sub(c134,eigenname_1_1),
i_0_136 ).
cnf(c_0_684,hypothesis,
( ~ obj(X1,X2)
| ~ attr(X2,c135)
| ~ attr(X2,c134)
| ~ prop(X3,s__374dafrikanisch_1_1)
| ~ sub(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_681,c_0_682]),c_0_683])]) ).
cnf(c_0_685,hypothesis,
attr(c133,c135),
i_0_139 ).
cnf(c_0_686,hypothesis,
attr(c133,c134),
i_0_140 ).
cnf(c_0_687,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_455 ).
cnf(c_0_688,hypothesis,
fact(c133,real),
i_0_102 ).
cnf(c_0_689,hypothesis,
( ~ obj(X1,c133)
| ~ prop(X2,s__374dafrikanisch_1_1)
| ~ sub(c133,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_684,c_0_685]),c_0_686])]) ).
cnf(c_0_690,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_488 ).
cnf(c_0_691,plain,
has_fact_leq(c133,real),
inference(spm,[status(thm)],[c_0_687,c_0_688]) ).
cnf(c_0_692,plain,
( ~ loc(c133,X1)
| ~ prop(X2,s__374dafrikanisch_1_1)
| ~ sub(c133,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_689,c_0_690]),c_0_691])]) ).
cnf(c_0_693,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_587 ).
cnf(c_0_694,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(X3,s__374dafrikanisch_1_1)
| ~ prop(c133,X1)
| ~ sub(c133,X4) ),
inference(spm,[status(thm)],[c_0_692,c_0_693]) ).
cnf(c_0_695,hypothesis,
prop(c133,s__374dafrikanisch_1_1),
i_0_138 ).
cnf(c_0_696,hypothesis,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(c133,X1)
| ~ sub(c133,X3) ),
inference(spm,[status(thm)],[c_0_694,c_0_695]) ).
cnf(c_0_697,hypothesis,
sub(c133,pr__344sident_1_1),
i_0_137 ).
cnf(c_0_698,hypothesis,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(c133,X1) ),
inference(spm,[status(thm)],[c_0_696,c_0_697]) ).
cnf(c_0_699,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_698,c_0_677]),c_0_695])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : CSR116+22 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Fri Jun 10 08:54:40 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.12/0.34 # ENIGMATIC: Selected SinE mode:
% 0.12/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.45/2.56 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.45/2.56 # Version: 2.1pre011
% 7.45/2.56 # Preprocessing time : 0.022 s
% 7.45/2.56
% 7.45/2.56 # Proof found!
% 7.45/2.56 # SZS status Theorem
% 7.45/2.56 # SZS output start CNFRefutation
% See solution above
% 7.45/2.56 # Proof object total steps : 70
% 7.45/2.56 # Proof object clause steps : 45
% 7.45/2.56 # Proof object formula steps : 25
% 7.45/2.56 # Proof object conjectures : 3
% 7.45/2.56 # Proof object clause conjectures : 2
% 7.45/2.56 # Proof object formula conjectures : 1
% 7.45/2.56 # Proof object initial clauses used : 25
% 7.45/2.56 # Proof object initial formulas used : 25
% 7.45/2.56 # Proof object generating inferences : 20
% 7.45/2.56 # Proof object simplifying inferences : 11
% 7.45/2.56 # Training examples: 0 positive, 0 negative
% 7.45/2.56 # Parsed axioms : 649
% 7.45/2.56 # Removed by relevancy pruning/SinE : 0
% 7.45/2.56 # Initial clauses : 649
% 7.45/2.56 # Removed in clause preprocessing : 0
% 7.45/2.56 # Initial clauses in saturation : 649
% 7.45/2.56 # Processed clauses : 813
% 7.45/2.56 # ...of these trivial : 0
% 7.45/2.56 # ...subsumed : 3
% 7.45/2.56 # ...remaining for further processing : 810
% 7.45/2.56 # Other redundant clauses eliminated : 0
% 7.45/2.56 # Clauses deleted for lack of memory : 0
% 7.45/2.56 # Backward-subsumed : 16
% 7.45/2.56 # Backward-rewritten : 0
% 7.45/2.56 # Generated clauses : 1921
% 7.45/2.56 # ...of the previous two non-trivial : 1919
% 7.45/2.56 # Contextual simplify-reflections : 6
% 7.45/2.56 # Paramodulations : 1921
% 7.45/2.56 # Factorizations : 0
% 7.45/2.56 # Equation resolutions : 0
% 7.45/2.56 # Propositional unsat checks : 0
% 7.45/2.56 # Propositional unsat check successes : 0
% 7.45/2.56 # Current number of processed clauses : 794
% 7.45/2.56 # Positive orientable unit clauses : 378
% 7.45/2.56 # Positive unorientable unit clauses: 0
% 7.45/2.56 # Negative unit clauses : 0
% 7.45/2.56 # Non-unit-clauses : 416
% 7.45/2.56 # Current number of unprocessed clauses: 1725
% 7.45/2.56 # ...number of literals in the above : 6415
% 7.45/2.56 # Current number of archived formulas : 0
% 7.45/2.56 # Current number of archived clauses : 16
% 7.45/2.56 # Clause-clause subsumption calls (NU) : 53631
% 7.45/2.56 # Rec. Clause-clause subsumption calls : 10645
% 7.45/2.56 # Non-unit clause-clause subsumptions : 25
% 7.45/2.56 # Unit Clause-clause subsumption calls : 4411
% 7.45/2.56 # Rewrite failures with RHS unbound : 0
% 7.45/2.56 # BW rewrite match attempts : 0
% 7.45/2.56 # BW rewrite match successes : 0
% 7.45/2.56 # Condensation attempts : 0
% 7.45/2.56 # Condensation successes : 0
% 7.45/2.56 # Termbank termtop insertions : 40196
% 7.45/2.56
% 7.45/2.56 # -------------------------------------------------
% 7.45/2.56 # User time : 0.074 s
% 7.45/2.56 # System time : 0.005 s
% 7.45/2.56 # Total time : 0.079 s
% 7.45/2.56 # ...preprocessing : 0.022 s
% 7.45/2.56 # ...main loop : 0.057 s
% 7.45/2.56 # Maximum resident set size: 9924 pages
% 7.45/2.56
%------------------------------------------------------------------------------