%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP024+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:53:51 PM UTC 2026
% Result : Theorem 21.50s 4.96s
% Output : CNFRefutation 21.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 21 unt; 0 def)
% Number of atoms : 209 ( 30 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 250 ( 96 ~; 78 |; 42 &)
% ( 8 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 1 sgn 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_tsp_2,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tsp_2) ).
fof(d5_tsp_2,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
& v1_tsp_1(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tsp_2) ).
fof(t64_tex_4,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',t64_tex_4) ).
fof(d2_tops_3,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tops_1(X2,X1)
<=> k6_pre_topc(X1,X2) = u1_struct_0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+370.ax',d2_tops_3) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+387.ax',t5_tex_2) ).
fof(d2_tex_2,axiom,
! [X1,X2] :
( m1_subset_1(X2,X1)
=> ( v1_tex_2(X2,X1)
<=> X2 != k3_tarski(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+387.ax',d2_tex_2) ).
fof(dt_k6_pre_topc,axiom,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& l1_pre_topc(X1) )
=> m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+206.ax',dt_k6_pre_topc) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(fc3_tex_4,axiom,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& ~ v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ( ~ v1_tex_2(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
& v4_pre_topc(k6_pre_topc(X1,X2),X1)
& ~ v1_xboole_0(k6_pre_topc(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',fc3_tex_4) ).
fof(t99_zfmisc_1,axiom,
! [X1] : k3_tarski(k1_zfmisc_1(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t99_zfmisc_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(assume_negation,[status(cth)],[t2_tsp_2]) ).
fof(c_0_12,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( k3_tex_4(X1,X2) = u1_struct_0(X1)
& v1_tsp_1(X2,X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
=> v1_tops_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t64_tex_4]) ).
fof(c_0_15,plain,
! [X133,X134] :
( ( ~ l1_pre_topc(X133)
| ~ v2_pre_topc(X133)
| v3_struct_0(X133)
| ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| v1_tsp_2(X134,X133)
| k3_tex_4(X133,X134) != u1_struct_0(X133)
| ~ v1_tsp_1(X134,X133) )
& ( ~ l1_pre_topc(X133)
| ~ v2_pre_topc(X133)
| v3_struct_0(X133)
| ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| ~ v1_tsp_2(X134,X133)
| k3_tex_4(X133,X134) = u1_struct_0(X133) )
& ( ~ l1_pre_topc(X133)
| ~ v2_pre_topc(X133)
| v3_struct_0(X133)
| ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| ~ v1_tsp_2(X134,X133)
| v1_tsp_1(X134,X133) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_16,negated_conjecture,
( ~ v1_tops_1(esk2_0,esk1_0)
& v1_tsp_2(esk2_0,esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& l1_pre_topc(esk1_0)
& v2_pre_topc(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_17,plain,
! [X1445,X1446] :
( k6_pre_topc(X1445,k3_tex_4(X1445,X1446)) = k6_pre_topc(X1445,X1446)
| ~ m1_subset_1(X1446,k1_zfmisc_1(u1_struct_0(X1445)))
| ~ l1_pre_topc(X1445)
| ~ v2_pre_topc(X1445)
| v3_struct_0(X1445) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_18,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1)
| v3_struct_0(X1)
| k3_tex_4(X1,X2) = u1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
v1_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X34,X35] :
( ( ~ l1_pre_topc(X34)
| ~ m1_subset_1(X35,k1_zfmisc_1(u1_struct_0(X34)))
| v1_tops_1(X35,X34)
| k6_pre_topc(X34,X35) != u1_struct_0(X34) )
& ( ~ l1_pre_topc(X34)
| ~ m1_subset_1(X35,k1_zfmisc_1(u1_struct_0(X34)))
| k6_pre_topc(X34,X35) = u1_struct_0(X34)
| ~ v1_tops_1(X35,X34) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tops_3])])])])]) ).
fof(c_0_25,plain,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> ( v1_tex_2(X2,k1_zfmisc_1(X1))
<=> X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[t5_tex_2]) ).
fof(c_0_26,plain,
! [X1,X2] :
( m1_subset_1(X2,X1)
=> ( v1_tex_2(X2,X1)
<=> X2 != k3_tarski(X1) ) ),
inference(fof_simplification,[status(thm)],[d2_tex_2]) ).
fof(c_0_27,plain,
! [X402,X403] :
( m1_subset_1(k6_pre_topc(X402,X403),k1_zfmisc_1(u1_struct_0(X402)))
| ~ m1_subset_1(X403,k1_zfmisc_1(u1_struct_0(X402)))
| ~ l1_pre_topc(X402) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])])]) ).
cnf(c_0_28,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
k3_tex_4(esk1_0,esk2_0) = u1_struct_0(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ v1_tops_1(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,plain,
( ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| k6_pre_topc(X1,X2) != u1_struct_0(X1)
| v1_tops_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,plain,
! [X1294,X1295] :
( ( ~ m1_subset_1(X1295,k1_zfmisc_1(X1294))
| v1_tex_2(X1295,k1_zfmisc_1(X1294))
| X1295 = X1294 )
& ( ~ m1_subset_1(X1295,k1_zfmisc_1(X1294))
| X1295 != X1294
| ~ v1_tex_2(X1295,k1_zfmisc_1(X1294)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
fof(c_0_33,plain,
! [X474,X475] :
( ( m1_subset_1(X474,k1_zfmisc_1(X475))
| ~ r1_tarski(X474,X475) )
& ( r1_tarski(X474,X475)
| ~ m1_subset_1(X474,k1_zfmisc_1(X475)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_34,plain,
! [X451] : r1_tarski(X451,X451),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_35,plain,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
& ~ v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
& l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ( ~ v1_tex_2(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
& v4_pre_topc(k6_pre_topc(X1,X2),X1)
& ~ v1_xboole_0(k6_pre_topc(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[fc3_tex_4]) ).
fof(c_0_36,plain,
! [X1292,X1293] :
( ( ~ m1_subset_1(X1293,X1292)
| v1_tex_2(X1293,X1292)
| X1293 = k3_tarski(X1292) )
& ( ~ m1_subset_1(X1293,X1292)
| X1293 != k3_tarski(X1292)
| ~ v1_tex_2(X1293,X1292) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_37,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
k6_pre_topc(esk1_0,esk2_0) = k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_39,plain,
! [X1900] : k3_tarski(k1_zfmisc_1(X1900)) = X1900,
inference(variable_rename,[status(thm)],[t99_zfmisc_1]) ).
cnf(c_0_40,negated_conjecture,
k6_pre_topc(esk1_0,esk2_0) != u1_struct_0(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_21]),c_0_22])]) ).
cnf(c_0_41,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| X1 != X2
| ~ v1_tex_2(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_44,plain,
! [X1310,X1311] :
( ( ~ m1_subset_1(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
| v1_tex_2(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
| ~ l1_pre_topc(X1310)
| ~ v2_pre_topc(X1310)
| v3_struct_0(X1310)
| ~ v1_tex_2(k6_pre_topc(X1310,X1311),k1_zfmisc_1(u1_struct_0(X1310))) )
& ( ~ m1_subset_1(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
| v1_tex_2(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
| ~ l1_pre_topc(X1310)
| ~ v2_pre_topc(X1310)
| v3_struct_0(X1310)
| v4_pre_topc(k6_pre_topc(X1310,X1311),X1310) )
& ( ~ m1_subset_1(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
| v1_tex_2(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
| ~ l1_pre_topc(X1310)
| ~ v2_pre_topc(X1310)
| v3_struct_0(X1310)
| ~ v1_xboole_0(k6_pre_topc(X1310,X1311)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_45,plain,
( ~ m1_subset_1(X1,X2)
| v1_tex_2(X1,X2)
| X1 = k3_tarski(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
m1_subset_1(k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21]),c_0_22])]) ).
cnf(c_0_47,plain,
k3_tarski(k1_zfmisc_1(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,negated_conjecture,
k6_pre_topc(esk1_0,u1_struct_0(esk1_0)) != u1_struct_0(esk1_0),
inference(rw,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_49,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X1))
| ~ v1_tex_2(X1,k1_zfmisc_1(X1)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
m1_subset_1(X1,k1_zfmisc_1(X1)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ v1_tex_2(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,negated_conjecture,
v1_tex_2(k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
~ v1_tex_2(X1,k1_zfmisc_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_20]),c_0_21]),c_0_50])]),c_0_53]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TOP024+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n013.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 12:39:09 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.50 Running first-order theorem proving
% 0.06/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.50/4.96 % Version: 3.5.1
% 21.50/4.96 % Preprocessing class: FMLMSMSLSSSNFFN.
% 21.50/4.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.50/4.96 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 21.50/4.96 % Starting new_bool_3 with 600s (2) cores
% 21.50/4.96 % Starting new_bool_1 with 600s (2) cores
% 21.50/4.96 % Starting sh5l with 300s (1) cores
% 21.50/4.96 % new_bool_3 with pid 774258 completed with status 0
% 21.50/4.96 % Result found by new_bool_3
% 21.50/4.96 % Preprocessing class: FMLMSMSLSSSNFFN.
% 21.50/4.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.50/4.96 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 21.50/4.96 % Starting new_bool_3 with 600s (2) cores
% 21.50/4.96 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 21.50/4.96 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.50/4.96 % Search class: FGHSM-SMLM31-MFFFFFNN
% 21.50/4.96 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 21.50/4.96 % Starting SubtermCWHack with 61s (1) cores
% 21.50/4.96 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 21.50/4.96 % C07_19_nc_SAT001_MinMin_p005000_rr with pid 774262 completed with status 0
% 21.50/4.96 % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 21.50/4.96 % Preprocessing class: FMLMSMSLSSSNFFN.
% 21.50/4.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.50/4.96 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 21.50/4.96 % Starting new_bool_3 with 600s (2) cores
% 21.50/4.96 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 21.50/4.96 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.50/4.96 % Search class: FGHSM-SMLM31-MFFFFFNN
% 21.50/4.96 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 21.50/4.96 % Starting SubtermCWHack with 61s (1) cores
% 21.50/4.96 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 21.50/4.96 % Preprocessing time : 0.079 s
% 21.50/4.96 % Presaturation interreduction done
% 21.50/4.96
% 21.50/4.96 % Proof found!
% 21.50/4.96 % SZS status Theorem
% 21.50/4.96 % SZS output start CNFRefutation
% See solution above
% 21.50/4.96 % Parsed axioms : 3583
% 21.50/4.96 % Removed by relevancy pruning/SinE : 2545
% 21.50/4.96 % Initial clauses : 2493
% 21.50/4.96 % Removed in clause preprocessing : 100
% 21.50/4.96 % Initial clauses in saturation : 2393
% 21.50/4.96 % Processed clauses : 15357
% 21.50/4.96 % ...of these trivial : 50
% 21.50/4.96 % ...subsumed : 9559
% 21.50/4.96 % ...remaining for further processing : 5748
% 21.50/4.96 % Other redundant clauses eliminated : 281
% 21.50/4.96 % Clauses deleted for lack of memory : 0
% 21.50/4.96 % Backward-subsumed : 172
% 21.50/4.96 % Backward-rewritten : 66
% 21.50/4.96 % Generated clauses : 42994
% 21.50/4.96 % ...of the previous two non-redundant : 38648
% 21.50/4.96 % ...aggressively subsumed : 0
% 21.50/4.96 % Contextual simplify-reflections : 377
% 21.50/4.96 % Paramodulations : 42703
% 21.50/4.96 % Factorizations : 3
% 21.50/4.96 % NegExts : 0
% 21.50/4.96 % Equation resolutions : 291
% 21.50/4.96 % Disequality decompositions : 0
% 21.50/4.96 % Total rewrite steps : 7062
% 21.50/4.96 % ...of those cached : 6103
% 21.50/4.96 % Propositional unsat checks : 1
% 21.50/4.96 % Propositional check models : 1
% 21.50/4.97 % Propositional check unsatisfiable : 0
% 21.50/4.97 % Propositional clauses : 0
% 21.50/4.97 % Propositional clauses after purity: 0
% 21.50/4.97 % Propositional unsat core size : 0
% 21.50/4.97 % Propositional preprocessing time : 0.000
% 21.50/4.97 % Propositional encoding time : 0.037
% 21.50/4.97 % Propositional solver time : 0.028
% 21.50/4.97 % Success case prop preproc time : 0.000
% 21.50/4.97 % Success case prop encoding time : 0.000
% 21.50/4.97 % Success case prop solver time : 0.000
% 21.50/4.97 % Current number of processed clauses : 3178
% 21.50/4.97 % Positive orientable unit clauses : 236
% 21.50/4.97 % Positive unorientable unit clauses: 2
% 21.50/4.97 % Negative unit clauses : 469
% 21.50/4.97 % Non-unit-clauses : 2471
% 21.50/4.97 % Current number of unprocessed clauses: 27388
% 21.50/4.97 % ...number of literals in the above : 104839
% 21.50/4.97 % Current number of archived formulas : 0
% 21.50/4.97 % Current number of archived clauses : 2399
% 21.50/4.97 % Clause-clause subsumption calls (NU) : 4391988
% 21.50/4.97 % Rec. Clause-clause subsumption calls : 730790
% 21.50/4.97 % Non-unit clause-clause subsumptions : 4874
% 21.50/4.97 % Unit Clause-clause subsumption calls : 30265
% 21.50/4.97 % Rewrite failures with RHS unbound : 0
% 21.50/4.97 % BW rewrite match attempts : 288
% 21.50/4.97 % BW rewrite match successes : 186
% 21.50/4.97 % Condensation attempts : 0
% 21.50/4.97 % Condensation successes : 0
% 21.50/4.97 % Termbank termtop insertions : 894128
% 21.50/4.97 % Search garbage collected termcells : 67654
% 21.50/4.97
% 21.50/4.97 % -------------------------------------------------
% 21.50/4.97 % User time : 3.410 s
% 21.50/4.97 % System time : 0.092 s
% 21.50/4.97 % Total time : 3.502 s
% 21.50/4.97 % Maximum resident set size: 15036 pages
% 21.50/4.97
% 21.50/4.97 % -------------------------------------------------
% 21.50/4.97 % User time : 5.761 s
% 21.50/4.97 % System time : 0.179 s
% 21.50/4.97 % Total time : 5.940 s
% 21.50/4.97 % Maximum resident set size: 8960 pages
% 21.50/4.97 % E exiting
%------------------------------------------------------------------------------