%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET644+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 02:17:50 PM UTC 2026
% Result : Theorem 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 15 unt; 0 def)
% Number of atoms : 269 ( 11 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 348 ( 138 ~; 133 |; 35 &)
% ( 6 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 123 ( 10 sgn 59 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p5,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) )
& ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5) ).
fof(p27,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p27) ).
fof(prove_relset_1_6,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ( member(X3,X4)
=> ? [X5] :
( ? [X6] :
( member(X6,X2)
& member(X5,X1)
& X3 = ordered_pair(X5,X6)
& ilf_type(X6,set_type) )
& ilf_type(X5,set_type) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_6) ).
fof(p24,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> relation_like(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p24) ).
fof(p21,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ilf_type(X2,set_type)
& ~ empty(X2) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21) ).
fof(p14,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ilf_type(X2,subset_type(X1))
<=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p14) ).
fof(p20,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ilf_type(power_set(X1),set_type)
& ~ empty(power_set(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20) ).
fof(p23,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( relation_like(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X2,X1)
=> ? [X3] :
( ? [X4] :
( X2 = ordered_pair(X3,X4)
& ilf_type(X4,set_type) )
& ilf_type(X3,set_type) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p23) ).
fof(p19,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X1,power_set(X2))
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p19) ).
fof(p2,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,set_type)
=> ( member(ordered_pair(X1,X2),cross_product(X3,X4))
<=> ( member(X2,X4)
& member(X1,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2) ).
fof(c_0_10,plain,
! [X22,X23,X24,X25] :
( ( ~ ilf_type(X22,set_type)
| ~ ilf_type(X23,set_type)
| ilf_type(X25,subset_type(cross_product(X22,X23)))
| ~ ilf_type(X25,relation_type(X22,X23)) )
& ( ~ ilf_type(X22,set_type)
| ~ ilf_type(X23,set_type)
| ilf_type(X24,relation_type(X22,X23))
| ~ ilf_type(X24,subset_type(cross_product(X22,X23))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p5])])])])]) ).
fof(c_0_11,plain,
! [X76] : ilf_type(X76,set_type),
inference(variable_rename,[status(thm)],[p27]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ( member(X3,X4)
=> ? [X5] :
( ? [X6] :
( member(X6,X2)
& member(X5,X1)
& X3 = ordered_pair(X5,X6)
& ilf_type(X6,set_type) )
& ilf_type(X5,set_type) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_6]) ).
fof(c_0_13,plain,
! [X69,X70,X71] :
( relation_like(X71)
| ~ ilf_type(X71,subset_type(cross_product(X69,X70)))
| ~ ilf_type(X70,set_type)
| ~ ilf_type(X69,set_type) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p24])])])]) ).
cnf(c_0_14,plain,
( ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,relation_type(X2,X3))
| ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,negated_conjecture,
! [X81,X82] :
( ( ~ member(X82,esk15_0)
| ~ member(X81,esk14_0)
| esk16_0 != ordered_pair(X81,X82)
| ~ ilf_type(X82,set_type)
| ~ ilf_type(X81,set_type) )
& member(esk16_0,esk17_0)
& ilf_type(esk17_0,relation_type(esk14_0,esk15_0))
& ilf_type(esk16_0,set_type)
& ilf_type(esk15_0,set_type)
& ilf_type(esk14_0,set_type) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
fof(c_0_17,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ilf_type(X2,set_type)
& ~ empty(X2) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[p21]) ).
fof(c_0_18,plain,
! [X40,X41] :
( ( ~ ilf_type(X40,set_type)
| ~ ilf_type(X41,set_type)
| ilf_type(X41,subset_type(X40))
| ~ ilf_type(X41,member_type(power_set(X40))) )
& ( ~ ilf_type(X40,set_type)
| ~ ilf_type(X41,set_type)
| ilf_type(X41,member_type(power_set(X40)))
| ~ ilf_type(X41,subset_type(X40)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p14])])])])]) ).
fof(c_0_19,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( ilf_type(power_set(X1),set_type)
& ~ empty(power_set(X1)) ) ),
inference(fof_simplification,[status(thm)],[p20]) ).
fof(c_0_20,plain,
! [X62,X63,X67,X68] :
( ( ~ ilf_type(X62,set_type)
| relation_like(X62)
| esk12_1(X62) != ordered_pair(X67,X68)
| ~ ilf_type(X68,set_type)
| ~ ilf_type(X67,set_type) )
& ( ~ ilf_type(X62,set_type)
| relation_like(X62)
| member(esk12_1(X62),X62) )
& ( ~ ilf_type(X62,set_type)
| relation_like(X62)
| ilf_type(esk12_1(X62),set_type) )
& ( ~ ilf_type(X62,set_type)
| ~ relation_like(X62)
| ~ ilf_type(X63,set_type)
| ~ member(X63,X62)
| X63 = ordered_pair(esk10_2(X62,X63),esk11_2(X62,X63)) )
& ( ~ ilf_type(X62,set_type)
| ~ relation_like(X62)
| ~ ilf_type(X63,set_type)
| ~ member(X63,X62)
| ilf_type(esk11_2(X62,X63),set_type) )
& ( ~ ilf_type(X62,set_type)
| ~ relation_like(X62)
| ~ ilf_type(X63,set_type)
| ~ member(X63,X62)
| ilf_type(esk10_2(X62,X63),set_type) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p23])])])])])]) ).
cnf(c_0_21,plain,
( ~ ilf_type(X3,subset_type(cross_product(X1,X2)))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| relation_like(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( ~ ilf_type(X1,relation_type(X2,X3))
| ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_23,negated_conjecture,
ilf_type(esk17_0,relation_type(esk14_0,esk15_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X53,X54,X55] :
( ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X53,power_set(X54))
| ~ member(esk8_2(X53,X54),X54) )
& ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X53,power_set(X54))
| member(esk8_2(X53,X54),X53) )
& ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X53,power_set(X54))
| ilf_type(esk8_2(X53,X54),set_type) )
& ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X55,X54)
| ~ member(X55,X53)
| ~ ilf_type(X55,set_type)
| ~ member(X53,power_set(X54)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p19])])])])])]) ).
fof(c_0_25,plain,
! [X58,X59] :
( ( ~ ilf_type(X58,set_type)
| ~ ilf_type(X59,set_type)
| empty(X59)
| ilf_type(X58,member_type(X59))
| ~ member(X58,X59) )
& ( ~ ilf_type(X58,set_type)
| ~ ilf_type(X59,set_type)
| empty(X59)
| member(X58,X59)
| ~ ilf_type(X58,member_type(X59)) ) ),
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_17])])])])]) ).
cnf(c_0_26,plain,
( ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X1,subset_type(X2))
| ilf_type(X1,member_type(power_set(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X57] :
( ( ~ ilf_type(X57,set_type)
| ilf_type(power_set(X57),set_type) )
& ( ~ ilf_type(X57,set_type)
| ~ empty(power_set(X57)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_28,plain,
! [X11,X12,X13,X14] :
( ( ~ ilf_type(X11,set_type)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X13,set_type)
| ~ ilf_type(X14,set_type)
| member(ordered_pair(X11,X12),cross_product(X13,X14))
| ~ member(X12,X14)
| ~ member(X11,X13) )
& ( ~ ilf_type(X11,set_type)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X13,set_type)
| ~ ilf_type(X14,set_type)
| ~ member(ordered_pair(X11,X12),cross_product(X13,X14))
| member(X12,X14) )
& ( ~ ilf_type(X11,set_type)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X13,set_type)
| ~ ilf_type(X14,set_type)
| ~ member(ordered_pair(X11,X12),cross_product(X13,X14))
| member(X11,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])])])]) ).
cnf(c_0_29,plain,
( ~ ilf_type(X2,set_type)
| ~ relation_like(X2)
| ~ ilf_type(X1,set_type)
| ~ member(X1,X2)
| X1 = ordered_pair(esk10_2(X2,X1),esk11_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
| relation_like(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_15]),c_0_15])]) ).
cnf(c_0_31,negated_conjecture,
ilf_type(esk17_0,subset_type(cross_product(esk14_0,esk15_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X3,set_type)
| ~ member(X1,power_set(X2))
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,member_type(X2))
| empty(X2)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( ~ ilf_type(X1,subset_type(X2))
| ilf_type(X1,member_type(power_set(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_15]),c_0_15])]) ).
cnf(c_0_35,plain,
( ~ ilf_type(X1,set_type)
| ~ empty(power_set(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X4,set_type)
| ~ member(ordered_pair(X1,X3),cross_product(X2,X4))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
( ~ member(X2,X1)
| ~ relation_like(X1)
| ordered_pair(esk10_2(X1,X2),esk11_2(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_15]),c_0_15])]) ).
cnf(c_0_38,negated_conjecture,
member(esk16_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_39,negated_conjecture,
relation_like(esk17_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( ~ member(X1,X3)
| ~ member(X3,power_set(X2))
| member(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_41,plain,
( ~ ilf_type(X2,member_type(X1))
| member(X2,X1)
| empty(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_15]),c_0_15])]) ).
cnf(c_0_42,negated_conjecture,
ilf_type(esk17_0,member_type(power_set(cross_product(esk14_0,esk15_0)))),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_43,plain,
~ empty(power_set(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_15])]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(X2,esk15_0)
| ~ member(X1,esk14_0)
| esk16_0 != ordered_pair(X1,X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_45,plain,
( ~ member(ordered_pair(X1,X3),cross_product(X2,X4))
| member(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_15]),c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_46,negated_conjecture,
ordered_pair(esk10_2(esk17_0,esk16_0),esk11_2(esk17_0,esk16_0)) = esk16_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_47,negated_conjecture,
( ~ member(esk17_0,power_set(X1))
| member(esk16_0,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
member(esk17_0,power_set(cross_product(esk14_0,esk15_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_49,plain,
( ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X4,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(ordered_pair(X3,X1),cross_product(X4,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_50,negated_conjecture,
( ~ member(X1,esk14_0)
| ~ member(X2,esk15_0)
| ordered_pair(X1,X2) != esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_15]),c_0_15])]) ).
cnf(c_0_51,negated_conjecture,
( ~ member(esk16_0,cross_product(X1,X2))
| member(esk10_2(esk17_0,esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
member(esk16_0,cross_product(esk14_0,esk15_0)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( ~ member(ordered_pair(X3,X1),cross_product(X4,X2))
| member(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_15]),c_0_15]),c_0_15]),c_0_15])]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(esk10_2(esk17_0,esk16_0),esk14_0)
| ~ member(esk11_2(esk17_0,esk16_0),esk15_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
member(esk10_2(esk17_0,esk16_0),esk14_0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( ~ member(esk16_0,cross_product(X2,X1))
| member(esk11_2(esk17_0,esk16_0),X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
~ member(esk11_2(esk17_0,esk16_0),esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_52]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET644+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 05:28:51 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 0.15/0.49 % Version: 3.5.1
% 0.15/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 % Starting sh5l with 300s (1) cores
% 0.15/0.49 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 268789 completed with status 0
% 0.15/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.49 % No SInE strategy applied
% 0.15/0.49 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.15/0.49 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.15/0.49 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.15/0.49 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with pid 268795 completed with status 0
% 0.15/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 0.15/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.49 % No SInE strategy applied
% 0.15/0.49 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.15/0.49 % Preprocessing time : 0.003 s
% 0.15/0.49 % Presaturation interreduction done
% 0.15/0.49
% 0.15/0.49 % Proof found!
% 0.15/0.49 % SZS status Theorem
% 0.15/0.49 % SZS output start CNFRefutation
% See solution above
% 0.15/0.49 % Parsed axioms : 28
% 0.15/0.49 % Removed by relevancy pruning/SinE : 0
% 0.15/0.49 % Initial clauses : 63
% 0.15/0.49 % Removed in clause preprocessing : 3
% 0.15/0.49 % Initial clauses in saturation : 60
% 0.15/0.49 % Processed clauses : 332
% 0.15/0.49 % ...of these trivial : 17
% 0.15/0.49 % ...subsumed : 105
% 0.15/0.49 % ...remaining for further processing : 210
% 0.15/0.49 % Other redundant clauses eliminated : 11
% 0.15/0.49 % Clauses deleted for lack of memory : 0
% 0.15/0.49 % Backward-subsumed : 0
% 0.15/0.49 % Backward-rewritten : 8
% 0.15/0.49 % Generated clauses : 855
% 0.15/0.49 % ...of the previous two non-redundant : 771
% 0.15/0.49 % ...aggressively subsumed : 0
% 0.15/0.49 % Contextual simplify-reflections : 1
% 0.15/0.49 % Paramodulations : 842
% 0.15/0.49 % Factorizations : 2
% 0.15/0.49 % NegExts : 0
% 0.15/0.49 % Equation resolutions : 11
% 0.15/0.49 % Disequality decompositions : 0
% 0.15/0.49 % Total rewrite steps : 214
% 0.15/0.49 % ...of those cached : 148
% 0.15/0.49 % Propositional unsat checks : 0
% 0.15/0.49 % Propositional check models : 0
% 0.15/0.49 % Propositional check unsatisfiable : 0
% 0.15/0.49 % Propositional clauses : 0
% 0.15/0.49 % Propositional clauses after purity: 0
% 0.15/0.49 % Propositional unsat core size : 0
% 0.15/0.49 % Propositional preprocessing time : 0.000
% 0.15/0.49 % Propositional encoding time : 0.000
% 0.15/0.49 % Propositional solver time : 0.000
% 0.15/0.49 % Success case prop preproc time : 0.000
% 0.15/0.49 % Success case prop encoding time : 0.000
% 0.15/0.49 % Success case prop solver time : 0.000
% 0.15/0.49 % Current number of processed clauses : 159
% 0.15/0.49 % Positive orientable unit clauses : 55
% 0.15/0.49 % Positive unorientable unit clauses: 1
% 0.15/0.49 % Negative unit clauses : 10
% 0.15/0.49 % Non-unit-clauses : 93
% 0.15/0.49 % Current number of unprocessed clauses: 537
% 0.15/0.49 % ...number of literals in the above : 1726
% 0.15/0.49 % Current number of archived formulas : 0
% 0.15/0.49 % Current number of archived clauses : 48
% 0.15/0.49 % Clause-clause subsumption calls (NU) : 1192
% 0.15/0.49 % Rec. Clause-clause subsumption calls : 914
% 0.15/0.49 % Non-unit clause-clause subsumptions : 46
% 0.15/0.49 % Unit Clause-clause subsumption calls : 520
% 0.15/0.49 % Rewrite failures with RHS unbound : 0
% 0.15/0.49 % BW rewrite match attempts : 20
% 0.15/0.49 % BW rewrite match successes : 4
% 0.15/0.49 % Condensation attempts : 0
% 0.15/0.49 % Condensation successes : 0
% 0.15/0.49 % Termbank termtop insertions : 15052
% 0.15/0.49 % Search garbage collected termcells : 1392
% 0.15/0.49
% 0.15/0.49 % -------------------------------------------------
% 0.15/0.49 % User time : 0.038 s
% 0.15/0.49 % System time : 0.004 s
% 0.15/0.49 % Total time : 0.043 s
% 0.15/0.49 % Maximum resident set size: 3668 pages
% 0.15/0.49
% 0.15/0.49 % -------------------------------------------------
% 0.15/0.49 % User time : 0.157 s
% 0.15/0.49 % System time : 0.022 s
% 0.15/0.49 % Total time : 0.179 s
% 0.15/0.49 % Maximum resident set size: 4864 pages
% 0.15/0.49 % E exiting
%------------------------------------------------------------------------------