%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP619+1 : 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 : 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 12:40:23 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 69 ( 20 unt; 0 def)
% Number of atoms : 211 ( 4 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 224 ( 82 ~; 69 |; 47 &)
% ( 3 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 103 ( 2 sgn 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_autgroup,conjecture,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> r1_tarski(k1_autgroup(X1),k1_fraenkel(u1_struct_0(X1),u1_struct_0(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_autgroup) ).
fof(dt_k1_autgroup,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_fraenkel(k1_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_autgroup) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( l1_struct_0(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(dt_l1_group_1,axiom,
! [X1] :
( l1_group_1(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_group_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
<=> ! [X3] :
( r2_hidden(X3,X1)
=> r2_hidden(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(redefinition_m2_fraenkel,axiom,
! [X1,X2,X3] :
( ( m1_fraenkel(X3,X1,X2)
& ~ v1_xboole_0(X2) )
=> ! [X4] :
( m2_fraenkel(X4,X1,X2,X3)
<=> m1_subset_1(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_fraenkel) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(dt_m1_fraenkel,axiom,
! [X1,X2,X3] :
( m1_fraenkel(X3,X1,X2)
=> ( v1_fraenkel(X3)
& ~ v1_xboole_0(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m1_fraenkel) ).
fof(dt_m2_fraenkel,axiom,
! [X1,X2,X3] :
( ( m1_fraenkel(X3,X1,X2)
& ~ v1_xboole_0(X2) )
=> ! [X4] :
( m2_fraenkel(X4,X1,X2,X3)
=> ( m2_relset_1(X4,X1,X2)
& v1_funct_2(X4,X1,X2)
& v1_funct_1(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_fraenkel) ).
fof(redefinition_k1_fraenkel,axiom,
! [X1,X2] :
( ~ v1_xboole_0(X2)
=> k1_fraenkel(X1,X2) = k1_funct_2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k1_fraenkel) ).
fof(cc1_fraenkel,axiom,
! [X1] :
( v1_fraenkel(X1)
=> ! [X2] :
( m1_subset_1(X2,X1)
=> ( v1_funct_1(X2)
& v1_relat_1(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_fraenkel) ).
fof(t12_funct_2,axiom,
! [X1,X2] :
( ( m2_relset_1(X2,X1,X1)
& v1_funct_2(X2,X1,X1)
& v1_funct_1(X2) )
=> r2_hidden(X2,k1_funct_2(X1,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_funct_2) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> r1_tarski(k1_autgroup(X1),k1_fraenkel(u1_struct_0(X1),u1_struct_0(X1))) ),
inference(assume_negation,[status(cth)],[t3_autgroup]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> r1_tarski(k1_autgroup(X1),k1_fraenkel(u1_struct_0(X1),u1_struct_0(X1))) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_14,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& v1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_fraenkel(k1_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k1_autgroup]) ).
fof(c_0_15,plain,
! [X1] :
( ( l1_struct_0(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_16,plain,
! [X37] :
( l1_struct_0(X37)
| ~ l1_group_1(X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_group_1])])]) ).
fof(c_0_17,negated_conjecture,
( ~ r1_tarski(k1_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0)))
& l1_group_1(esk1_0)
& v4_group_1(esk1_0)
& v3_group_1(esk1_0)
& v1_group_1(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_18,plain,
! [X26,X27,X28,X29,X30] :
( ( r1_tarski(X29,X30)
| ~ r2_hidden(esk2_2(X29,X30),X30) )
& ( r1_tarski(X29,X30)
| r2_hidden(esk2_2(X29,X30),X29) )
& ( r2_hidden(X28,X27)
| ~ r2_hidden(X28,X26)
| ~ r1_tarski(X26,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
fof(c_0_19,plain,
! [X1,X2,X3] :
( ( m1_fraenkel(X3,X1,X2)
& ~ v1_xboole_0(X2) )
=> ! [X4] :
( m2_fraenkel(X4,X1,X2,X3)
<=> m1_subset_1(X4,X3) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_fraenkel]) ).
fof(c_0_20,plain,
! [X34] :
( m1_fraenkel(k1_autgroup(X34),u1_struct_0(X34),u1_struct_0(X34))
| ~ l1_group_1(X34)
| ~ v4_group_1(X34)
| ~ v3_group_1(X34)
| ~ v1_group_1(X34)
| v3_struct_0(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_21,plain,
! [X72] :
( ~ v1_xboole_0(u1_struct_0(X72))
| ~ l1_struct_0(X72)
| v3_struct_0(X72) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,plain,
( ~ l1_group_1(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X109,X110] :
( m1_subset_1(X109,X110)
| ~ r2_hidden(X109,X110) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_25,negated_conjecture,
~ r1_tarski(k1_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X1,X2,X3] :
( m1_fraenkel(X3,X1,X2)
=> ( v1_fraenkel(X3)
& ~ v1_xboole_0(X3) ) ),
inference(fof_simplification,[status(thm)],[dt_m1_fraenkel]) ).
fof(c_0_28,plain,
! [X1,X2,X3] :
( ( m1_fraenkel(X3,X1,X2)
& ~ v1_xboole_0(X2) )
=> ! [X4] :
( m2_fraenkel(X4,X1,X2,X3)
=> ( m2_relset_1(X4,X1,X2)
& v1_funct_2(X4,X1,X2)
& v1_funct_1(X4) ) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_fraenkel]) ).
fof(c_0_29,plain,
! [X99,X100,X101,X102] :
( ( ~ m1_fraenkel(X101,X99,X100)
| v1_xboole_0(X100)
| m2_fraenkel(X102,X99,X100,X101)
| ~ m1_subset_1(X102,X101) )
& ( ~ m1_fraenkel(X101,X99,X100)
| v1_xboole_0(X100)
| m1_subset_1(X102,X101)
| ~ m2_fraenkel(X102,X99,X100,X101) ) ),
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_19])])])])]) ).
cnf(c_0_30,plain,
( ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| ~ v1_group_1(X1)
| m1_fraenkel(k1_autgroup(X1),u1_struct_0(X1),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,negated_conjecture,
v1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,plain,
( ~ v1_xboole_0(u1_struct_0(X1))
| ~ l1_struct_0(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_36,negated_conjecture,
l1_struct_0(esk1_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_37,plain,
! [X1,X2] :
( ~ v1_xboole_0(X2)
=> k1_fraenkel(X1,X2) = k1_funct_2(X1,X2) ),
inference(fof_simplification,[status(thm)],[redefinition_k1_fraenkel]) ).
fof(c_0_38,plain,
! [X9,X10] :
( ( ~ v1_fraenkel(X9)
| ~ m1_subset_1(X10,X9)
| v1_funct_1(X10) )
& ( ~ v1_fraenkel(X9)
| ~ m1_subset_1(X10,X9)
| v1_relat_1(X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_fraenkel])])])])]) ).
cnf(c_0_39,plain,
( ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,negated_conjecture,
r2_hidden(esk2_2(k1_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),k1_autgroup(esk1_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_41,plain,
! [X38,X39,X40] :
( ( ~ m1_fraenkel(X40,X38,X39)
| v1_fraenkel(X40) )
& ( ~ m1_fraenkel(X40,X38,X39)
| ~ v1_xboole_0(X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
fof(c_0_42,plain,
! [X41,X42,X43,X44] :
( ( ~ m1_fraenkel(X43,X41,X42)
| v1_xboole_0(X42)
| ~ m2_fraenkel(X44,X41,X42,X43)
| m2_relset_1(X44,X41,X42) )
& ( ~ m1_fraenkel(X43,X41,X42)
| v1_xboole_0(X42)
| ~ m2_fraenkel(X44,X41,X42,X43)
| v1_funct_2(X44,X41,X42) )
& ( ~ m1_fraenkel(X43,X41,X42)
| v1_xboole_0(X42)
| ~ m2_fraenkel(X44,X41,X42,X43)
| v1_funct_1(X44) ) ),
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_28])])])])]) ).
cnf(c_0_43,plain,
( ~ m1_fraenkel(X2,X3,X4)
| ~ m1_subset_1(X1,X2)
| v1_xboole_0(X4)
| m2_fraenkel(X1,X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_44,negated_conjecture,
m1_fraenkel(k1_autgroup(esk1_0),u1_struct_0(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_30,c_0_23]),c_0_31]),c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_45,negated_conjecture,
~ v1_xboole_0(u1_struct_0(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
fof(c_0_46,plain,
! [X97,X98] :
( k1_fraenkel(X97,X98) = k1_funct_2(X97,X98)
| v1_xboole_0(X98) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])]) ).
cnf(c_0_47,plain,
( ~ v1_fraenkel(X2)
| ~ m1_subset_1(X1,X2)
| v1_funct_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,negated_conjecture,
m1_subset_1(esk2_2(k1_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),k1_autgroup(esk1_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
( ~ m1_fraenkel(X1,X2,X3)
| v1_fraenkel(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
( ~ m1_fraenkel(X4,X2,X3)
| ~ m2_fraenkel(X1,X2,X3,X4)
| v1_xboole_0(X3)
| m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( ~ m1_subset_1(X1,k1_autgroup(esk1_0))
| m2_fraenkel(X1,u1_struct_0(esk1_0),u1_struct_0(esk1_0),k1_autgroup(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,plain,
( k1_fraenkel(X2,X1) = k1_funct_2(X2,X1)
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( ~ m1_fraenkel(X4,X2,X3)
| ~ m2_fraenkel(X1,X2,X3,X4)
| v1_xboole_0(X3)
| v1_funct_2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_54,negated_conjecture,
( ~ v1_fraenkel(k1_autgroup(esk1_0))
| v1_funct_1(esk2_2(k1_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
v1_fraenkel(k1_autgroup(esk1_0)),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
fof(c_0_56,plain,
! [X107,X108] :
( r2_hidden(X108,k1_funct_2(X107,X107))
| ~ m2_relset_1(X108,X107,X107)
| ~ v1_funct_2(X108,X107,X107)
| ~ v1_funct_1(X108) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_funct_2])])]) ).
cnf(c_0_57,negated_conjecture,
( ~ m1_subset_1(X1,k1_autgroup(esk1_0))
| m2_relset_1(X1,u1_struct_0(esk1_0),u1_struct_0(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_44])]),c_0_45]) ).
cnf(c_0_58,negated_conjecture,
m1_subset_1(esk2_2(k1_autgroup(esk1_0),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),k1_autgroup(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_52]),c_0_45]) ).
cnf(c_0_59,negated_conjecture,
( ~ m1_subset_1(X1,k1_autgroup(esk1_0))
| v1_funct_2(X1,u1_struct_0(esk1_0),u1_struct_0(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_44])]),c_0_45]) ).
cnf(c_0_60,negated_conjecture,
v1_funct_1(esk2_2(k1_autgroup(esk1_0),k1_fraenkel(u1_struct_0(esk1_0),u1_struct_0(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_61,negated_conjecture,
~ r1_tarski(k1_autgroup(esk1_0),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_52]),c_0_45]) ).
cnf(c_0_62,plain,
( ~ r2_hidden(esk2_2(X1,X2),X2)
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_63,plain,
( ~ m2_relset_1(X1,X2,X2)
| ~ v1_funct_2(X1,X2,X2)
| ~ v1_funct_1(X1)
| r2_hidden(X1,k1_funct_2(X2,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_64,negated_conjecture,
m2_relset_1(esk2_2(k1_autgroup(esk1_0),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),u1_struct_0(esk1_0),u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
v1_funct_2(esk2_2(k1_autgroup(esk1_0),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),u1_struct_0(esk1_0),u1_struct_0(esk1_0)),
inference(spm,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_66,negated_conjecture,
v1_funct_1(esk2_2(k1_autgroup(esk1_0),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_52]),c_0_45]) ).
cnf(c_0_67,negated_conjecture,
~ r2_hidden(esk2_2(k1_autgroup(esk1_0),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),k1_funct_2(u1_struct_0(esk1_0),u1_struct_0(esk1_0))),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66])]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP619+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:16:06 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.46 % Version: 3.5.1
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3502503 completed with status 0
% 0.11/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46 % No SInE strategy applied
% 0.11/0.46 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.11/0.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.11/0.46 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.46 % G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3502513 completed with status 0
% 0.11/0.46 % Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46 % No SInE strategy applied
% 0.11/0.46 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.11/0.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.11/0.46 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.46 % Preprocessing time : 0.002 s
% 0.11/0.46 % Presaturation interreduction done
% 0.11/0.46
% 0.11/0.46 % Proof found!
% 0.11/0.46 % SZS status Theorem
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.11/0.46 % Parsed axioms : 69
% 0.11/0.46 % Removed by relevancy pruning/SinE : 0
% 0.11/0.46 % Initial clauses : 121
% 0.11/0.46 % Removed in clause preprocessing : 16
% 0.11/0.46 % Initial clauses in saturation : 105
% 0.11/0.46 % Processed clauses : 379
% 0.11/0.46 % ...of these trivial : 4
% 0.11/0.46 % ...subsumed : 25
% 0.11/0.46 % ...remaining for further processing : 350
% 0.11/0.46 % Other redundant clauses eliminated : 0
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 0
% 0.11/0.46 % Backward-rewritten : 11
% 0.11/0.46 % Generated clauses : 306
% 0.11/0.46 % ...of the previous two non-redundant : 268
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 2
% 0.11/0.46 % Paramodulations : 304
% 0.11/0.46 % Factorizations : 0
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 2
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 130
% 0.11/0.46 % ...of those cached : 72
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 236
% 0.11/0.46 % Positive orientable unit clauses : 100
% 0.11/0.46 % Positive unorientable unit clauses: 0
% 0.11/0.46 % Negative unit clauses : 33
% 0.11/0.46 % Non-unit-clauses : 103
% 0.11/0.46 % Current number of unprocessed clauses: 93
% 0.11/0.46 % ...number of literals in the above : 265
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 114
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 1428
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 810
% 0.11/0.46 % Non-unit clause-clause subsumptions : 11
% 0.11/0.46 % Unit Clause-clause subsumption calls : 377
% 0.11/0.46 % Rewrite failures with RHS unbound : 0
% 0.11/0.46 % BW rewrite match attempts : 8
% 0.11/0.46 % BW rewrite match successes : 4
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 11661
% 0.11/0.46 % Search garbage collected termcells : 1153
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.021 s
% 0.11/0.46 % System time : 0.010 s
% 0.11/0.46 % Total time : 0.031 s
% 0.11/0.46 % Maximum resident set size: 3952 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.107 s
% 0.11/0.46 % System time : 0.030 s
% 0.11/0.46 % Total time : 0.137 s
% 0.11/0.46 % Maximum resident set size: 4608 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------